Yuval Peres
Orcid: 0000-0001-5456-6323
According to our database1,
Yuval Peres
authored at least 105 papers
between 1995 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
IEEE Trans. Autom. Control., 2022
2021
IEEE Trans. Inf. Theory, 2021
Proceedings of the Conference on Learning Theory, 2021
2020
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements.
IEEE Trans. Inf. Theory, 2020
Proc. Natl. Acad. Sci. USA, 2020
Comb. Probab. Comput., 2020
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without.
Proceedings of the Conference on Learning Theory, 2020
2019
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019
Staying up to Date with Online Content Changes Using Reinforcement Learning for Scheduling.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019
2018
Stabilizing a system with an unbounded random gain using only a finite number of bits.
CoRR, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability.
Proceedings of the Conference On Learning Theory, 2018
Proceedings of the 57th IEEE Conference on Decision and Control, 2018
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018
2017
Am. Math. Mon., 2017
Random Struct. Algorithms, 2017
CoRR, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Average-Case Reconstruction for the Deletion Channel: Subpolynomially Many Traces Suffice.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
Proceedings of the Approximation, 2017
Proceedings of the Approximation, 2017
2016
Four random permutations conjugated by an adversary generate <i>S</i><sub>n</sub> with high probability.
Random Struct. Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the 54th Annual Allerton Conference on Communication, 2016
2015
Random Struct. Algorithms, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
Proceedings of The 28th Conference on Learning Theory, 2015
2014
Eur. J. Comb., 2014
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures.
Comb. Probab. Comput., 2014
Comb. Probab. Comput., 2014
Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability.
CoRR, 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of The 27th Conference on Learning Theory, 2014
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014
2013
ACM Trans. Economics and Comput., 2013
SIAM J. Comput., 2013
All-pairs shortest paths in <i>O</i>(<i>n</i><sup>2</sup>) time with high probability.
J. ACM, 2013
2012
2011
Random Struct. Algorithms, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Comb. Probab. Comput., 2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes
CoRR, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the Approximation, 2009
University Lecture Series 51, American Mathematical Society, ISBN: 978-0-8218-4373-4, 2009
2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008
2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
Comb. Probab. Comput., 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
2004
Random Struct. Algorithms, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Am. Math. Mon., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview.
Proceedings of the Discrete Random Walks, 2003
2002
2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000
1999
J. Comb. Theory A, 1999
1997
1995