Abstract is missing.
- On the Impossibility of Probabilistic Proofs in Relativized WorldsAlessandro Chiesa, Siqi Liu. [doi]
- Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent LimitationsGuy Blanc, Jane Lange, Li-Yang Tan. [doi]
- Strategic Payments in Financial NetworksNils Bertschinger, Martin Hoefer, Daniel Schmand. [doi]
- Optimal Single-Choice Prophet Inequalities from SamplesAviad Rubinstein, Jack Z. Wang, S. Matthew Weinberg. [doi]
- Reducing Inefficiency in Carbon Auctions with Imperfect CompetitionKira Goldner, Nicole Immorlica, Brendan Lucier. [doi]
- Tarski's Theorem, Supermodular Games, and the Complexity of EquilibriaKousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis. [doi]
- Robust Algorithms for the Secretary ProblemDomagoj Bradac, Anupam Gupta, Sahil Singla 0001, Goran Zuzic. [doi]
- Advancing Subgroup Fairness via Sleeping ExpertsAvrim Blum, Thodoris Lykouris. [doi]
- Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p]Rahul Ilango. [doi]
- OV Graphs Are (Probably) Hard InstancesJosh Alman, Virginia Vassilevska Williams. [doi]
- Monochromatic Triangles, Intermediate Matrix Products, and ConvolutionsAndrea Lincoln, Adam Polak 0001, Virginia Vassilevska Williams. [doi]
- On Oblivious Amplification of Coin-Tossing ProtocolsNir Bitansky, Nathan Geier. [doi]
- Testing Properties of Multiple Distributions with Few SamplesMaryam Aliakbarpour, Sandeep Silwal. [doi]
- Kronecker Powers of Tensors and Strassen's Laser MethodAustin Conner, Joseph M. Landsberg, Fulvio Gesmundo, Emanuele Ventura. [doi]
- Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse GraphsAndrea Lincoln, Nikhil Vyas 0001. [doi]
- Interactive Coding with Constant Round and Communication BlowupKlim Efremenko, Elad Haramaty, Yael Tauman Kalai. [doi]
- DEEP-FRI: Sampling Outside the Box Improves SoundnessEli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf. [doi]
- Learning and Testing Variable PartitionsAndrej Bogdanov, Baoxiang Wang. [doi]
- Lower Bounds for (Non-Monotone) Comparator CircuitsAnna Gál, Robert Robere. [doi]
- Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)Adam Bouland, Bill Fefferman, Umesh V. Vazirani. [doi]
- Distributional Property Testing in a Quantum WorldAndrás Gilyén, Tongyang Li. [doi]
- Resolution with Counting: Dag-Like Lower Bounds and Different ModuliFedor Part, Iddo Tzameret. [doi]
- Affine Determinant Programs: A Framework for Obfuscation and Witness EncryptionJames Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry. [doi]
- Testing Linear Inequalities of Subgraph StatisticsLior Gishboliner, Asaf Shapira, Henrique Stagni. [doi]
- Choice and Bias in Random WalksAgelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester. [doi]
- Scheduling with Predictions and the Price of MispredictionMichael Mitzenmacher. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Low Diameter Graph Decompositions by Approximate Distance ComputationRuben Becker, Yuval Emek, Christoph Lenzen. [doi]
- Smooth and Strong PCPsOrr Paradise. [doi]
- Cryptography from Information LossMarshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan. [doi]
- Sample Complexity Bounds for Influence MaximizationGal Sadeh, Edith Cohen, Haim Kaplan. [doi]
- Matching Is as Easy as the Decision Problem, in the NC ModelNima Anari, Vijay V. Vazirani. [doi]
- Ad Hoc Multi-Input Functional EncryptionShweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler. [doi]
- Strategy-Stealing Is Non-ConstructiveGreg Bodwin, Ofer Grossman. [doi]
- Combinatorial Lower Bounds for 3-Query LDCsArnab Bhattacharyya 0001, L. Sunil Chandran, Suprovat Ghoshal. [doi]
- Distribution-Free Testing of Linear Functions on ℝⁿNoah Fleming, Yuichi Yoshida. [doi]
- Smoothed Efficient Algorithms and Reductions for Network Coordination GamesShant Boodaghians, Rucha Kulkarni, Ruta Mehta. [doi]
- The Computational Cost of Asynchronous Neural CommunicationYael Hitron, Merav Parter, Gur Perri. [doi]
- Online Computation with Untrusted AdviceSpyros Angelopoulos 0001, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault. [doi]
- Limits to Non-MalleabilityMarshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin. [doi]
- Computation-Aware Data AggregationBernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia. [doi]
- Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games HardErik D. Demaine, Dylan H. Hendrickson, Jayson Lynch. [doi]
- Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-ConsistenceAriel Schvartzman, S. Matthew Weinberg, Eitan Zlatin, Albert Zuo. [doi]
- Signed Tropical ConvexityGeorg Loho, László A. Végh. [doi]
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix SpacesXiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun. [doi]
- Pseudo-Deterministic StreamingShafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff. [doi]
- On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin. [doi]
- Span Programs and Quantum Space ComplexityStacey Jeffery. [doi]
- Consensus vs Broadcast, with and Without Noise (Extended Abstract)Andrea E. F. Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan. [doi]
- Approximating Cumulative Pebbling Cost Is Unique Games HardJeremiah Blocki, Seunghoon Lee, Samson Zhou. [doi]
- Algorithms and Adaptivity Gaps for Stochastic k-TSPHaotian Jiang, Jian Li, Daogao Liu, Sahil Singla 0001. [doi]
- Graph Spanners in the Message-Passing ModelManuel Fernandez, David P. Woodruff, Taisuke Yasuda 0002. [doi]
- Separating Two-Round Secure Computation From Oblivious TransferBenny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan. [doi]
- Beyond Natural Proofs: Hardness Magnification and LocalityLijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam. [doi]
- Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size SixSuman K. Bera, Noujan Pashanasangi, C. Seshadhri. [doi]
- Fault Tolerant Subgraphs with Applications in KernelizationWilliam Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. [doi]
- Finding Skewed Subcubes Under a DistributionParikshit Gopalan, Roie Levin, Udi Wieder. [doi]
- Computationally Data-Independent Memory Hard FunctionsMohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou. [doi]
- Local-To-Global Agreement Expansion via the Variance MethodTali Kaufman, David Mass. [doi]
- Random Sketching, Clustering, and Short-Term Memory in Spiking Neural NetworksYael Hitron, Nancy A. Lynch, Cameron Musco, Merav Parter. [doi]
- On the Cryptographic Hardness of Local SearchNir Bitansky, Idan Gerichter. [doi]
- Incentive Compatible Active LearningFederico Echenique, Siddharth Prasad. [doi]
- Trade-Offs Between Size and Degree in Polynomial CalculusGuillaume Lagarde, Jakob Nordström, Dmitry Sokolov 0001, Joseph Swernofsky. [doi]
- On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of HJin-yi Cai, Artem Govorov. [doi]
- Preference-Informed FairnessMichael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona. [doi]
- New Query Lower Bounds for Submodular Function MinimizationAndrei Graur, Tristan Pollner, Vidhya Ramaswamy, S. Matthew Weinberg. [doi]
- Universal Communication, Universal Graphs, and Graph LabelingNathaniel Harms. [doi]
- A Tight Lower Bound For Non-Coherent Index ErasureNathan Lindzey, Ansis Rosmanis. [doi]
- Certified Algorithms: Worst-Case Analysis and BeyondKonstantin Makarychev, Yury Makarychev. [doi]
- Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-HardLinda Cai, Clayton Thomas, S. Matthew Weinberg. [doi]
- Hardness Amplification of Optimization ProblemsElazar Goldenberg, Karthik C. S.. [doi]
- Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear SamplesRonitt Rubinfeld, Arsen Vasilyan. [doi]
- A New Analysis of Differential Privacy's Generalization GuaranteesChristopher Jung, Katrina Ligett, Seth Neel, Aaron Roth 0001, Saeed Sharifi-Malvajerdi, Moshe Shenfeld. [doi]
- Computational Hardness of Certifying Bounds on Constrained PCA ProblemsAfonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein. [doi]
- Parameterization Above a Multiplicative GuaranteeFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Local Access to Huge Random Objects Through Partial SamplingAmartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee. [doi]
- Hard Properties with (Very) Short PCPPs and Their ApplicationsOmri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum. [doi]
- Unexpected Power of Random StringsShuichi Hirahara. [doi]
- Equivalence of Systematic Linear Data Structures and Matrix RigiditySivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian. [doi]
- On Local Testability in the Non-Signaling SettingAlessandro Chiesa, Peter Manohar, Igor Shinkar. [doi]
- MPC for MPC: Secure Computation on a Massively Parallel Computing ArchitectureT.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi. [doi]
- Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed StorageFrancisco Maturana, K. V. Rashmi. [doi]
- High-Dimensional Expanders from ExpandersSiqi Liu, Sidhanth Mohanty, Elizabeth Yang. [doi]
- The Random-Query Model and the Memory-Bounded Coupon CollectorRan Raz, Wei Zhan. [doi]
- Instance Complexity and Unlabeled Certificates in the Decision Tree ModelTomer Grossman, Ilan Komargodski, Moni Naor. [doi]
- Generalized List DecodingYihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi. [doi]
- Pseudorandomness and the Minimum Circuit Size ProblemRahul Santhanam. [doi]