dblp.uni-trier.dewww.uni-trier.de

Yuval Peres

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
23EEYuval Peres: The unreasonable effectiveness of martingales. SODA 2009: 997-1000
2008
22EEJeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali: A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS 2008: 402-415
21EESatyen Kale, Yuval Peres, C. Seshadhri: Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728
20EEMike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum overhang. SODA 2008: 756-765
19EEReid Andersen, Yuval Peres: Finding Sparse Cuts Locally Using Evolving Sets CoRR abs/0811.3779: (2008)
2007
18EEYun Long, Asaf Nachmias, Yuval Peres: Mixing Time Power Laws at Criticality. FOCS 2007: 205-214
17EEDimitris Achlioptas, Assaf Naor, Yuval Peres: On the maximum satisfiability of random formulas. J. ACM 54(2): (2007)
2006
16EEJames R. Lee, Assaf Naor, Yuval Peres: Trees and Markov convexity. SODA 2006: 1028-1037
15EEJózsef Balogh, Yuval Peres, Gábor Pete: Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. Combinatorics, Probability & Computing 15(5): 715-730 (2006)
2005
14EEElchanan Mossel, Yuval Peres: New Coins From Old: Computing With Unknown Bias. Combinatorica 25(6): 707-724 (2005)
2004
13EEElchanan Mossel, Yuval Peres, Alistair Sinclair: Shuffling by Semi-Random Transpositions. FOCS 2004: 572-581
12EEDavid A. Levin, Yuval Peres: Identifying several biased coins encountered by a hidden random walk. Random Struct. Algorithms 25(1): 91-114 (2004)
2003
11EEDayue Chen, Yuval Peres: The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. DRW 2003: 39-44
10EEDimitris Achlioptas, Assaf Naor, Yuval Peres: On the Maximum Satisfiability of Random Formulas. FOCS 2003: 362-
9EEDimitris Achlioptas, Yuval Peres: The threshold for random k-SAT is 2k (ln 2 - O(k)). STOC 2003: 223-231
8EEBen Morris, Yuval Peres: Evolving sets and mixin. STOC 2003: 279-286
7EEDimitris Achlioptas, Yuval Peres: The Threshold for Random k-SAT is 2kln2 - O(k) CoRR cs.CC/0305009: (2003)
2002
6 Bhaskara Marthi, Hanna Pasula, Stuart J. Russell, Yuval Peres: Decayed MCMC Filtering. UAI 2002: 319-326
2001
5 Claire Kenyon, Elchanan Mossel, Yuval Peres: Glauber Dynamics on Trees and Hyperbolic Graphs. FOCS 2001: 568-578
2000
4 Johan Jonasson, Elchanan Mossel, Yuval Peres: Percolation in a dependent random environment. Random Struct. Algorithms 16(4): 333-343 (2000)
1999
3EERussell Lyons, Robin Pemantle, Yuval Peres: Resistance Bounds for First-Passage Percolation and Maximum Flow. J. Comb. Theory, Ser. A 86(1): 158-168 (1999)
1997
2 Irene Hueter, Yuval Peres: Self-Affine Carpets on the Square Lattice. Combinatorics, Probability & Computing 6(2): 197-204 (1997)
1995
1 Ron Blei, Yuval Peres, James H. Schmerl: Fractional Products of Sets. Random Struct. Algorithms 6(1): 113-120 (1995)

Coauthor Index

1Dimitris Achlioptas [7] [9] [10] [17]
2Reid Andersen [19]
3József Balogh [15]
4Ron Blei [1]
5Dayue Chen [11]
6Irene Hueter [2]
7Johan Jonasson [4]
8Satyen Kale [21]
9Jeong Han Kim [22]
10James R. Lee [16]
11David A. Levin [12]
12Yun Long [18]
13Russell Lyons [3]
14Bhaskara Marthi [6]
15Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [5]
16Ravi Montenegro [22]
17Ben Morris (Ben J. Morris) [8]
18Elchanan Mossel [4] [5] [13] [14]
19Asaf Nachmias [18]
20Assaf Naor [10] [16] [17]
21Hanna M. Pasula (Hanna Pasula) [6]
22Mike Paterson [20]
23Robin Pemantle [3]
24Gábor Pete [15]
25Stuart J. Russell [6]
26James H. Schmerl [1]
27C. Seshadhri [21]
28Alistair Sinclair [13]
29Prasad Tetali [22]
30Mikkel Thorup [20]
31Peter Winkler (Peter M. Winkler) [20]
32Uri Zwick [20]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)