Browse by People

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) Beyond Rings: Gathering in 1-Interval Connected Graphs. PARALLEL PROCESSING LETTERS, 31 (04).

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Brief Announcement: Fast Approximate Counting and Leader Election in Populations. .

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail (2022) The Complexity of Growing a Graph. In: International Symposium on Algorithmics of Wireless Networks (ALGOSENSORS).

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George ORCID: 0000-0003-2514-8004, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) The Complexity of Growing a Graph. [Preprint]

Antypov, Dmytro ORCID: 0000-0003-1893-7785, Deligkas, Argyrios, Gusev, Vladimir, Rosseinsky, Matthew J ORCID: 0000-0002-1910-2483, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2020) Crystal Structure Prediction via Oblivious Local Search. 18th Symposium on Experimental Algorithms (SEA 2020), 160. 21:1-21:14.

Doty, David, Eftekhari, Mahsa, Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Exact size counting in uniform population protocols in nearly logarithmic time. CoRR, abs/18.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Fast Approximate Counting and Leader Election in Populations. In: 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO ) 2018, 2018-6-18 - 2018-6-21, Maale HaHawisha Israel.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2019) Fault Tolerant Network Constructors. Lecture Notes in Computer Science, 11914. pp. 243-255.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2023) Fault tolerant network constructors. In: International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS).

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail (2023) Fault tolerant network constructors. Information and Computation, 292. p. 105037.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, PG ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Simple and Fast Approximate Counting and Leader Election in Populations. In: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018-11-4 - 2018-11-7, Tokyo, Japan..

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2022) Simple and fast approximate counting and leader election in populations. INFORMATION AND COMPUTATION, 285. p. 104698.

Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) Stability and Structure-Formation Problems for Dynamic and Chemical Systems. PhD thesis, University of Liverpool.