Fractional Products of Sets. - Ron Blei; Yuval Peres; James H. Schmerl (Random Struct. Algorithms, 1995)

Self-Affine Carpets on the Square Lattice. - Irene Hueter; Yuval Peres (Comb. Probab. Comput., 1997)

Resistance Bounds for First-Passage Percolation and Maximum Flow. - Russell Lyons; Robin Pemantle; Yuval Peres (J. Comb. Theory A, 1999)

Percolation in a dependent random environment. - Johan Jonasson; Elchanan Mossel; Yuval Peres (Random Struct. Algorithms, 2000)

Glauber Dynamics on Trees and Hyperbolic Graphs. - Claire Kenyon; Elchanan Mossel; Yuval Peres (FOCS, 2001)

Decayed MCMC Filtering. - Bhaskara Marthi; Hanna Pasula; Stuart Russell 001; Yuval Peres (UAI, 2002)

The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. - Dayue Chen 002; Yuval Peres (DRW, 2003)

The threshold for random k-SAT is 2k (ln 2 - O(k)). - Dimitris Achlioptas; Yuval Peres (STOC, 2003)

Evolving sets and mixin. - Ben Morris 001; Yuval Peres (STOC, 2003)

The Threshold for Random k-SAT is 2kln2 - O(k) - Dimitris Achlioptas; Yuval Peres (CoRR, 2003)

Fractals with Positive Length and Zero Buffon Needle Probability. - Yuval Peres; Károly Simon; Boris Solomyak (Am. Math. Mon., 2003)

Shuffling by Semi-Random Transpositions. - Elchanan Mossel; Yuval Peres; Alistair Sinclair (FOCS, 2004)

Identifying several biased coins encountered by a hidden random walk. - David A. Levin; Yuval Peres (Random Struct. Algorithms, 2004)

New Coins From Old: Computing With Unknown Bias. - Elchanan Mossel; Yuval Peres (Comb., 2005)

Trees and Markov convexity. - James R. Lee; Assaf Naor; Yuval Peres (SODA, 2006)

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. - József Balogh; Yuval Peres; Gábor Pete (Comb. Probab. Comput., 2006)

Mixing Time Power Laws at Criticality. - Yun Long; Asaf Nachmias; Yuval Peres (FOCS, 2007)

On the maximum satisfiability of random formulas. - Dimitris Achlioptas; Assaf Naor; Yuval Peres (J. ACM, 2007)

Random-Turn Hex and Other Selection Games. - Yuval Peres; Oded Schramm; Scott Sheffield; David Bruce Wilson (Am. Math. Mon., 2007)

A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. - Jeong Han Kim; Ravi Montenegro; Yuval Peres; Prasad Tetali (ANTS, 2008)

Noise Tolerance of Expanders and Sublinear Expander Reconstruction. - Satyen Kale; Yuval Peres; C. Seshadhri 001 (FOCS, 2008)

Zeros of Gaussian Analytic Functions and Determinantal Point Processes. - J. Ben Hough; Manjunath Krishnapur; Yuval Peres; Bálint Virág (American Mathematical Society, 2009)

The Glauber Dynamics for Colourings of Bounded Degree Trees. - Brendan Lucier; Michael Molloy 001; Yuval Peres (APPROX-RANDOM, 2009)

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. - Yossi Azar; Benjamin E. Birnbaum; L. Elisa Celis; Nikhil R. Devanur; Yuval Peres (FOCS, 2009)

The unreasonable effectiveness of martingales. - Yuval Peres (SODA, 2009)

Finding sparse cuts locally using evolving sets. - Reid Andersen; Yuval Peres (STOC, 2009)

Reconstruction on Trees: Exponential Moment Bounds for Linear Estimators. - Yuval Peres; Sebastien Roch (CoRR, 2009)

A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes - Guangyue Han; Brian H. Marcus; Yuval Peres (CoRR, 2009)

Maximum Overhang. - Mike Paterson; Yuval Peres; Mikkel Thorup; Peter Winkler 001; Uri Zwick (Am. Math. Mon., 2009)

All-Pairs Shortest Paths in O(n2) Time with High Probability. - Yuval Peres; Dmitry Sotnikov; Benny Sudakov; Uri Zwick (FOCS, 2010)

The (1 + beta)-Choice Process and Weighted Balls-into-Bins. - Yuval Peres; Kunal Talwar; Udi Wieder (SODA, 2010)

Local Dynamics in Bargaining Networks via Random-Turn Games. - L. Elisa Celis; Nikhil R. Devanur; Yuval Peres (WINE, 2010)

Entropy Rate for Hidden Markov Chains with rare transitions - Yuval Peres; Anthony Quas (CoRR, 2010)

Diameters in Supercritical Random Graphs Via First Passage Percolation. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Comb. Probab. Comput., 2010)

Critical percolation on random regular graphs. - Asaf Nachmias; Yuval Peres (Random Struct. Algorithms, 2010)

Pólya's Theorem on Random Walks via Pólya's Urn. - David A. Levin; Yuval Peres (Am. Math. Mon., 2010)

Mobile Geometric Graphs: Detection, Coverage and Percolation. - Yuval Peres; Alistair Sinclair; Perla Sousi; Alexandre Stauffer (SODA, 2011)

Cover times, blanket times, and majorizing measures. - Jian Ding; James R. Lee; Yuval Peres (STOC, 2011)

The Evolution of the Cover Time. - Martin T. Barlow; Jian Ding; Asaf Nachmias; Yuval Peres (Comb. Probab. Comput., 2011)

Anatomy of a young giant component in the random graph. - Jian Ding; Jeong Han Kim; Eyal Lubetzky; Yuval Peres (Random Struct. Algorithms, 2011)

Mechanisms for Risk Averse Agents, Without Loss - Shaddin Dughmi; Yuval Peres (CoRR, 2012)

Hitting Times for Random Walks with Restarts. - Svante Janson; Yuval Peres (SIAM J. Discret. Math., 2012)

Bandits with Switching Costs: T^{2/3} Regret. - Ofer Dekel; Jian Ding; Tomer Koren; Yuval Peres (CoRR, 2013)

Separating signal from noise. - Nir Lev; Ron Peled; Yuval Peres (CoRR, 2013)

All-pairs shortest paths in O(n2) time with high probability. - Yuval Peres; Dmitry Sotnikov; Benny Sudakov; Uri Zwick (J. ACM, 2013)

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. - Satyen Kale; Yuval Peres; C. Seshadhri 001 (SIAM J. Comput., 2013)

Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design. - Anna R. Karlin; C. Thach Nguyen; Yuval Peres (ACM Trans. Economics and Comput., 2013)

Permuted Random Walk Exits Typically in Linear Time. - Shirshendu Ganguly; Yuval Peres (ANALCO, 2014)

Online Learning with Composite Loss Functions. - Ofer Dekel; Jian Ding; Tomer Koren; Yuval Peres (COLT, 2014)

Bandits with switching costs: T2/3 regret. - Ofer Dekel; Jian Ding; Tomer Koren; Yuval Peres (STOC, 2014)

Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability. - Robin Pemantle; Yuval Peres; Igor Rivin (CoRR, 2014)

Finding Hidden Cliques in Linear Time with High Probability. - Yael Dekel; Ori Gurel-Gurevich; Yuval Peres (Comb. Probab. Comput., 2014)

Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures. - Robin Pemantle; Yuval Peres (Comb. Probab. Comput., 2014)

Anatomy of the giant component: The strictly supercritical regime. - Jian Ding; Eyal Lubetzky; Yuval Peres (Eur. J. Comb., 2014)

The looping constant of ℤd. - Lionel Levine; Yuval Peres (Random Struct. Algorithms, 2014)

Shortest-Weight Paths in Random Regular Graphs. - Hamed Amini; Yuval Peres (SIAM J. Discret. Math., 2014)

Escape Rates for Rotor Walks in Zd. - Laura Florescu; Shirshendu Ganguly; Lionel Levine; Yuval Peres (SIAM J. Discret. Math., 2014)

Bandit Convex Optimization: ( sqrt{T} ) Regret in One Dimension. - Sébastien Bubeck; Ofer Dekel; Tomer Koren; Yuval Peres (COLT, 2015)

Approval Voting and Incentives in Crowdsourcing. - Nihar B. Shah; Dengyong Zhou; Yuval Peres (ICML, 2015)

Characterization of cutoff for reversible Markov chains. - Riddhipratim Basu; Jonathan Hermon; Yuval Peres (SODA, 2015)

Graphical balanced allocations and the (1 + β)-choice process. - Yuval Peres; Kunal Talwar; Udi Wieder (Random Struct. Algorithms, 2015)

Rate-limited control of systems with uncertain gain. - Victoria Kostina; Yuval Peres; Miklós Z. Rácz; Gireeja Ranade (Allerton, 2016)

A tiger by the tail: When multiplicative noise stymies control. - Jian Ding; Yuval Peres; Gireeja Ranade (ISIT, 2016)

Towards Optimal Algorithms for Prediction with Expert Advice. - Nick Gravin; Yuval Peres; Balasubramanian Sivan (SODA, 2016)

When multiplicative noise stymies control. - Jian Ding; Yuval Peres; Gireeja Ranade; Alex Zhai (CoRR, 2016)

Almost Optimal Local Graph Clustering Using Evolving Sets. - Reid Andersen; Shayan Oveis Gharan; Yuval Peres; Luca Trevisan 001 (J. ACM, 2016)

Four random permutations conjugated by an adversary generate Sn with high probability. - Robin Pemantle; Yuval Peres; Igor Rivin (Random Struct. Algorithms, 2016)

The Range of a Rotor Walk. - Laura Florescu; Lionel Levine; Yuval Peres (Am. Math. Mon., 2016)

The String of Diamonds Is Tight for Rumor Spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (APPROX-RANDOM, 2017)

Cutoff for a Stratified Random Walk on the Hypercube. - Anna Ben-Hamou; Yuval Peres (APPROX-RANDOM, 2017)

Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice. - Yuval Peres; Alex Zhai (FOCS, 2017)

Tight Lower Bounds for Multiplicative Weights Algorithmic Families. - Nick Gravin; Yuval Peres; Balasubramanian Sivan (ICALP, 2017)

Random Walks in Polytopes and Negative Dependence. - Yuval Peres; Mohit Singh; Nisheeth K. Vishnoi (ITCS, 2017)

Local max-cut in smoothed polynomial time. - Omer Angel; Sébastien Bubeck; Yuval Peres; Fan Wei (STOC, 2017)

Trace reconstruction with exp(O(n1/3)) samples. - Fedor Nazarov; Yuval Peres (STOC, 2017)

Mixing time estimation in reversible Markov chains from a single sample path. - Daniel J. Hsu; Aryeh Kontorovich; David A. Levin; Yuval Peres; Csaba Szepesvári (CoRR, 2017)

How fragile are information cascades? - Yuval Peres; Miklós Z. Rácz; Allan Sly; Izabella Stuhl (CoRR, 2017)

Surprise Probabilities in Markov Chains. - James Norris; Yuval Peres; Alex Zhai (Comb. Probab. Comput., 2017)

Competing first passage percolation on random regular graphs. - Tonci Antunovic; Yael Dekel; Elchanan Mossel; Yuval Peres (Random Struct. Algorithms, 2017)

Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling. - David A. Levin; Yuval Peres (Am. Math. Mon., 2017)

Trace reconstruction with varying deletion probabilities. - Lisa Hartung; Nina Holden; Yuval Peres (ANALCO, 2018)

Electrostatic Methods for Perfect Matching and Safe Path Planning. - Nak-seung Patrick Hyun; Yuval Peres (CDC, 2018)

Subpolynomial trace reconstruction for random strings {and arbitrary deletion probability. - Nina Holden; Robin Pemantle; Yuval Peres (COLT, 2018)

Testing Graph Clusterability: Algorithms and Lower Bounds. - Ashish Chiplunkar; Michael Kapralov; Sanjeev Khanna; Aida Mousavifar; Yuval Peres (FOCS, 2018)

Comparing mixing times on sparse random graphs. - Anna Ben-Hamou; Eyal Lubetzky; Yuval Peres (SODA, 2018)

Estimating graph parameters via random walks with restarts. - Anna Ben-Hamou; Roberto I. Oliveira 001; Yuval Peres (SODA, 2018)

Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. - Reza Gheissari; Eyal Lubetzky; Yuval Peres (SODA, 2018)

Stabilizing a system with an unbounded random gain using only a finite number of bits. - Victoria Kostina; Yuval Peres; Gireeja Ranade; Mark Sellke (CoRR, 2018)

Tractable near-optimal policies for crawling. - Yossi Azar; Eric Horvitz; Eyal Lubetzky; Yuval Peres; Dafna Shahaf (Proc. Natl. Acad. Sci. USA, 2018)

Sensitivity of Mixing Times in Eulerian Digraphs. - Lucas Boczkowski; Yuval Peres; Perla Sousi (SIAM J. Discret. Math., 2018)

Optimal Control for Diffusions on Graphs. - Laura Florescu; Yuval Peres; Miklós Z. Rácz (SIAM J. Discret. Math., 2018)

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. - Roberto I. Oliveira 001; Yuval Peres (ANALCO, 2019)

Sorted Top-k in Rounds. - Mark Braverman; Jieming Mao; Yuval Peres (COLT, 2019)

Staying up to Date with Online Content Changes Using Reinforcement Learning for Scheduling. - Andrey Kolobov; Yuval Peres; Cheng Lu; Eric Horvitz (NeurIPS, 2019)

Optimal Freshness Crawl Under Politeness Constraints. - Andrey Kolobov; Yuval Peres; Eyal Lubetzky; Eric Horvitz (SIGIR, 2019)

Perfect Bayesian Equilibria in repeated sales. - Nikhil R. Devanur; Yuval Peres; Balasubramanian Sivan (Games Econ. Behav., 2019)

Online learning with an almost perfect expert. - Simina Brânzei; Yuval Peres (Proc. Natl. Acad. Sci. USA, 2019)

Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. - Sébastien Bubeck; Yuanzhi Li; Yuval Peres; Mark Sellke (COLT, 2020)

The string of diamonds is nearly tight for rumour spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (Comb. Probab. Comput., 2020)

Communication cost of consensus for nodes with limited memory. - Giulia Fanti; Nina Holden; Yuval Peres; Gireeja Ranade (Proc. Natl. Acad. Sci. USA, 2020)

Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements. - Fernando G. S. L. Brandão; Aram W. Harrow; James R. Lee; Yuval Peres (IEEE Trans. Inf. Theory, 2020)

Multiplayer Bandit Learning, from Competition to Cooperation. - Simina Brânzei; Yuval Peres (COLT, 2021)

Consensus with Bounded Space and Minimal Communication. - Simina Brânzei; Yuval Peres (CoRR, 2021)

Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits. - Victoria Kostina; Yuval Peres; Gireeja Ranade; Mark Sellke (IEEE Trans. Inf. Theory, 2021)

Exact Minimum Number of Bits to Stabilize a Linear System. - Victoria Kostina; Yuval Peres; Gireeja Ranade; Mark Sellke (IEEE Trans. Autom. Control., 2022)

The asynchronous DeGroot dynamics. - Dor Elboim; Yuval Peres; Ron Peretz (Random Struct. Algorithms, 2024)