Table of Contents

• Learning Reserve Prices in Second-Price AuctionsYaonan Jin, Pinyan Lu, Tao Xiao. [doi]
• Recovery from Non-Decomposable Distance OraclesZhuangfei Hu, XinDa Li, David P. Woodruff, Hongyang Zhang 0001, Shufan Zhang. [doi]
• Opponent Indifference in Rating Systems: A Theoretical Case for SonasGreg Bodwin, Forest Zhang. [doi]
• Is Untrusted Randomness Helpful?Uma Girish, Ran Raz, Wei Zhan. [doi]
• Symmetric Formulas for Products of PermutationsWilliam He, Benjamin Rossman. [doi]
• Fractional Certificates for Bounded FunctionsShachar Lovett, Jiapeng Zhang. [doi]
• Vertex Sparsification for Edge Connectivity in Polynomial TimeYang P. Liu. [doi]
• Expander Decomposition in Dynamic StreamsArnold Filtser, Michael Kapralov, Mikhail Makarov. [doi]
• Proofs of Quantumness from Trapdoor PermutationsTomoyuki Morimae, Takashi Yamakawa. [doi]
• Look Before, Before You Leap: Online Vector Load Balancing with Few ReassignmentsVarun Gupta 0004, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan. [doi]
• Random Max-CSPs Inherit Algorithmic Hardness from Spin GlassesChris Jones, Kunal Marwaha, Juspreet Singh Sandhu, Jonathan Shi. [doi]
• Beyond Worst-Case Budget-Feasible Mechanism DesignAviad Rubinstein, Junyao Zhao 0001. [doi]
• Matroid Partition Property and the Secretary ProblemDorna Abdolazimi, Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan. [doi]
• Constant-Depth Sorting NetworksNatalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii. [doi]
• An Algorithmic Bridge Between Hamming and Levenshtein DistancesElazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha. [doi]
• Downward Self-Reducibility in TFNPPrahladh Harsha, Daniel Mitropolsky, Alon Rosen. [doi]
• Worst-Case to Expander-Case ReductionsAmir Abboud, Nathan Wallheimer. [doi]
• Consensus Division in an Arbitrary RatioPaul Goldberg, Jiawei Li. [doi]
• Learning Versus Pseudorandom Generators in Constant Parallel TimeShuichi Hirahara, Mikito Nanashima. [doi]
• Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) BicliquePasin Manurangsi. [doi]
• Rounding via Low Dimensional EmbeddingsMark Braverman, Dor Minzer. [doi]
• Improved Monotonicity Testers via Hypercube EmbeddingsMark Braverman, Subhash Khot, Guy Kindler, Dor Minzer. [doi]
• A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic LimitHamza Fawzi, Omar Fawzi, Samuel O. Scalet. [doi]
• Noisy Radio Network Lower Bounds via Noiseless Beeping Lower BoundsKlim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. [doi]
• Online Pen TestingMingda Qiao, Gregory Valiant. [doi]
• Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into UnentanglementSevag Gharibian, Dorian Rudolph. [doi]
• PPP-Completeness and Extremal CombinatoricsRomain Bourneuf, Lukas Folwarczny, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach. [doi]
• Algorithms with More Granular Differential Privacy GuaranteesBadih Ghazi, Ravi Kumar 0001, Pasin Manurangsi, Thomas Steinke 0002. [doi]
• On Disperser/Lifting Properties of the Index and Inner-Product FunctionsPaul Beame, Sajin Koroth. [doi]
• Quantum Algorithms and the Power of ForgettingAndrew M. Childs, Matthew Coudron, Amin Shiraz Gilani. [doi]
• Garland's Technique for Posets and High Dimensional Grassmannian ExpandersTali Kaufman, Ran J. Tessler. [doi]
• Is This Correct? Let's Check!Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan 0001. [doi]
• Communication Complexity of Inner Product in Symmetric Normed SpacesAlexandr Andoni, Jaroslaw Blasiok, Arnold Filtser. [doi]
• The Time Complexity of Consensus Under Oblivious Message AdversariesKyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid 0001, Ulrich Schmid 0001. [doi]
• New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic MethodLijie Chen 0001. [doi]
• Is It Easier to Count Communities Than Find Them?Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang. [doi]
• Certification with an NP OracleGuy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan. [doi]
• On Oracles and Algorithmic Methods for Proving Lower BoundsNikhil Vyas 0001, Ryan Williams 0001. [doi]
• False Consensus, Information Theory, and Prediction MarketsYuqing Kong, Grant Schoenebeck. [doi]
• On the Computational Hardness Needed for Quantum CryptographyZvika Brakerski, Ran Canetti, Luowen Qian. [doi]
• A Framework for Adversarial Streaming via Differential Privacy and Difference EstimatorsIdan Attias, Edith Cohen, Moshe Shechner, Uri Stemmer. [doi]
• Making Auctions Robust to AftermarketsMoshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier. [doi]
• Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic NetworksAntoine El-Hayek, Monika Henzinger, Stefan Schmid 0001. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Efficiently Testable CircuitsMirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak. [doi]
• What Can Cryptography Do for Decentralized Mechanism Design?Elaine Shi, Hao Chung, Ke Wu 0001. [doi]
• Differentially Private Continual Releases of Streaming Frequency Moment EstimationsAlessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong. [doi]
• Quantum Majority VoteHarry Buhrman, Noah Linden, Laura Mancinska, Ashley Montanaro, Maris Ozols. [doi]
• Rigidity in Mechanism Design and Its ApplicationsShahar Dobzinski, Ariel Shaulker. [doi]
• Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation AlgorithmFabrizio Grandoni 0001, Claire Mathieu, Hang Zhou 0001. [doi]
• On Computing Homological Hitting SetsUlrich Bauer, Abhishek Rathod, Meirav Zehavi. [doi]
• Strategyproof Scheduling with PredictionsEric Balkanski, Vasilis Gkatzelis, Xizhi Tan. [doi]
• Generalized Private Selection and Testing with High ConfidenceEdith Cohen, Xin Lyu 0002, Jelani Nelson, Tamás Sarlós, Uri Stemmer. [doi]
• The Complexity of Infinite-Horizon General-Sum Stochastic GamesYujia Jin, Vidya Muthukumar, Aaron Sidford. [doi]
• Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPPAmol Pasarkar, Christos H. Papadimitriou, Mihalis Yannakakis. [doi]
• Asynchronous Multi-Party Quantum ComputationVipul Goyal, Chen-Da Liu Zhang, Justin Raizes, João Ribeiro. [doi]
• Resilience of 3-Majority Dynamics to Non-Uniform SchedulersUri Meir, Rotem Oshman, Ofer Shayevitz, Yuval Volkov. [doi]
• Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for FreeGreg Bodwin, Michael Dinitz, Yasamin Nazari. [doi]
• Counting Subgraphs in Somewhere Dense GraphsMarco Bressan 0002, Leslie Ann Goldberg, Kitty Meeks, Marc Roth. [doi]
• Quantum Proofs of Deletion for Learning with ErrorsAlexander Poremba. [doi]
• Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and MoreQipeng Liu. [doi]
• Karchmer-Wigderson Games for Hazard-Free ComputationChristian Ikenmeyer, Balagopal Komarath, Nitin Saurabh. [doi]
• Exact Completeness of LP Hierarchies for Linear CodesLeonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones. [doi]
• Low-Stabilizer-Complexity Quantum States Are Not PseudorandomSabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang. [doi]
• Incompressiblity and Next-Block PseudoentropyIftach Haitner, Noam Mazor, Jad Silbak. [doi]
• TFNP Characterizations of Proof Systems and Monotone CircuitsSam Buss, Noah Fleming, Russell Impagliazzo. [doi]
• On Identity Testing and Noncommutative Rank Computation over the Free Skew FieldVikraman Arvind, Abhranil Chatterjee 0001, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya. [doi]
• Bootstrapping Homomorphic Encryption via Functional EncryptionNir Bitansky, Tomer Solomon. [doi]
• Lifting to Parity Decision Trees via StiflingArkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif. [doi]
• Private Counting of Distinct and k-Occurring Items in Time WindowsBadih Ghazi, Ravi Kumar 0001, Jelani Nelson, Pasin Manurangsi. [doi]
• Graph Searching with PredictionsSiddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta 0001, Zhouzi Li. [doi]
• Decision-Making Under MiscalibrationGuy N. Rothblum, Gal Yona. [doi]
• Budget Pacing in Repeated Auctions: Regret and Efficiency Without ConvergenceJason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, Aleksandrs Slivkins. [doi]
• A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other ProblemsJulia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan. [doi]
• Matrix Multiplication via Matrix GroupsJonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans. [doi]
• Online Learning and Bandits with Queried HintsAditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala. [doi]
• Bit Complexity of Jordan Normal Form and Polynomial Spectral FactorizationPapri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava. [doi]
• Rigidity for Monogamy-Of-Entanglement GamesAnne Broadbent, Eric Culf. [doi]
• Kolmogorov Complexity Characterizes Statistical Zero KnowledgeEric Allender, Shuichi Hirahara, Harsha Tirumala. [doi]
• On Flipping the Fréchet DistanceOmrit Filtser, Mayank Goswami 0001, Joseph S. B. Mitchell, Valentin Polishchuk. [doi]
• Unitary Property Testing Lower Bounds by PolynomialsAdrian She, Henry Yuen. [doi]
• Secure Distributed Network Optimization Against EavesdroppersYael Hitron, Merav Parter, Eylon Yogev. [doi]
• Clustering Permutations: New Techniques with Streaming ApplicationsDiptarka Chakraborty, Debarati Das 0001, Robert Krauthgamer. [doi]
• All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update MethodSepehr Assadi, Aaron Bernstein, Zachary Langley. [doi]
• Making Decisions Under Outcome PerformativityMichael P. Kim, Juan C. Perdomo. [doi]
• On Low-End Obfuscation and LearningElette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, Gal Yehuda. [doi]
• HappyMap : A Generalized Multicalibration MethodZhun Deng, Cynthia Dwork, Linjun Zhang. [doi]
• The Strength of Equality Oracles in CommunicationToniann Pitassi, Morgan Shirley, Adi Shraibman. [doi]
• Exponential Separations Using Guarded Extension VariablesEmre Yolcu, Marijn J. H. Heule. [doi]
• List Agreement Expansion from Coboundary ExpansionRoy Gotlib, Tali Kaufman. [doi]
• Black-Box Constructive Proofs Are UnavoidableLijie Chen 0001, Ryan Williams 0001, Tianqi Yang 0001. [doi]
• Necessary Conditions in Multi-Server Differential PrivacyAlbert Cheu, Chao Yan. [doi]
• Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial ApproximationsAnurag Anshu, Tony Metger. [doi]
• Comparative Learning: A Sample Complexity Theory for Two Hypothesis ClassesLunjia Hu, Charlotte Peale. [doi]
• Beeping Shortest Paths via Hypergraph Bipartite DecompositionFabien Dufoulon, Yuval Emek, Ran Gelles. [doi]
• On Interactive Proofs of Proximity with Proof-Oblivious QueriesOded Goldreich 0001, Guy N. Rothblum, Tal Skverer. [doi]
• Certificate GamesSourav Chakraborty 0001, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny. [doi]
• Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random MatricesPrayaag Venkat. [doi]
• Loss Minimization Through the Lens Of Outcome IndistinguishabilityParikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder. [doi]
• A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear SystemsMonika Henzinger, Billy Jin, Richard Peng, David P. Williamson. [doi]
• Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs ExactlyGillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu. [doi]
• An Improved Lower Bound for Matroid Intersection Prophet InequalitiesRaghuvansh R. Saxena, Santhoshini Velusamy, S. Matthew Weinberg. [doi]