A Lower Bound for Sampling Disjoint Sets
Mika Göös and Thomas Watson
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
Domagoj Bradac, Sahil Singla and Goran Zuzic
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems
Sarah Cannon, Joshua Daymude, Cem Gokmen, Dana Randall and Andréa Richa
Approximate degree, secret sharing, and concentration phenomena
Andrej Bogdanov, Nikhil Mande, Justin Thaler and Christopher Williamson
Approximate F_2-Sketching of Valuation Functions
Grigory Yaroslavtsev and Samson Zhou
Approximating the noise sensitivity of a monotone Boolean function
Ronitt Rubinfeld and Arsen Vasilyan
Connectivity of Random Annulus Graphs and the Geometric Block Model
Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal and Barna Saha
Counting independent sets and colorings on random regular bipartite graphs
Chao Liao, Jiabao Lin, Pinyan Lu and Zhenyu Mao
Deterministic Approximation of Random Walks in Small Space
Jack Murtagh, Omer Reingold, Aaron Sidford and Salil Vadhan
Efficient average-case population recovery in the presence of insertions and deletions
Frank Ban, Xi Chen, Rocco Servedio and Sandip Sinha
Efficient Black-Box Identity Testing for Free Group Algebras
V Arvind, Abhranil Chatterjee, Rajit Datta and Partha Mukhopadhyay
Exploring Differential Obliviousness
Amos Beimel, Kobbi Nissim and Mohammad Zaheri
Fast algorithms at low temperatures via Markov chains
Zongchen Chen, Andreas Galanis, Leslie Goldberg, Will Perkins, James Stewart and Eric Vigoda
Improved Extractors for Recognizable and Algebraic Sources
Fu Li and David Zuckerman
Improved pseudorandom generators from pseudorandom multi-switching lemmas
Rocco Servedio and Li-Yang Tan
Improved Strong Spatial Mixing for Colorings on Trees
Charilaos Efthymiou, Andreas Galanis, Thomas Hayes, Daniel Stefankovic and Eric Vigoda
Lifted multiplicity codes and the disjoint repair group property
Ray Li and Mary Wootters
Maximum Label Propagation Algorithm on Sparse Random Graphs
Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller and Angelika Steger
Near neighbor preserving dimension reduction for doubling subsets of $\ell_1$
Ioannis Emiris, Vasilis Margonis and Ioannis Psarros
On a connectivity threshold for colorings of random graphs and hypergraphs
Michael Anastos and Alan Frieze
On List Recovery of High-Rate Tensor Codes
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf and Shashwat Silas
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
Zongchen Chen and Santosh Vempala
Pairwise Independent Random Walks can be Slightly Unbounded
Shyam Narayanan
Random-cluster dynamics in Z^2: rapid mixing with general boundary conditions
Antonio Blanca, Reza Gheissari and Eric Vigoda
Samplers and extractors for unbounded functions
Rohit Agrawal
Simple Analysis of Sparse, Sign-Consistent JL
Meena Jagadeesan
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ferroelectric and Antiferroelectric Phases
Matthew Fahrbach and Dana Randall
Streaming Coresets for M-Estimators
Vladimir Braverman, Dan Feldman, Harry Lang and Daniela Rus
Streaming Verification of Graph Computations via Graph Structure
Amit Chakrabarti and Prantar Ghosh
String Matching: Communication, Circuits, and Learning
Alexander Golovnev, Mika Goos, Daniel Reichman and Igor Shinkar
Successive minimum spanning trees
Svante Janson and Gregory Sorkin
Testing Odd Direct Sums Using High Dimensional Expanders
Roy Gotlib and Tali Kaufman
Direct Sum Testing: the General Case
Irit Dinur and Konstantin Golubev
The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions
Josep Diaz and Mordecai J Golin
The Large-Error Approximate Degree of AC^0
Mark Bun and Justin Thaler
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization
Grant Schoenebeck, Biaoshuai Tao and Fang-Yi Yu
Thresholds in Random Motif Graphs
Michael Anastos, Peleg Michaeli and Samantha Petti
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions
Dean Doron, Amnon Ta-Shma, Avraham Ben-Aroya and Gil Cohen
Unconstraining Graph-Constrained Group Testing
Bruce Spang and Mary Wootters