default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichail Theofilatos
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j4]George B. Mertzios, Othon Michail, George Skretas
, Paul G. Spirakis, Michail Theofilatos:
The complexity of growing a graph. J. Comput. Syst. Sci. 147: 103587 (2025)- 2023
- [j3]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault tolerant network constructors. Inf. Comput. 292: 105037 (2023) - 2022
- [j2]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and fast approximate counting and leader election in populations. Inf. Comput. 285(Part): 104698 (2022) - [c6]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - 2021
- [j1]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Beyond Rings: Gathering in 1-Interval Connected Graphs. Parallel Process. Lett. 31(4): 2150020:1-2150020:31 (2021) - [i6]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - 2020
- [c5]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. SEA 2020: 21:1-21:14 - [i5]Dmytro Antypov, Argyrios Deligkas, Vladimir V. Gusev, Matthew J. Rosseinsky, Paul G. Spirakis, Michail Theofilatos:
Crystal Structure Prediction via Oblivious Local Search. CoRR abs/2003.12442 (2020) - [i4]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Gathering in 1-Interval Connected Graphs. CoRR abs/2008.07455 (2020)
2010 – 2019
- 2019
- [c4]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. SSS 2019: 243-255 - [i3]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fault Tolerant Network Constructors. CoRR abs/1903.05992 (2019) - 2018
- [c3]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. SIROCCO 2018: 38-42 - [c2]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Simple and Fast Approximate Counting and Leader Election in Populations. SSS 2018: 154-169 - [c1]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. DISC 2018: 46:1-46:3 - [i2]David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Exact size counting in uniform population protocols in nearly logarithmic time. CoRR abs/1805.04832 (2018) - [i1]Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Fast Approximate Counting and Leader Election in Populations. CoRR abs/1806.02638 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
