Brief Announcement: Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (SIROCCO, 2018)

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (DISC, 2018)

Exact size counting in uniform population protocols in nearly logarithmic time. - David Doty; Mahsa Eftekhari; Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

Fast Approximate Counting and Leader Election in Populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2018)

Crystal Structure Prediction via Oblivious Local Search. - Dmytro Antypov; Argyrios Deligkas; Vladimir V. Gusev; Matthew J. Rosseinsky; Paul G. Spirakis; Michail Theofilatos (SEA, 2020)

Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (CoRR, 2020)

Beyond Rings: Gathering in 1-Interval Connected Graphs. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Parallel Process. Lett., 2021)

Simple and fast approximate counting and leader election in populations. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2022)

Fault tolerant network constructors. - Othon Michail; Paul G. Spirakis; Michail Theofilatos (Inf. Comput., 2023)

The complexity of growing a graph. - George B. Mertzios; Othon Michail; George Skretas; Paul G. Spirakis; Michail Theofilatos (J. Comput. Syst. Sci., 2025)