| Publication | Date of Publication | Type |
|---|
| Optimal mixing via tensorization for random independent sets on arbitrary trees | 2025-01-14 | Paper |
| Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier | 2024-09-30 | Paper |
| Improved reconstruction of random geometric graphs | 2024-06-24 | Paper |
| Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147383 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083382 | 2023-12-08 | Paper |
| On the Power of Choice for k-Colorability of Random Graphs. | 2023-11-20 | Paper |
| Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks | 2023-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875505 | 2023-02-03 | Paper |
| Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier | 2021-07-29 | Paper |
| The Energy Complexity of BFS in Radio Networks | 2021-03-15 | Paper |
| Multiparty Interactive Communication with Private Channels | 2021-01-20 | Paper |
| The Energy Complexity of Broadcast | 2019-09-19 | Paper |
| Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model | 2019-05-07 | Paper |
| Interactive communication with unknown noise rate | 2018-06-14 | Paper |
| Sampling Random Colorings of Sparse Random Graphs | 2018-03-15 | Paper |
| Codes, lower bounds, and phase transitions in the symmetric rendezvous problem | 2017-01-05 | Paper |
| Randomly coloring planar graphs with fewer colors than the maximum degree | 2016-01-07 | Paper |
| Interactive communication with unknown noise rate | 2015-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501247 | 2015-08-03 | Paper |
| Spatial Mixing for Independent Sets in Poisson Random Trees | 2015-02-21 | Paper |
| Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group | 2014-10-13 | Paper |
| Bounds on the diameter of Cayley graphs of the symmetric group | 2014-08-29 | Paper |
| The forgiving graph | 2014-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414555 | 2014-05-06 | Paper |
| Randomly coloring constant degree graphs | 2013-10-09 | Paper |
| Local uniformity properties for Glauber dynamics on graph colorings | 2013-10-09 | Paper |
| The Power of Choice for Random Satisfiability | 2013-10-04 | Paper |
| The forgiving graph: a distributed data structure for low stretch under adversarial attack | 2013-02-04 | Paper |
| How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman | 2011-12-04 | Paper |
| Liftings of Tree-Structured Markov Chains | 2010-09-10 | Paper |
| Robbing the bandit | 2010-08-16 | Paper |
| Randomly coloring graphs of girth at least five | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579444 | 2010-08-06 | Paper |
| Randomly coloring planar graphs with fewer colors than the maximum degree | 2009-01-05 | Paper |
| Variable length path coupling | 2008-01-08 | Paper |
| A general lower bound for mixing of single-site dynamics on graphs | 2007-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3436059 | 2007-05-08 | Paper |
| Coupling with the stationary distribution and improved sampling for colorings and independent sets | 2007-02-05 | Paper |
| The quantum black-box complexity of majority | 2003-05-04 | Paper |
| The cost of the missing bit: Communication complexity with help | 2002-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542591 | 1998-01-01 | Paper |
