| How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. | 0 | 0.34 | 2022 |
| Improved Reconstruction of Random Geometric Graphs | 0 | 0.34 | 2022 |
| Distributed Metropolis Sampler with Optimal Parallelism | 0 | 0.34 | 2021 |
| Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. | 0 | 0.34 | 2021 |
| Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks | 0 | 0.34 | 2021 |
| On the Power of Choice for k-Colorability of Random Graphs. | 0 | 0.34 | 2021 |
| A Scalable Algorithm For Multiparty Interactive Communication With Private Channels | 0 | 0.34 | 2020 |
| The Energy Complexity of BFS in Radio Networks | 0 | 0.34 | 2020 |
| Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. | 0 | 0.34 | 2019 |
| Improved Strong Spatial Mixing for Colorings on Trees. | 0 | 0.34 | 2019 |
| Multiparty Interactive Communication with Private Channels | 0 | 0.34 | 2019 |
| Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). | 3 | 0.40 | 2018 |
| The Energy Complexity of Broadcast | 2 | 0.37 | 2018 |
| Sampling Random Colorings of Sparse Random Graphs. | 2 | 0.38 | 2018 |
| Sending a Message with Unknown Noise. | 0 | 0.34 | 2018 |
| Distributed Computing with Channel Noise. | 0 | 0.34 | 2017 |
| Secure Multiparty Interactive Communication with Unknown Noise Rate. | 0 | 0.34 | 2016 |
| Secure one-way interactive communication. | 0 | 0.34 | 2016 |
| Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. | 0 | 0.34 | 2016 |
| Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model | 9 | 0.55 | 2016 |
| Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks. | 3 | 0.46 | 2016 |
| Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. | 1 | 0.62 | 2014 |
| The Power of Choice for Random Satisfiability | 1 | 0.35 | 2013 |
| Block Coordinate Descent for Sparse NMF | 0 | 0.34 | 2013 |
| Local uniformity properties for glauber dynamics on graph colorings. | 1 | 0.35 | 2013 |
| Block Coordinate Descent for Sparse NMF | 7 | 0.51 | 2013 |
| The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. | 0 | 0.34 | 2012 |
| Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. | 1 | 0.37 | 2011 |
| How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman | 0 | 0.34 | 2011 |
| Sparseness and a reduction from Totally Nonnegative Least Squares to SVM | 1 | 0.37 | 2011 |
| Liftings Of Tree-Structured Markov Chains (Extended Abstract) | 0 | 0.34 | 2010 |
| The forgiving graph: a distributed data structure for low stretch under adversarial attack | 18 | 0.81 | 2009 |
| The adwords problem: online keyword matching with budgeted bidders under random permutations | 137 | 5.60 | 2009 |
| Minimizing average latency in oblivious routing | 7 | 0.50 | 2008 |
| High-Probability Regret Bounds for Bandit Online Linear Optimization | 13 | 1.34 | 2008 |
| Stochastic Linear Optimization under Bandit Feedback | 162 | 10.12 | 2008 |
| Variable length path coupling | 8 | 0.64 | 2007 |
| The Price of Bandit Information for Online Optimization | 71 | 7.41 | 2007 |
| Randomly coloring planar graphs with fewer colors than the maximum degree | 7 | 0.57 | 2007 |
| Online collaborative filtering with nearly optimal dynamic regret | 6 | 0.46 | 2007 |
| A simple condition implying rapid mixing of single-site dynamics on spin systems | 26 | 1.52 | 2006 |
| Robbing the bandit: less regret in online geometric optimization against an adaptive adversary | 42 | 4.64 | 2006 |
| How to Beat the Adaptive Multi-Armed Bandit | 5 | 0.60 | 2006 |
| Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group | 11 | 0.66 | 2005 |
| A general lower bound for mixing of single-site dynamics on graphs | 11 | 0.67 | 2005 |
| Randomly coloring constant degree graphs | 21 | 1.66 | 2004 |
| Reductions Between Classification Tasks | 5 | 0.63 | 2004 |
| A Non-Markovian Coupling for Randomly Sampling Colorings | 25 | 1.59 | 2003 |
| Randomly coloring graphs of girth at least five | 21 | 1.45 | 2003 |
| The Quantum Black-Box Complexity of Majority | 7 | 0.61 | 2002 |
