Michael Anastos

According to our database, Michael Anastos authored at least 25 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.

Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak

IACR Cryptol. ePrint Arch., 2024

2023

Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.

Michael Anastos, David Fabian, Alp Müyesser, Tibor Szabó

Electron. J. Comb., 2023

A Note on Long Cycles in Sparse Random Graphs.

Michael Anastos

Electron. J. Comb., 2023

Fast algorithms for solving the Hamilton Cycle problem with high probability.

Michael Anastos

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

A scaling limit for the length of the longest cycle in a sparse random digraph.

Michael Anastos, Alan M. Frieze

Random Struct. Algorithms, 2022

An improved lower bound on the length of the longest cycle in random graphs.

Michael Anastos

CoRR, 2022

Solving the Hamilton cycle problem fast on average.

Michael Anastos

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Hamiltonicity of Random Graphs in the Stochastic Block Model.

Michael Anastos, Alan M. Frieze, Pu Gao

SIAM J. Discret. Math., 2021

Finding maximum matchings in random regular graphs in linear expected time.

Michael Anastos, Alan M. Frieze

Random Struct. Algorithms, 2021

A scaling limit for the length of the longest cycle in a sparse random graph.

Michael Anastos, Alan M. Frieze

J. Comb. Theory B, 2021

A fast algorithm on average for solving the Hamilton Cycle problem.

Michael Anastos

CoRR, 2021

On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time.

Michael Anastos

CoRR, 2021

Majority Colorings of Sparse Digraphs.

Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó

Electron. J. Comb., 2021

2020

On the connectivity of proper colorings of random graphs and hypergraphs.

Michael Anastos, Alan M. Frieze

Random Struct. Algorithms, July, 2020

Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis.

Michael Anastos, Alan M. Frieze

Random Struct. Algorithms, 2020

A Ramsey property of random regular and k -out graphs.

Michael Anastos, Deepak Bal

J. Graph Theory, 2020

2019

Pattern Colored Hamilton Cycles in Random Graphs.

Michael Anastos, Alan M. Frieze

SIAM J. Discret. Math., 2019

How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?

Michael Anastos, Alan M. Frieze

J. Graph Theory, 2019

Thresholds in Random Motif Graphs.

Michael Anastos, Peleg Michaeli, Samantha Petti

Proceedings of the Approximation, 2019

On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs.

Michael Anastos, Alan M. Frieze

Proceedings of the Approximation, 2019

2018

Packing Directed Hamilton Cycles Online.

Michael Anastos, Joseph Briggs

SIAM J. Discret. Math., 2018

Connectivity of the k-Out Hypercube.

Michael Anastos

SIAM J. Discret. Math., 2018

Constraining the Clustering Transition for Colorings of Sparse Random Graphs.

Michael Anastos, Alan M. Frieze, Wesley Pegden

Electron. J. Comb., 2018

2017

Randomly coloring simple hypergraphs with fewer colors.

Alan M. Frieze, Michael Anastos

Inf. Process. Lett., 2017

2016

Purchasing a C_4 online.

Michael Anastos

CoRR, 2016