How boosting the margin can also boost classifier complexity. - Lev Reyzin; Robert E. Schapire (ICML, 2006)

Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. - Lev Reyzin; Nikhil Srivastava (ALT, 2007)

On the longest path algorithm for reconstructing trees from distance matrices. - Lev Reyzin; Nikhil Srivastava (Inf. Process. Lett., 2007)

Learning large-alphabet and analog circuits with value injection queries. - Dana Angluin; James Aspnes; Jiang Chen; Lev Reyzin (Mach. Learn., 2008)

Learning Finite Automata Using Label Queries. - Dana Angluin; Leonor Becerra-Bonache; Adrian-Horia Dediu; Lev Reyzin (ALT, 2009)

Learning Acyclic Probabilistic Circuits Using Test Paths. - Dana Angluin; James Aspnes; Jiang Chen; David Eisenstat; Lev Reyzin (J. Mach. Learn. Res., 2009)

Inferring Social Networks from Outbreaks. - Dana Angluin; James Aspnes; Lev Reyzin (ALT, 2010)

Lower Bounds on Learning Random Structures with Statistical Queries. - Dana Angluin; David Eisenstat; Leonid Kontorovich; Lev Reyzin (ALT, 2010)

Non-Stochastic Bandit Slate Problems. - Satyen Kale; Lev Reyzin; Robert E. Schapire (NIPS, 2010)

An Optimal High Probability Algorithm for the Contextual Bandit Problem - Alina Beygelzimer; John Langford 001; Lihong Li 001; Lev Reyzin; Robert E. Schapire (CoRR, 2010)

Questions answered. in theory.: http://cstheory.stackexchange.com/. - Dave Clarke 001; David Eppstein; Kaveh Ghasemloo; Lev Reyzin; András Z. Salamon; Peter W. Shor; Aaron D. Sterling; Suresh Venkatasubramanian (SIGACT News, 2010)

Optimally learning social networks with activations and suppressions. - Dana Angluin; James Aspnes; Lev Reyzin (Theor. Comput. Sci., 2010)

On Noise-Tolerant Learning of Sparse Parities and Related Problems. - Elena Grigorescu; Lev Reyzin; Santosh S. Vempala (ALT, 2011)

Boosting on a Budget: Sampling for Feature-Efficient Prediction. - Lev Reyzin (ICML, 2011)

Efficient Optimal Learning for Contextual Bandits. - Miroslav Dudík; Daniel J. Hsu; Satyen Kale; Nikos Karampatziakis; John Langford 001; Lev Reyzin; Tong Zhang 001 (UAI, 2011)

Contextual Bandit Algorithms with Supervised Learning Guarantees. - Alina Beygelzimer; John Langford 001; Lihong Li 001; Lev Reyzin; Robert E. Schapire (AISTATS, 2011)

Contextual Bandits with Linear Payoff Functions. - Wei Chu; Lihong Li 001; Lev Reyzin; Robert E. Schapire (AISTATS, 2011)

Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç. - Lev Reyzin (SIGACT News, 2011)

Data Stability in Clustering: A Closer Look. - Lev Reyzin (ALT, 2012)

The Complexity of Statistical Algorithms - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala (CoRR, 2012)

Statistical Algorithms and a Lower Bound for Planted Clique. - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala; Ying Xiao 003 (Electron. Colloquium Comput. Complex., 2012)

Anti-coordination Games and Stable Graph Colorings. - Jeremy Kun; Brian Powers; Lev Reyzin (SAGT, 2013)

On the Resilience of Bipartite Networks. - Will Perkins 001; Lev Reyzin (CoRR, 2013)

On Boosting Sparse Parities. - Lev Reyzin (AAAI, 2014)

On Coloring Resilient Graphs. - Jeremy Kun; Lev Reyzin (MFCS (2), 2014)

Network installation and recovery: approximation lower bounds and faster exact formulations. - Alexander Gutfraind; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin (CoRR, 2014)

Data stability in clustering: A closer look. - Shalev Ben-David; Lev Reyzin (Theor. Comput. Sci., 2014)

Shift-Pessimistic Active Learning Using Robust Bias-Aware Prediction. - Anqi Liu; Lev Reyzin; Brian D. Ziebart (AAAI, 2015)

Interactive Clustering of Linear Classes and Cryptographic Lower Bounds. - Ádám Dániel Lelkes; Lev Reyzin (ALT, 2015)

Open Problem: Learning Quantum Circuits with Queries. - Jeremy Kun; Lev Reyzin (COLT, 2015)

Training-Time Optimization of a Budgeted Booster. - Yi Huang; Brian Powers; Lev Reyzin (IJCAI, 2015)

On the Computational Complexity of MapReduce. - Benjamin Fish; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin; György Turán (DISC, 2015)

A Simple Spectral Algorithm for Recovering Planted Partitions. - Sam Cole; Shmuel Friedland; Lev Reyzin (CoRR, 2015)

Network construction with subgraph connectivity constraints. - Dana Angluin; James Aspnes; Lev Reyzin (J. Comb. Optim., 2015)

Recovering Social Networks by Observing Votes. - Benjamin Fish; Yi Huang; Lev Reyzin (ISAIM, 2016)

Network installation under convex costs. - Alexander Gutfraind; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin (J. Complex Networks, 2016)

Improved algorithms for distributed boosting. - Jeff Cooper; Lev Reyzin (Allerton, 2017)

Open Problem: Meeting Times for Learning Random Automata. - Benjamin Fish; Lev Reyzin (COLT, 2017)

Network Construction with Ordered Constraints. - Yi Huang; Mano Vikash Janardhanan; Lev Reyzin (FSTTCS, 2017)

On the Complexity of Learning from Label Proportions. - Benjamin Fish; Lev Reyzin (IJCAI, 2017)

Foreword. - Lisa Hellerstein; Lev Reyzin; György Turán (Ann. Math. Artif. Intell., 2017)

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. - Vitaly Feldman; Elena Grigorescu; Lev Reyzin; Santosh S. Vempala; Ying Xiao 003 (J. ACM, 2017)

On the Resilience of Bipartite Networks. - Shelby Heinecke; Will Perkins 001; Lev Reyzin (Allerton, 2018)

Sublinear-Time Adaptive Data Analysis. - Benjamin Fish; Lev Reyzin; Benjamin I. P. Rubinstein (ISAIM, 2018)

Crowdsourced PAC Learning under Classification Noise. - Shelby Heinecke; Lev Reyzin (HCOMP, 2019)

Sampling Without Compromising Accuracy in Adaptive Data Analysis. - Benjamin Fish; Lev Reyzin; Benjamin I. P. Rubinstein (ALT, 2020)

On biased random walks, corrupted intervals, and learning under adversarial design. - Daniel Berend; Aryeh Kontorovich; Lev Reyzin; Thomas J. Robinson 001 (Ann. Math. Artif. Intell., 2020)

Statistical Queries and Statistical Algorithms: Foundations and Applications. - Lev Reyzin (CoRR, 2020)

On the Complexity of Learning a Class Ratio from Unlabeled Data. - Benjamin Fish; Lev Reyzin (J. Artif. Intell. Res., 2020)

Special issue on ALT 2017: Guest Editors' Introduction. - Steve Hanneke; Lev Reyzin (Theor. Comput. Sci., 2020)

Communication-Aware Collaborative Learning. - Avrim Blum; Shelby Heinecke; Lev Reyzin (AAAI, 2021)

Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model. - Thomas Maranzatto; Lev Reyzin (CoRR, 2021)

An Interactive Search Game with Two Agents. - Xing Gao; Lev Reyzin (Allerton, 2022)

On Learning a Hidden Directed Graph with Path Queries. - Mano Vikash Janardhanan; Lev Reyzin (Allerton, 2022)

On the Geometry of Stable Steiner Tree Instances. - James Freitag; Neshat Mohammadi; Aditya Potukuchi; Lev Reyzin (CCCG, 2022)

Foreword. - Lev Reyzin (Ann. Math. Artif. Intell., 2022)

Slowly Changing Adversarial Bandit Algorithms are Provably Efficient for Discounted MDPs. - Ian A. Kash; Lev Reyzin; Zishun Yu (CoRR, 2022)

A Unified Analysis of Dynamic Interactive Learning. - Xing Gao; Thomas Maranzatto; Lev Reyzin (Allerton, 2023)

Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs. - Ian A. Kash; Lev Reyzin; Zishun Yu (ALT, 2024)

A Model for Optimizing Recalculation Schedules to Minimize Regret. - Bethany Austhof; Lev Reyzin (ISAIM, 2024)

On Sample Reuse Methods for Answering k-wise Statistical Queries. - Lev Reyzin; Duan Tu (ISAIM, 2024)

Applications of Littlestone Dimension to Query Learning and to Compression. - Hunter Chase; James Freitag; Lev Reyzin (MFCS, 2024)

Non-adaptive Learning of Random Hypergraphs with Queries. - Bethany Austhof; Lev Reyzin; Erasmo Tani (CoRR, 2025)

Learning-Augmented Algorithms for Boolean Satisfiability. - Idan Attias; Xing Gao; Lev Reyzin (CoRR, 2025)