Abstract is missing.
- Polynomial Identity Testing via Evaluation of Rational FunctionsDieter van Melkebeek, Andrew Morgan. [doi]
- Extremely Deep ProofsNoah Fleming, Toniann Pitassi, Robert Robere. [doi]
- On Fairness and Stability in Two-Sided MatchingsGili Karni, Guy N. Rothblum, Gal Yona. [doi]
- A Gaussian Fixed Point Random WalkYang P. Liu, Ashwin Sah, Mehtaab Sawhney. [doi]
- Correlation-Intractable Hash Functions via Shift-HidingAlex Lombardi, Vinod Vaikuntanathan. [doi]
- Continuous Tasks and the Asynchronous Computability TheoremHugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid 0001. [doi]
- A Complete Linear Programming Hierarchy for Linear CodesLeonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones. [doi]
- Lifting with SunflowersShachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang. [doi]
- Multi-Channel Bayesian PersuasionYakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi. [doi]
- Online Multivalid Learning: Means, Moments, and Prediction IntervalsVarun Gupta, Christopher Jung 0001, Georgy Noarov, Mallesh M. Pai, Aaron Roth 0001. [doi]
- Double Coverage with Machine-Learned AdviceAlexander Lindermayr, Nicole Megow, Bertrand Simon. [doi]
- Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained ComplexityShyan Akmal, Lijie Chen 0001, Ce Jin, Malvika Raj, Ryan Williams 0001. [doi]
- A Unifying Framework for Characterizing and Computing Width MeasuresEduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon. [doi]
- Randomness Extraction from Somewhat Dependent SourcesMarshall Ball, Oded Goldreich 0001, Tal Malkin. [doi]
- Vertex Fault-Tolerant EmulatorsGreg Bodwin, Michael Dinitz, Yasamin Nazari. [doi]
- Excluding PH PessilandShuichi Hirahara, Rahul Santhanam. [doi]
- Locality-Preserving Hashing for Shifts with Connections to CryptographyElette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein. [doi]
- Algebraic Restriction Codes and Their ApplicationsDivesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski. [doi]
- Time-Traveling Simulators Using Blockchains and Their ApplicationsVipul Goyal, Justin Raizes, Pratik Soni. [doi]
- Lower Bounds on Stabilizer RankShir Peleg, Ben lee Volk, Amir Shpilka. [doi]
- Individual Fairness in Advertising Auctions Through Inverse ProportionalityShuchi Chawla 0001, Meena Jagadeesan. [doi]
- Sample-Based Proofs of ProximityGuy Goldberg, Guy N. Rothblum. [doi]
- Beating the Folklore Algorithm for Dynamic MatchingMohammad Roghani, Amin Saberi, David Wajc. [doi]
- Adversarially Robust Coloring for Graph StreamsAmit Chakrabarti, Prantar Ghosh, Manuel Stoeckl. [doi]
- Beating Classical Impossibility of Position VerificationJiahui Liu, Qipeng Liu, Luowen Qian. [doi]
- Bounded Indistinguishability for Simple SourcesAndrej Bogdanov, Krishnamoorthy Dinesh 0003, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan. [doi]
- Interactive Communication in Bilateral TradeJieming Mao, Renato Paes Leme, Kangning Wang. [doi]
- Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth GraphsBoaz Barak, Kunal Marwaha. [doi]
- Eliminating Intermediate Measurements Using Pseudorandom GeneratorsUma Girish, Ran Raz. [doi]
- Deterministic Dynamic Matching in Worst-Case Update TimePeter Kiss. [doi]
- A Spectral Approach to Polytope DiameterHariharan Narayanan, Rikhav Shah, Nikhil Srivastava. [doi]
- Optimal Deterministic Clock Auctions and BeyondGiorgos Christodoulou 0001, Vasilis Gkatzelis, Daniel Schoepflin 0001. [doi]
- Quantum Distributed Algorithms for Detection of CliquesKeren Censor Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman. [doi]
- Symmetric Sparse Boolean Matrix Factorization and ApplicationsSitan Chen, Zhao Song 0002, Runzhou Tao, Ruizhe Zhang 0001. [doi]
- The Importance of the Spectral Gap in Estimating Ground-State EnergiesAbhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman. [doi]
- Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck ProblemVijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani. [doi]
- Improved Hardness of BDD and SVP Under Gap-(S)ETHHuck Bennett, Chris Peikert, Yi Tang. [doi]
- Small Circuits Imply Efficient Arthur-Merlin ProtocolsMichael Ezra, Ron D. Rothblum. [doi]
- Circuit Lower Bounds for Low-Energy States of Quantum Code HamiltoniansAnurag Anshu, Chinmay Nirkhe. [doi]
- Improved Decoding of Expander CodesXue Chen, Kuan Cheng, Xin Li 0006, Minghui Ouyang. [doi]
- Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In TwoGaurav Sinha. [doi]
- Faster Sparse Matrix Inversion and Rank Computation in Finite FieldsSílvia Casacuberta, Rasmus Kyng. [doi]
- Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense DecompositionsSepehr Assadi, Chen Wang 0027. [doi]
- Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-DebreuMojtaba Hosseini, Vijay V. Vazirani. [doi]
- Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector BalancingNikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha. [doi]
- Smaller ACC0 Circuits for Symmetric FunctionsBrynmor Chapman, R. Ryan Williams. [doi]
- Max-3-Lin over Non-Abelian Groups with Universal Factor GraphsAmey Bhangale, Aleksa Stankovic. [doi]
- Noisy Boolean Hidden Matching with ApplicationsMichael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou. [doi]
- Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum WalksHarry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman. [doi]
- 3+ε Approximation of Tree Edit Distance in Truly Subquadratic TimeMasoud Seddighin, Saeed Seddighin. [doi]
- The Space Complexity of SamplingEshan Chattopadhyay, Jesse Goodman, David Zuckerman. [doi]
- More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of TasksYuqing Kong. [doi]
- Interactive Proofs for Synthesizing Quantum States and UnitariesGregory Rosenthal, Henry Yuen. [doi]
- Uniform Brackets, Containers, and Combinatorial Macbeath RegionsKunal Dutta, Arijit Ghosh, Shay Moran. [doi]
- Reduction from Non-Unique Games to Boolean Unique GamesRonen Eldan, Dana Moshkovitz. [doi]
- Domain Sparsification of Discrete Distributions Using Entropic IndependenceNima Anari, Michal Derezinski, Thuy Duong Vuong, Elizabeth Yang. [doi]
- Secret Sharing, Slice Formulas, and Monotone Real CircuitsBenny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi. [doi]
- Optimal Sub-Gaussian Mean Estimation in Very High DimensionsJasper C. H. Lee, Paul Valiant. [doi]
- Lower Bounds for Symmetric Circuits for the DeterminantAnuj Dawar, Gregory Wilsenach. [doi]
- An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic StreamsSepehr Assadi, Vihan Shah. [doi]
- Interaction-Preserving Compilers for Secure ComputationNico Döttling, Vipul Goyal, Giulio Malavolta, Justin Raizes. [doi]
- Pre-Constrained EncryptionPrabhanjan Ananth, Abhishek Jain 0002, Zhengzhong Jin, Giulio Malavolta. [doi]
- Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive CombinatoricsSebastian Brandt 0002, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky. [doi]
- Maximizing Revenue in the Presence of IntermediariesGagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, Andrés Perlroth. [doi]
- Budget-Smoothed Analysis for Submodular MaximizationAviad Rubinstein, Junyao Zhao 0001. [doi]
- Explicit Abelian Lifts and Quantum LDPC CodesFernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes 0002, Madhur Tulsiani. [doi]
- A Variant of the VC-Dimension with Applications to Depth-3 CircuitsPeter Frankl, Svyatoslav Gryaznov, Navid Talebanfard. [doi]
- On the Existence of Competitive Equilibrium with ChoresBhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta. [doi]
- Errorless Versus Error-Prone Average-Case ComplexityShuichi Hirahara, Rahul Santhanam. [doi]
- On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast DerandomizationRonen Shaltiel, Emanuele Viola. [doi]
- Keep That Card in Mind: Card Guessing with Limited MemoryBoaz Menuhin, Moni Naor. [doi]
- Uniform Bounds for Scheduling with Job Size EstimatesZiv Scully, Isaac Grosof, Michael Mitzenmacher. [doi]
- Distributed Vertex Cover ReconfigurationKeren Censor Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan. [doi]
- Fixed-Parameter Sensitivity OraclesDavide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger. [doi]
- Optimal Bounds for Dominating Set in Graph StreamsSanjeev Khanna, Christian Konrad. [doi]
- Mixing in Non-Quasirandom GroupsW. T. Gowers 0001, Emanuele Viola. [doi]
- Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking ProblemsShiri Antaki, Quanquan C. Liu, Shay Solomon. [doi]
- Sublinear-Time Computation in the Presence of Online ErasuresIden Kalemaj, Sofya Raskhodnikova, Nithin Varma. [doi]
- Matroid Secretary Is Equivalent to Contention ResolutionShaddin Dughmi. [doi]
- Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All DistributionsMeryem Essaidi, Matheus V. X. Ferreira, S. Matthew Weinberg. [doi]
- Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie AlgebrasGábor Ivanyos, Tushant Mittal, Youming Qiao. [doi]
- Multiscale Entropic Regularization for MTS on General Metric SpacesFarzam Ebrahimnejad, James R. Lee. [doi]
- Nonlinear Repair Schemes of Reed-Solomon CodesRoni Con, Itzhak Tamo. [doi]
- Small Hazard-Free TransducersJohannes Bund, Christoph Lenzen, Moti Medina. [doi]
- Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded DataNoah Shutty, Mary Wootters. [doi]
- Geometric Bounds on the Fastest Mixing Markov ChainSam Olesker-Taylor, Luca Zanetti. [doi]
- Correlation Detection in Trees for Planted Graph AlignmentLuca Ganassali, Laurent Massoulié, Marc Lelarge. [doi]
- A Lower Bound on the Space Overhead of Fault-Tolerant Quantum ComputationOmar Fawzi, Alexander Müller-Hermes, Ala Shayeghi. [doi]
- Probing to MinimizeWeina Wang, Anupam Gupta, Jalani Williams. [doi]
- Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite GraphsFarzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan. [doi]
- Embeddings and Labeling Schemes for ATalya Eden, Piotr Indyk, Haike Xu. [doi]
- Monotone Complexity of Spanning Tree Polynomial Re-VisitedArkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay. [doi]
- Testing Distributions of Huge ObjectsOded Goldreich 0001, Dana Ron. [doi]
- On Polynomially Many Queries to NP or QMA OraclesSevag Gharibian, Dorian Rudolph. [doi]
- Convex InfluencesAnindya De, Shivam Nadimpalli, Rocco A. Servedio. [doi]
- On the Download Rate of Homomorphic Secret SharingIngerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters. [doi]
- Quantum Meets the Minimum Circuit Size ProblemNai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang 0001. [doi]
- Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABEZvika Brakerski, Vinod Vaikuntanathan. [doi]
- Pseudorandom Self-Reductions for NP-Complete ProblemsReyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda. [doi]
- Balanced Allocations with Incomplete Information: The Power of Two QueriesDimitrios Los, Thomas Sauerwald. [doi]
- Mixing of 3-Term Progressions in Quasirandom GroupsAmey Bhangale, Prahladh Harsha, Sourya Roy. [doi]
- Average-Case Hardness of NP and PH from Worst-Case Fine-Grained AssumptionsLijie Chen 0001, Shuichi Hirahara, Neekon Vafa. [doi]
- Indistinguishability Obfuscation of Null Quantum Circuits and ApplicationsJames Bartusek, Giulio Malavolta. [doi]
- On Semi-Algebraic Proofs and AlgorithmsNoah Fleming, Mika Göös, Stefan Grosser, Robert Robere. [doi]
- FPT Algorithms for Finding Near-Cliques in c-Closed GraphsBalaram Behera, Edin Husic, Shweta Jain 0003, Tim Roughgarden, C. Seshadhri. [doi]
- An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few PassesAnubhav Baweja, Justin Jia, David P. Woodruff. [doi]
- Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String ProblemsFrançois Le Gall, Saeed Seddighin. [doi]
- Cursed yet Satisfied AgentsYiling Chen, Alon Eden, Juntao Wang. [doi]
- Small-Box CryptographyYevgeniy Dodis, Harish Karthikeyan, Daniel Wichs. [doi]
- Larger Corner-Free Sets from Combinatorial DegenerationsMatthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam. [doi]
- Dynamic Matching Algorithms Under Vertex UpdatesHung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams. [doi]
- PCPs and Instance Compression from a Cryptographic LensLiron Bronfman, Ron D. Rothblum. [doi]
- Adaptive Massively Parallel Constant-Round Tree ContractionMohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su. [doi]
- OmnipredictorsParikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder. [doi]
- Support Recovery in Universal One-Bit Compressed SensingArya Mazumdar, Soumyabrata Pal. [doi]
- What Does Dynamic Optimality Mean in External Memory?Michael A. Bender, Martin Farach-Colton, William Kuszmaul. [doi]
- Algorithms and Lower Bounds for Comparator Circuits from ShrinkageBruno Pasqualotto Cavalar, Zhenjian Lu. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Local Access to Random WalksAmartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld. [doi]
- Almost-Orthogonal Bases for Inner Product PolynomialsChris Jones, Aaron Potechin. [doi]
- Mechanism Design with Moral BiddersShahar Dobzinski, Sigal Oren. [doi]