The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yuval Peres: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dayue Chen, Yuval Peres
    The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. [Citation Graph (0, 0)][DBLP]
    DRW, 2003, pp:39-44 [Conf]
  2. Dimitris Achlioptas, Assaf Naor, Yuval Peres
    On the Maximum Satisfiability of Random Formulas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:362-0 [Conf]
  3. Claire Kenyon, Elchanan Mossel, Yuval Peres
    Glauber Dynamics on Trees and Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:568-578 [Conf]
  4. Elchanan Mossel, Yuval Peres, Alistair Sinclair
    Shuffling by Semi-Random Transpositions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:572-581 [Conf]
  5. James R. Lee, Assaf Naor, Yuval Peres
    Trees and Markov convexity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1028-1037 [Conf]
  6. Dimitris Achlioptas, Yuval Peres
    The threshold for random k-SAT is 2k (ln 2 - O(k)). [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:223-231 [Conf]
  7. Ben Morris, Yuval Peres
    Evolving sets and mixin. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:279-286 [Conf]
  8. Bhaskara Marthi, Hanna Pasula, Stuart J. Russell, Yuval Peres
    Decayed MCMC Filtering. [Citation Graph (0, 0)][DBLP]
    UAI, 2002, pp:319-326 [Conf]
  9. Elchanan Mossel, Yuval Peres
    New Coins From Old: Computing With Unknown Bias. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:6, pp:707-724 [Journal]
  10. Dimitris Achlioptas, Yuval Peres
    The Threshold for Random k-SAT is 2kln2 - O(k) [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  11. Irene Hueter, Yuval Peres
    Self-Affine Carpets on the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:197-204 [Journal]
  12. Dimitris Achlioptas, Assaf Naor, Yuval Peres
    On the maximum satisfiability of random formulas. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:2, pp:- [Journal]
  13. Russell Lyons, Robin Pemantle, Yuval Peres
    Resistance Bounds for First-Passage Percolation and Maximum Flow. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:158-168 [Journal]
  14. Ron Blei, Yuval Peres, James H. Schmerl
    Fractional Products of Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:113-120 [Journal]
  15. Johan Jonasson, Elchanan Mossel, Yuval Peres
    Percolation in a dependent random environment. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:333-343 [Journal]
  16. David A. Levin, Yuval Peres
    Identifying several biased coins encountered by a hidden random walk. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:1, pp:91-114 [Journal]

  17. A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. [Citation Graph (, )][DBLP]


  18. The Glauber Dynamics for Colourings of Bounded Degree Trees. [Citation Graph (, )][DBLP]


  19. Noise Tolerance of Expanders and Sublinear Expander Reconstruction. [Citation Graph (, )][DBLP]


  20. Mixing Time Power Laws at Criticality. [Citation Graph (, )][DBLP]


  21. Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. [Citation Graph (, )][DBLP]


  22. Maximum overhang. [Citation Graph (, )][DBLP]


  23. The unreasonable effectiveness of martingales. [Citation Graph (, )][DBLP]


  24. The (1 + beta)-Choice Process and Weighted Balls-into-Bins. [Citation Graph (, )][DBLP]


  25. Finding sparse cuts locally using evolving sets. [Citation Graph (, )][DBLP]


  26. Finding Sparse Cuts Locally Using Evolving Sets [Citation Graph (, )][DBLP]


  27. A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes [Citation Graph (, )][DBLP]


  28. Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks [Citation Graph (, )][DBLP]


  29. Cover times, blanket times, and majorizing measures [Citation Graph (, )][DBLP]


  30. Mobile Geometric Graphs: Detection, Coverage and Percolation [Citation Graph (, )][DBLP]


  31. Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002