default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Anastos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak:
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. IACR Cryptol. ePrint Arch. 2024: 1097 (2024)- 2023
- [j16]Michael Anastos:
A Note on Long Cycles in Sparse Random Graphs. Electron. J. Comb. 30(2) (2023) - [j15]Michael Anastos, David Fabian, Alp Müyesser, Tibor Szabó:
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets. Electron. J. Comb. 30(3) (2023) - [c4]Michael Anastos:
Fast algorithms for solving the Hamilton Cycle problem with high probability. SODA 2023: 2286-2323 - 2022
- [j14]Michael Anastos, Alan M. Frieze:
A scaling limit for the length of the longest cycle in a sparse random digraph. Random Struct. Algorithms 60(1): 3-24 (2022) - [c3]Michael Anastos:
Solving the Hamilton cycle problem fast on average. FOCS 2022: 919-930 - [i7]Michael Anastos:
An improved lower bound on the length of the longest cycle in random graphs. CoRR abs/2208.06851 (2022) - 2021
- [j13]Michael Anastos, Ander Lamaison
, Raphael Steiner, Tibor Szabó:
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j12]Michael Anastos, Alan M. Frieze:
A scaling limit for the length of the longest cycle in a sparse random graph. J. Comb. Theory B 148: 184-208 (2021) - [j11]Michael Anastos, Alan M. Frieze:
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58(3): 390-429 (2021) - [j10]Michael Anastos, Alan M. Frieze, Pu Gao:
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35(3): 1854-1880 (2021) - [i6]Michael Anastos:
On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time. CoRR abs/2107.03523 (2021) - [i5]Michael Anastos:
Fast algorithms for solving the Hamilton Cycle problem with high probability. CoRR abs/2111.14759 (2021) - [i4]Michael Anastos:
A fast algorithm on average for solving the Hamilton Cycle problem. CoRR abs/2111.14771 (2021) - 2020
- [j9]Michael Anastos, Deepak Bal:
A Ramsey property of random regular and k -out graphs. J. Graph Theory 93(3): 363-371 (2020) - [j8]Michael Anastos, Alan M. Frieze:
On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56(4): 988-997 (2020) - [j7]Michael Anastos, Alan M. Frieze:
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Random Struct. Algorithms 57(4): 865-878 (2020)
2010 – 2019
- 2019
- [j6]Michael Anastos, Alan M. Frieze:
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? J. Graph Theory 92(4): 405-414 (2019) - [j5]Michael Anastos, Alan M. Frieze:
Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 33(1): 528-545 (2019) - [c2]Michael Anastos, Alan M. Frieze:
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. APPROX-RANDOM 2019: 36:1-36:10 - [c1]Michael Anastos, Peleg Michaeli, Samantha Petti:
Thresholds in Random Motif Graphs. APPROX-RANDOM 2019: 66:1-66:19 - 2018
- [j4]Michael Anastos, Alan M. Frieze, Wesley Pegden:
Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j3]Michael Anastos, Joseph Briggs:
Packing Directed Hamilton Cycles Online. SIAM J. Discret. Math. 32(2): 1505-1539 (2018) - [j2]Michael Anastos:
Connectivity of the k-Out Hypercube. SIAM J. Discret. Math. 32(3): 2194-2216 (2018) - [i3]Michael Anastos, Alan M. Frieze:
On the connectivity threshold for colorings of random graphs and hypergraphs. CoRR abs/1803.05246 (2018) - 2017
- [j1]Alan M. Frieze, Michael Anastos:
Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. 126: 39-42 (2017) - [i2]Michael Anastos, Alan M. Frieze:
Randomly coloring simple hypergraphs with fewer colors. CoRR abs/1703.05173 (2017) - 2016
- [i1]Michael Anastos:
Purchasing a C_4 online. CoRR abs/1611.07503 (2016)
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-09-29 01:14 CEST 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:
