


Остановите войну!
for scientists:
Yuval Peres
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j42]Victoria Kostina
, Yuval Peres, Gireeja Ranade
, Mark Sellke
:
Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits. IEEE Trans. Inf. Theory 67(4): 2554-2561 (2021) - [c56]Simina Brânzei, Yuval Peres:
Multiplayer Bandit Learning, from Competition to Cooperation. COLT 2021: 679-723 - [i42]Simina Brânzei, Yuval Peres:
Consensus with Bounded Space and Minimal Communication. CoRR abs/2101.00025 (2021) - 2020
- [j41]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is nearly tight for rumour spreading. Comb. Probab. Comput. 29(2): 190-199 (2020) - [j40]Giulia Fanti, Nina Holden, Yuval Peres, Gireeja Ranade:
Communication cost of consensus for nodes with limited memory. Proc. Natl. Acad. Sci. USA 117(11): 5624-5630 (2020) - [j39]Fernando G. S. L. Brandão, Aram W. Harrow
, James R. Lee, Yuval Peres:
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements. IEEE Trans. Inf. Theory 66(8): 5037-5054 (2020) - [c55]Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke:
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. COLT 2020: 961-987
2010 – 2019
- 2019
- [j38]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan
:
Perfect Bayesian Equilibria in repeated sales. Games Econ. Behav. 118: 570-588 (2019) - [j37]Simina Brânzei, Yuval Peres:
Online learning with an almost perfect expert. Proc. Natl. Acad. Sci. USA 116(13): 5949-5954 (2019) - [c54]Roberto I. Oliveira, Yuval Peres:
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. ANALCO 2019: 119-126 - [c53]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. COLT 2019: 342-382 - [c52]Andrey Kolobov, Yuval Peres, Cheng Lu, Eric Horvitz:
Staying up to Date with Online Content Changes Using Reinforcement Learning for Scheduling. NeurIPS 2019: 579-589 - [c51]Andrey Kolobov, Yuval Peres, Eyal Lubetzky, Eric Horvitz:
Optimal Freshness Crawl Under Politeness Constraints. SIGIR 2019: 495-504 - [i41]Giulia Fanti, Nina Holden, Yuval Peres, Gireeja Ranade:
Communication cost of consensus for nodes with limited memory. CoRR abs/1901.01665 (2019) - [i40]Sébastien Bubeck, Yuanzhi Li, Yuval Peres, Mark Sellke:
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without. CoRR abs/1904.12233 (2019) - [i39]Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. CoRR abs/1906.05208 (2019) - [i38]Simina Brânzei, Yuval Peres:
Multiplayer Bandit Learning, from Competition to Cooperation. CoRR abs/1908.01135 (2019) - 2018
- [j36]Yossi Azar, Eric Horvitz, Eyal Lubetzky, Yuval Peres, Dafna Shahaf:
Tractable near-optimal policies for crawling. Proc. Natl. Acad. Sci. USA 115(32): 8099-8103 (2018) - [j35]Lucas Boczkowski, Yuval Peres, Perla Sousi:
Sensitivity of Mixing Times in Eulerian Digraphs. SIAM J. Discret. Math. 32(1): 624-655 (2018) - [j34]Laura Florescu, Yuval Peres, Miklós Z. Rácz:
Optimal Control for Diffusions on Graphs. SIAM J. Discret. Math. 32(4): 2941-2972 (2018) - [c50]Lisa Hartung, Nina Holden, Yuval Peres:
Trace reconstruction with varying deletion probabilities. ANALCO 2018: 54-61 - [c49]Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke:
Exact minimum number of bits to stabilize a linear system. CDC 2018: 453-458 - [c48]Nak-seung Patrick Hyun, Yuval Peres:
Electrostatic Methods for Perfect Matching and Safe Path Planning. CDC 2018: 912-917 - [c47]Nina Holden, Robin Pemantle, Yuval Peres:
Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability. COLT 2018: 1799-1840 - [c46]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. FOCS 2018: 497-508 - [c45]Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke:
Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits. ISIT 2018: 2256-2260 - [c44]Anna Ben-Hamou, Roberto I. Oliveira
, Yuval Peres:
Estimating graph parameters via random walks with restarts. SODA 2018: 1702-1714 - [c43]Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres:
Comparing mixing times on sparse random graphs. SODA 2018: 1734-1740 - [c42]Reza Gheissari, Eyal Lubetzky, Yuval Peres:
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. SODA 2018: 1981-1988 - [i37]Nina Holden, Robin Pemantle, Yuval Peres:
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability. CoRR abs/1801.04783 (2018) - [i36]Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke:
Stabilizing a system with an unbounded random gain using only a finite number of bits. CoRR abs/1805.05535 (2018) - [i35]Roberto I. Oliveira, Yuval Peres:
Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. CoRR abs/1807.06858 (2018) - [i34]Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke:
Exact minimum number of bits to stabilize a linear system. CoRR abs/1807.07686 (2018) - [i33]Simina Brânzei, Yuval Peres:
Online Learning with an Almost Perfect Expert. CoRR abs/1807.11169 (2018) - [i32]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. CoRR abs/1808.04807 (2018) - 2017
- [j33]James Norris, Yuval Peres, Alex Zhai:
Surprise Probabilities in Markov Chains. Comb. Probab. Comput. 26(4): 603-627 (2017) - [j32]Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres:
Competing first passage percolation on random regular graphs. Random Struct. Algorithms 50(4): 534-583 (2017) - [j31]David A. Levin, Yuval Peres:
Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling. Am. Math. Mon. 124(7): 637-641 (2017) - [c41]Omer Angel
, Abbas Mehrabian, Yuval Peres:
The String of Diamonds Is Tight for Rumor Spreading. APPROX-RANDOM 2017: 26:1-26:9 - [c40]Anna Ben-Hamou, Yuval Peres:
Cutoff for a Stratified Random Walk on the Hypercube. APPROX-RANDOM 2017: 29:1-29:10 - [c39]Yuval Peres, Alex Zhai:
Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice. FOCS 2017: 228-239 - [c38]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. ICALP 2017: 48:1-48:14 - [c37]Yuval Peres, Mohit Singh, Nisheeth K. Vishnoi:
Random Walks in Polytopes and Negative Dependence. ITCS 2017: 50:1-50:10 - [c36]Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei:
Local max-cut in smoothed polynomial time. STOC 2017: 429-437 - [c35]Fedor Nazarov, Yuval Peres:
Trace reconstruction with exp(O(n1/3)) samples. STOC 2017: 1042-1046 - [i31]Omer Angel, Abbas Mehrabian, Yuval Peres:
The string of diamonds is tight for rumor spreading. CoRR abs/1704.00874 (2017) - [i30]Yuval Peres, Alex Zhai:
Average-case reconstruction for the deletion channel: subpolynomially many traces suffice. CoRR abs/1708.00854 (2017) - [i29]Lisa Hartung, Nina Holden, Yuval Peres:
Trace reconstruction with varying deletion probabilities. CoRR abs/1708.02216 (2017) - [i28]Daniel J. Hsu, Aryeh Kontorovich, David A. Levin, Yuval Peres, Csaba Szepesvári:
Mixing time estimation in reversible Markov chains from a single sample path. CoRR abs/1708.07367 (2017) - [i27]Anna Ben-Hamou
, Roberto I. Oliveira, Yuval Peres:
Estimating graph parameters via random walks with restarts. CoRR abs/1709.00869 (2017) - [i26]Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella Stuhl:
How fragile are information cascades? CoRR abs/1711.04024 (2017) - 2016
- [j30]Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan
:
Almost Optimal Local Graph Clustering Using Evolving Sets. J. ACM 63(2): 15:1-15:31 (2016) - [j29]Robin Pemantle, Yuval Peres, Igor Rivin:
Four random permutations conjugated by an adversary generate Sn with high probability. Random Struct. Algorithms 49(3): 409-428 (2016) - [j28]Laura Florescu, Lionel Levine, Yuval Peres:
The Range of a Rotor Walk. Am. Math. Mon. 123(7): 627-642 (2016) - [c34]Victoria Kostina, Yuval Peres, Miklós Z. Rácz, Gireeja Ranade:
Rate-limited control of systems with uncertain gain. Allerton 2016: 1189-1196 - [c33]Jian Ding, Yuval Peres, Gireeja Ranade:
A tiger by the tail: When multiplicative noise stymies control. ISIT 2016: 1994-1998 - [c32]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. SODA 2016: 528-547 - [i25]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Tight Lower Bounds for Multiplicative Weights Algorithmic Families. CoRR abs/1607.02834 (2016) - [i24]Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei:
Local max-cut in smoothed polynomial time. CoRR abs/1610.04807 (2016) - [i23]Jian Ding, Yuval Peres, Gireeja Ranade, Alex Zhai:
When multiplicative noise stymies control. CoRR abs/1612.03239 (2016) - [i22]Fedor Nazarov, Yuval Peres:
Trace reconstruction with exp(O(n1/3)) samples. CoRR abs/1612.03599 (2016) - 2015
- [j27]Yuval Peres, Kunal Talwar, Udi Wieder:
Graphical balanced allocations and the (1 + β)-choice process. Random Struct. Algorithms 47(4): 760-775 (2015) - [c31]Sébastien Bubeck, Ofer Dekel, Tomer Koren, Yuval Peres:
Bandit Convex Optimization: \(\sqrt{T}\) Regret in One Dimension. COLT 2015: 266-278 - [c30]Nihar B. Shah, Dengyong Zhou, Yuval Peres:
Approval Voting and Incentives in Crowdsourcing. ICML 2015: 10-19 - [c29]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. SODA 2015: 983-1002 - [c28]James Norris, Yuval Peres, Alex Zhai:
Surprise probabilities in Markov chains. SODA 2015: 1759-1773 - [c27]Riddhipratim Basu, Jonathan Hermon, Yuval Peres:
Characterization of cutoff for reversible Markov chains. SODA 2015: 1774-1791 - [i21]Nihar B. Shah, Dengyong Zhou, Yuval Peres:
Approval Voting and Incentives in Crowdsourcing. CoRR abs/1502.05696 (2015) - [i20]Sébastien Bubeck, Ofer Dekel, Tomer Koren, Yuval Peres:
Bandit Convex Optimization: sqrt{T} Regret in One Dimension. CoRR abs/1502.06398 (2015) - 2014
- [j26]Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. Comb. Probab. Comput. 23(1): 29-49 (2014) - [j25]Robin Pemantle, Yuval Peres:
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures. Comb. Probab. Comput. 23(1): 140-160 (2014) - [j24]Jian Ding, Eyal Lubetzky, Yuval Peres:
Anatomy of the giant component: The strictly supercritical regime. Eur. J. Comb. 35: 155-168 (2014) - [j23]Lionel Levine
, Yuval Peres:
The looping constant of ℤd. Random Struct. Algorithms 45(1): 1-13 (2014) - [j22]Laura Florescu, Shirshendu Ganguly, Lionel Levine
, Yuval Peres:
Escape Rates for Rotor Walks in Zd. SIAM J. Discret. Math. 28(1): 323-334 (2014) - [j21]Hamed Amini, Yuval Peres:
Shortest-Weight Paths in Random Regular Graphs. SIAM J. Discret. Math. 28(2): 656-672 (2014) - [c26]Shirshendu Ganguly, Yuval Peres:
Permuted Random Walk Exits Typically in Linear Time. ANALCO 2014: 74-81 - [c25]Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres:
Online Learning with Composite Loss Functions. COLT 2014: 1214-1231 - [c24]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. ITCS 2014: 183-194 - [c23]Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres:
Bandits with switching costs: T2/3 regret. STOC 2014: 459-467 - [i19]Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres:
Online Learning with Composite Loss Functions. CoRR abs/1405.4471 (2014) - [i18]Nick Gravin, Yuval Peres, Balasubramanian Sivan:
Towards Optimal Algorithms for Prediction with Expert Advice. CoRR abs/1409.3040 (2014) - [i17]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. CoRR abs/1409.3062 (2014) - [i16]Robin Pemantle, Yuval Peres, Igor Rivin:
Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability. CoRR abs/1412.3781 (2014) - 2013
- [j20]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. J. ACM 60(4): 26:1-26:25 (2013) - [j19]Satyen Kale, Yuval Peres, C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. SIAM J. Comput. 42(1): 305-323 (2013) - [j18]Anna R. Karlin, C. Thach Nguyen, Yuval Peres:
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design. ACM Trans. Economics and Comput. 1(2): 7:1-7:31 (2013) - [i15]Bhaskara Marthi, Hanna Pasula, Stuart Russell, Yuval Peres:
Decayed MCMC Filtering. CoRR abs/1301.0584 (2013) - [i14]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum Stein's Lemma for restricted measurements. CoRR abs/1308.6702 (2013) - [i13]Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres:
Bandits with Switching Costs: T^{2/3} Regret. CoRR abs/1310.2997 (2013) - [i12]Nir Lev, Ron Peled, Yuval Peres:
Separating signal from noise. CoRR abs/1312.6843 (2013) - 2012
- [j17]Svante Janson, Yuval Peres:
Hitting Times for Random Walks with Restarts. SIAM J. Discret. Math. 26(2): 537-547 (2012) - [i11]Shaddin Dughmi, Yuval Peres:
Mechanisms for Risk Averse Agents, Without Loss. CoRR abs/1206.2957 (2012) - 2011
- [j16]Martin T. Barlow, Jian Ding, Asaf Nachmias, Yuval Peres:
The Evolution of the Cover Time. Comb. Probab. Comput. 20(3): 331-345 (2011) - [j15]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Anatomy of a young giant component in the random graph. Random Struct. Algorithms 39(2): 139-178 (2011) - [c22]Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. ANALCO 2011: 67-75 - [c21]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. SODA 2011: 412-428 - [c20]Jian Ding, James R. Lee, Yuval Peres:
Cover times, blanket times, and majorizing measures. STOC 2011: 61-70 - [i10]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) time with high probability. CoRR abs/1105.3770 (2011) - 2010
- [j14]Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19(5-6): 729-751 (2010) - [j13]Asaf Nachmias, Yuval Peres:
Critical percolation on random regular graphs. Random Struct. Algorithms 36(2): 111-148 (2010) - [j12]David A. Levin
, Yuval Peres:
Pólya's Theorem on Random Walks via Pólya's Urn. Am. Math. Mon. 117(3): 220-231 (2010) - [c19]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) Time with High Probability. FOCS 2010: 663-672 - [c18]Yuval Peres, Kunal Talwar, Udi Wieder:
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. SODA 2010: 1613-1619 - [c17]L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Local Dynamics in Bargaining Networks via Random-Turn Games. WINE 2010: 133-144 - [i9]Jian Ding, James R. Lee, Yuval Peres:
Cover times, blanket times, and majorizing measures. CoRR abs/1004.4371 (2010) - [i8]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. CoRR abs/1008.0075 (2010) - [i7]Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. CoRR abs/1010.2997 (2010) - [i6]Yuval Peres, Anthony Quas:
Entropy Rate for Hidden Markov Chains with rare transitions. CoRR abs/1012.2086 (2010)
2000 – 2009
- 2009
- [b1]J. Ben Hough, Manjunath Krishnapur, Yuval Peres, Bálint Virág:
Zeros of Gaussian Analytic Functions and Determinantal Point Processes. University Lecture Series 51, American Mathematical Society 2009, ISBN 978-0-8218-4373-4 - [j11]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum Overhang. Am. Math. Mon. 116(9): 763-787 (2009) - [c16]Brendan Lucier, Michael Molloy, Yuval Peres:
The Glauber Dynamics for Colourings of Bounded Degree Trees. APPROX-RANDOM 2009: 631-645 - [c15]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. FOCS 2009: 293-302 - [c14]Yuval Peres:
The unreasonable effectiveness of martingales. SODA 2009: 997-1000 - [c13]Reid Andersen, Yuval Peres:
Finding sparse cuts locally using evolving sets. STOC 2009: 235-244 - [i5]Guangyue Han, Brian H. Marcus, Yuval Peres:
A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes. CoRR abs/0905.2479 (2009) - [i4]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. CoRR abs/0907.4356 (2009) - [i3]Yuval Peres, Sebastien Roch:
Reconstruction on Trees: Exponential Moment Bounds for Linear Estimators. CoRR abs/0908.2056 (2009) - 2008
- [c12]Jeong 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 - [c11]Satyen Kale, Yuval Peres, C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728 - [c10]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum overhang. SODA 2008: 756-765 - [i2]Reid Andersen, Yuval Peres:
Finding Sparse Cuts Locally Using Evolving Sets. CoRR abs/0811.3779 (2008) - 2007
- [j10]Dimitris Achlioptas, Assaf Naor, Yuval Peres:
On the maximum satisfiability of random formulas. J. ACM 54(2): 10 (2007) - [j9]Yuval Peres, Oded Schramm, Scott Sheffield, David Bruce Wilson:
Random-Turn Hex and Other Selection Games. Am. Math. Mon. 114(5): 373-387 (2007) - [c9]Yun Long, Asaf Nachmias, Yuval Peres:
Mixing Time Power Laws at Criticality. FOCS 2007: 205-214 - 2006
- [j8]József Balogh, Yuval Peres, Gábor Pete:
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. Comb. Probab. Comput. 15(5): 715-730 (2006) - [c8]James R. Lee, Assaf Naor, Yuval Peres:
Trees and Markov convexity. SODA 2006: 1028-1037 - 2005
- [j7]Elchanan Mossel
, Yuval Peres:
New Coins From Old: Computing With Unknown Bias. Comb. 25(6): 707-724 (2005) - 2004
- [j6]David A. Levin
, Yuval Peres:
Identifying several biased coins encountered by a hidden random walk. Random Struct. Algorithms 25(1): 91-114 (2004) - [c7]Elchanan Mossel
, Yuval Peres, Alistair Sinclair:
Shuffling by Semi-Random Transpositions. FOCS 2004: 572-581 - 2003
- [j5]Yuval Peres, Károly Simon, Boris Solomyak:
Fractals with Positive Length and Zero Buffon Needle Probability. Am. Math. Mon. 110(4): 314-325 (2003) - [c6]Dayue Chen, Yuval Peres:
The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. DRW 2003: 39-44 - [c5]Dimitris Achlioptas, Assaf Naor, Yuval Peres:
On the Maximum Satisfiability of Random Formulas. FOCS 2003: 362-370 - [c4]