Michail Theofilatos

According to our database, Michail Theofilatos authored at least 10 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The complexity of growing a graph.

George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos

J. Comput. Syst. Sci., 2025

2023

Fault tolerant network constructors.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

Inf. Comput., June, 2023

2022

Simple and fast approximate counting and leader election in populations.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

Inf. Comput., 2022

2021

Beyond Rings: Gathering in 1-Interval Connected Graphs.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

Parallel Process. Lett., 2021

2020

Gathering in 1-Interval Connected Graphs.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

CoRR, 2020

Crystal Structure Prediction via Oblivious Local Search.

Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2018

Fast Approximate Counting and Leader Election in Populations.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

CoRR, 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

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time.

David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Brief Announcement: Fast Approximate Counting and Leader Election in Populations.

Othon Michail, Paul G. Spirakis, Michail Theofilatos

Proceedings of the Structural Information and Communication Complexity, 2018