Michael Anastos

32 papers A* 3Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2025 A* conf
Smoothed Analysis for Graph Isomorphism.
STOC
Michael Anastos, Matthew Kwan, Benjamin R. Moore
2025 J jnl
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.
Random Struct. Algorithms
Yahav Alon, Michael Anastos
2024 J jnl
Smoothed analysis for graph isomorphism.
CoRR
Michael Anastos, Matthew Kwan, Benjamin R. Moore
2024 — conf
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.
TCC (1)
Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak
2024 J jnl
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.
IACR Cryptol. ePrint Arch.
Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak
2023 J jnl
A Note on Long Cycles in Sparse Random Graphs.
Electron. J. Comb.
Michael Anastos
2023 A* conf
Fast algorithms for solving the Hamilton Cycle problem with high probability.
SODA
Michael Anastos
2023 J jnl
Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.
Electron. J. Comb.
Michael Anastos, David Fabian, Alp Müyesser, Tibor Szabó
2022 J jnl
A scaling limit for the length of the longest cycle in a sparse random digraph.
Random Struct. Algorithms
Michael Anastos, Alan M. Frieze
2022 J jnl
An improved lower bound on the length of the longest cycle in random graphs.
CoRR
Michael Anastos
2022 A* conf
Solving the Hamilton cycle problem fast on average.
FOCS
Michael Anastos
2021 J jnl
A fast algorithm on average for solving the Hamilton Cycle problem.
CoRR
Michael Anastos
2021 J jnl
A scaling limit for the length of the longest cycle in a sparse random graph.
J. Comb. Theory B
Michael Anastos, Alan M. Frieze
2021 J jnl
Fast algorithms for solving the Hamilton Cycle problem with high probability.
CoRR
Michael Anastos
2021 J jnl
Finding maximum matchings in random regular graphs in linear expected time.
Random Struct. Algorithms
Michael Anastos, Alan M. Frieze
2021 J jnl
Hamiltonicity of Random Graphs in the Stochastic Block Model.
SIAM J. Discret. Math.
Michael Anastos, Alan M. Frieze, Pu Gao
2021 J jnl
Majority Colorings of Sparse Digraphs.
Electron. J. Comb.
Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó
2021 J jnl
On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time.
CoRR
Michael Anastos
2020 J jnl
A Ramsey property of random regular and k -out graphs.
J. Graph Theory
Michael Anastos, Deepak Bal
2020 J jnl
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis.
Random Struct. Algorithms
Michael Anastos, Alan M. Frieze
2020 J jnl
On the connectivity of proper colorings of random graphs and hypergraphs.
Random Struct. Algorithms
Michael Anastos, Alan M. Frieze
2019 J jnl
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
J. Graph Theory
Michael Anastos, Alan M. Frieze
2019 — conf
On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs.
APPROX-RANDOM
Michael Anastos, Alan M. Frieze
2019 J jnl
Pattern Colored Hamilton Cycles in Random Graphs.
SIAM J. Discret. Math.
Michael Anastos, Alan M. Frieze
2019 — conf
Thresholds in Random Motif Graphs.
APPROX-RANDOM
Michael Anastos, Peleg Michaeli, Samantha Petti
2018 J jnl
Connectivity of the k-Out Hypercube.
SIAM J. Discret. Math.
Michael Anastos
2018 J jnl
Constraining the Clustering Transition for Colorings of Sparse Random Graphs.
Electron. J. Comb.
Michael Anastos, Alan M. Frieze, Wesley Pegden
2018 J jnl
On the connectivity threshold for colorings of random graphs and hypergraphs.
CoRR
Michael Anastos, Alan M. Frieze
2018 J jnl
Packing Directed Hamilton Cycles Online.
SIAM J. Discret. Math.
Michael Anastos, Joseph Briggs
2017 J jnl
Randomly coloring simple hypergraphs with fewer colors.
CoRR
Michael Anastos, Alan M. Frieze
2017 J jnl
Randomly coloring simple hypergraphs with fewer colors.
Inf. Process. Lett.
Alan M. Frieze, Michael Anastos
2016 J jnl
Purchasing a C_4 online.
CoRR
Michael Anastos