| Publication | Date of Publication | Type |
|---|
Transience of simple random walks with linear entropy growth
Electronic Communications in Probability | 2023-09-05 | Paper |
Transience of simple random walks with linear entropy growth
Electronic Communications in Probability | 2023-09-05 | Paper |
| Format Preserving Encryption in the Bounded Retrieval Model | 2023-07-16 | Paper |
| A Probabilistic Proof of the nCPA to CCA Bound | 2022-11-14 | Paper |
Thermodynamics of relativistic quantum fields confined in cavities
Physics Letters. A | 2020-11-30 | Paper |
The social network model on infinite graphs
The Annals of Applied Probability | 2020-08-17 | Paper |
The social network model on infinite graphs
The Annals of Applied Probability | 2020-08-17 | Paper |
| Entanglement between identical particles is a useful and consistent resource | 2019-08-30 | Paper |
| Pushing the limits of the reaction-coordinate mapping | 2019-05-31 | Paper |
Quantum coherence fluctuation relations
Journal of Physics A: Mathematical and Theoretical | 2019-02-28 | Paper |
Quantum coherence fluctuation relations
Journal of Physics A: Mathematical and Theoretical | 2019-02-28 | Paper |
| Assisted work distillation | 2018-11-29 | Paper |
Deterministic encryption with the Thorp shuffle
Journal of Cryptology | 2018-05-28 | Paper |
How many queries are needed to distinguish a truncated random permutation from a random function?
Journal of Cryptology | 2018-04-26 | Paper |
Transience in growing subgraphs via evolving sets
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2017-09-15 | Paper |
Hybrid Invariant Manifolds in Systems With Impulse Effects With Application to Periodic Locomotion in Bipedal Robots
IEEE Transactions on Automatic Control | 2017-08-08 | Paper |
Improved bounds for the mixing time of the random-to-random shuffle
Electronic Communications in Probability | 2017-04-05 | Paper |
Improved bounds for the mixing time of the random-to-random shuffle
Electronic Communications in Probability | 2017-04-05 | Paper |
Mixing time of the fifteen puzzle
Electronic Journal of Probability | 2017-02-07 | Paper |
Rapid mixing of dealer shuffles and clumpy shuffles
Electronic Communications in Probability | 2015-08-17 | Paper |
Achieving bipedal running with RABBIT: six steps toward infinity
Lecture Notes in Control and Information Sciences | 2015-05-08 | Paper |
Mixing time of the card-cyclic-to-random shuffle
The Annals of Applied Probability | 2014-09-25 | Paper |
Mixing time of the card-cyclic-to-random shuffle
The Annals of Applied Probability | 2014-09-25 | Paper |
Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
| The mixing time of the fifteen puzzle | 2013-07-26 | Paper |
Coalescing systems of non-Brownian particles
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2013-06-19 | Paper |
Linear cover time is exponentially unlikely
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2013-03-04 | Paper |
Improved mixing time bounds for the Thorp shuffle
Combinatorics, Probability and Computing | 2013-01-21 | Paper |
An enciphering scheme based on a card shuffle
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Evolving sets and mixing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The mixing time of the Thorp shuffle
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Ends in uniform spanning forests
Electronic Journal of Probability | 2009-11-20 | Paper |
Ends in uniform spanning forests
Electronic Journal of Probability | 2009-11-20 | Paper |
Ends in uniform spanning forests
Electronic Journal of Probability | 2009-11-20 | Paper |
Spectral gap for the interchange process in a box
Electronic Communications in Probability | 2009-11-20 | Paper |
Spectral gap for the interchange process in a box
Electronic Communications in Probability | 2009-11-20 | Paper |
Spectral gap for the interchange process in a box
Electronic Communications in Probability | 2009-11-20 | Paper |
How to Encipher Messages on a Small Domain
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
The Annals of Probability | 2009-05-27 | Paper |
The Mixing Time of the Thorp Shuffle
SIAM Journal on Computing | 2009-04-30 | Paper |
The mixing time for simple exclusion
The Annals of Applied Probability | 2007-08-08 | Paper |
| The birthday problem and Markov chain Monte Carlo | 2007-01-14 | Paper |
Spectral gap for the zero range process with constant rate
The Annals of Probability | 2007-01-12 | Paper |
Evolving sets, mixing and heat kernel bounds
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2005-11-02 | Paper |
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
SIAM Journal on Computing | 2005-02-21 | Paper |
The components of the wired spanning forest are recurrent
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2003-08-14 | Paper |
Improved bounds for sampling contingency tables
Random Structures & Algorithms | 2003-04-02 | Paper |
| scientific article; zbMATH DE number 1418271 (Why is no real title available?) | 1999-01-01 | Paper |
Mixing Time of the Overlapping Cycles Shuffle
(available as arXiv preprint) | N/A | Paper |
