• Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro and Noah Stephens-Davidowitz. Extractor lower bounds, revisited
  • Kwangjun Ahn. A Simpler Strong Refutation of Random k-XOR
  • Sarah Miracle, Amanda Streib and Noah Streib. Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov chains
  • Zeyu Guo and Rohit Gurjar. Improved explicit hitting-sets for ROABPs
  • Nader Bshouty. Almost Optimal Testers for Concise Representations
  • Noga Alon and Sepehr Assadi. Palette Sparsification Beyond (Delta+1) Vertex Coloring
  • Dean Doron, Amnon Ta-Shma and Roei Tell. On Hitting-Set Generators for Polynomials that Vanish Rarely
  • Markus Bläser and Anurag Pandey. Polynomial identity testing for low degree polynomials with optimal randomness
  • Nicolas Resch, Venkatesan Guruswami, Jonathan Mosheiff, Ray Li, Shashwat Silas and Mary Wootters. Bounds for list-decoding and list-recovery of random linear codes
  • Ronen Shaltiel. Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?
  • Ali Pourmiri, Catherine Greenhill and Bernard Mans. Balanced Allocation on Dynamic Hypergraphs
  • Jeff Phillips and Wai Ming Tai. The GaussianSketch for Almost Relative Error Kernel Distance
  • Eric Price and Jonathan Scarlett. A Fast Binary Splitting Approach to Non-Adaptive Group Testing
  • Jan Dreier, Philipp Kuinke and Peter Rossmanith. Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size
  • Shuichi Hirahara and Osamu Watanabe. On Nonadaptive Security Reductions of Hitting Set Generators
  • Artur Czumaj, Hendrik Fichtenberger, Pan Peng and Christian Sohler. Testable Properties in General Graphs and Random Order Streaming
  • Calvin Beideman, Karthekeyan Chandrasekaran and Chao Xu. Multicriteria cuts and size-constrained k-cuts in hypergraphs
  • Eric Blais and Abhinav Bommireddi. On testing and robust characterizations of convexity
  • Reut Levi and Moti Medina. Distributed Testing of Graph Isomorphism in the CONGEST model
  • Linh Tran and Van Vu. Reaching a Consensus on Random Networks: The Power of Few
  • Sumegha Garg, Pravesh K. Kothari and Ran Raz. Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG
  • Amit Chakrabarti, Prantar Ghosh and Justin Thaler. Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
  • Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra and Manaswi Paraashar. Disjointness through the Lens of VC-dimension: Sparsity and Beyond
  • Clément Canonne and Karl Wimmer. Testing Data Binnings
  • Tali Kaufman and Ella Sharakanski. Chernoff Bound for High-Dimensional Expanders
  • Cyrus Rashtchian, David P. Woodruff and Hanlin Zhu. Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
  • Dana Ron and Asaf Rosin. Almost Optimal Distribution-Free Sample-Based Testing of k-Modality
  • Shalev Ben-David, Mika Göös, Robin Kothari and Thomas Watson. When Is Amplification Necessary for Composition in Randomized Query Complexity?
  • Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty and Mrinal Kumar. On Multilinear Forms: Bias, Correlation, and Tensor Rank
  • Aditya Potukuchi and Ben Lund. On the list recoverability of randomly punctured codes