Michael Anastos

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 28

Top Topics

Learning Curves

Top Venues

Electron. J. Comb.

SIAM J. Discret. Math.

Random Struct. Algorithms

Publications

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 (2024)
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)
Michael Anastos
Fast algorithms for solving the Hamilton Cycle problem with high probability. SODA (2023)
Michael Anastos
A Note on Long Cycles in Sparse Random Graphs. Electron. J. Comb. 30 (2) (2023)
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) (2022)
Michael Anastos
Solving the Hamilton cycle problem fast on average. FOCS (2022)
Michael Anastos
An improved lower bound on the length of the longest cycle in random graphs. CoRR (2022)
Michael Anastos
Fast algorithms for solving the Hamilton Cycle problem with high probability. CoRR (2021)
Michael Anastos, Alan M. Frieze
A scaling limit for the length of the longest cycle in a sparse random graph. J. Comb. Theory, Ser. B 148 (2021)
Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28 (2) (2021)
Michael Anastos
On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time. CoRR (2021)
Michael Anastos, Alan M. Frieze
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58 (3) (2021)
Michael Anastos, Alan M. Frieze, Pu Gao
Hamiltonicity of Random Graphs in the Stochastic Block Model. SIAM J. Discret. Math. 35 (3) (2021)
Michael Anastos
A fast algorithm on average for solving the Hamilton Cycle problem. CoRR (2021)
Michael Anastos, Alan M. Frieze
On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56 (4) (2020)
Michael Anastos, Alan M. Frieze
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Random Struct. Algorithms 57 (4) (2020)
Michael Anastos, Deepak Bal
A Ramsey property of random regular and k -out graphs. J. Graph Theory 93 (3) (2020)
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) (2019)
Michael Anastos, Peleg Michaeli, Samantha Petti
Thresholds in Random Motif Graphs. APPROX-RANDOM (2019)
Michael Anastos, Alan M. Frieze
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. APPROX-RANDOM (2019)
Michael Anastos, Alan M. Frieze
Pattern Colored Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Michael Anastos
Connectivity of the k-Out Hypercube. SIAM J. Discret. Math. 32 (3) (2018)
Michael Anastos, Alan M. Frieze, Wesley Pegden
Constraining the Clustering Transition for Colorings of Sparse Random Graphs. Electron. J. Comb. 25 (1) (2018)
Michael Anastos, Joseph Briggs
Packing Directed Hamilton Cycles Online. SIAM J. Discret. Math. 32 (2) (2018)
Michael Anastos, Alan M. Frieze
On the connectivity threshold for colorings of random graphs and hypergraphs. CoRR (2018)
Michael Anastos, Alan M. Frieze
Randomly coloring simple hypergraphs with fewer colors. CoRR (2017)
Alan M. Frieze, Michael Anastos
Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. 126 (2017)
Michael Anastos
Purchasing a C_4 online. CoRR (2016)