Alexandre Stauffer

Random Struct. Algorithms, December, 2023

2022

Mixing time of random walk on dynamical random cluster.

[BibT_eX]

[DOI]

Andrea Lelli

CoRR, 2022

2019

Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings.

[BibT_eX]

[DOI]

Sarah Cannon

David A. Levin

Comb. Probab. Comput., 2019

The Dispersion Time of Random Walks on Finite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018

Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile Agents.

[BibT_eX]

[DOI]

Peter Gracar

Proceedings of the Approximation, 2018

2016

Balls into bins via local search: Cover time and maximum load.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

2015

A Lyapunov function for Glauber dynamics on lattice triangulations.

[BibT_eX]

[DOI]

CoRR, 2015

Dynamics of Lattice Triangulations on Thin Rectangles.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Randomized Rumor Spreading in Dynamic Graphs.

[BibT_eX]

[DOI]

George Giakkoupis

Thomas Sauerwald

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Characterizing optimal sampling of binary contingency tables via the configuration model.

[BibT_eX]

[DOI]

Jose H. Blanchet

Random Struct. Algorithms, 2013

Phase transition for finite-speed detection among moving particles.

[BibT_eX]

[DOI]

Vladas Sidoravicius

CoRR, 2013

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions.

[BibT_eX]

[DOI]

Tobias Friedrich

Thomas Sauerwald

Algorithmica, 2013

Random lattice triangulations: structure and algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Balls-into-bins with nearly optimal load distribution.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Balls into Bins via Local Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011

Structural and Algorithmic Properties of Static and Mobile Random Geometric Graphs.

[BibT_eX]

[DOI]

PhD thesis, 2011

Rumor Spreading and Vertex Expansion on Regular Graphs.

[BibT_eX]

[DOI]

Thomas Sauerwald

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Mobile Geometric Graphs: Detection, Coverage and Percolation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks

[BibT_eX]

[DOI]

Alistair Sinclair

CoRR, 2010

Efficient Broadcast on Random Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2007

Probabilistic heuristics for disseminating information in networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

2006

Local heuristics and the emergence of spanning subgraphs in complex networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

A study of the edge-switching Markov-chain method for the generation of random graphs

[BibT_eX]

[DOI]

CoRR, 2005

A dissemination strategy for immunizing scale-free networks

[BibT_eX]

[DOI]