STOC 2024 – Author Index

A B C D E F G H I J K L M N O P Q R S T V W X Y Z

	Abboud, Amir	STOC '24: "New Graph Decompositions and ..." New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka (Weizmann Institute of Science, Israel; University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1033, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1033-1032}, doi = {10.1145/3618260.3649696}, year = {2024}, } Publisher's Version Article: stoc24main-p481-p (type: Full Paper) doi:10.1145/3618260.3649696
	Abrahamsen, Mikkel	STOC '24: "Minimum Star Partitions of ..." Minimum Star Partitions of Simple Polygons in Polynomial Time Mikkel Abrahamsen, Joakim Blikstad, André Nusser, and Hanwen Zhang (University of Copenhagen, Copenhagen, Denmark; KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany) @InProceedings{STOC24p997, author = {Mikkel Abrahamsen and Joakim Blikstad and André Nusser and Hanwen Zhang}, title = {Minimum Star Partitions of Simple Polygons in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {997-996}, doi = {10.1145/3618260.3649756}, year = {2024}, } Publisher's Version Article: stoc24main-p1052-p (type: Full Paper) doi:10.1145/3618260.3649756
	Ahmadi, Ali	STOC '24: "Prize-Collecting Steiner Tree: ..." Prize-Collecting Steiner Tree: A 1.79 Approximation Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi (University of Maryland, USA) @InProceedings{STOC24p1825, author = {Ali Ahmadi and Iman Gholami and MohammadTaghi Hajiaghayi and Peyman Jabbarzade and Mohammad Mahdavi}, title = {Prize-Collecting Steiner Tree: A 1.79 Approximation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1825-1824}, doi = {10.1145/3618260.3649789}, year = {2024}, } Publisher's Version Article: stoc24main-p1622-p (type: Full Paper) doi:10.1145/3618260.3649789
	Akshima	STOC '24: "Tight Time-Space Tradeoffs ..." Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, and Yuping Ye (NYU Shanghai, China; East China Normal University, China) @InProceedings{STOC24p1933, author = { Akshima and Tyler Besselman and Siyao Guo and Zhiye Xie and Yuping Ye}, title = {Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1933-1932}, doi = {10.1145/3618260.3649752}, year = {2024}, } Publisher's Version Article: stoc24main-p1023-p (type: Full Paper) doi:10.1145/3618260.3649752
	Alrabiah, Omar	STOC '24: "Randomly Punctured Reed–Solomon ..." Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields Omar Alrabiah, Venkatesan Guruswami, and Ray Li (University of California at Berkeley, USA; Santa Clara University, USA) @InProceedings{STOC24p1621, author = {Omar Alrabiah and Venkatesan Guruswami and Ray Li}, title = {Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1621-1620}, doi = {10.1145/3618260.3649634}, year = {2024}, } Publisher's Version Article: stoc24main-p130-p (type: Full Paper) doi:10.1145/3618260.3649634
	Amir, Daniel	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Amireddy, Prashanth	STOC '24: "Local Correction of Linear ..." Local Correction of Linear Functions over the Boolean Cube Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, and Madhu Sudan (Harvard University, USA; Aarhus University, Aarhus, Denmark; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p841, author = {Prashanth Amireddy and Amik Raj Behera and Manaswi Paraashar and Srikanth Srinivasan and Madhu Sudan}, title = {Local Correction of Linear Functions over the Boolean Cube}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {841-840}, doi = {10.1145/3618260.3649746}, year = {2024}, } Publisher's Version Article: stoc24main-p954-p (type: Full Paper) doi:10.1145/3618260.3649746
	Anand, Aditya	STOC '24: "Approximating Small Sparse ..." Approximating Small Sparse Cuts Aditya Anand, Euiwoong Lee, Jason Li, and Thatchaphol Saranurak (University of Michigan, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p361, author = {Aditya Anand and Euiwoong Lee and Jason Li and Thatchaphol Saranurak}, title = {Approximating Small Sparse Cuts}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {361-360}, doi = {10.1145/3618260.3649747}, year = {2024}, } Publisher's Version Article: stoc24main-p972-p (type: Full Paper) doi:10.1145/3618260.3649747
	Anari, Nima	STOC '24: "Trickle-Down in Localization ..." Trickle-Down in Localization Schemes and Applications Nima Anari, Frederic Koehler, and Thuy-Duong Vuong (Stanford University, USA; University of Chicago, USA) @InProceedings{STOC24p1213, author = {Nima Anari and Frederic Koehler and Thuy-Duong Vuong}, title = {Trickle-Down in Localization Schemes and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1213-1212}, doi = {10.1145/3618260.3649622}, year = {2024}, } Publisher's Version Article: stoc24main-p76-p (type: Full Paper) doi:10.1145/3618260.3649622 STOC '24: "Parallel Sampling via Counting ..." Parallel Sampling via Counting Nima Anari, Ruiquan Gao, and Aviad Rubinstein (Stanford University, USA) @InProceedings{STOC24p601, author = {Nima Anari and Ruiquan Gao and Aviad Rubinstein}, title = {Parallel Sampling via Counting}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {601-600}, doi = {10.1145/3618260.3649744}, year = {2024}, } Publisher's Version Article: stoc24main-p931-p (type: Full Paper) doi:10.1145/3618260.3649744
	Anshu, Anurag	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722 STOC '24: "Circuit-to-Hamiltonian from ..." Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance Anurag Anshu, Nikolas P. Breuckmann, and Quynh T. Nguyen (Harvard University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p649, author = {Anurag Anshu and Nikolas P. Breuckmann and Quynh T. Nguyen}, title = {Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {649-648}, doi = {10.1145/3618260.3649690}, year = {2024}, } Publisher's Version Article: stoc24main-p434-p (type: Full Paper) doi:10.1145/3618260.3649690
	Arad, Itai	STOC '24: "An Area Law for the Maximally-Mixed ..." An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP Itai Arad, Raz Firanko, and Rahul Jain (Centre for Quantum Technologies, Singapore; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p1453, author = {Itai Arad and Raz Firanko and Rahul Jain}, title = {An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1453-1452}, doi = {10.1145/3618260.3649612}, year = {2024}, } Publisher's Version Article: stoc24main-p47-p (type: Full Paper) doi:10.1145/3618260.3649612
	Arvind, V.	STOC '24: "Black-Box Identity Testing ..." Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time V. Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay (Institute of Mathematical Sciences, India; Chennai Mathematical Institute, India; Indian Statistical Institute, Kolkata, India) @InProceedings{STOC24p133, author = {V. Arvind and Abhranil Chatterjee and Partha Mukhopadhyay}, title = {Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {133-132}, doi = {10.1145/3618260.3649693}, year = {2024}, } Publisher's Version Article: stoc24main-p448-p (type: Full Paper) doi:10.1145/3618260.3649693
	Assadi, Sepehr	STOC '24: "Optimal Multi-pass Lower Bounds ..." Optimal Multi-pass Lower Bounds for MST in Dynamic Streams Sepehr Assadi, Gillat Kol, and Zhijun Zhang (University of Waterloo, Canada; Rutgers University, USA; Princeton University, USA) @InProceedings{STOC24p913, author = {Sepehr Assadi and Gillat Kol and Zhijun Zhang}, title = {Optimal Multi-pass Lower Bounds for MST in Dynamic Streams}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {913-912}, doi = {10.1145/3618260.3649755}, year = {2024}, } Publisher's Version Article: stoc24main-p1046-p (type: Full Paper) doi:10.1145/3618260.3649755 STOC '24: "O(log log n) Passes Is Optimal ..." O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, and Janani Sundaresan (University of Waterloo, Canada; Rutgers University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p925, author = {Sepehr Assadi and Christian Konrad and Kheeran K. Naidu and Janani Sundaresan}, title = {O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {925-924}, doi = {10.1145/3618260.3649763}, year = {2024}, } Publisher's Version Article: stoc24main-p1123-p (type: Full Paper) doi:10.1145/3618260.3649763
	Babichenko, Yakov	STOC '24: "Fair Division via Quantile ..." Fair Division via Quantile Shares Yakov Babichenko, Michal Feldman, Ron Holzman, and Vishnu V. Narayan (Technion, Israel; Tel Aviv University, Israel) @InProceedings{STOC24p1369, author = {Yakov Babichenko and Michal Feldman and Ron Holzman and Vishnu V. Narayan}, title = {Fair Division via Quantile Shares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1369-1368}, doi = {10.1145/3618260.3649728}, year = {2024}, } Publisher's Version Article: stoc24main-p764-p (type: Full Paper) doi:10.1145/3618260.3649728
	Bafna, Mitali	STOC '24: "Characterizing Direct Product ..." Characterizing Direct Product Testing via Coboundary Expansion Mitali Bafna and Dor Minzer (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p2197, author = {Mitali Bafna and Dor Minzer}, title = {Characterizing Direct Product Testing via Coboundary Expansion}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2197-2196}, doi = {10.1145/3618260.3649714}, year = {2024}, } Publisher's Version Article: stoc24main-p610-p (type: Full Paper) doi:10.1145/3618260.3649714
	Bakshi, Ainesh	STOC '24: "Learning Quantum Hamiltonians ..." Learning Quantum Hamiltonians at Any Temperature in Polynomial Time Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1633, author = {Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang}, title = {Learning Quantum Hamiltonians at Any Temperature in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1633-1632}, doi = {10.1145/3618260.3649619}, year = {2024}, } Publisher's Version Article: stoc24main-p62-p (type: Full Paper) doi:10.1145/3618260.3649619
	Bangachev, Kiril	STOC '24: "On the Fourier Coefficients ..." On the Fourier Coefficients of High-Dimensional Random Geometric Graphs Kiril Bangachev and Guy Bresler (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p613, author = {Kiril Bangachev and Guy Bresler}, title = {On the Fourier Coefficients of High-Dimensional Random Geometric Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {613-612}, doi = {10.1145/3618260.3649676}, year = {2024}, } Publisher's Version Article: stoc24main-p356-p (type: Full Paper) doi:10.1145/3618260.3649676
	Barooti, Khashayar	STOC '24: "Nonlocality under Computational ..." Nonlocality under Computational Assumptions Grzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, and Marc-Olivier Renou (EPFL, Lausanne, Switzerland; Aztec Labs, United Kingdom; Chalmers University of Technology, Sweden; Inria - Université Paris-Saclay - CPHT - École Polytechnique - Institut Polytechnique de Paris, France) @InProceedings{STOC24p1129, author = {Grzegorz Gluch and Khashayar Barooti and Alexandru Gheorghiu and Marc-Olivier Renou}, title = {Nonlocality under Computational Assumptions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1129-1128}, doi = {10.1145/3618260.3649750}, year = {2024}, } Publisher's Version Article: stoc24main-p1004-p (type: Full Paper) doi:10.1145/3618260.3649750
	Bartusek, James	STOC '24: "Quantum State Obfuscation ..." Quantum State Obfuscation from Classical Oracles James Bartusek, Zvika Brakerski, and Vinod Vaikuntanathan (University of California at Berkeley, USA; Weizmann Institute of Science, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1117, author = {James Bartusek and Zvika Brakerski and Vinod Vaikuntanathan}, title = {Quantum State Obfuscation from Classical Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1117-1116}, doi = {10.1145/3618260.3649673}, year = {2024}, } Publisher's Version Article: stoc24main-p345-p (type: Full Paper) doi:10.1145/3618260.3649673
	Beame, Paul	STOC '24: "Quantum Time-Space Tradeoffs ..." Quantum Time-Space Tradeoffs for Matrix Problems Paul Beame, Niels Kornerup, and Michael Whitmeyer (University of Washington, USA; University of Texas at Austin, USA) @InProceedings{STOC24p661, author = {Paul Beame and Niels Kornerup and Michael Whitmeyer}, title = {Quantum Time-Space Tradeoffs for Matrix Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {661-660}, doi = {10.1145/3618260.3649700}, year = {2024}, } Publisher's Version Article: stoc24main-p546-p (type: Full Paper) doi:10.1145/3618260.3649700
	Behera, Amik Raj	STOC '24: "Local Correction of Linear ..." Local Correction of Linear Functions over the Boolean Cube Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, and Madhu Sudan (Harvard University, USA; Aarhus University, Aarhus, Denmark; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p841, author = {Prashanth Amireddy and Amik Raj Behera and Manaswi Paraashar and Srikanth Srinivasan and Madhu Sudan}, title = {Local Correction of Linear Functions over the Boolean Cube}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {841-840}, doi = {10.1145/3618260.3649746}, year = {2024}, } Publisher's Version Article: stoc24main-p954-p (type: Full Paper) doi:10.1145/3618260.3649746
	Behnezhad, Soheil	STOC '24: "Approximating Maximum Matching ..." Approximating Maximum Matching Requires Almost Quadratic Time Soheil Behnezhad, Mohammad Roghani, and Aviad Rubinstein (Northeastern University, USA; Stanford University, USA) @InProceedings{STOC24p505, author = {Soheil Behnezhad and Mohammad Roghani and Aviad Rubinstein}, title = {Approximating Maximum Matching Requires Almost Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {505-504}, doi = {10.1145/3618260.3649785}, year = {2024}, } Publisher's Version Article: stoc24main-p1563-p (type: Full Paper) doi:10.1145/3618260.3649785
	Bérczi, Kristóf	STOC '24: "Reconfiguration of Basis Pairs ..." Reconfiguration of Basis Pairs in Regular Matroids Kristóf Bérczi, Bence Mátravölgyi, and Tamás Schwarcz (University of Eötvös Loránd, Hungary; ETH Zurich, Switzerland) @InProceedings{STOC24p1837, author = {Kristóf Bérczi and Bence Mátravölgyi and Tamás Schwarcz}, title = {Reconfiguration of Basis Pairs in Regular Matroids}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1837-1836}, doi = {10.1145/3618260.3649660}, year = {2024}, } Publisher's Version Article: stoc24main-p269-p (type: Full Paper) doi:10.1145/3618260.3649660
	Berendsohn, Benjamin Aram	STOC '24: "Optimization with Pattern-Avoiding ..." Optimization with Pattern-Avoiding Input Benjamin Aram Berendsohn, László Kozma, and Michal Opler (Freie Universität Berlin, Berlin, Germany; Czech Technical University, Prague, Czechia) @InProceedings{STOC24p745, author = {Benjamin Aram Berendsohn and László Kozma and Michal Opler}, title = {Optimization with Pattern-Avoiding Input}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {745-744}, doi = {10.1145/3618260.3649631}, year = {2024}, } Publisher's Version Article: stoc24main-p118-p (type: Full Paper) doi:10.1145/3618260.3649631
	Beretta, Lorenzo	STOC '24: "Approximate Earth Mover’s ..." Approximate Earth Mover’s Distance in Truly-Subquadratic Time Lorenzo Beretta and Aviad Rubinstein (University of Copenhagen, Copenhagen, Denmark; Stanford University, USA) @InProceedings{STOC24p73, author = {Lorenzo Beretta and Aviad Rubinstein}, title = {Approximate Earth Mover’s Distance in Truly-Subquadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {73-72}, doi = {10.1145/3618260.3649629}, year = {2024}, } Publisher's Version Article: stoc24main-p97-p (type: Full Paper) doi:10.1145/3618260.3649629
	Bergamaschi, Thiago	STOC '24: "Approaching the Quantum Singleton ..." Approaching the Quantum Singleton Bound with Approximate Error Correction Thiago Bergamaschi, Louis Golowich, and Sam Gunn (University of California at Berkeley, USA) @InProceedings{STOC24p1681, author = {Thiago Bergamaschi and Louis Golowich and Sam Gunn}, title = {Approaching the Quantum Singleton Bound with Approximate Error Correction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1681-1680}, doi = {10.1145/3618260.3649680}, year = {2024}, } Publisher's Version Article: stoc24main-p387-p (type: Full Paper) doi:10.1145/3618260.3649680
	Bernasconi, Martino	STOC '24: "No-Regret Learning in Bilateral ..." No-Regret Learning in Bilateral Trade via Global Budget Balance Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco (Bocconi University, Italy; Politecnico di Milano, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p289, author = {Martino Bernasconi and Matteo Castiglioni and Andrea Celli and Federico Fusco}, title = {No-Regret Learning in Bilateral Trade via Global Budget Balance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {289-288}, doi = {10.1145/3618260.3649653}, year = {2024}, } Publisher's Version Article: stoc24main-p212-p (type: Full Paper) doi:10.1145/3618260.3649653
	Besselman, Tyler	STOC '24: "Tight Time-Space Tradeoffs ..." Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, and Yuping Ye (NYU Shanghai, China; East China Normal University, China) @InProceedings{STOC24p1933, author = { Akshima and Tyler Besselman and Siyao Guo and Zhiye Xie and Yuping Ye}, title = {Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1933-1932}, doi = {10.1145/3618260.3649752}, year = {2024}, } Publisher's Version Article: stoc24main-p1023-p (type: Full Paper) doi:10.1145/3618260.3649752
	Bhangale, Amey	STOC '24: "On Approximability of Satisfiable ..." On Approximability of Satisfiable k-CSPs: IV Amey Bhangale, Subhash Khot, and Dor Minzer (University of California at Riverside, USA; New York University, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1585, author = {Amey Bhangale and Subhash Khot and Dor Minzer}, title = {On Approximability of Satisfiable k-CSPs: IV}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1585-1584}, doi = {10.1145/3618260.3649610}, year = {2024}, } Publisher's Version Article: stoc24main-p34-p (type: Full Paper) doi:10.1145/3618260.3649610
	Bhargav, C. S.	STOC '24: "Learning the Coefficients: ..." Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring C. S. Bhargav, Prateek Dwivedi, and Nitin Saxena (IIT Kanpur, India) @InProceedings{STOC24p157, author = {C. S. Bhargav and Prateek Dwivedi and Nitin Saxena}, title = {Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {157-156}, doi = {10.1145/3618260.3649743}, year = {2024}, } Publisher's Version Article: stoc24main-p922-p (type: Full Paper) doi:10.1145/3618260.3649743
	Bhaskara, Aditya	STOC '24: "New Tools for Smoothed Analysis: ..." New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, and Aravindan Vijayaraghavan (University of Utah, USA; Northwestern University, USA) @InProceedings{STOC24p433, author = {Aditya Bhaskara and Eric Evert and Vaidehi Srinivas and Aravindan Vijayaraghavan}, title = {New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {433-432}, doi = {10.1145/3618260.3649765}, year = {2024}, } Publisher's Version Article: stoc24main-p1150-p (type: Full Paper) doi:10.1145/3618260.3649765
	Bhattacharya, Sayan	STOC '24: "Near-Optimal Dynamic Rounding ..." Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs Sayan Bhattacharya, Peter Kiss, Aaron Sidford, and David Wajc (University of Warwick, United Kingdom; Stanford University, USA; Technion, Israel) @InProceedings{STOC24p85, author = {Sayan Bhattacharya and Peter Kiss and Aaron Sidford and David Wajc}, title = {Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {85-84}, doi = {10.1145/3618260.3649648}, year = {2024}, } Publisher's Version Article: stoc24main-p175-p (type: Full Paper) doi:10.1145/3618260.3649648
	Bitansky, Nir	STOC '24: "Batch Proofs Are Statistically ..." Batch Proofs Are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan (Tel Aviv University, Israel; IIT Bombay, India; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p493, author = {Nir Bitansky and Chethan Kamath and Omer Paneth and Ron D. Rothblum and Prashant Nalini Vasudevan}, title = {Batch Proofs Are Statistically Hiding}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {493-492}, doi = {10.1145/3618260.3649775}, year = {2024}, } Publisher's Version Article: stoc24main-p1365-p (type: Full Paper) doi:10.1145/3618260.3649775
	Björklund, Andreas	STOC '24: "The Asymptotic Rank Conjecture ..." The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True Andreas Björklund and Petteri Kaski (IT University of Copenhagen, Copenhagen, Denmark; Aalto University, Finland) @InProceedings{STOC24p937, author = {Andreas Björklund and Petteri Kaski}, title = {The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {937-936}, doi = {10.1145/3618260.3649656}, year = {2024}, } Publisher's Version Article: stoc24main-p230-p (type: Full Paper) doi:10.1145/3618260.3649656
	Blais, Eric	STOC '24: "New Graph and Hypergraph Container ..." New Graph and Hypergraph Container Lemmas with Applications in Property Testing Eric Blais and Cameron Seth (University of Waterloo, Canada) @InProceedings{STOC24p1993, author = {Eric Blais and Cameron Seth}, title = {New Graph and Hypergraph Container Lemmas with Applications in Property Testing}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1993-1992}, doi = {10.1145/3618260.3649708}, year = {2024}, } Publisher's Version Article: stoc24main-p576-p (type: Full Paper) doi:10.1145/3618260.3649708
	Blikstad, Joakim	STOC '24: "Online Edge Coloring Is (Nearly) ..." Online Edge Coloring Is (Nearly) as Easy as Offline Joakim Blikstad, Ola Svensson, Radu Vintan, and David Wajc (KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany; EPFL, Lausanne, Switzerland; Technion, Israel) @InProceedings{STOC24p61, author = {Joakim Blikstad and Ola Svensson and Radu Vintan and David Wajc}, title = {Online Edge Coloring Is (Nearly) as Easy as Offline}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {61-60}, doi = {10.1145/3618260.3649741}, year = {2024}, } Publisher's Version Article: stoc24main-p891-p (type: Full Paper) doi:10.1145/3618260.3649741 STOC '24: "Minimum Star Partitions of ..." Minimum Star Partitions of Simple Polygons in Polynomial Time Mikkel Abrahamsen, Joakim Blikstad, André Nusser, and Hanwen Zhang (University of Copenhagen, Copenhagen, Denmark; KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany) @InProceedings{STOC24p997, author = {Mikkel Abrahamsen and Joakim Blikstad and André Nusser and Hanwen Zhang}, title = {Minimum Star Partitions of Simple Polygons in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {997-996}, doi = {10.1145/3618260.3649756}, year = {2024}, } Publisher's Version Article: stoc24main-p1052-p (type: Full Paper) doi:10.1145/3618260.3649756
	Bostanci, John	STOC '24: "An Efficient Quantum Parallel ..." An Efficient Quantum Parallel Repetition Theorem and Applications John Bostanci, Luowen Qian, Nicholas Spooner, and Henry Yuen (Columbia University, USA; Boston University, USA; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1645, author = {John Bostanci and Luowen Qian and Nicholas Spooner and Henry Yuen}, title = {An Efficient Quantum Parallel Repetition Theorem and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1645-1644}, doi = {10.1145/3618260.3649603}, year = {2024}, } Publisher's Version Article: stoc24main-p10-p (type: Full Paper) doi:10.1145/3618260.3649603
	Boyle, Elette	STOC '24: "Memory Checking Requires Logarithmic ..." Memory Checking Requires Logarithmic Overhead Elette Boyle, Ilan Komargodski, and Neekon Vafa (Reichman University, Israel; NTT Research, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1897, author = {Elette Boyle and Ilan Komargodski and Neekon Vafa}, title = {Memory Checking Requires Logarithmic Overhead}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1897-1896}, doi = {10.1145/3618260.3649686}, year = {2024}, } Publisher's Version Article: stoc24main-p413-p (type: Full Paper) doi:10.1145/3618260.3649686
	Brakensiek, Joshua	STOC '24: "Generalized GM-MDS: Polynomial ..." Generalized GM-MDS: Polynomial Codes Are Higher Order MDS Joshua Brakensiek, Manik Dhar, and Sivakanth Gopi (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA) @InProceedings{STOC24p805, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi}, title = {Generalized GM-MDS: Polynomial Codes Are Higher Order MDS}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {805-804}, doi = {10.1145/3618260.3649637}, year = {2024}, } Publisher's Version Article: stoc24main-p135-p (type: Full Paper) doi:10.1145/3618260.3649637 STOC '24: "AG Codes Achieve List Decoding ..." AG Codes Achieve List Decoding Capacity over Constant-Sized Fields Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, and Zihan Zhang (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA; Ohio State University, USA) @InProceedings{STOC24p817, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi and Zihan Zhang}, title = {AG Codes Achieve List Decoding Capacity over Constant-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {817-816}, doi = {10.1145/3618260.3649651}, year = {2024}, } Publisher's Version Article: stoc24main-p193-p (type: Full Paper) doi:10.1145/3618260.3649651
	Brakerski, Zvika	STOC '24: "Quantum State Obfuscation ..." Quantum State Obfuscation from Classical Oracles James Bartusek, Zvika Brakerski, and Vinod Vaikuntanathan (University of California at Berkeley, USA; Weizmann Institute of Science, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1117, author = {James Bartusek and Zvika Brakerski and Vinod Vaikuntanathan}, title = {Quantum State Obfuscation from Classical Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1117-1116}, doi = {10.1145/3618260.3649673}, year = {2024}, } Publisher's Version Article: stoc24main-p345-p (type: Full Paper) doi:10.1145/3618260.3649673
	Braverman, Mark	STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672
	Bravyi, Sergey	STOC '24: "Classical Simulation of Peaked ..." Classical Simulation of Peaked Shallow Quantum Circuits Sergey Bravyi, David Gosset, and Yinchen Liu (IBM Research, USA; University of Waterloo, Canada; Institute for Quantum Computing, Canada; Perimeter Institute for Theoretical Physics, Canada) @InProceedings{STOC24p625, author = {Sergey Bravyi and David Gosset and Yinchen Liu}, title = {Classical Simulation of Peaked Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {625-624}, doi = {10.1145/3618260.3649638}, year = {2024}, } Publisher's Version Article: stoc24main-p141-p (type: Full Paper) doi:10.1145/3618260.3649638
	Bresler, Guy	STOC '24: "On the Fourier Coefficients ..." On the Fourier Coefficients of High-Dimensional Random Geometric Graphs Kiril Bangachev and Guy Bresler (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p613, author = {Kiril Bangachev and Guy Bresler}, title = {On the Fourier Coefficients of High-Dimensional Random Geometric Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {613-612}, doi = {10.1145/3618260.3649676}, year = {2024}, } Publisher's Version Article: stoc24main-p356-p (type: Full Paper) doi:10.1145/3618260.3649676
	Breuckmann, Nikolas P.	STOC '24: "Circuit-to-Hamiltonian from ..." Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance Anurag Anshu, Nikolas P. Breuckmann, and Quynh T. Nguyen (Harvard University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p649, author = {Anurag Anshu and Nikolas P. Breuckmann and Quynh T. Nguyen}, title = {Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {649-648}, doi = {10.1145/3618260.3649690}, year = {2024}, } Publisher's Version Article: stoc24main-p434-p (type: Full Paper) doi:10.1145/3618260.3649690
	Bringmann, Karl	STOC '24: "Knapsack with Small Items ..." Knapsack with Small Items in Near-Quadratic Time Karl Bringmann (Saarland University, Saarbrücken, Germany; MPI-INF, Germany) @InProceedings{STOC24p301, author = {Karl Bringmann}, title = {Knapsack with Small Items in Near-Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {301-300}, doi = {10.1145/3618260.3649719}, year = {2024}, } Publisher's Version Article: stoc24main-p664-p (type: Full Paper) doi:10.1145/3618260.3649719
	Broughton, Michael	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	Buchbinder, Niv	STOC '24: "Constrained Submodular Maximization ..." Constrained Submodular Maximization via New Bounds for DR-Submodular Functions Niv Buchbinder and Moran Feldman (Tel Aviv University, Israel; University of Haifa, Israel) @InProceedings{STOC24p2029, author = {Niv Buchbinder and Moran Feldman}, title = {Constrained Submodular Maximization via New Bounds for DR-Submodular Functions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2029-2028}, doi = {10.1145/3618260.3649630}, year = {2024}, } Publisher's Version Article: stoc24main-p113-p (type: Full Paper) doi:10.1145/3618260.3649630
	Cai, Yang	STOC '24: "The Power of Two-Sided Recruitment ..." The Power of Two-Sided Recruitment in Two-Sided Markets Yang Cai, Christopher Liaw, Aranyak Mehta, and Mingfei Zhao (Yale University, USA; Google Research, USA) @InProceedings{STOC24p241, author = {Yang Cai and Christopher Liaw and Aranyak Mehta and Mingfei Zhao}, title = {The Power of Two-Sided Recruitment in Two-Sided Markets}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {241-240}, doi = {10.1145/3618260.3649669}, year = {2024}, } Publisher's Version Article: stoc24main-p319-p (type: Full Paper) doi:10.1145/3618260.3649669
	Cannon, Sarah	STOC '24: "Sampling Balanced Forests ..." Sampling Balanced Forests of Grids in Polynomial Time Sarah Cannon, Wesley Pegden, and Jamie Tucker-Foltz (Claremont McKenna College, USA; Carnegie Mellon University, USA; Harvard University, USA) @InProceedings{STOC24p1861, author = {Sarah Cannon and Wesley Pegden and Jamie Tucker-Foltz}, title = {Sampling Balanced Forests of Grids in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1861-1860}, doi = {10.1145/3618260.3649699}, year = {2024}, } Publisher's Version Article: stoc24main-p525-p (type: Full Paper) doi:10.1145/3618260.3649699
	Cao, Nairen	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749
	Caputo, Pietro	STOC '24: "Nonlinear Dynamics for the ..." Nonlinear Dynamics for the Ising Model Pietro Caputo and Alistair Sinclair (University Rome III, Italy; University of California at Berkeley, USA) @InProceedings{STOC24p577, author = {Pietro Caputo and Alistair Sinclair}, title = {Nonlinear Dynamics for the Ising Model}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {577-576}, doi = {10.1145/3618260.3649759}, year = {2024}, } Publisher's Version Article: stoc24main-p1091-p (type: Full Paper) doi:10.1145/3618260.3649759
	Casacuberta, Sílvia	STOC '24: "Complexity-Theoretic Implications ..." Complexity-Theoretic Implications of Multicalibration Sílvia Casacuberta, Cynthia Dwork, and Salil Vadhan (University of Oxford, United Kingdom; Harvard University, USA) @InProceedings{STOC24p1189, author = {Sílvia Casacuberta and Cynthia Dwork and Salil Vadhan}, title = {Complexity-Theoretic Implications of Multicalibration}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1189-1188}, doi = {10.1145/3618260.3649748}, year = {2024}, } Publisher's Version Article: stoc24main-p982-p (type: Full Paper) doi:10.1145/3618260.3649748
	Castiglioni, Matteo	STOC '24: "No-Regret Learning in Bilateral ..." No-Regret Learning in Bilateral Trade via Global Budget Balance Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco (Bocconi University, Italy; Politecnico di Milano, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p289, author = {Martino Bernasconi and Matteo Castiglioni and Andrea Celli and Federico Fusco}, title = {No-Regret Learning in Bilateral Trade via Global Budget Balance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {289-288}, doi = {10.1145/3618260.3649653}, year = {2024}, } Publisher's Version Article: stoc24main-p212-p (type: Full Paper) doi:10.1145/3618260.3649653
	Cavallaro, Dario Giuliano	STOC '24: "Edge-Disjoint Paths in Eulerian ..." Edge-Disjoint Paths in Eulerian Digraphs Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, and Stephan Kreutzer (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan) @InProceedings{STOC24p781, author = {Dario Giuliano Cavallaro and Ken-ichi Kawarabayashi and Stephan Kreutzer}, title = {Edge-Disjoint Paths in Eulerian Digraphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {781-780}, doi = {10.1145/3618260.3649758}, year = {2024}, } Publisher's Version Article: stoc24main-p1070-p (type: Full Paper) doi:10.1145/3618260.3649758
	Celli, Andrea	STOC '24: "No-Regret Learning in Bilateral ..." No-Regret Learning in Bilateral Trade via Global Budget Balance Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco (Bocconi University, Italy; Politecnico di Milano, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p289, author = {Martino Bernasconi and Matteo Castiglioni and Andrea Celli and Federico Fusco}, title = {No-Regret Learning in Bilateral Trade via Global Budget Balance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {289-288}, doi = {10.1145/3618260.3649653}, year = {2024}, } Publisher's Version Article: stoc24main-p212-p (type: Full Paper) doi:10.1145/3618260.3649653
	Cen, Ruoxu	STOC '24: "Hypergraph Unreliability in ..." Hypergraph Unreliability in Quasi-Polynomial Time Ruoxu Cen, Jason Li, and Debmalya Panigrahi (Duke University, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1885, author = {Ruoxu Cen and Jason Li and Debmalya Panigrahi}, title = {Hypergraph Unreliability in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1885-1884}, doi = {10.1145/3618260.3649753}, year = {2024}, } Publisher's Version Article: stoc24main-p1042-p (type: Full Paper) doi:10.1145/3618260.3649753
	Cesa-Bianchi, Nicolo	STOC '24: "The Role of Transparency in ..." The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi (University of Milan, Italy; Politecnico di Milano, Italy; University of Ottawa, Canada; Italian Institute of Technology, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p265, author = {Nicolo Cesa-Bianchi and Tommaso Cesari and Roberto Colomboni and Federico Fusco and Stefano Leonardi}, title = {The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {265-264}, doi = {10.1145/3618260.3649658}, year = {2024}, } Publisher's Version Article: stoc24main-p255-p (type: Full Paper) doi:10.1145/3618260.3649658
	Cesari, Tommaso	STOC '24: "The Role of Transparency in ..." The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi (University of Milan, Italy; Politecnico di Milano, Italy; University of Ottawa, Canada; Italian Institute of Technology, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p265, author = {Nicolo Cesa-Bianchi and Tommaso Cesari and Roberto Colomboni and Federico Fusco and Stefano Leonardi}, title = {The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {265-264}, doi = {10.1145/3618260.3649658}, year = {2024}, } Publisher's Version Article: stoc24main-p255-p (type: Full Paper) doi:10.1145/3618260.3649658
	Chan, Siu On	STOC '24: "How Random CSPs Fool Hierarchies ..." How Random CSPs Fool Hierarchies Siu On Chan, Hiu Tsun Ng, and Sijin Peng (Unaffiliated, Hong Kong, China; Chinese University of Hong Kong, China; Tsinghua University, China) @InProceedings{STOC24p2161, author = {Siu On Chan and Hiu Tsun Ng and Sijin Peng}, title = {How Random CSPs Fool Hierarchies}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2161-2160}, doi = {10.1145/3618260.3649613}, year = {2024}, } Publisher's Version Article: stoc24main-p48-p (type: Full Paper) doi:10.1145/3618260.3649613
	Chan, Swee Hong	STOC '24: "Equality Cases of the Alexandrov–Fenchel ..." Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy Swee Hong Chan and Igor Pak (Rutgers University, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p961, author = {Swee Hong Chan and Igor Pak}, title = {Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {961-960}, doi = {10.1145/3618260.3649646}, year = {2024}, } Publisher's Version Article: stoc24main-p167-p (type: Full Paper) doi:10.1145/3618260.3649646
	Chase, Zachary	STOC '24: "Local Borsuk-Ulam, Stability, ..." Local Borsuk-Ulam, Stability, and Replicability Zachary Chase, Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff (Technion, Israel; Google Research, Israel; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p1969, author = {Zachary Chase and Bogdan Chornomaz and Shay Moran and Amir Yehudayoff}, title = {Local Borsuk-Ulam, Stability, and Replicability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1969-1968}, doi = {10.1145/3618260.3649632}, year = {2024}, } Publisher's Version Article: stoc24main-p119-p (type: Full Paper) doi:10.1145/3618260.3649632
	Chatterjee, Abhranil	STOC '24: "Black-Box Identity Testing ..." Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time V. Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay (Institute of Mathematical Sciences, India; Chennai Mathematical Institute, India; Indian Statistical Institute, Kolkata, India) @InProceedings{STOC24p133, author = {V. Arvind and Abhranil Chatterjee and Partha Mukhopadhyay}, title = {Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {133-132}, doi = {10.1145/3618260.3649693}, year = {2024}, } Publisher's Version Article: stoc24main-p448-p (type: Full Paper) doi:10.1145/3618260.3649693
	Chen, Chi-Fang	STOC '24: "Local Minima in Quantum Systems ..." Local Minima in Quantum Systems Chi-Fang Chen, Hsin-Yuan Huang, John Preskill, and Leo Zhou (California Institute of Technology, USA; AWS Center for Quantum Computing, USA; Google Quantum AI, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1465, author = {Chi-Fang Chen and Hsin-Yuan Huang and John Preskill and Leo Zhou}, title = {Local Minima in Quantum Systems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1465-1464}, doi = {10.1145/3618260.3649675}, year = {2024}, } Publisher's Version Article: stoc24main-p355-p (type: Full Paper) doi:10.1145/3618260.3649675
	Chen, Hongjie	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Chen, Li	STOC '24: "Almost-Linear Time Algorithms ..." Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg (Carnegie Mellon University, USA; ETH Zurich, Switzerland; Institute for Advanced Study, Princeton, USA) @InProceedings{STOC24p1285, author = {Li Chen and Rasmus Kyng and Yang P. Liu and Simon Meierhans and Maximilian Probst Gutenberg}, title = {Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1285-1284}, doi = {10.1145/3618260.3649745}, year = {2024}, } Publisher's Version Article: stoc24main-p949-p (type: Full Paper) doi:10.1145/3618260.3649745
	Chen, Lijie	STOC '24: "Symmetric Exponential Time ..." Symmetric Exponential Time Requires Near-Maximum Circuit Size Lijie Chen, Shuichi Hirahara, and Hanlin Ren (University of California at Berkeley, USA; National Institute of Informatics, Tokyo, Japan; University of Oxford, United Kingdom) @InProceedings{STOC24p2209, author = {Lijie Chen and Shuichi Hirahara and Hanlin Ren}, title = {Symmetric Exponential Time Requires Near-Maximum Circuit Size}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2209-2208}, doi = {10.1145/3618260.3649624}, year = {2024}, } Publisher's Version Article: stoc24main-p79-p (type: Full Paper) doi:10.1145/3618260.3649624
	Chen, Lin	STOC '24: "A Nearly Quadratic-Time FPTAS ..." A Nearly Quadratic-Time FPTAS for Knapsack Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p325, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {A Nearly Quadratic-Time FPTAS for Knapsack}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {325-324}, doi = {10.1145/3618260.3649730}, year = {2024}, } Publisher's Version Article: stoc24main-p797-p (type: Full Paper) doi:10.1145/3618260.3649730 STOC '24: "Approximating Partition in ..." Approximating Partition in Near-Linear Time Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p349, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {Approximating Partition in Near-Linear Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {349-348}, doi = {10.1145/3618260.3649727}, year = {2024}, } Publisher's Version Article: stoc24main-p758-p (type: Full Paper) doi:10.1145/3618260.3649727
	Chen, Sitan	STOC '24: "An Optimal Tradeoff between ..." An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography Sitan Chen, Jerry Li, and Allen Liu (Harvard University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1477, author = {Sitan Chen and Jerry Li and Allen Liu}, title = {An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1477-1476}, doi = {10.1145/3618260.3649704}, year = {2024}, } Publisher's Version Article: stoc24main-p558-p (type: Full Paper) doi:10.1145/3618260.3649704
	Chen, Xi	STOC '24: "Distribution-Free Testing ..." Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries Xi Chen, Yumou Fei, and Shyamal Patel (Columbia University, USA; Peking University, China) @InProceedings{STOC24p1165, author = {Xi Chen and Yumou Fei and Shyamal Patel}, title = {Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1165-1164}, doi = {10.1145/3618260.3649717}, year = {2024}, } Publisher's Version Article: stoc24main-p650-p (type: Full Paper) doi:10.1145/3618260.3649717 STOC '24: "Computing a Fixed Point of ..." Computing a Fixed Point of Contraction Maps in Polynomial Queries Xi Chen, Yuhao Li, and Mihalis Yannakakis (Columbia University, USA) @InProceedings{STOC24p1513, author = {Xi Chen and Yuhao Li and Mihalis Yannakakis}, title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1513-1512}, doi = {10.1145/3618260.3649623}, year = {2024}, } Publisher's Version Article: stoc24main-p78-p (type: Full Paper) doi:10.1145/3618260.3649623
	Chen, Yilei	STOC '24: "Hardness of Range Avoidance ..." Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography Yilei Chen and Jiatu Li (Tsinghua University, China; Shanghai Qi Zhi Institute, Shanghai, China; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p685, author = {Yilei Chen and Jiatu Li}, title = {Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {685-684}, doi = {10.1145/3618260.3649602}, year = {2024}, } Publisher's Version Article: stoc24main-p7-p (type: Full Paper) doi:10.1145/3618260.3649602
	Chenakkod, Shabarish	STOC '24: "Optimal Embedding Dimension ..." Optimal Embedding Dimension for Sparse Subspace Embeddings Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong, and Mark Rudelson (University of Michigan, USA) @InProceedings{STOC24p1225, author = {Shabarish Chenakkod and Michał Dereziński and Xiaoyu Dong and Mark Rudelson}, title = {Optimal Embedding Dimension for Sparse Subspace Embeddings}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1225-1224}, doi = {10.1145/3618260.3649762}, year = {2024}, } Publisher's Version Article: stoc24main-p1115-p (type: Full Paper) doi:10.1145/3618260.3649762
	Chornomaz, Bogdan	STOC '24: "Local Borsuk-Ulam, Stability, ..." Local Borsuk-Ulam, Stability, and Replicability Zachary Chase, Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff (Technion, Israel; Google Research, Israel; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p1969, author = {Zachary Chase and Bogdan Chornomaz and Shay Moran and Amir Yehudayoff}, title = {Local Borsuk-Ulam, Stability, and Replicability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1969-1968}, doi = {10.1145/3618260.3649632}, year = {2024}, } Publisher's Version Article: stoc24main-p119-p (type: Full Paper) doi:10.1145/3618260.3649632
	Chuzhoy, Julia	STOC '24: "Maximum Bipartite Matching ..." Maximum Bipartite Matching in 𝑛2+𝑜(1) Time via a Combinatorial Algorithm Julia Chuzhoy and Sanjeev Khanna (Toyota Technological Institute, Chicago, USA; University of Pennsylvania, USA) @InProceedings{STOC24p109, author = {Julia Chuzhoy and Sanjeev Khanna}, title = {Maximum Bipartite Matching in 𝑛<sup>2+𝑜(1)</sup> Time via a Combinatorial Algorithm}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {109-108}, doi = {10.1145/3618260.3649725}, year = {2024}, } Publisher's Version Article: stoc24main-p726-p (type: Full Paper) doi:10.1145/3618260.3649725
	Ciardo, Lorenzo	STOC '24: "Semidefinite Programming and ..." Semidefinite Programming and Linear Equations vs. Homomorphism Problems Lorenzo Ciardo and Stanislav Živný (University of Oxford, United Kingdom) @InProceedings{STOC24p2149, author = {Lorenzo Ciardo and Stanislav Živný}, title = {Semidefinite Programming and Linear Equations vs. Homomorphism Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2149-2148}, doi = {10.1145/3618260.3649635}, year = {2024}, } Publisher's Version Article: stoc24main-p131-p (type: Full Paper) doi:10.1145/3618260.3649635
	Cohen-Addad, Vincent	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749 STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712
	Coiteux-Roy, Xavier	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Coladangelo, Andrea	STOC '24: "How to Use Quantum Indistinguishability ..." How to Use Quantum Indistinguishability Obfuscation Andrea Coladangelo and Sam Gunn (University of Washington, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1105, author = {Andrea Coladangelo and Sam Gunn}, title = {How to Use Quantum Indistinguishability Obfuscation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1105-1104}, doi = {10.1145/3618260.3649779}, year = {2024}, } Publisher's Version Article: stoc24main-p1449-p (type: Full Paper) doi:10.1145/3618260.3649779
	Colomboni, Roberto	STOC '24: "The Role of Transparency in ..." The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi (University of Milan, Italy; Politecnico di Milano, Italy; University of Ottawa, Canada; Italian Institute of Technology, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p265, author = {Nicolo Cesa-Bianchi and Tommaso Cesari and Roberto Colomboni and Federico Fusco and Stefano Leonardi}, title = {The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {265-264}, doi = {10.1145/3618260.3649658}, year = {2024}, } Publisher's Version Article: stoc24main-p255-p (type: Full Paper) doi:10.1145/3618260.3649658
	Compton, Spencer	STOC '24: "Near-Optimal Mean Estimation ..." Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances Spencer Compton and Gregory Valiant (Stanford University, USA) @InProceedings{STOC24p229, author = {Spencer Compton and Gregory Valiant}, title = {Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {229-228}, doi = {10.1145/3618260.3649754}, year = {2024}, } Publisher's Version Article: stoc24main-p1045-p (type: Full Paper) doi:10.1145/3618260.3649754
	Cook, James	STOC '24: "Tree Evaluation Is in Space ..." Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛) James Cook and Ian Mertz (Unaffiliated, Canada; University of Warwick, United Kingdom) @InProceedings{STOC24p1405, author = {James Cook and Ian Mertz}, title = {Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1405-1404}, doi = {10.1145/3618260.3649664}, year = {2024}, } Publisher's Version Article: stoc24main-p294-p (type: Full Paper) doi:10.1145/3618260.3649664
	Cristi, Andrés	STOC '24: "Prophet Inequalities Require ..." Prophet Inequalities Require Only a Constant Number of Samples Andrés Cristi and Bruno Ziliotto (University of Chile, Chile; Center for Mathematical Modeling, Chile; CNRS, France; Paris Dauphine University, France) @InProceedings{STOC24p553, author = {Andrés Cristi and Bruno Ziliotto}, title = {Prophet Inequalities Require Only a Constant Number of Samples}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {553-552}, doi = {10.1145/3618260.3649773}, year = {2024}, } Publisher's Version Article: stoc24main-p1317-p (type: Full Paper) doi:10.1145/3618260.3649773
	Dadush, Daniel	STOC '24: "A Strongly Polynomial Algorithm ..." A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh (CWI, Amsterdam, Netherlands; Georgia Institute of Technology, USA; London School of Economics, United Kingdom) @InProceedings{STOC24p1741, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1741-1740}, doi = {10.1145/3618260.3649764}, year = {2024}, } Publisher's Version Article: stoc24main-p1131-p (type: Full Paper) doi:10.1145/3618260.3649764
	Dagan, Yuval	STOC '24: "From External to Swap Regret ..." From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich (University of California at Berkeley, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1345, author = {Yuval Dagan and Constantinos Daskalakis and Maxwell Fishelson and Noah Golowich}, title = {From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1345-1344}, doi = {10.1145/3618260.3649681}, year = {2024}, } Publisher's Version Article: stoc24main-p389-p (type: Full Paper) doi:10.1145/3618260.3649681
	Dalirrooyfard, Mina	STOC '24: "Towards Optimal Output-Sensitive ..." Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu (Morgan Stanley Research, Canada; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1021, author = {Mina Dalirrooyfard and Surya Mathialagan and Virginia Vassilevska Williams and Yinzhan Xu}, title = {Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1021-1020}, doi = {10.1145/3618260.3649663}, year = {2024}, } Publisher's Version Article: stoc24main-p288-p (type: Full Paper) doi:10.1145/3618260.3649663
	D'Amore, Francesco	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Das, Bireswar	STOC '24: "The Minimal Faithful Permutation ..." The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups Bireswar Das and Dhara Thakkar (IIT Gandhinagar, India) @InProceedings{STOC24p145, author = {Bireswar Das and Dhara Thakkar}, title = {The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {145-144}, doi = {10.1145/3618260.3649641}, year = {2024}, } Publisher's Version Article: stoc24main-p156-p (type: Full Paper) doi:10.1145/3618260.3649641
	Daskalakis, Constantinos	STOC '24: "From External to Swap Regret ..." From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich (University of California at Berkeley, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1345, author = {Yuval Dagan and Constantinos Daskalakis and Maxwell Fishelson and Noah Golowich}, title = {From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1345-1344}, doi = {10.1145/3618260.3649681}, year = {2024}, } Publisher's Version Article: stoc24main-p389-p (type: Full Paper) doi:10.1145/3618260.3649681
	De, Anindya	STOC '24: "Detecting Low-Degree Truncation ..." Detecting Low-Degree Truncation Anindya De, Huan Li, Shivam Nadimpalli, and Rocco A. Servedio (University of Pennsylvania, USA; Columbia University, USA) @InProceedings{STOC24p1141, author = {Anindya De and Huan Li and Shivam Nadimpalli and Rocco A. Servedio}, title = {Detecting Low-Degree Truncation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1141-1140}, doi = {10.1145/3618260.3649633}, year = {2024}, } Publisher's Version Article: stoc24main-p129-p (type: Full Paper) doi:10.1145/3618260.3649633
	Debris-Alazard, Thomas	STOC '24: "Quantum Oblivious LWE Sampling ..." Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs Thomas Debris-Alazard, Pouria Fallahpour, and Damien Stehlé (Inria - Laboratoire LIX - École Polytechnique, France; ENS Lyon - LIP, France; CryptoLab, France) @InProceedings{STOC24p481, author = {Thomas Debris-Alazard and Pouria Fallahpour and Damien Stehlé}, title = {Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {481-480}, doi = {10.1145/3618260.3649766}, year = {2024}, } Publisher's Version Article: stoc24main-p1194-p (type: Full Paper) doi:10.1145/3618260.3649766
	Dereziński, Michał	STOC '24: "Optimal Embedding Dimension ..." Optimal Embedding Dimension for Sparse Subspace Embeddings Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong, and Mark Rudelson (University of Michigan, USA) @InProceedings{STOC24p1225, author = {Shabarish Chenakkod and Michał Dereziński and Xiaoyu Dong and Mark Rudelson}, title = {Optimal Embedding Dimension for Sparse Subspace Embeddings}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1225-1224}, doi = {10.1145/3618260.3649762}, year = {2024}, } Publisher's Version Article: stoc24main-p1115-p (type: Full Paper) doi:10.1145/3618260.3649762 STOC '24: "Solving Dense Linear Systems ..." Solving Dense Linear Systems Faster Than via Preconditioning Michał Dereziński and Jiaming Yang (University of Michigan, USA) @InProceedings{STOC24p1237, author = {Michał Dereziński and Jiaming Yang}, title = {Solving Dense Linear Systems Faster Than via Preconditioning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1237-1236}, doi = {10.1145/3618260.3649694}, year = {2024}, } Publisher's Version Article: stoc24main-p464-p (type: Full Paper) doi:10.1145/3618260.3649694
	Dey, Dipan	STOC '24: "Nearly Optimal Fault Tolerant ..." Nearly Optimal Fault Tolerant Distance Oracle Dipan Dey and Manoj Gupta (IIT Gandhinagar, India) @InProceedings{STOC24p1045, author = {Dipan Dey and Manoj Gupta}, title = {Nearly Optimal Fault Tolerant Distance Oracle}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1045-1044}, doi = {10.1145/3618260.3649697}, year = {2024}, } Publisher's Version Article: stoc24main-p517-p (type: Full Paper) doi:10.1145/3618260.3649697
	Dhar, Manik	STOC '24: "Generalized GM-MDS: Polynomial ..." Generalized GM-MDS: Polynomial Codes Are Higher Order MDS Joshua Brakensiek, Manik Dhar, and Sivakanth Gopi (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA) @InProceedings{STOC24p805, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi}, title = {Generalized GM-MDS: Polynomial Codes Are Higher Order MDS}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {805-804}, doi = {10.1145/3618260.3649637}, year = {2024}, } Publisher's Version Article: stoc24main-p135-p (type: Full Paper) doi:10.1145/3618260.3649637 STOC '24: "AG Codes Achieve List Decoding ..." AG Codes Achieve List Decoding Capacity over Constant-Sized Fields Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, and Zihan Zhang (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA; Ohio State University, USA) @InProceedings{STOC24p817, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi and Zihan Zhang}, title = {AG Codes Achieve List Decoding Capacity over Constant-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {817-816}, doi = {10.1145/3618260.3649651}, year = {2024}, } Publisher's Version Article: stoc24main-p193-p (type: Full Paper) doi:10.1145/3618260.3649651
	Diakonikolas, Ilias	STOC '24: "Super Non-singular Decompositions ..." Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, and Nikos Zarifis (University of Wisconsin-Madison, USA; University of California at San Diego, USA; University of Texas at Austin, USA) @InProceedings{STOC24p181, author = {Ilias Diakonikolas and Daniel M. Kane and Vasilis Kontonis and Sihan Liu and Nikos Zarifis}, title = {Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {181-180}, doi = {10.1145/3618260.3649776}, year = {2024}, } Publisher's Version Article: stoc24main-p1369-p (type: Full Paper) doi:10.1145/3618260.3649776 STOC '24: "Testing Closeness of Multivariate ..." Testing Closeness of Multivariate Distributions via Ramsey Theory Ilias Diakonikolas, Daniel M. Kane, and Sihan Liu (University of Wisconsin-Madison, USA; University of California at San Diego, USA) @InProceedings{STOC24p385, author = {Ilias Diakonikolas and Daniel M. Kane and Sihan Liu}, title = {Testing Closeness of Multivariate Distributions via Ramsey Theory}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {385-384}, doi = {10.1145/3618260.3649657}, year = {2024}, } Publisher's Version Article: stoc24main-p244-p (type: Full Paper) doi:10.1145/3618260.3649657
	Dikstein, Yotam	STOC '24: "Swap Cosystolic Expansion ..." Swap Cosystolic Expansion Yotam Dikstein and Irit Dinur (Institute for Advanced Study, Princeton, USA; Weizmann Institute of Science, Israel) @InProceedings{STOC24p2173, author = {Yotam Dikstein and Irit Dinur}, title = {Swap Cosystolic Expansion}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2173-2172}, doi = {10.1145/3618260.3649780}, year = {2024}, } Publisher's Version Article: stoc24main-p1471-p (type: Full Paper) doi:10.1145/3618260.3649780 STOC '24: "Agreement Theorems for High ..." Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers Yotam Dikstein and Irit Dinur (Institute for Advanced Study, Princeton, USA; Weizmann Institute of Science, Israel) @InProceedings{STOC24p2185, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2185-2184}, doi = {10.1145/3618260.3649685}, year = {2024}, } Publisher's Version Article: stoc24main-p409-p (type: Full Paper) doi:10.1145/3618260.3649685
	Ding, Jingqiu	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Dinur, Irit	STOC '24: "Swap Cosystolic Expansion ..." Swap Cosystolic Expansion Yotam Dikstein and Irit Dinur (Institute for Advanced Study, Princeton, USA; Weizmann Institute of Science, Israel) @InProceedings{STOC24p2173, author = {Yotam Dikstein and Irit Dinur}, title = {Swap Cosystolic Expansion}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2173-2172}, doi = {10.1145/3618260.3649780}, year = {2024}, } Publisher's Version Article: stoc24main-p1471-p (type: Full Paper) doi:10.1145/3618260.3649780 STOC '24: "Agreement Theorems for High ..." Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers Yotam Dikstein and Irit Dinur (Institute for Advanced Study, Princeton, USA; Weizmann Institute of Science, Israel) @InProceedings{STOC24p2185, author = {Yotam Dikstein and Irit Dinur}, title = {Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2185-2184}, doi = {10.1145/3618260.3649685}, year = {2024}, } Publisher's Version Article: stoc24main-p409-p (type: Full Paper) doi:10.1145/3618260.3649685
	Dobzinski, Shahar	STOC '24: "Bilateral Trade with Correlated ..." Bilateral Trade with Correlated Values Shahar Dobzinski and Ariel Shaulker (Weizmann Institute of Science, Israel) @InProceedings{STOC24p277, author = {Shahar Dobzinski and Ariel Shaulker}, title = {Bilateral Trade with Correlated Values}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {277-276}, doi = {10.1145/3618260.3649659}, year = {2024}, } Publisher's Version Article: stoc24main-p256-p (type: Full Paper) doi:10.1145/3618260.3649659 STOC '24: "A Constant-Factor Approximation ..." A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, and Jan Vondrák (Weizmann Institute of Science, Israel; Stanford University, USA) @InProceedings{STOC24p529, author = {Shahar Dobzinski and Wenzheng Li and Aviad Rubinstein and Jan Vondrák}, title = {A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {529-528}, doi = {10.1145/3618260.3649740}, year = {2024}, } Publisher's Version Article: stoc24main-p872-p (type: Full Paper) doi:10.1145/3618260.3649740
	Dong, Ruiwen	STOC '24: "Semigroup Algorithmic Problems ..." Semigroup Algorithmic Problems in Metabelian Groups Ruiwen Dong (Saarland University, Saarbrücken, Germany) @InProceedings{STOC24p973, author = {Ruiwen Dong}, title = {Semigroup Algorithmic Problems in Metabelian Groups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {973-972}, doi = {10.1145/3618260.3649609}, year = {2024}, } Publisher's Version Article: stoc24main-p30-p (type: Full Paper) doi:10.1145/3618260.3649609
	Dong, Xiaoyu	STOC '24: "Optimal Embedding Dimension ..." Optimal Embedding Dimension for Sparse Subspace Embeddings Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong, and Mark Rudelson (University of Michigan, USA) @InProceedings{STOC24p1225, author = {Shabarish Chenakkod and Michał Dereziński and Xiaoyu Dong and Mark Rudelson}, title = {Optimal Embedding Dimension for Sparse Subspace Embeddings}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1225-1224}, doi = {10.1145/3618260.3649762}, year = {2024}, } Publisher's Version Article: stoc24main-p1115-p (type: Full Paper) doi:10.1145/3618260.3649762
	Döring, Simon	STOC '24: "Counting Small Induced Subgraphs ..." Counting Small Induced Subgraphs with Edge-Monotone Properties Simon Döring, Dániel Marx, and Philip Wellnitz (MPI-INF, Germany; Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany; Saarland Informatics Campus, Saarbrücken, Germany; CISPA Helmholtz Center for Information Security, Germany) @InProceedings{STOC24p1693, author = {Simon Döring and Dániel Marx and Philip Wellnitz}, title = {Counting Small Induced Subgraphs with Edge-Monotone Properties}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1693-1692}, doi = {10.1145/3618260.3649644}, year = {2024}, } Publisher's Version Article: stoc24main-p162-p (type: Full Paper) doi:10.1145/3618260.3649644
	Doron, Dean	STOC '24: "Opening Up the Distinguisher: ..." Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL Dean Doron, Edward Pyne, and Roei Tell (Ben-Gurion University of the Negev, Israel; Massachusetts Institute of Technology, USA; University of Toronto, Canada) @InProceedings{STOC24p2269, author = {Dean Doron and Edward Pyne and Roei Tell}, title = {Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2269-2268}, doi = {10.1145/3618260.3649772}, year = {2024}, } Publisher's Version Article: stoc24main-p1312-p (type: Full Paper) doi:10.1145/3618260.3649772
	D'Orsi, Tommaso	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Dreier, Jan	STOC '24: "Flip-Breakability: A Combinatorial ..." Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes Jan Dreier, Nikolas Mählmann, and Szymon Toruńczyk (TU Wien, Austria; University of Bremen, Bremen, Germany; University of Warsaw, Poland) @InProceedings{STOC24p1729, author = {Jan Dreier and Nikolas Mählmann and Szymon Toruńczyk}, title = {Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1729-1728}, doi = {10.1145/3618260.3649739}, year = {2024}, } Publisher's Version Article: stoc24main-p867-p (type: Full Paper) doi:10.1145/3618260.3649739
	Dughmi, Shaddin	STOC '24: "Limitations of Stochastic ..." Limitations of Stochastic Selection Problems with Pairwise Independent Priors Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel (University of Southern California, USA) @InProceedings{STOC24p541, author = {Shaddin Dughmi and Yusuf Hakan Kalayci and Neel Patel}, title = {Limitations of Stochastic Selection Problems with Pairwise Independent Priors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {541-540}, doi = {10.1145/3618260.3649718}, year = {2024}, } Publisher's Version Article: stoc24main-p655-p (type: Full Paper) doi:10.1145/3618260.3649718
	Dwivedi, Prateek	STOC '24: "Learning the Coefficients: ..." Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring C. S. Bhargav, Prateek Dwivedi, and Nitin Saxena (IIT Kanpur, India) @InProceedings{STOC24p157, author = {C. S. Bhargav and Prateek Dwivedi and Nitin Saxena}, title = {Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {157-156}, doi = {10.1145/3618260.3649743}, year = {2024}, } Publisher's Version Article: stoc24main-p922-p (type: Full Paper) doi:10.1145/3618260.3649743
	Dwork, Cynthia	STOC '24: "Complexity-Theoretic Implications ..." Complexity-Theoretic Implications of Multicalibration Sílvia Casacuberta, Cynthia Dwork, and Salil Vadhan (University of Oxford, United Kingdom; Harvard University, USA) @InProceedings{STOC24p1189, author = {Sílvia Casacuberta and Cynthia Dwork and Salil Vadhan}, title = {Complexity-Theoretic Implications of Multicalibration}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1189-1188}, doi = {10.1145/3618260.3649748}, year = {2024}, } Publisher's Version Article: stoc24main-p982-p (type: Full Paper) doi:10.1145/3618260.3649748
	Efremenko, Klim	STOC '24: "Lower Bounds for Regular Resolution ..." Lower Bounds for Regular Resolution over Parities Klim Efremenko, Michal Garlík, and Dmitry Itsykson (Ben-Gurion University of the Negev, Israel; Imperial College London, United Kingdom) @InProceedings{STOC24p709, author = {Klim Efremenko and Michal Garlík and Dmitry Itsykson}, title = {Lower Bounds for Regular Resolution over Parities}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {709-708}, doi = {10.1145/3618260.3649652}, year = {2024}, } Publisher's Version Article: stoc24main-p197-p (type: Full Paper) doi:10.1145/3618260.3649652
	Ekbatani, Farbod	STOC '24: "Prophet Inequalities with ..." Prophet Inequalities with Cancellation Costs Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, and Jan Vondrák (University of Chicago, USA; Stanford University, USA) @InProceedings{STOC24p1381, author = {Farbod Ekbatani and Rad Niazadeh and Pranav Nuti and Jan Vondrák}, title = {Prophet Inequalities with Cancellation Costs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1381-1380}, doi = {10.1145/3618260.3649786}, year = {2024}, } Publisher's Version Article: stoc24main-p1593-p (type: Full Paper) doi:10.1145/3618260.3649786
	Ellis, David	STOC '24: "Product Mixing in Compact ..." Product Mixing in Compact Lie Groups David Ellis, Guy Kindler, Noam Lifshitz, and Dor Minzer (University of Bristol, United Kingdom; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1573, author = {David Ellis and Guy Kindler and Noam Lifshitz and Dor Minzer}, title = {Product Mixing in Compact Lie Groups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1573-1572}, doi = {10.1145/3618260.3649626}, year = {2024}, } Publisher's Version Article: stoc24main-p91-p (type: Full Paper) doi:10.1145/3618260.3649626
	Esfandiari, Hossein	STOC '24: "Optimal Communication Bounds ..." Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, and Peilin Zhong (Google, United Kingdom; Carnegie Mellon University, USA; Google Research, USA) @InProceedings{STOC24p2125, author = {Hossein Esfandiari and Praneeth Kacham and Vahab Mirrokni and David P. Woodruff and Peilin Zhong}, title = {Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2125-2124}, doi = {10.1145/3618260.3649742}, year = {2024}, } Publisher's Version Article: stoc24main-p901-p (type: Full Paper) doi:10.1145/3618260.3649742
	Evert, Eric	STOC '24: "New Tools for Smoothed Analysis: ..." New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, and Aravindan Vijayaraghavan (University of Utah, USA; Northwestern University, USA) @InProceedings{STOC24p433, author = {Aditya Bhaskara and Eric Evert and Vaidehi Srinivas and Aravindan Vijayaraghavan}, title = {New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {433-432}, doi = {10.1145/3618260.3649765}, year = {2024}, } Publisher's Version Article: stoc24main-p1150-p (type: Full Paper) doi:10.1145/3618260.3649765
	Fallahpour, Pouria	STOC '24: "Quantum Oblivious LWE Sampling ..." Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs Thomas Debris-Alazard, Pouria Fallahpour, and Damien Stehlé (Inria - Laboratoire LIX - École Polytechnique, France; ENS Lyon - LIP, France; CryptoLab, France) @InProceedings{STOC24p481, author = {Thomas Debris-Alazard and Pouria Fallahpour and Damien Stehlé}, title = {Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {481-480}, doi = {10.1145/3618260.3649766}, year = {2024}, } Publisher's Version Article: stoc24main-p1194-p (type: Full Paper) doi:10.1145/3618260.3649766
	Fang, Yuting	STOC '24: "No Complete Problem for Constant-Cost ..." No Complete Problem for Constant-Cost Randomized Communication Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, and Pooya Hatami (Ohio State University, USA; Hebrew University of Jerusalem, Israel; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1429, author = {Yuting Fang and Lianna Hambardzumyan and Nathaniel Harms and Pooya Hatami}, title = {No Complete Problem for Constant-Cost Randomized Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1429-1428}, doi = {10.1145/3618260.3649716}, year = {2024}, } Publisher's Version Article: stoc24main-p637-p (type: Full Paper) doi:10.1145/3618260.3649716
	Fearnley, John	STOC '24: "The Complexity of Computing ..." The Complexity of Computing KKT Solutions of Quadratic Programs John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani (University of Liverpool, United Kingdom; University of Oxford, United Kingdom; Alan Turing Institute, United Kingdom) @InProceedings{STOC24p985, author = {John Fearnley and Paul W. Goldberg and Alexandros Hollender and Rahul Savani}, title = {The Complexity of Computing KKT Solutions of Quadratic Programs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {985-984}, doi = {10.1145/3618260.3649647}, year = {2024}, } Publisher's Version Article: stoc24main-p170-p (type: Full Paper) doi:10.1145/3618260.3649647
	Fei, Yumou	STOC '24: "Distribution-Free Testing ..." Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries Xi Chen, Yumou Fei, and Shyamal Patel (Columbia University, USA; Peking University, China) @InProceedings{STOC24p1165, author = {Xi Chen and Yumou Fei and Shyamal Patel}, title = {Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1165-1164}, doi = {10.1145/3618260.3649717}, year = {2024}, } Publisher's Version Article: stoc24main-p650-p (type: Full Paper) doi:10.1145/3618260.3649717
	Feldman, Michal	STOC '24: "Fair Division via Quantile ..." Fair Division via Quantile Shares Yakov Babichenko, Michal Feldman, Ron Holzman, and Vishnu V. Narayan (Technion, Israel; Tel Aviv University, Israel) @InProceedings{STOC24p1369, author = {Yakov Babichenko and Michal Feldman and Ron Holzman and Vishnu V. Narayan}, title = {Fair Division via Quantile Shares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1369-1368}, doi = {10.1145/3618260.3649728}, year = {2024}, } Publisher's Version Article: stoc24main-p764-p (type: Full Paper) doi:10.1145/3618260.3649728 STOC '24: "Algorithmic Contract Design ..." Algorithmic Contract Design (Keynote) Michal Feldman (Tel Aviv University, Israel) @InProceedings{STOC24p13, author = {Michal Feldman}, title = {Algorithmic Contract Design (Keynote)}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {13-12}, doi = {10.1145/3618260.3664273}, year = {2024}, } Publisher's Version Article: stoc24main-key3-p (type: Invited Talk) doi:10.1145/3618260.3664273
	Feldman, Moran	STOC '24: "Constrained Submodular Maximization ..." Constrained Submodular Maximization via New Bounds for DR-Submodular Functions Niv Buchbinder and Moran Feldman (Tel Aviv University, Israel; University of Haifa, Israel) @InProceedings{STOC24p2029, author = {Niv Buchbinder and Moran Feldman}, title = {Constrained Submodular Maximization via New Bounds for DR-Submodular Functions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2029-2028}, doi = {10.1145/3618260.3649630}, year = {2024}, } Publisher's Version Article: stoc24main-p113-p (type: Full Paper) doi:10.1145/3618260.3649630
	Feng, Yiding	STOC '24: "Strategic Budget Selection ..." Strategic Budget Selection in a Competitive Autobidding World Yiding Feng, Brendan Lucier, and Aleksandrs Slivkins (University of Chicago, USA; Microsoft Research, USA) @InProceedings{STOC24p253, author = {Yiding Feng and Brendan Lucier and Aleksandrs Slivkins}, title = {Strategic Budget Selection in a Competitive Autobidding World}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {253-252}, doi = {10.1145/3618260.3649688}, year = {2024}, } Publisher's Version Article: stoc24main-p425-p (type: Full Paper) doi:10.1145/3618260.3649688
	Filos-Ratsikas, Aris	STOC '24: "PPAD-Membership for Problems ..." PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, and Alexandros Hollender (University of Edinburgh, United Kingdom; Aarhus University, Aarhus, Denmark; University of Oxford, United Kingdom) @InProceedings{STOC24p1333, author = {Aris Filos-Ratsikas and Kristoffer Arnsfelt Hansen and Kasper Høgh and Alexandros Hollender}, title = {PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1333-1332}, doi = {10.1145/3618260.3649645}, year = {2024}, } Publisher's Version Article: stoc24main-p166-p (type: Full Paper) doi:10.1145/3618260.3649645
	Fineman, Jeremy T.	STOC '24: "Single-Source Shortest Paths ..." Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛8/9) Time Jeremy T. Fineman (Georgetown University, USA) @InProceedings{STOC24p25, author = {Jeremy T. Fineman}, title = {Single-Source Shortest Paths with Negative Real Weights in <i>Õ(𝑚𝑛<sup>8/9</sup>)</i> Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {25-24}, doi = {10.1145/3618260.3649614}, year = {2024}, } Publisher's Version Article: stoc24main-p49-p (type: Full Paper) doi:10.1145/3618260.3649614
	Firanko, Raz	STOC '24: "An Area Law for the Maximally-Mixed ..." An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP Itai Arad, Raz Firanko, and Rahul Jain (Centre for Quantum Technologies, Singapore; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p1453, author = {Itai Arad and Raz Firanko and Rahul Jain}, title = {An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1453-1452}, doi = {10.1145/3618260.3649612}, year = {2024}, } Publisher's Version Article: stoc24main-p47-p (type: Full Paper) doi:10.1145/3618260.3649612
	First, Uriya A.	STOC '24: "Cosystolic Expansion of Sheaves ..." Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes Uriya A. First and Tali Kaufman (University of Haifa, Israel; Bar-Ilan University, Israel) @InProceedings{STOC24p1609, author = {Uriya A. First and Tali Kaufman}, title = {Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1609-1608}, doi = {10.1145/3618260.3649625}, year = {2024}, } Publisher's Version Article: stoc24main-p83-p (type: Full Paper) doi:10.1145/3618260.3649625
	Fischer, Nick	STOC '24: "New Graph Decompositions and ..." New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka (Weizmann Institute of Science, Israel; University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1033, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1033-1032}, doi = {10.1145/3618260.3649696}, year = {2024}, } Publisher's Version Article: stoc24main-p481-p (type: Full Paper) doi:10.1145/3618260.3649696
	Fishelson, Maxwell	STOC '24: "From External to Swap Regret ..." From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich (University of California at Berkeley, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1345, author = {Yuval Dagan and Constantinos Daskalakis and Maxwell Fishelson and Noah Golowich}, title = {From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1345-1344}, doi = {10.1145/3618260.3649681}, year = {2024}, } Publisher's Version Article: stoc24main-p389-p (type: Full Paper) doi:10.1145/3618260.3649681
	Fleming, Noah	STOC '24: "Black-Box PPP Is Not Turing-Closed ..." Black-Box PPP Is Not Turing-Closed Noah Fleming, Stefan Grosser, Toniann Pitassi, and Robert Robere (Memorial University of Newfoundland, Canada; McGill University, Canada; Columbia University, USA) @InProceedings{STOC24p1561, author = {Noah Fleming and Stefan Grosser and Toniann Pitassi and Robert Robere}, title = {Black-Box PPP Is Not Turing-Closed}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1561-1560}, doi = {10.1145/3618260.3649769}, year = {2024}, } Publisher's Version Article: stoc24main-p1259-p (type: Full Paper) doi:10.1145/3618260.3649769
	Fournier, Hervé	STOC '24: "On the Power of Homogeneous ..." On the Power of Homogeneous Algebraic Formulas Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas (Université Paris Cité - IMJ-PRG, France; IT University of Copenhagen, Copenhagen, Denmark; University of Copenhagen, Copenhagen, Denmark; Université Savoie Mont Blanc - CNRS - LAMA, France) @InProceedings{STOC24p169, author = {Hervé Fournier and Nutan Limaye and Srikanth Srinivasan and Sébastien Tavenas}, title = {On the Power of Homogeneous Algebraic Formulas}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {169-168}, doi = {10.1145/3618260.3649760}, year = {2024}, } Publisher's Version Article: stoc24main-p1106-p (type: Full Paper) doi:10.1145/3618260.3649760
	Fusco, Federico	STOC '24: "The Role of Transparency in ..." The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi (University of Milan, Italy; Politecnico di Milano, Italy; University of Ottawa, Canada; Italian Institute of Technology, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p265, author = {Nicolo Cesa-Bianchi and Tommaso Cesari and Roberto Colomboni and Federico Fusco and Stefano Leonardi}, title = {The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {265-264}, doi = {10.1145/3618260.3649658}, year = {2024}, } Publisher's Version Article: stoc24main-p255-p (type: Full Paper) doi:10.1145/3618260.3649658 STOC '24: "No-Regret Learning in Bilateral ..." No-Regret Learning in Bilateral Trade via Global Budget Balance Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco (Bocconi University, Italy; Politecnico di Milano, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p289, author = {Martino Bernasconi and Matteo Castiglioni and Andrea Celli and Federico Fusco}, title = {No-Regret Learning in Bilateral Trade via Global Budget Balance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {289-288}, doi = {10.1145/3618260.3649653}, year = {2024}, } Publisher's Version Article: stoc24main-p212-p (type: Full Paper) doi:10.1145/3618260.3649653
	Gaitonde, Jason	STOC '24: "A Unified Approach to Learning ..." A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width Jason Gaitonde and Elchanan Mossel (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p565, author = {Jason Gaitonde and Elchanan Mossel}, title = {A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {565-564}, doi = {10.1145/3618260.3649674}, year = {2024}, } Publisher's Version Article: stoc24main-p346-p (type: Full Paper) doi:10.1145/3618260.3649674
	Gajjala, Rishikesh	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Gao, Ruiquan	STOC '24: "Parallel Sampling via Counting ..." Parallel Sampling via Counting Nima Anari, Ruiquan Gao, and Aviad Rubinstein (Stanford University, USA) @InProceedings{STOC24p601, author = {Nima Anari and Ruiquan Gao and Aviad Rubinstein}, title = {Parallel Sampling via Counting}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {601-600}, doi = {10.1145/3618260.3649744}, year = {2024}, } Publisher's Version Article: stoc24main-p931-p (type: Full Paper) doi:10.1145/3618260.3649744
	Garg, Sumegha	STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672
	Garlík, Michal	STOC '24: "Lower Bounds for Regular Resolution ..." Lower Bounds for Regular Resolution over Parities Klim Efremenko, Michal Garlík, and Dmitry Itsykson (Ben-Gurion University of the Negev, Israel; Imperial College London, United Kingdom) @InProceedings{STOC24p709, author = {Klim Efremenko and Michal Garlík and Dmitry Itsykson}, title = {Lower Bounds for Regular Resolution over Parities}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {709-708}, doi = {10.1145/3618260.3649652}, year = {2024}, } Publisher's Version Article: stoc24main-p197-p (type: Full Paper) doi:10.1145/3618260.3649652
	Gartland, Peter	STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Gelles, Yuval	STOC '24: "Optimal Load-Balanced Scalable ..." Optimal Load-Balanced Scalable Distributed Agreement Yuval Gelles and Ilan Komargodski (Hebrew University of Jerusalem, Israel; NTT Research, USA) @InProceedings{STOC24p469, author = {Yuval Gelles and Ilan Komargodski}, title = {Optimal Load-Balanced Scalable Distributed Agreement}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {469-468}, doi = {10.1145/3618260.3649736}, year = {2024}, } Publisher's Version Article: stoc24main-p827-p (type: Full Paper) doi:10.1145/3618260.3649736
	Ghadiri, Mehrdad	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787
	Ghaffari, Mohsen	STOC '24: "Dynamic O(Arboricity) Coloring ..." Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time Mohsen Ghaffari and Christoph Grunau (Massachusetts Institute of Technology, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p1309, author = {Mohsen Ghaffari and Christoph Grunau}, title = {Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1309-1308}, doi = {10.1145/3618260.3649782}, year = {2024}, } Publisher's Version Article: stoc24main-p1517-p (type: Full Paper) doi:10.1145/3618260.3649782 STOC '24: "Lenzen’s Distributed Routing ..." Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability Mohsen Ghaffari and Brandon Wang (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p2089, author = {Mohsen Ghaffari and Brandon Wang}, title = {Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2089-2088}, doi = {10.1145/3618260.3649627}, year = {2024}, } Publisher's Version Article: stoc24main-p92-p (type: Full Paper) doi:10.1145/3618260.3649627 STOC '24: "Work-Efficient Parallel Derandomization ..." Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping Mohsen Ghaffari and Christoph Grunau (Massachusetts Institute of Technology, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p2101, author = {Mohsen Ghaffari and Christoph Grunau}, title = {Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2101-2100}, doi = {10.1145/3618260.3649668}, year = {2024}, } Publisher's Version Article: stoc24main-p315-p (type: Full Paper) doi:10.1145/3618260.3649668
	Gheorghiu, Alexandru	STOC '24: "Nonlocality under Computational ..." Nonlocality under Computational Assumptions Grzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, and Marc-Olivier Renou (EPFL, Lausanne, Switzerland; Aztec Labs, United Kingdom; Chalmers University of Technology, Sweden; Inria - Université Paris-Saclay - CPHT - École Polytechnique - Institut Polytechnique de Paris, France) @InProceedings{STOC24p1129, author = {Grzegorz Gluch and Khashayar Barooti and Alexandru Gheorghiu and Marc-Olivier Renou}, title = {Nonlocality under Computational Assumptions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1129-1128}, doi = {10.1145/3618260.3649750}, year = {2024}, } Publisher's Version Article: stoc24main-p1004-p (type: Full Paper) doi:10.1145/3618260.3649750
	Gholami, Iman	STOC '24: "Prize-Collecting Steiner Tree: ..." Prize-Collecting Steiner Tree: A 1.79 Approximation Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi (University of Maryland, USA) @InProceedings{STOC24p1825, author = {Ali Ahmadi and Iman Gholami and MohammadTaghi Hajiaghayi and Peyman Jabbarzade and Mohammad Mahdavi}, title = {Prize-Collecting Steiner Tree: A 1.79 Approximation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1825-1824}, doi = {10.1145/3618260.3649789}, year = {2024}, } Publisher's Version Article: stoc24main-p1622-p (type: Full Paper) doi:10.1145/3618260.3649789
	Giannopoulou, Archontia C.	STOC '24: "A Flat Wall Theorem for Matching ..." A Flat Wall Theorem for Matching Minors in Bipartite Graphs Archontia C. Giannopoulou and Sebastian Wiederrecht (National and Kapodistrian University of Athens, Athens, Greece; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p793, author = {Archontia C. Giannopoulou and Sebastian Wiederrecht}, title = {A Flat Wall Theorem for Matching Minors in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {793-792}, doi = {10.1145/3618260.3649774}, year = {2024}, } Publisher's Version Article: stoc24main-p1351-p (type: Full Paper) doi:10.1145/3618260.3649774
	Girish, Uma	STOC '24: "The Power of Adaptivity in ..." The Power of Adaptivity in Quantum Query Algorithms Uma Girish, Makrand Sinha, Avishay Tal, and Kewen Wu (Princeton University, USA; University of Illinois at Urbana-Champaign, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1657, author = {Uma Girish and Makrand Sinha and Avishay Tal and Kewen Wu}, title = {The Power of Adaptivity in Quantum Query Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1657-1656}, doi = {10.1145/3618260.3649621}, year = {2024}, } Publisher's Version Article: stoc24main-p66-p (type: Full Paper) doi:10.1145/3618260.3649621
	Gluch, Grzegorz	STOC '24: "Nonlocality under Computational ..." Nonlocality under Computational Assumptions Grzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, and Marc-Olivier Renou (EPFL, Lausanne, Switzerland; Aztec Labs, United Kingdom; Chalmers University of Technology, Sweden; Inria - Université Paris-Saclay - CPHT - École Polytechnique - Institut Polytechnique de Paris, France) @InProceedings{STOC24p1129, author = {Grzegorz Gluch and Khashayar Barooti and Alexandru Gheorghiu and Marc-Olivier Renou}, title = {Nonlocality under Computational Assumptions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1129-1128}, doi = {10.1145/3618260.3649750}, year = {2024}, } Publisher's Version Article: stoc24main-p1004-p (type: Full Paper) doi:10.1145/3618260.3649750
	Goldberg, Paul W.	STOC '24: "The Complexity of Computing ..." The Complexity of Computing KKT Solutions of Quadratic Programs John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani (University of Liverpool, United Kingdom; University of Oxford, United Kingdom; Alan Turing Institute, United Kingdom) @InProceedings{STOC24p985, author = {John Fearnley and Paul W. Goldberg and Alexandros Hollender and Rahul Savani}, title = {The Complexity of Computing KKT Solutions of Quadratic Programs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {985-984}, doi = {10.1145/3618260.3649647}, year = {2024}, } Publisher's Version Article: stoc24main-p170-p (type: Full Paper) doi:10.1145/3618260.3649647
	Golowich, Louis	STOC '24: "Approaching the Quantum Singleton ..." Approaching the Quantum Singleton Bound with Approximate Error Correction Thiago Bergamaschi, Louis Golowich, and Sam Gunn (University of California at Berkeley, USA) @InProceedings{STOC24p1681, author = {Thiago Bergamaschi and Louis Golowich and Sam Gunn}, title = {Approaching the Quantum Singleton Bound with Approximate Error Correction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1681-1680}, doi = {10.1145/3618260.3649680}, year = {2024}, } Publisher's Version Article: stoc24main-p387-p (type: Full Paper) doi:10.1145/3618260.3649680
	Golowich, Noah	STOC '24: "From External to Swap Regret ..." From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich (University of California at Berkeley, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1345, author = {Yuval Dagan and Constantinos Daskalakis and Maxwell Fishelson and Noah Golowich}, title = {From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1345-1344}, doi = {10.1145/3618260.3649681}, year = {2024}, } Publisher's Version Article: stoc24main-p389-p (type: Full Paper) doi:10.1145/3618260.3649681 STOC '24: "Exploring and Learning in ..." Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles Noah Golowich, Ankur Moitra, and Dhruv Rohatgi (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p217, author = {Noah Golowich and Ankur Moitra and Dhruv Rohatgi}, title = {Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {217-216}, doi = {10.1145/3618260.3649710}, year = {2024}, } Publisher's Version Article: stoc24main-p579-p (type: Full Paper) doi:10.1145/3618260.3649710
	Gonczarowski, Yannai A.	STOC '24: "Structural Complexities of ..." Structural Complexities of Matching Mechanisms Yannai A. Gonczarowski and Clayton Thomas (Harvard University, USA; Microsoft Research, USA) @InProceedings{STOC24p517, author = {Yannai A. Gonczarowski and Clayton Thomas}, title = {Structural Complexities of Matching Mechanisms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {517-516}, doi = {10.1145/3618260.3649737}, year = {2024}, } Publisher's Version Article: stoc24main-p828-p (type: Full Paper) doi:10.1145/3618260.3649737
	Göös, Mika	STOC '24: "Hardness Condensation by Restriction ..." Hardness Condensation by Restriction Mika Göös, Ilan Newman, Artur Riazanov, and Dmitry Sokolov (EPFL, Lausanne, Switzerland; University of Haifa, Israel) @InProceedings{STOC24p2245, author = {Mika Göös and Ilan Newman and Artur Riazanov and Dmitry Sokolov}, title = {Hardness Condensation by Restriction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2245-2244}, doi = {10.1145/3618260.3649711}, year = {2024}, } Publisher's Version Article: stoc24main-p586-p (type: Full Paper) doi:10.1145/3618260.3649711
	Gopi, Sivakanth	STOC '24: "Generalized GM-MDS: Polynomial ..." Generalized GM-MDS: Polynomial Codes Are Higher Order MDS Joshua Brakensiek, Manik Dhar, and Sivakanth Gopi (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA) @InProceedings{STOC24p805, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi}, title = {Generalized GM-MDS: Polynomial Codes Are Higher Order MDS}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {805-804}, doi = {10.1145/3618260.3649637}, year = {2024}, } Publisher's Version Article: stoc24main-p135-p (type: Full Paper) doi:10.1145/3618260.3649637 STOC '24: "AG Codes Achieve List Decoding ..." AG Codes Achieve List Decoding Capacity over Constant-Sized Fields Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, and Zihan Zhang (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA; Ohio State University, USA) @InProceedings{STOC24p817, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi and Zihan Zhang}, title = {AG Codes Achieve List Decoding Capacity over Constant-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {817-816}, doi = {10.1145/3618260.3649651}, year = {2024}, } Publisher's Version Article: stoc24main-p193-p (type: Full Paper) doi:10.1145/3618260.3649651
	Gorsky, Maximilian	STOC '24: "Packing Even Directed Circuits ..." Packing Even Directed Circuits Quarter-Integrally Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p769, author = {Maximilian Gorsky and Ken-ichi Kawarabayashi and Stephan Kreutzer and Sebastian Wiederrecht}, title = {Packing Even Directed Circuits Quarter-Integrally}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {769-768}, doi = {10.1145/3618260.3649682}, year = {2024}, } Publisher's Version Article: stoc24main-p391-p (type: Full Paper) doi:10.1145/3618260.3649682
	Gosset, David	STOC '24: "Classical Simulation of Peaked ..." Classical Simulation of Peaked Shallow Quantum Circuits Sergey Bravyi, David Gosset, and Yinchen Liu (IBM Research, USA; University of Waterloo, Canada; Institute for Quantum Computing, Canada; Perimeter Institute for Theoretical Physics, Canada) @InProceedings{STOC24p625, author = {Sergey Bravyi and David Gosset and Yinchen Liu}, title = {Classical Simulation of Peaked Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {625-624}, doi = {10.1145/3618260.3649638}, year = {2024}, } Publisher's Version Article: stoc24main-p141-p (type: Full Paper) doi:10.1145/3618260.3649638
	Grewal, Sabee	STOC '24: "Improved Stabilizer Estimation ..." Improved Stabilizer Estimation via Bell Difference Sampling Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang (University of Texas at Austin, USA; Simons Institute for the Theory of Computing, Berkeley, USA; Rice University, USA) @InProceedings{STOC24p1501, author = {Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang}, title = {Improved Stabilizer Estimation via Bell Difference Sampling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1501-1500}, doi = {10.1145/3618260.3649738}, year = {2024}, } Publisher's Version Article: stoc24main-p845-p (type: Full Paper) doi:10.1145/3618260.3649738
	Grosser, Stefan	STOC '24: "Black-Box PPP Is Not Turing-Closed ..." Black-Box PPP Is Not Turing-Closed Noah Fleming, Stefan Grosser, Toniann Pitassi, and Robert Robere (Memorial University of Newfoundland, Canada; McGill University, Canada; Columbia University, USA) @InProceedings{STOC24p1561, author = {Noah Fleming and Stefan Grosser and Toniann Pitassi and Robert Robere}, title = {Black-Box PPP Is Not Turing-Closed}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1561-1560}, doi = {10.1145/3618260.3649769}, year = {2024}, } Publisher's Version Article: stoc24main-p1259-p (type: Full Paper) doi:10.1145/3618260.3649769
	Grunau, Christoph	STOC '24: "Dynamic O(Arboricity) Coloring ..." Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time Mohsen Ghaffari and Christoph Grunau (Massachusetts Institute of Technology, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p1309, author = {Mohsen Ghaffari and Christoph Grunau}, title = {Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1309-1308}, doi = {10.1145/3618260.3649782}, year = {2024}, } Publisher's Version Article: stoc24main-p1517-p (type: Full Paper) doi:10.1145/3618260.3649782 STOC '24: "Work-Efficient Parallel Derandomization ..." Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping Mohsen Ghaffari and Christoph Grunau (Massachusetts Institute of Technology, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p2101, author = {Mohsen Ghaffari and Christoph Grunau}, title = {Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2101-2100}, doi = {10.1145/3618260.3649668}, year = {2024}, } Publisher's Version Article: stoc24main-p315-p (type: Full Paper) doi:10.1145/3618260.3649668
	Gunn, Sam	STOC '24: "How to Use Quantum Indistinguishability ..." How to Use Quantum Indistinguishability Obfuscation Andrea Coladangelo and Sam Gunn (University of Washington, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1105, author = {Andrea Coladangelo and Sam Gunn}, title = {How to Use Quantum Indistinguishability Obfuscation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1105-1104}, doi = {10.1145/3618260.3649779}, year = {2024}, } Publisher's Version Article: stoc24main-p1449-p (type: Full Paper) doi:10.1145/3618260.3649779 STOC '24: "Approaching the Quantum Singleton ..." Approaching the Quantum Singleton Bound with Approximate Error Correction Thiago Bergamaschi, Louis Golowich, and Sam Gunn (University of California at Berkeley, USA) @InProceedings{STOC24p1681, author = {Thiago Bergamaschi and Louis Golowich and Sam Gunn}, title = {Approaching the Quantum Singleton Bound with Approximate Error Correction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1681-1680}, doi = {10.1145/3618260.3649680}, year = {2024}, } Publisher's Version Article: stoc24main-p387-p (type: Full Paper) doi:10.1145/3618260.3649680
	Guo, Siyao	STOC '24: "Tight Time-Space Tradeoffs ..." Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, and Yuping Ye (NYU Shanghai, China; East China Normal University, China) @InProceedings{STOC24p1933, author = { Akshima and Tyler Besselman and Siyao Guo and Zhiye Xie and Yuping Ye}, title = {Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1933-1932}, doi = {10.1145/3618260.3649752}, year = {2024}, } Publisher's Version Article: stoc24main-p1023-p (type: Full Paper) doi:10.1145/3618260.3649752
	Gupta, Manoj	STOC '24: "Nearly Optimal Fault Tolerant ..." Nearly Optimal Fault Tolerant Distance Oracle Dipan Dey and Manoj Gupta (IIT Gandhinagar, India) @InProceedings{STOC24p1045, author = {Dipan Dey and Manoj Gupta}, title = {Nearly Optimal Fault Tolerant Distance Oracle}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1045-1044}, doi = {10.1145/3618260.3649697}, year = {2024}, } Publisher's Version Article: stoc24main-p517-p (type: Full Paper) doi:10.1145/3618260.3649697
	Gupta, Meghal	STOC '24: "Constant Query Local Decoding ..." Constant Query Local Decoding against Deletions Is Impossible Meghal Gupta (University of California at Berkeley, USA) @InProceedings{STOC24p829, author = {Meghal Gupta}, title = {Constant Query Local Decoding against Deletions Is Impossible}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {829-828}, doi = {10.1145/3618260.3649655}, year = {2024}, } Publisher's Version Article: stoc24main-p227-p (type: Full Paper) doi:10.1145/3618260.3649655
	Gur, Tom	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784 STOC '24: "Perfect Zero-Knowledge PCPs ..." Perfect Zero-Knowledge PCPs for #P Tom Gur, Jack O'Connor, and Nicholas Spooner (University of Cambridge, United Kingdom; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1909, author = {Tom Gur and Jack O'Connor and Nicholas Spooner}, title = {Perfect Zero-Knowledge PCPs for #P}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1909-1908}, doi = {10.1145/3618260.3649698}, year = {2024}, } Publisher's Version Article: stoc24main-p520-p (type: Full Paper) doi:10.1145/3618260.3649698
	Guruswami, Venkatesan	STOC '24: "Randomly Punctured Reed–Solomon ..." Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields Omar Alrabiah, Venkatesan Guruswami, and Ray Li (University of California at Berkeley, USA; Santa Clara University, USA) @InProceedings{STOC24p1621, author = {Omar Alrabiah and Venkatesan Guruswami and Ray Li}, title = {Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1621-1620}, doi = {10.1145/3618260.3649634}, year = {2024}, } Publisher's Version Article: stoc24main-p130-p (type: Full Paper) doi:10.1145/3618260.3649634 STOC '24: "Parameterized Inapproximability ..." Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, and Kewen Wu (University of California at Berkeley, USA; Nanjing University, China; Peking University, China) @InProceedings{STOC24p49, author = {Venkatesan Guruswami and Bingkai Lin and Xuandi Ren and Yican Sun and Kewen Wu}, title = {Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {49-48}, doi = {10.1145/3618260.3649771}, year = {2024}, } Publisher's Version Article: stoc24main-p1264-p (type: Full Paper) doi:10.1145/3618260.3649771
	Haeupler, Bernhard	STOC '24: "Polylog-Competitive Deterministic ..." Polylog-Competitive Deterministic Local Routing and Scheduling Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Columbia University, USA; Google Research, Switzerland) @InProceedings{STOC24p889, author = {Bernhard Haeupler and Shyamal Patel and Antti Roeyskoe and Cliff Stein and Goran Zuzic}, title = {Polylog-Competitive Deterministic Local Routing and Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {889-888}, doi = {10.1145/3618260.3649678}, year = {2024}, } Publisher's Version Article: stoc24main-p370-p (type: Full Paper) doi:10.1145/3618260.3649678 STOC '24: "Low-Step Multi-commodity Flow ..." Low-Step Multi-commodity Flow Emulators Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, and Thatchaphol Saranurak (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Brown University, USA; University of Michigan, USA) @InProceedings{STOC24p97, author = {Bernhard Haeupler and D. Ellis Hershkowitz and Jason Li and Antti Roeyskoe and Thatchaphol Saranurak}, title = {Low-Step Multi-commodity Flow Emulators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {97-96}, doi = {10.1145/3618260.3649689}, year = {2024}, } Publisher's Version Article: stoc24main-p429-p (type: Full Paper) doi:10.1145/3618260.3649689
	Hajiaghayi, MohammadTaghi	STOC '24: "Prize-Collecting Steiner Tree: ..." Prize-Collecting Steiner Tree: A 1.79 Approximation Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi (University of Maryland, USA) @InProceedings{STOC24p1825, author = {Ali Ahmadi and Iman Gholami and MohammadTaghi Hajiaghayi and Peyman Jabbarzade and Mohammad Mahdavi}, title = {Prize-Collecting Steiner Tree: A 1.79 Approximation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1825-1824}, doi = {10.1145/3618260.3649789}, year = {2024}, } Publisher's Version Article: stoc24main-p1622-p (type: Full Paper) doi:10.1145/3618260.3649789
	Hakoniemi, Tuomas	STOC '24: "Functional Lower Bounds in ..." Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Tuomas Hakoniemi, Nutan Limaye, and Iddo Tzameret (University of Helsinki, Helsinki, Finland; IT University of Copenhagen, Copenhagen, Denmark; Imperial College London, United Kingdom) @InProceedings{STOC24p1549, author = {Tuomas Hakoniemi and Nutan Limaye and Iddo Tzameret}, title = {Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1549-1548}, doi = {10.1145/3618260.3649616}, year = {2024}, } Publisher's Version Article: stoc24main-p57-p (type: Full Paper) doi:10.1145/3618260.3649616
	Hambardzumyan, Lianna	STOC '24: "No Complete Problem for Constant-Cost ..." No Complete Problem for Constant-Cost Randomized Communication Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, and Pooya Hatami (Ohio State University, USA; Hebrew University of Jerusalem, Israel; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1429, author = {Yuting Fang and Lianna Hambardzumyan and Nathaniel Harms and Pooya Hatami}, title = {No Complete Problem for Constant-Cost Randomized Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1429-1428}, doi = {10.1145/3618260.3649716}, year = {2024}, } Publisher's Version Article: stoc24main-p637-p (type: Full Paper) doi:10.1145/3618260.3649716
	Hansen, Kristoffer Arnsfelt	STOC '24: "PPAD-Membership for Problems ..." PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, and Alexandros Hollender (University of Edinburgh, United Kingdom; Aarhus University, Aarhus, Denmark; University of Oxford, United Kingdom) @InProceedings{STOC24p1333, author = {Aris Filos-Ratsikas and Kristoffer Arnsfelt Hansen and Kasper Høgh and Alexandros Hollender}, title = {PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1333-1332}, doi = {10.1145/3618260.3649645}, year = {2024}, } Publisher's Version Article: stoc24main-p166-p (type: Full Paper) doi:10.1145/3618260.3649645
	Harms, Nathaniel	STOC '24: "No Complete Problem for Constant-Cost ..." No Complete Problem for Constant-Cost Randomized Communication Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, and Pooya Hatami (Ohio State University, USA; Hebrew University of Jerusalem, Israel; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1429, author = {Yuting Fang and Lianna Hambardzumyan and Nathaniel Harms and Pooya Hatami}, title = {No Complete Problem for Constant-Cost Randomized Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1429-1428}, doi = {10.1145/3618260.3649716}, year = {2024}, } Publisher's Version Article: stoc24main-p637-p (type: Full Paper) doi:10.1145/3618260.3649716
	Harvey, Nicholas	STOC '24: "Explicit Orthogonal Arrays ..." Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters Nicholas Harvey and Arvin Sahami (University of British Columbia, Canada) @InProceedings{STOC24p1393, author = {Nicholas Harvey and Arvin Sahami}, title = {Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1393-1392}, doi = {10.1145/3618260.3649642}, year = {2024}, } Publisher's Version Article: stoc24main-p157-p (type: Full Paper) doi:10.1145/3618260.3649642
	Hatami, Pooya	STOC '24: "No Complete Problem for Constant-Cost ..." No Complete Problem for Constant-Cost Randomized Communication Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, and Pooya Hatami (Ohio State University, USA; Hebrew University of Jerusalem, Israel; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1429, author = {Yuting Fang and Lianna Hambardzumyan and Nathaniel Harms and Pooya Hatami}, title = {No Complete Problem for Constant-Cost Randomized Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1429-1428}, doi = {10.1145/3618260.3649716}, year = {2024}, } Publisher's Version Article: stoc24main-p637-p (type: Full Paper) doi:10.1145/3618260.3649716
	Hershkowitz, D. Ellis	STOC '24: "Ghost Value Augmentation for ..." Ghost Value Augmentation for k-Edge-Connectivity D. Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen (Brown University, USA; Institute for Advanced Study, Princeton, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p2065, author = {D. Ellis Hershkowitz and Nathan Klein and Rico Zenklusen}, title = {Ghost Value Augmentation for k-Edge-Connectivity}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2065-2064}, doi = {10.1145/3618260.3649715}, year = {2024}, } Publisher's Version Article: stoc24main-p621-p (type: Full Paper) doi:10.1145/3618260.3649715 STOC '24: "Low-Step Multi-commodity Flow ..." Low-Step Multi-commodity Flow Emulators Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, and Thatchaphol Saranurak (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Brown University, USA; University of Michigan, USA) @InProceedings{STOC24p97, author = {Bernhard Haeupler and D. Ellis Hershkowitz and Jason Li and Antti Roeyskoe and Thatchaphol Saranurak}, title = {Low-Step Multi-commodity Flow Emulators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {97-96}, doi = {10.1145/3618260.3649689}, year = {2024}, } Publisher's Version Article: stoc24main-p429-p (type: Full Paper) doi:10.1145/3618260.3649689
	Hirahara, Shuichi	STOC '24: "Probabilistically Checkable ..." Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems Shuichi Hirahara and Naoto Ohsaka (National Institute of Informatics, Tokyo, Japan; CyberAgent, Japan) @InProceedings{STOC24p1597, author = {Shuichi Hirahara and Naoto Ohsaka}, title = {Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1597-1596}, doi = {10.1145/3618260.3649667}, year = {2024}, } Publisher's Version Article: stoc24main-p311-p (type: Full Paper) doi:10.1145/3618260.3649667 STOC '24: "One-Way Functions and Zero ..." One-Way Functions and Zero Knowledge Shuichi Hirahara and Mikito Nanashima (National Institute of Informatics, Tokyo, Japan; Tokyo Institute of Technology, Tokyo, Japan) @InProceedings{STOC24p1921, author = {Shuichi Hirahara and Mikito Nanashima}, title = {One-Way Functions and Zero Knowledge}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1921-1920}, doi = {10.1145/3618260.3649701}, year = {2024}, } Publisher's Version Article: stoc24main-p553-p (type: Full Paper) doi:10.1145/3618260.3649701 STOC '24: "Symmetric Exponential Time ..." Symmetric Exponential Time Requires Near-Maximum Circuit Size Lijie Chen, Shuichi Hirahara, and Hanlin Ren (University of California at Berkeley, USA; National Institute of Informatics, Tokyo, Japan; University of Oxford, United Kingdom) @InProceedings{STOC24p2209, author = {Lijie Chen and Shuichi Hirahara and Hanlin Ren}, title = {Symmetric Exponential Time Requires Near-Maximum Circuit Size}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2209-2208}, doi = {10.1145/3618260.3649624}, year = {2024}, } Publisher's Version Article: stoc24main-p79-p (type: Full Paper) doi:10.1145/3618260.3649624 STOC '24: "Planted Clique Conjectures ..." Planted Clique Conjectures Are Equivalent Shuichi Hirahara and Nobutaka Shimizu (National Institute of Informatics, Tokyo, Japan; Tokyo Institute of Technology, Tokyo, Japan) @InProceedings{STOC24p409, author = {Shuichi Hirahara and Nobutaka Shimizu}, title = {Planted Clique Conjectures Are Equivalent}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {409-408}, doi = {10.1145/3618260.3649751}, year = {2024}, } Publisher's Version Article: stoc24main-p1010-p (type: Full Paper) doi:10.1145/3618260.3649751 STOC '24: "Beating Brute Force for Compression ..." Beating Brute Force for Compression Problems Shuichi Hirahara, Rahul Ilango, and R. Ryan Williams (National Institute of Informatics, Tokyo, Japan; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p733, author = {Shuichi Hirahara and Rahul Ilango and R. Ryan Williams}, title = {Beating Brute Force for Compression Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {733-732}, doi = {10.1145/3618260.3649778}, year = {2024}, } Publisher's Version Article: stoc24main-p1425-p (type: Full Paper) doi:10.1145/3618260.3649778
	Høgh, Kasper	STOC '24: "PPAD-Membership for Problems ..." PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, and Alexandros Hollender (University of Edinburgh, United Kingdom; Aarhus University, Aarhus, Denmark; University of Oxford, United Kingdom) @InProceedings{STOC24p1333, author = {Aris Filos-Ratsikas and Kristoffer Arnsfelt Hansen and Kasper Høgh and Alexandros Hollender}, title = {PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1333-1332}, doi = {10.1145/3618260.3649645}, year = {2024}, } Publisher's Version Article: stoc24main-p166-p (type: Full Paper) doi:10.1145/3618260.3649645
	Hollender, Alexandros	STOC '24: "PPAD-Membership for Problems ..." PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, and Alexandros Hollender (University of Edinburgh, United Kingdom; Aarhus University, Aarhus, Denmark; University of Oxford, United Kingdom) @InProceedings{STOC24p1333, author = {Aris Filos-Ratsikas and Kristoffer Arnsfelt Hansen and Kasper Høgh and Alexandros Hollender}, title = {PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1333-1332}, doi = {10.1145/3618260.3649645}, year = {2024}, } Publisher's Version Article: stoc24main-p166-p (type: Full Paper) doi:10.1145/3618260.3649645 STOC '24: "The Complexity of Computing ..." The Complexity of Computing KKT Solutions of Quadratic Programs John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani (University of Liverpool, United Kingdom; University of Oxford, United Kingdom; Alan Turing Institute, United Kingdom) @InProceedings{STOC24p985, author = {John Fearnley and Paul W. Goldberg and Alexandros Hollender and Rahul Savani}, title = {The Complexity of Computing KKT Solutions of Quadratic Programs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {985-984}, doi = {10.1145/3618260.3649647}, year = {2024}, } Publisher's Version Article: stoc24main-p170-p (type: Full Paper) doi:10.1145/3618260.3649647
	Holzman, Ron	STOC '24: "Fair Division via Quantile ..." Fair Division via Quantile Shares Yakov Babichenko, Michal Feldman, Ron Holzman, and Vishnu V. Narayan (Technion, Israel; Tel Aviv University, Israel) @InProceedings{STOC24p1369, author = {Yakov Babichenko and Michal Feldman and Ron Holzman and Vishnu V. Narayan}, title = {Fair Division via Quantile Shares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1369-1368}, doi = {10.1145/3618260.3649728}, year = {2024}, } Publisher's Version Article: stoc24main-p764-p (type: Full Paper) doi:10.1145/3618260.3649728
	Hsieh, Jun-Ting	STOC '24: "Explicit Two-Sided Unique-Neighbor ..." Explicit Two-Sided Unique-Neighbor Expanders Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes (Carnegie Mellon University, USA; Stanford University, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p865, author = {Jun-Ting Hsieh and Theo McKenzie and Sidhanth Mohanty and Pedro Paredes}, title = {Explicit Two-Sided Unique-Neighbor Expanders}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {865-864}, doi = {10.1145/3618260.3649705}, year = {2024}, } Publisher's Version Article: stoc24main-p566-p (type: Full Paper) doi:10.1145/3618260.3649705
	Hua, Yiding	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Huang, Hsin-Yuan	STOC '24: "Local Minima in Quantum Systems ..." Local Minima in Quantum Systems Chi-Fang Chen, Hsin-Yuan Huang, John Preskill, and Leo Zhou (California Institute of Technology, USA; AWS Center for Quantum Computing, USA; Google Quantum AI, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1465, author = {Chi-Fang Chen and Hsin-Yuan Huang and John Preskill and Leo Zhou}, title = {Local Minima in Quantum Systems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1465-1464}, doi = {10.1145/3618260.3649675}, year = {2024}, } Publisher's Version Article: stoc24main-p355-p (type: Full Paper) doi:10.1145/3618260.3649675 STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	Huang, Lingxiao	STOC '24: "On Optimal Coreset Construction ..." On Optimal Coreset Construction for Euclidean (k,z)-Clustering Lingxiao Huang, Jian Li, and Xuan Wu (Nanjing University, China; Tsinghua University, China) @InProceedings{STOC24p1777, author = {Lingxiao Huang and Jian Li and Xuan Wu}, title = {On Optimal Coreset Construction for Euclidean (k,z)-Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1777-1776}, doi = {10.1145/3618260.3649707}, year = {2024}, } Publisher's Version Article: stoc24main-p570-p (type: Full Paper) doi:10.1145/3618260.3649707
	Ilango, Rahul	STOC '24: "Beating Brute Force for Compression ..." Beating Brute Force for Compression Problems Shuichi Hirahara, Rahul Ilango, and R. Ryan Williams (National Institute of Informatics, Tokyo, Japan; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p733, author = {Shuichi Hirahara and Rahul Ilango and R. Ryan Williams}, title = {Beating Brute Force for Compression Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {733-732}, doi = {10.1145/3618260.3649778}, year = {2024}, } Publisher's Version Article: stoc24main-p1425-p (type: Full Paper) doi:10.1145/3618260.3649778
	Itsykson, Dmitry	STOC '24: "Lower Bounds for Regular Resolution ..." Lower Bounds for Regular Resolution over Parities Klim Efremenko, Michal Garlík, and Dmitry Itsykson (Ben-Gurion University of the Negev, Israel; Imperial College London, United Kingdom) @InProceedings{STOC24p709, author = {Klim Efremenko and Michal Garlík and Dmitry Itsykson}, title = {Lower Bounds for Regular Resolution over Parities}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {709-708}, doi = {10.1145/3618260.3649652}, year = {2024}, } Publisher's Version Article: stoc24main-p197-p (type: Full Paper) doi:10.1145/3618260.3649652
	Ivkov, Misha	STOC '24: "Semidefinite Programs Simulate ..." Semidefinite Programs Simulate Approximate Message Passing Robustly Misha Ivkov and Tselil Schramm (Stanford University, USA) @InProceedings{STOC24p397, author = {Misha Ivkov and Tselil Schramm}, title = {Semidefinite Programs Simulate Approximate Message Passing Robustly}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {397-396}, doi = {10.1145/3618260.3649713}, year = {2024}, } Publisher's Version Article: stoc24main-p602-p (type: Full Paper) doi:10.1145/3618260.3649713
	Iyer, Siddharth	STOC '24: "XOR Lemmas for Communication ..." XOR Lemmas for Communication via Marginal Information Siddharth Iyer and Anup Rao (University of Washington, USA) @InProceedings{STOC24p721, author = {Siddharth Iyer and Anup Rao}, title = {XOR Lemmas for Communication via Marginal Information}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {721-720}, doi = {10.1145/3618260.3649726}, year = {2024}, } Publisher's Version Article: stoc24main-p750-p (type: Full Paper) doi:10.1145/3618260.3649726
	Iyer, Vishnu	STOC '24: "Improved Stabilizer Estimation ..." Improved Stabilizer Estimation via Bell Difference Sampling Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang (University of Texas at Austin, USA; Simons Institute for the Theory of Computing, Berkeley, USA; Rice University, USA) @InProceedings{STOC24p1501, author = {Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang}, title = {Improved Stabilizer Estimation via Bell Difference Sampling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1501-1500}, doi = {10.1145/3618260.3649738}, year = {2024}, } Publisher's Version Article: stoc24main-p845-p (type: Full Paper) doi:10.1145/3618260.3649738
	Jabbarzade, Peyman	STOC '24: "Prize-Collecting Steiner Tree: ..." Prize-Collecting Steiner Tree: A 1.79 Approximation Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi (University of Maryland, USA) @InProceedings{STOC24p1825, author = {Ali Ahmadi and Iman Gholami and MohammadTaghi Hajiaghayi and Peyman Jabbarzade and Mohammad Mahdavi}, title = {Prize-Collecting Steiner Tree: A 1.79 Approximation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1825-1824}, doi = {10.1145/3618260.3649789}, year = {2024}, } Publisher's Version Article: stoc24main-p1622-p (type: Full Paper) doi:10.1145/3618260.3649789
	Jahanara, Mohammad Mahdi	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784
	Jain, Rahul	STOC '24: "An Area Law for the Maximally-Mixed ..." An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP Itai Arad, Raz Firanko, and Rahul Jain (Centre for Quantum Technologies, Singapore; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p1453, author = {Itai Arad and Raz Firanko and Rahul Jain}, title = {An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1453-1452}, doi = {10.1145/3618260.3649612}, year = {2024}, } Publisher's Version Article: stoc24main-p47-p (type: Full Paper) doi:10.1145/3618260.3649612
	Jambulapati, Arun	STOC '24: "Sparsifying Generalized Linear ..." Sparsifying Generalized Linear Models Arun Jambulapati, James R. Lee, Yang P. Liu, and Aaron Sidford (Simons Institute for the Theory of Computing, Berkeley, USA; University of Washington, USA; Institute for Advanced Study, Princeton, USA; Stanford University, USA) @InProceedings{STOC24p1849, author = {Arun Jambulapati and James R. Lee and Yang P. Liu and Aaron Sidford}, title = {Sparsifying Generalized Linear Models}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1849-1848}, doi = {10.1145/3618260.3649684}, year = {2024}, } Publisher's Version Article: stoc24main-p402-p (type: Full Paper) doi:10.1145/3618260.3649684
	Jayaram, Rajesh	STOC '24: "Data-Dependent LSH for the ..." Data-Dependent LSH for the Earth Mover’s Distance Rajesh Jayaram, Erik Waingarten, and Tian Zhang (Google Research, USA; University of Pennsylvania, USA) @InProceedings{STOC24p877, author = {Rajesh Jayaram and Erik Waingarten and Tian Zhang}, title = {Data-Dependent LSH for the Earth Mover’s Distance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {877-876}, doi = {10.1145/3618260.3649666}, year = {2024}, } Publisher's Version Article: stoc24main-p310-p (type: Full Paper) doi:10.1145/3618260.3649666
	Jin, Ce	STOC '24: "Shaving Logs via Large Sieve ..." Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More Ce Jin and Yinzhan Xu (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1753, author = {Ce Jin and Yinzhan Xu}, title = {Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1753-1752}, doi = {10.1145/3618260.3649605}, year = {2024}, } Publisher's Version Article: stoc24main-p15-p (type: Full Paper) doi:10.1145/3618260.3649605 STOC '24: "0-1 Knapsack in Nearly Quadratic ..." 0-1 Knapsack in Nearly Quadratic Time Ce Jin (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p313, author = {Ce Jin}, title = {0-1 Knapsack in Nearly Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {313-312}, doi = {10.1145/3618260.3649618}, year = {2024}, } Publisher's Version Article: stoc24main-p59-p (type: Full Paper) doi:10.1145/3618260.3649618
	Jin, Zhengzhong	STOC '24: "SNARGs under LWE via Propositional ..." SNARGs under LWE via Propositional Proofs Zhengzhong Jin, Yael Kalai, Alex Lombardi, and Vinod Vaikuntanathan (Northeastern University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p1945, author = {Zhengzhong Jin and Yael Kalai and Alex Lombardi and Vinod Vaikuntanathan}, title = {SNARGs under LWE via Propositional Proofs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1945-1944}, doi = {10.1145/3618260.3649770}, year = {2024}, } Publisher's Version Article: stoc24main-p1260-p (type: Full Paper) doi:10.1145/3618260.3649770
	Kacham, Praneeth	STOC '24: "Optimal Communication Bounds ..." Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, and Peilin Zhong (Google, United Kingdom; Carnegie Mellon University, USA; Google Research, USA) @InProceedings{STOC24p2125, author = {Hossein Esfandiari and Praneeth Kacham and Vahab Mirrokni and David P. Woodruff and Peilin Zhong}, title = {Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2125-2124}, doi = {10.1145/3618260.3649742}, year = {2024}, } Publisher's Version Article: stoc24main-p901-p (type: Full Paper) doi:10.1145/3618260.3649742
	Kalai, Adam Tauman	STOC '24: "Calibrated Language Models ..." Calibrated Language Models Must Hallucinate Adam Tauman Kalai and Santosh S. Vempala (Open AI, USA; Georgia Institute of Technology, USA) @InProceedings{STOC24p193, author = {Adam Tauman Kalai and Santosh S. Vempala}, title = {Calibrated Language Models Must Hallucinate}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {193-192}, doi = {10.1145/3618260.3649777}, year = {2024}, } Publisher's Version Article: stoc24main-p1400-p (type: Full Paper) doi:10.1145/3618260.3649777
	Kalai, Yael	STOC '24: "SNARGs under LWE via Propositional ..." SNARGs under LWE via Propositional Proofs Zhengzhong Jin, Yael Kalai, Alex Lombardi, and Vinod Vaikuntanathan (Northeastern University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p1945, author = {Zhengzhong Jin and Yael Kalai and Alex Lombardi and Vinod Vaikuntanathan}, title = {SNARGs under LWE via Propositional Proofs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1945-1944}, doi = {10.1145/3618260.3649770}, year = {2024}, } Publisher's Version Article: stoc24main-p1260-p (type: Full Paper) doi:10.1145/3618260.3649770
	Kalayci, Yusuf Hakan	STOC '24: "Limitations of Stochastic ..." Limitations of Stochastic Selection Problems with Pairwise Independent Priors Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel (University of Southern California, USA) @InProceedings{STOC24p541, author = {Shaddin Dughmi and Yusuf Hakan Kalayci and Neel Patel}, title = {Limitations of Stochastic Selection Problems with Pairwise Independent Priors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {541-540}, doi = {10.1145/3618260.3649718}, year = {2024}, } Publisher's Version Article: stoc24main-p655-p (type: Full Paper) doi:10.1145/3618260.3649718
	Kallaugher, John	STOC '24: "Exponential Quantum Space ..." Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model John Kallaugher, Ojas Parekh, and Nadezhda Voronova (Sandia National Laboratories, USA; Boston University, USA) @InProceedings{STOC24p2005, author = {John Kallaugher and Ojas Parekh and Nadezhda Voronova}, title = {Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2005-2004}, doi = {10.1145/3618260.3649709}, year = {2024}, } Publisher's Version Article: stoc24main-p577-p (type: Full Paper) doi:10.1145/3618260.3649709
	Kamath, Chethan	STOC '24: "Batch Proofs Are Statistically ..." Batch Proofs Are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan (Tel Aviv University, Israel; IIT Bombay, India; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p493, author = {Nir Bitansky and Chethan Kamath and Omer Paneth and Ron D. Rothblum and Prashant Nalini Vasudevan}, title = {Batch Proofs Are Statistically Hiding}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {493-492}, doi = {10.1145/3618260.3649775}, year = {2024}, } Publisher's Version Article: stoc24main-p1365-p (type: Full Paper) doi:10.1145/3618260.3649775
	Kane, Daniel M.	STOC '24: "Locality Bounds for Sampling ..." Locality Bounds for Sampling Hamming Slices Daniel M. Kane, Anthony Ostuni, and Kewen Wu (University of California at San Diego, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1417, author = {Daniel M. Kane and Anthony Ostuni and Kewen Wu}, title = {Locality Bounds for Sampling Hamming Slices}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1417-1416}, doi = {10.1145/3618260.3649670}, year = {2024}, } Publisher's Version Article: stoc24main-p320-p (type: Full Paper) doi:10.1145/3618260.3649670 STOC '24: "Super Non-singular Decompositions ..." Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, and Nikos Zarifis (University of Wisconsin-Madison, USA; University of California at San Diego, USA; University of Texas at Austin, USA) @InProceedings{STOC24p181, author = {Ilias Diakonikolas and Daniel M. Kane and Vasilis Kontonis and Sihan Liu and Nikos Zarifis}, title = {Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {181-180}, doi = {10.1145/3618260.3649776}, year = {2024}, } Publisher's Version Article: stoc24main-p1369-p (type: Full Paper) doi:10.1145/3618260.3649776 STOC '24: "Testing Closeness of Multivariate ..." Testing Closeness of Multivariate Distributions via Ramsey Theory Ilias Diakonikolas, Daniel M. Kane, and Sihan Liu (University of Wisconsin-Madison, USA; University of California at San Diego, USA) @InProceedings{STOC24p385, author = {Ilias Diakonikolas and Daniel M. Kane and Sihan Liu}, title = {Testing Closeness of Multivariate Distributions via Ramsey Theory}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {385-384}, doi = {10.1145/3618260.3649657}, year = {2024}, } Publisher's Version Article: stoc24main-p244-p (type: Full Paper) doi:10.1145/3618260.3649657
	Kaski, Petteri	STOC '24: "The Asymptotic Rank Conjecture ..." The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True Andreas Björklund and Petteri Kaski (IT University of Copenhagen, Copenhagen, Denmark; Aalto University, Finland) @InProceedings{STOC24p937, author = {Andreas Björklund and Petteri Kaski}, title = {The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {937-936}, doi = {10.1145/3618260.3649656}, year = {2024}, } Publisher's Version Article: stoc24main-p230-p (type: Full Paper) doi:10.1145/3618260.3649656
	Kaufman, Tali	STOC '24: "Cosystolic Expansion of Sheaves ..." Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes Uriya A. First and Tali Kaufman (University of Haifa, Israel; Bar-Ilan University, Israel) @InProceedings{STOC24p1609, author = {Uriya A. First and Tali Kaufman}, title = {Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1609-1608}, doi = {10.1145/3618260.3649625}, year = {2024}, } Publisher's Version Article: stoc24main-p83-p (type: Full Paper) doi:10.1145/3618260.3649625
	Kawamura, Akitoshi	STOC '24: "Proof of the Density Threshold ..." Proof of the Density Threshold Conjecture for Pinwheel Scheduling Akitoshi Kawamura (Kyoto University, Kyoto, Japan) @InProceedings{STOC24p2017, author = {Akitoshi Kawamura}, title = {Proof of the Density Threshold Conjecture for Pinwheel Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2017-2016}, doi = {10.1145/3618260.3649757}, year = {2024}, } Publisher's Version Article: stoc24main-p1056-p (type: Full Paper) doi:10.1145/3618260.3649757
	Kawarabayashi, Ken-ichi	STOC '24: "Better Coloring of 3-Colorable ..." Better Coloring of 3-Colorable Graphs Ken-ichi Kawarabayashi, Mikkel Thorup, and Hirotaka Yoneda (National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p373, author = {Ken-ichi Kawarabayashi and Mikkel Thorup and Hirotaka Yoneda}, title = {Better Coloring of 3-Colorable Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {373-372}, doi = {10.1145/3618260.3649768}, year = {2024}, } Publisher's Version Article: stoc24main-p1255-p (type: Full Paper) doi:10.1145/3618260.3649768 STOC '24: "Packing Even Directed Circuits ..." Packing Even Directed Circuits Quarter-Integrally Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p769, author = {Maximilian Gorsky and Ken-ichi Kawarabayashi and Stephan Kreutzer and Sebastian Wiederrecht}, title = {Packing Even Directed Circuits Quarter-Integrally}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {769-768}, doi = {10.1145/3618260.3649682}, year = {2024}, } Publisher's Version Article: stoc24main-p391-p (type: Full Paper) doi:10.1145/3618260.3649682 STOC '24: "Edge-Disjoint Paths in Eulerian ..." Edge-Disjoint Paths in Eulerian Digraphs Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, and Stephan Kreutzer (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan) @InProceedings{STOC24p781, author = {Dario Giuliano Cavallaro and Ken-ichi Kawarabayashi and Stephan Kreutzer}, title = {Edge-Disjoint Paths in Eulerian Digraphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {781-780}, doi = {10.1145/3618260.3649758}, year = {2024}, } Publisher's Version Article: stoc24main-p1070-p (type: Full Paper) doi:10.1145/3618260.3649758
	Kelley, Zander	STOC '24: "New Graph Decompositions and ..." New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka (Weizmann Institute of Science, Israel; University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1033, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1033-1032}, doi = {10.1145/3618260.3649696}, year = {2024}, } Publisher's Version Article: stoc24main-p481-p (type: Full Paper) doi:10.1145/3618260.3649696 STOC '24: "Explicit Separations between ..." Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication Zander Kelley, Shachar Lovett, and Raghu Meka (University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1441, author = {Zander Kelley and Shachar Lovett and Raghu Meka}, title = {Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1441-1440}, doi = {10.1145/3618260.3649721}, year = {2024}, } Publisher's Version Article: stoc24main-p701-p (type: Full Paper) doi:10.1145/3618260.3649721
	Kesselheim, Thomas	STOC '24: "Supermodular Approximation ..." Supermodular Approximation of Norms and Applications Thomas Kesselheim, Marco Molinaro, and Sahil Singla (University of Bonn, Bonn, Germany; PUC-Rio, Brazil; Georgia Institute of Technology, USA) @InProceedings{STOC24p2053, author = {Thomas Kesselheim and Marco Molinaro and Sahil Singla}, title = {Supermodular Approximation of Norms and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2053-2052}, doi = {10.1145/3618260.3649734}, year = {2024}, } Publisher's Version Article: stoc24main-p820-p (type: Full Paper) doi:10.1145/3618260.3649734
	Khanna, Sanjeev	STOC '24: "Maximum Bipartite Matching ..." Maximum Bipartite Matching in 𝑛2+𝑜(1) Time via a Combinatorial Algorithm Julia Chuzhoy and Sanjeev Khanna (Toyota Technological Institute, Chicago, USA; University of Pennsylvania, USA) @InProceedings{STOC24p109, author = {Julia Chuzhoy and Sanjeev Khanna}, title = {Maximum Bipartite Matching in 𝑛<sup>2+𝑜(1)</sup> Time via a Combinatorial Algorithm}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {109-108}, doi = {10.1145/3618260.3649725}, year = {2024}, } Publisher's Version Article: stoc24main-p726-p (type: Full Paper) doi:10.1145/3618260.3649725
	Khodabandeh, Mohammad Mahdi	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784
	Khot, Subhash	STOC '24: "On Approximability of Satisfiable ..." On Approximability of Satisfiable k-CSPs: IV Amey Bhangale, Subhash Khot, and Dor Minzer (University of California at Riverside, USA; New York University, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1585, author = {Amey Bhangale and Subhash Khot and Dor Minzer}, title = {On Approximability of Satisfiable k-CSPs: IV}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1585-1584}, doi = {10.1145/3618260.3649610}, year = {2024}, } Publisher's Version Article: stoc24main-p34-p (type: Full Paper) doi:10.1145/3618260.3649610
	Khurana, Dakshita	STOC '24: "Commitments from Quantum One-Wayness ..." Commitments from Quantum One-Wayness Dakshita Khurana and Kabir Tomer (University of Illinois at Urbana-Champaign, USA) @InProceedings{STOC24p1069, author = {Dakshita Khurana and Kabir Tomer}, title = {Commitments from Quantum One-Wayness}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1069-1068}, doi = {10.1145/3618260.3649654}, year = {2024}, } Publisher's Version Article: stoc24main-p219-p (type: Full Paper) doi:10.1145/3618260.3649654
	Kim, Isaac	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	Kindler, Guy	STOC '24: "Product Mixing in Compact ..." Product Mixing in Compact Lie Groups David Ellis, Guy Kindler, Noam Lifshitz, and Dor Minzer (University of Bristol, United Kingdom; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1573, author = {David Ellis and Guy Kindler and Noam Lifshitz and Dor Minzer}, title = {Product Mixing in Compact Lie Groups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1573-1572}, doi = {10.1145/3618260.3649626}, year = {2024}, } Publisher's Version Article: stoc24main-p91-p (type: Full Paper) doi:10.1145/3618260.3649626
	Kiss, Peter	STOC '24: "Near-Optimal Dynamic Rounding ..." Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs Sayan Bhattacharya, Peter Kiss, Aaron Sidford, and David Wajc (University of Warwick, United Kingdom; Stanford University, USA; Technion, Israel) @InProceedings{STOC24p85, author = {Sayan Bhattacharya and Peter Kiss and Aaron Sidford and David Wajc}, title = {Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {85-84}, doi = {10.1145/3618260.3649648}, year = {2024}, } Publisher's Version Article: stoc24main-p175-p (type: Full Paper) doi:10.1145/3618260.3649648
	Klein, Nathan	STOC '24: "Ghost Value Augmentation for ..." Ghost Value Augmentation for k-Edge-Connectivity D. Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen (Brown University, USA; Institute for Advanced Study, Princeton, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p2065, author = {D. Ellis Hershkowitz and Nathan Klein and Rico Zenklusen}, title = {Ghost Value Augmentation for k-Edge-Connectivity}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2065-2064}, doi = {10.1145/3618260.3649715}, year = {2024}, } Publisher's Version Article: stoc24main-p621-p (type: Full Paper) doi:10.1145/3618260.3649715
	Kleinberg, Robert	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Kociumaka, Tomasz	STOC '24: "On the Communication Complexity ..." On the Communication Complexity of Approximate Pattern Matching Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz (MPI-INF, Germany; Saarland Informatics Campus, Saarbrücken, Germany; ETH Zurich, Switzerland) @InProceedings{STOC24p1957, author = {Tomasz Kociumaka and Jakob Nogler and Philip Wellnitz}, title = {On the Communication Complexity of Approximate Pattern Matching}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1957-1956}, doi = {10.1145/3618260.3649604}, year = {2024}, } Publisher's Version Article: stoc24main-p13-p (type: Full Paper) doi:10.1145/3618260.3649604
	Koehler, Frederic	STOC '24: "Trickle-Down in Localization ..." Trickle-Down in Localization Schemes and Applications Nima Anari, Frederic Koehler, and Thuy-Duong Vuong (Stanford University, USA; University of Chicago, USA) @InProceedings{STOC24p1213, author = {Nima Anari and Frederic Koehler and Thuy-Duong Vuong}, title = {Trickle-Down in Localization Schemes and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1213-1212}, doi = {10.1145/3618260.3649622}, year = {2024}, } Publisher's Version Article: stoc24main-p76-p (type: Full Paper) doi:10.1145/3618260.3649622 STOC '24: "Influences in Mixing Measures ..." Influences in Mixing Measures Frederic Koehler, Noam Lifshitz, Dor Minzer, and Elchanan Mossel (University of Chicago, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p589, author = {Frederic Koehler and Noam Lifshitz and Dor Minzer and Elchanan Mossel}, title = {Influences in Mixing Measures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {589-588}, doi = {10.1145/3618260.3649731}, year = {2024}, } Publisher's Version Article: stoc24main-p798-p (type: Full Paper) doi:10.1145/3618260.3649731
	Koh, Zhuan Khye	STOC '24: "A Strongly Polynomial Algorithm ..." A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh (CWI, Amsterdam, Netherlands; Georgia Institute of Technology, USA; London School of Economics, United Kingdom) @InProceedings{STOC24p1741, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1741-1740}, doi = {10.1145/3618260.3649764}, year = {2024}, } Publisher's Version Article: stoc24main-p1131-p (type: Full Paper) doi:10.1145/3618260.3649764
	Kol, Gillat	STOC '24: "Optimal Multi-pass Lower Bounds ..." Optimal Multi-pass Lower Bounds for MST in Dynamic Streams Sepehr Assadi, Gillat Kol, and Zhijun Zhang (University of Waterloo, Canada; Rutgers University, USA; Princeton University, USA) @InProceedings{STOC24p913, author = {Sepehr Assadi and Gillat Kol and Zhijun Zhang}, title = {Optimal Multi-pass Lower Bounds for MST in Dynamic Streams}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {913-912}, doi = {10.1145/3618260.3649755}, year = {2024}, } Publisher's Version Article: stoc24main-p1046-p (type: Full Paper) doi:10.1145/3618260.3649755
	Komargodski, Ilan	STOC '24: "Memory Checking Requires Logarithmic ..." Memory Checking Requires Logarithmic Overhead Elette Boyle, Ilan Komargodski, and Neekon Vafa (Reichman University, Israel; NTT Research, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1897, author = {Elette Boyle and Ilan Komargodski and Neekon Vafa}, title = {Memory Checking Requires Logarithmic Overhead}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1897-1896}, doi = {10.1145/3618260.3649686}, year = {2024}, } Publisher's Version Article: stoc24main-p413-p (type: Full Paper) doi:10.1145/3618260.3649686 STOC '24: "Optimal Load-Balanced Scalable ..." Optimal Load-Balanced Scalable Distributed Agreement Yuval Gelles and Ilan Komargodski (Hebrew University of Jerusalem, Israel; NTT Research, USA) @InProceedings{STOC24p469, author = {Yuval Gelles and Ilan Komargodski}, title = {Optimal Load-Balanced Scalable Distributed Agreement}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {469-468}, doi = {10.1145/3618260.3649736}, year = {2024}, } Publisher's Version Article: stoc24main-p827-p (type: Full Paper) doi:10.1145/3618260.3649736
	Konrad, Christian	STOC '24: "O(log log n) Passes Is Optimal ..." O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, and Janani Sundaresan (University of Waterloo, Canada; Rutgers University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p925, author = {Sepehr Assadi and Christian Konrad and Kheeran K. Naidu and Janani Sundaresan}, title = {O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {925-924}, doi = {10.1145/3618260.3649763}, year = {2024}, } Publisher's Version Article: stoc24main-p1123-p (type: Full Paper) doi:10.1145/3618260.3649763
	Kontonis, Vasilis	STOC '24: "Super Non-singular Decompositions ..." Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, and Nikos Zarifis (University of Wisconsin-Madison, USA; University of California at San Diego, USA; University of Texas at Austin, USA) @InProceedings{STOC24p181, author = {Ilias Diakonikolas and Daniel M. Kane and Vasilis Kontonis and Sihan Liu and Nikos Zarifis}, title = {Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {181-180}, doi = {10.1145/3618260.3649776}, year = {2024}, } Publisher's Version Article: stoc24main-p1369-p (type: Full Paper) doi:10.1145/3618260.3649776
	Korhonen, Tuukka	STOC '24: "Almost-Linear Time Parameterized ..." Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth Tuukka Korhonen and Marek Sokołowski (University of Bergen, Norway; University of Warsaw, Poland) @InProceedings{STOC24p1717, author = {Tuukka Korhonen and Marek Sokołowski}, title = {Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1717-1716}, doi = {10.1145/3618260.3649732}, year = {2024}, } Publisher's Version Article: stoc24main-p802-p (type: Full Paper) doi:10.1145/3618260.3649732
	Kornerup, Niels	STOC '24: "Quantum Time-Space Tradeoffs ..." Quantum Time-Space Tradeoffs for Matrix Problems Paul Beame, Niels Kornerup, and Michael Whitmeyer (University of Washington, USA; University of Texas at Austin, USA) @InProceedings{STOC24p661, author = {Paul Beame and Niels Kornerup and Michael Whitmeyer}, title = {Quantum Time-Space Tradeoffs for Matrix Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {661-660}, doi = {10.1145/3618260.3649700}, year = {2024}, } Publisher's Version Article: stoc24main-p546-p (type: Full Paper) doi:10.1145/3618260.3649700
	Kothari, Pravesh K.	STOC '24: "Sum-of-Squares Lower Bounds ..." Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs Pravesh K. Kothari, Aaron Potechin, and Jeff Xu (Carnegie Mellon University, USA; University of Chicago, USA) @InProceedings{STOC24p2137, author = {Pravesh K. Kothari and Aaron Potechin and Jeff Xu}, title = {Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2137-2136}, doi = {10.1145/3618260.3649703}, year = {2024}, } Publisher's Version Article: stoc24main-p556-p (type: Full Paper) doi:10.1145/3618260.3649703 STOC '24: "An Exponential Lower Bound ..." An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes Pravesh K. Kothari and Peter Manohar (Institute for Advanced Study, Princeton, USA; Princeton University, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p853, author = {Pravesh K. Kothari and Peter Manohar}, title = {An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {853-852}, doi = {10.1145/3618260.3649640}, year = {2024}, } Publisher's Version Article: stoc24main-p155-p (type: Full Paper) doi:10.1145/3618260.3649640
	Koucký, Michal	STOC '24: "Almost Linear Size Edit Distance ..." Almost Linear Size Edit Distance Sketch Michal Koucký and Michael E. Saks (Charles University, Prague, Czechia; Rutgers University, USA) @InProceedings{STOC24p1057, author = {Michal Koucký and Michael E. Saks}, title = {Almost Linear Size Edit Distance Sketch}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1057-1056}, doi = {10.1145/3618260.3649783}, year = {2024}, } Publisher's Version Article: stoc24main-p1527-p (type: Full Paper) doi:10.1145/3618260.3649783
	Kozma, László	STOC '24: "Optimization with Pattern-Avoiding ..." Optimization with Pattern-Avoiding Input Benjamin Aram Berendsohn, László Kozma, and Michal Opler (Freie Universität Berlin, Berlin, Germany; Czech Technical University, Prague, Czechia) @InProceedings{STOC24p745, author = {Benjamin Aram Berendsohn and László Kozma and Michal Opler}, title = {Optimization with Pattern-Avoiding Input}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {745-744}, doi = {10.1145/3618260.3649631}, year = {2024}, } Publisher's Version Article: stoc24main-p118-p (type: Full Paper) doi:10.1145/3618260.3649631
	Kretschmer, William	STOC '24: "Improved Stabilizer Estimation ..." Improved Stabilizer Estimation via Bell Difference Sampling Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang (University of Texas at Austin, USA; Simons Institute for the Theory of Computing, Berkeley, USA; Rice University, USA) @InProceedings{STOC24p1501, author = {Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang}, title = {Improved Stabilizer Estimation via Bell Difference Sampling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1501-1500}, doi = {10.1145/3618260.3649738}, year = {2024}, } Publisher's Version Article: stoc24main-p845-p (type: Full Paper) doi:10.1145/3618260.3649738
	Kreutzer, Stephan	STOC '24: "Packing Even Directed Circuits ..." Packing Even Directed Circuits Quarter-Integrally Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p769, author = {Maximilian Gorsky and Ken-ichi Kawarabayashi and Stephan Kreutzer and Sebastian Wiederrecht}, title = {Packing Even Directed Circuits Quarter-Integrally}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {769-768}, doi = {10.1145/3618260.3649682}, year = {2024}, } Publisher's Version Article: stoc24main-p391-p (type: Full Paper) doi:10.1145/3618260.3649682 STOC '24: "Edge-Disjoint Paths in Eulerian ..." Edge-Disjoint Paths in Eulerian Digraphs Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, and Stephan Kreutzer (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan) @InProceedings{STOC24p781, author = {Dario Giuliano Cavallaro and Ken-ichi Kawarabayashi and Stephan Kreutzer}, title = {Edge-Disjoint Paths in Eulerian Digraphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {781-780}, doi = {10.1145/3618260.3649758}, year = {2024}, } Publisher's Version Article: stoc24main-p1070-p (type: Full Paper) doi:10.1145/3618260.3649758
	Kuhn, Fabian	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Kulkarni, Janardhan	STOC '24: "Optimal Online Discrepancy ..." Optimal Online Discrepancy Minimization Janardhan Kulkarni, Victor Reis, and Thomas Rothvoss (Microsoft Research, USA; Institute for Advanced Study, Princeton, USA; University of Washington, USA) @InProceedings{STOC24p2041, author = {Janardhan Kulkarni and Victor Reis and Thomas Rothvoss}, title = {Optimal Online Discrepancy Minimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2041-2040}, doi = {10.1145/3618260.3649720}, year = {2024}, } Publisher's Version Article: stoc24main-p695-p (type: Full Paper) doi:10.1145/3618260.3649720
	Kumar, Vinayak M.	STOC '24: "Relaxed Local Correctability ..." Relaxed Local Correctability from Local Testing Vinayak M. Kumar and Geoffrey Mon (University of Texas at Austin, USA) @InProceedings{STOC24p1765, author = {Vinayak M. Kumar and Geoffrey Mon}, title = {Relaxed Local Correctability from Local Testing}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1765-1764}, doi = {10.1145/3618260.3649611}, year = {2024}, } Publisher's Version Article: stoc24main-p43-p (type: Full Paper) doi:10.1145/3618260.3649611
	Kuszmaul, William	STOC '24: "Space Lower Bounds for Dynamic ..." Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval William Kuszmaul and Stefan Walzer (Harvard University, USA; KIT, Karlsruhe, Germany) @InProceedings{STOC24p1273, author = {William Kuszmaul and Stefan Walzer}, title = {Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1273-1272}, doi = {10.1145/3618260.3649649}, year = {2024}, } Publisher's Version Article: stoc24main-p177-p (type: Full Paper) doi:10.1145/3618260.3649649
	Kyng, Rasmus	STOC '24: "Almost-Linear Time Algorithms ..." Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg (Carnegie Mellon University, USA; ETH Zurich, Switzerland; Institute for Advanced Study, Princeton, USA) @InProceedings{STOC24p1285, author = {Li Chen and Rasmus Kyng and Yang P. Liu and Simon Meierhans and Maximilian Probst Gutenberg}, title = {Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1285-1284}, doi = {10.1145/3618260.3649745}, year = {2024}, } Publisher's Version Article: stoc24main-p949-p (type: Full Paper) doi:10.1145/3618260.3649745 STOC '24: "A Dynamic Shortest Paths Toolbox: ..." A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications Rasmus Kyng, Simon Meierhans, and Maximilian Probst Gutenberg (ETH Zurich, Switzerland) @InProceedings{STOC24p1297, author = {Rasmus Kyng and Simon Meierhans and Maximilian Probst Gutenberg}, title = {A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1297-1296}, doi = {10.1145/3618260.3649767}, year = {2024}, } Publisher's Version Article: stoc24main-p1197-p (type: Full Paper) doi:10.1145/3618260.3649767
	Landau, Zeph	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	Lee, Euiwoong	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749 STOC '24: "Approximating Small Sparse ..." Approximating Small Sparse Cuts Aditya Anand, Euiwoong Lee, Jason Li, and Thatchaphol Saranurak (University of Michigan, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p361, author = {Aditya Anand and Euiwoong Lee and Jason Li and Thatchaphol Saranurak}, title = {Approximating Small Sparse Cuts}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {361-360}, doi = {10.1145/3618260.3649747}, year = {2024}, } Publisher's Version Article: stoc24main-p972-p (type: Full Paper) doi:10.1145/3618260.3649747
	Lee, James R.	STOC '24: "Sparsifying Generalized Linear ..." Sparsifying Generalized Linear Models Arun Jambulapati, James R. Lee, Yang P. Liu, and Aaron Sidford (Simons Institute for the Theory of Computing, Berkeley, USA; University of Washington, USA; Institute for Advanced Study, Princeton, USA; Stanford University, USA) @InProceedings{STOC24p1849, author = {Arun Jambulapati and James R. Lee and Yang P. Liu and Aaron Sidford}, title = {Sparsifying Generalized Linear Models}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1849-1848}, doi = {10.1145/3618260.3649684}, year = {2024}, } Publisher's Version Article: stoc24main-p402-p (type: Full Paper) doi:10.1145/3618260.3649684
	Lee, Yin Tat	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787
	Le Gall, François	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Leonardi, Stefano	STOC '24: "The Role of Transparency in ..." The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi (University of Milan, Italy; Politecnico di Milano, Italy; University of Ottawa, Canada; Italian Institute of Technology, Italy; Sapienza University of Rome, Italy) @InProceedings{STOC24p265, author = {Nicolo Cesa-Bianchi and Tommaso Cesari and Roberto Colomboni and Federico Fusco and Stefano Leonardi}, title = {The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {265-264}, doi = {10.1145/3618260.3649658}, year = {2024}, } Publisher's Version Article: stoc24main-p255-p (type: Full Paper) doi:10.1145/3618260.3649658
	Li, Huan	STOC '24: "Detecting Low-Degree Truncation ..." Detecting Low-Degree Truncation Anindya De, Huan Li, Shivam Nadimpalli, and Rocco A. Servedio (University of Pennsylvania, USA; Columbia University, USA) @InProceedings{STOC24p1141, author = {Anindya De and Huan Li and Shivam Nadimpalli and Rocco A. Servedio}, title = {Detecting Low-Degree Truncation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1141-1140}, doi = {10.1145/3618260.3649633}, year = {2024}, } Publisher's Version Article: stoc24main-p129-p (type: Full Paper) doi:10.1145/3618260.3649633
	Li, Jason	STOC '24: "Hypergraph Unreliability in ..." Hypergraph Unreliability in Quasi-Polynomial Time Ruoxu Cen, Jason Li, and Debmalya Panigrahi (Duke University, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1885, author = {Ruoxu Cen and Jason Li and Debmalya Panigrahi}, title = {Hypergraph Unreliability in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1885-1884}, doi = {10.1145/3618260.3649753}, year = {2024}, } Publisher's Version Article: stoc24main-p1042-p (type: Full Paper) doi:10.1145/3618260.3649753 STOC '24: "Approximating Small Sparse ..." Approximating Small Sparse Cuts Aditya Anand, Euiwoong Lee, Jason Li, and Thatchaphol Saranurak (University of Michigan, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p361, author = {Aditya Anand and Euiwoong Lee and Jason Li and Thatchaphol Saranurak}, title = {Approximating Small Sparse Cuts}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {361-360}, doi = {10.1145/3618260.3649747}, year = {2024}, } Publisher's Version Article: stoc24main-p972-p (type: Full Paper) doi:10.1145/3618260.3649747 STOC '24: "Low-Step Multi-commodity Flow ..." Low-Step Multi-commodity Flow Emulators Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, and Thatchaphol Saranurak (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Brown University, USA; University of Michigan, USA) @InProceedings{STOC24p97, author = {Bernhard Haeupler and D. Ellis Hershkowitz and Jason Li and Antti Roeyskoe and Thatchaphol Saranurak}, title = {Low-Step Multi-commodity Flow Emulators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {97-96}, doi = {10.1145/3618260.3649689}, year = {2024}, } Publisher's Version Article: stoc24main-p429-p (type: Full Paper) doi:10.1145/3618260.3649689
	Li, Jerry	STOC '24: "An Optimal Tradeoff between ..." An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography Sitan Chen, Jerry Li, and Allen Liu (Harvard University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1477, author = {Sitan Chen and Jerry Li and Allen Liu}, title = {An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1477-1476}, doi = {10.1145/3618260.3649704}, year = {2024}, } Publisher's Version Article: stoc24main-p558-p (type: Full Paper) doi:10.1145/3618260.3649704
	Li, Jian	STOC '24: "On Optimal Coreset Construction ..." On Optimal Coreset Construction for Euclidean (k,z)-Clustering Lingxiao Huang, Jian Li, and Xuan Wu (Nanjing University, China; Tsinghua University, China) @InProceedings{STOC24p1777, author = {Lingxiao Huang and Jian Li and Xuan Wu}, title = {On Optimal Coreset Construction for Euclidean (k,z)-Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1777-1776}, doi = {10.1145/3618260.3649707}, year = {2024}, } Publisher's Version Article: stoc24main-p570-p (type: Full Paper) doi:10.1145/3618260.3649707
	Li, Jiatu	STOC '24: "Hardness of Range Avoidance ..." Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography Yilei Chen and Jiatu Li (Tsinghua University, China; Shanghai Qi Zhi Institute, Shanghai, China; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p685, author = {Yilei Chen and Jiatu Li}, title = {Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {685-684}, doi = {10.1145/3618260.3649602}, year = {2024}, } Publisher's Version Article: stoc24main-p7-p (type: Full Paper) doi:10.1145/3618260.3649602
	Li, Qian	STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672
	Li, Ray	STOC '24: "Randomly Punctured Reed–Solomon ..." Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields Omar Alrabiah, Venkatesan Guruswami, and Ray Li (University of California at Berkeley, USA; Santa Clara University, USA) @InProceedings{STOC24p1621, author = {Omar Alrabiah and Venkatesan Guruswami and Ray Li}, title = {Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1621-1620}, doi = {10.1145/3618260.3649634}, year = {2024}, } Publisher's Version Article: stoc24main-p130-p (type: Full Paper) doi:10.1145/3618260.3649634
	Li, Shi	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749
	Li, Wenzheng	STOC '24: "A Constant-Factor Approximation ..." A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, and Jan Vondrák (Weizmann Institute of Science, Israel; Stanford University, USA) @InProceedings{STOC24p529, author = {Shahar Dobzinski and Wenzheng Li and Aviad Rubinstein and Jan Vondrák}, title = {A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {529-528}, doi = {10.1145/3618260.3649740}, year = {2024}, } Publisher's Version Article: stoc24main-p872-p (type: Full Paper) doi:10.1145/3618260.3649740
	Li, Yuhao	STOC '24: "Computing a Fixed Point of ..." Computing a Fixed Point of Contraction Maps in Polynomial Queries Xi Chen, Yuhao Li, and Mihalis Yannakakis (Columbia University, USA) @InProceedings{STOC24p1513, author = {Xi Chen and Yuhao Li and Mihalis Yannakakis}, title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1513-1512}, doi = {10.1145/3618260.3649623}, year = {2024}, } Publisher's Version Article: stoc24main-p78-p (type: Full Paper) doi:10.1145/3618260.3649623
	Li, Zeyong	STOC '24: "Symmetric Exponential Time ..." Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform Zeyong Li (National University of Singapore, Singapore) @InProceedings{STOC24p2221, author = {Zeyong Li}, title = {Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2221-2220}, doi = {10.1145/3618260.3649615}, year = {2024}, } Publisher's Version Article: stoc24main-p52-p (type: Full Paper) doi:10.1145/3618260.3649615
	Lian, Jiayi	STOC '24: "A Nearly Quadratic-Time FPTAS ..." A Nearly Quadratic-Time FPTAS for Knapsack Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p325, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {A Nearly Quadratic-Time FPTAS for Knapsack}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {325-324}, doi = {10.1145/3618260.3649730}, year = {2024}, } Publisher's Version Article: stoc24main-p797-p (type: Full Paper) doi:10.1145/3618260.3649730 STOC '24: "Approximating Partition in ..." Approximating Partition in Near-Linear Time Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p349, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {Approximating Partition in Near-Linear Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {349-348}, doi = {10.1145/3618260.3649727}, year = {2024}, } Publisher's Version Article: stoc24main-p758-p (type: Full Paper) doi:10.1145/3618260.3649727
	Liang, Daniel	STOC '24: "Improved Stabilizer Estimation ..." Improved Stabilizer Estimation via Bell Difference Sampling Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang (University of Texas at Austin, USA; Simons Institute for the Theory of Computing, Berkeley, USA; Rice University, USA) @InProceedings{STOC24p1501, author = {Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang}, title = {Improved Stabilizer Estimation via Bell Difference Sampling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1501-1500}, doi = {10.1145/3618260.3649738}, year = {2024}, } Publisher's Version Article: stoc24main-p845-p (type: Full Paper) doi:10.1145/3618260.3649738
	Liaw, Christopher	STOC '24: "The Power of Two-Sided Recruitment ..." The Power of Two-Sided Recruitment in Two-Sided Markets Yang Cai, Christopher Liaw, Aranyak Mehta, and Mingfei Zhao (Yale University, USA; Google Research, USA) @InProceedings{STOC24p241, author = {Yang Cai and Christopher Liaw and Aranyak Mehta and Mingfei Zhao}, title = {The Power of Two-Sided Recruitment in Two-Sided Markets}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {241-240}, doi = {10.1145/3618260.3649669}, year = {2024}, } Publisher's Version Article: stoc24main-p319-p (type: Full Paper) doi:10.1145/3618260.3649669
	Lievonen, Henrik	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Lifshitz, Noam	STOC '24: "Product Mixing in Compact ..." Product Mixing in Compact Lie Groups David Ellis, Guy Kindler, Noam Lifshitz, and Dor Minzer (University of Bristol, United Kingdom; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1573, author = {David Ellis and Guy Kindler and Noam Lifshitz and Dor Minzer}, title = {Product Mixing in Compact Lie Groups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1573-1572}, doi = {10.1145/3618260.3649626}, year = {2024}, } Publisher's Version Article: stoc24main-p91-p (type: Full Paper) doi:10.1145/3618260.3649626 STOC '24: "Influences in Mixing Measures ..." Influences in Mixing Measures Frederic Koehler, Noam Lifshitz, Dor Minzer, and Elchanan Mossel (University of Chicago, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p589, author = {Frederic Koehler and Noam Lifshitz and Dor Minzer and Elchanan Mossel}, title = {Influences in Mixing Measures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {589-588}, doi = {10.1145/3618260.3649731}, year = {2024}, } Publisher's Version Article: stoc24main-p798-p (type: Full Paper) doi:10.1145/3618260.3649731
	Limaye, Nutan	STOC '24: "Functional Lower Bounds in ..." Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Tuomas Hakoniemi, Nutan Limaye, and Iddo Tzameret (University of Helsinki, Helsinki, Finland; IT University of Copenhagen, Copenhagen, Denmark; Imperial College London, United Kingdom) @InProceedings{STOC24p1549, author = {Tuomas Hakoniemi and Nutan Limaye and Iddo Tzameret}, title = {Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1549-1548}, doi = {10.1145/3618260.3649616}, year = {2024}, } Publisher's Version Article: stoc24main-p57-p (type: Full Paper) doi:10.1145/3618260.3649616 STOC '24: "On the Power of Homogeneous ..." On the Power of Homogeneous Algebraic Formulas Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas (Université Paris Cité - IMJ-PRG, France; IT University of Copenhagen, Copenhagen, Denmark; University of Copenhagen, Copenhagen, Denmark; Université Savoie Mont Blanc - CNRS - LAMA, France) @InProceedings{STOC24p169, author = {Hervé Fournier and Nutan Limaye and Srikanth Srinivasan and Sébastien Tavenas}, title = {On the Power of Homogeneous Algebraic Formulas}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {169-168}, doi = {10.1145/3618260.3649760}, year = {2024}, } Publisher's Version Article: stoc24main-p1106-p (type: Full Paper) doi:10.1145/3618260.3649760
	Lin, Bingkai	STOC '24: "Parameterized Inapproximability ..." Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, and Kewen Wu (University of California at Berkeley, USA; Nanjing University, China; Peking University, China) @InProceedings{STOC24p49, author = {Venkatesan Guruswami and Bingkai Lin and Xuandi Ren and Yican Sun and Kewen Wu}, title = {Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {49-48}, doi = {10.1145/3618260.3649771}, year = {2024}, } Publisher's Version Article: stoc24main-p1264-p (type: Full Paper) doi:10.1145/3618260.3649771
	Liu, Allen	STOC '24: "An Optimal Tradeoff between ..." An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography Sitan Chen, Jerry Li, and Allen Liu (Harvard University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1477, author = {Sitan Chen and Jerry Li and Allen Liu}, title = {An Optimal Tradeoff between Entanglement and Copy Complexity for State Tomography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1477-1476}, doi = {10.1145/3618260.3649704}, year = {2024}, } Publisher's Version Article: stoc24main-p558-p (type: Full Paper) doi:10.1145/3618260.3649704 STOC '24: "Learning Quantum Hamiltonians ..." Learning Quantum Hamiltonians at Any Temperature in Polynomial Time Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1633, author = {Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang}, title = {Learning Quantum Hamiltonians at Any Temperature in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1633-1632}, doi = {10.1145/3618260.3649619}, year = {2024}, } Publisher's Version Article: stoc24main-p62-p (type: Full Paper) doi:10.1145/3618260.3649619
	Liu, Chih-Hung	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Liu, Sihan	STOC '24: "Super Non-singular Decompositions ..." Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, and Nikos Zarifis (University of Wisconsin-Madison, USA; University of California at San Diego, USA; University of Texas at Austin, USA) @InProceedings{STOC24p181, author = {Ilias Diakonikolas and Daniel M. Kane and Vasilis Kontonis and Sihan Liu and Nikos Zarifis}, title = {Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {181-180}, doi = {10.1145/3618260.3649776}, year = {2024}, } Publisher's Version Article: stoc24main-p1369-p (type: Full Paper) doi:10.1145/3618260.3649776 STOC '24: "Testing Closeness of Multivariate ..." Testing Closeness of Multivariate Distributions via Ramsey Theory Ilias Diakonikolas, Daniel M. Kane, and Sihan Liu (University of Wisconsin-Madison, USA; University of California at San Diego, USA) @InProceedings{STOC24p385, author = {Ilias Diakonikolas and Daniel M. Kane and Sihan Liu}, title = {Testing Closeness of Multivariate Distributions via Ramsey Theory}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {385-384}, doi = {10.1145/3618260.3649657}, year = {2024}, } Publisher's Version Article: stoc24main-p244-p (type: Full Paper) doi:10.1145/3618260.3649657
	Liu, Yang P.	STOC '24: "Almost-Linear Time Algorithms ..." Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg (Carnegie Mellon University, USA; ETH Zurich, Switzerland; Institute for Advanced Study, Princeton, USA) @InProceedings{STOC24p1285, author = {Li Chen and Rasmus Kyng and Yang P. Liu and Simon Meierhans and Maximilian Probst Gutenberg}, title = {Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1285-1284}, doi = {10.1145/3618260.3649745}, year = {2024}, } Publisher's Version Article: stoc24main-p949-p (type: Full Paper) doi:10.1145/3618260.3649745 STOC '24: "Sparsifying Generalized Linear ..." Sparsifying Generalized Linear Models Arun Jambulapati, James R. Lee, Yang P. Liu, and Aaron Sidford (Simons Institute for the Theory of Computing, Berkeley, USA; University of Washington, USA; Institute for Advanced Study, Princeton, USA; Stanford University, USA) @InProceedings{STOC24p1849, author = {Arun Jambulapati and James R. Lee and Yang P. Liu and Aaron Sidford}, title = {Sparsifying Generalized Linear Models}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1849-1848}, doi = {10.1145/3618260.3649684}, year = {2024}, } Publisher's Version Article: stoc24main-p402-p (type: Full Paper) doi:10.1145/3618260.3649684
	Liu, Yinchen	STOC '24: "Classical Simulation of Peaked ..." Classical Simulation of Peaked Shallow Quantum Circuits Sergey Bravyi, David Gosset, and Yinchen Liu (IBM Research, USA; University of Waterloo, Canada; Institute for Quantum Computing, Canada; Perimeter Institute for Theoretical Physics, Canada) @InProceedings{STOC24p625, author = {Sergey Bravyi and David Gosset and Yinchen Liu}, title = {Classical Simulation of Peaked Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {625-624}, doi = {10.1145/3618260.3649638}, year = {2024}, } Publisher's Version Article: stoc24main-p141-p (type: Full Paper) doi:10.1145/3618260.3649638
	Liu, Yunchao	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	Lokshtanov, Daniel	STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Lolck, David Rasmussen	STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712
	Lombardi, Alex	STOC '24: "A One-Query Lower Bound for ..." A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography Alex Lombardi, Fermi Ma, and John Wright (Princeton University, USA; Simons Institute for the Theory of Computing, Berkeley, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1081, author = {Alex Lombardi and Fermi Ma and John Wright}, title = {A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1081-1080}, doi = {10.1145/3618260.3649650}, year = {2024}, } Publisher's Version Article: stoc24main-p179-p (type: Full Paper) doi:10.1145/3618260.3649650 STOC '24: "SNARGs under LWE via Propositional ..." SNARGs under LWE via Propositional Proofs Zhengzhong Jin, Yael Kalai, Alex Lombardi, and Vinod Vaikuntanathan (Northeastern University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p1945, author = {Zhengzhong Jin and Yael Kalai and Alex Lombardi and Vinod Vaikuntanathan}, title = {SNARGs under LWE via Propositional Proofs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1945-1944}, doi = {10.1145/3618260.3649770}, year = {2024}, } Publisher's Version Article: stoc24main-p1260-p (type: Full Paper) doi:10.1145/3618260.3649770
	Lovett, Shachar	STOC '24: "New Graph Decompositions and ..." New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka (Weizmann Institute of Science, Israel; University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1033, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1033-1032}, doi = {10.1145/3618260.3649696}, year = {2024}, } Publisher's Version Article: stoc24main-p481-p (type: Full Paper) doi:10.1145/3618260.3649696 STOC '24: "Explicit Separations between ..." Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication Zander Kelley, Shachar Lovett, and Raghu Meka (University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1441, author = {Zander Kelley and Shachar Lovett and Raghu Meka}, title = {Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1441-1440}, doi = {10.1145/3618260.3649721}, year = {2024}, } Publisher's Version Article: stoc24main-p701-p (type: Full Paper) doi:10.1145/3618260.3649721
	Lucier, Brendan	STOC '24: "Strategic Budget Selection ..." Strategic Budget Selection in a Competitive Autobidding World Yiding Feng, Brendan Lucier, and Aleksandrs Slivkins (University of Chicago, USA; Microsoft Research, USA) @InProceedings{STOC24p253, author = {Yiding Feng and Brendan Lucier and Aleksandrs Slivkins}, title = {Strategic Budget Selection in a Competitive Autobidding World}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {253-252}, doi = {10.1145/3618260.3649688}, year = {2024}, } Publisher's Version Article: stoc24main-p425-p (type: Full Paper) doi:10.1145/3618260.3649688
	Ma, Fermi	STOC '24: "A One-Query Lower Bound for ..." A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography Alex Lombardi, Fermi Ma, and John Wright (Princeton University, USA; Simons Institute for the Theory of Computing, Berkeley, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1081, author = {Alex Lombardi and Fermi Ma and John Wright}, title = {A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1081-1080}, doi = {10.1145/3618260.3649650}, year = {2024}, } Publisher's Version Article: stoc24main-p179-p (type: Full Paper) doi:10.1145/3618260.3649650
	Ma, Will	STOC '24: "Random-Order Contention Resolution ..." Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals Calum MacRury and Will Ma (Columbia University, USA) @InProceedings{STOC24p1813, author = {Calum MacRury and Will Ma}, title = {Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1813-1812}, doi = {10.1145/3618260.3649788}, year = {2024}, } Publisher's Version Article: stoc24main-p1612-p (type: Full Paper) doi:10.1145/3618260.3649788
	MacRury, Calum	STOC '24: "Random-Order Contention Resolution ..." Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals Calum MacRury and Will Ma (Columbia University, USA) @InProceedings{STOC24p1813, author = {Calum MacRury and Will Ma}, title = {Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1813-1812}, doi = {10.1145/3618260.3649788}, year = {2024}, } Publisher's Version Article: stoc24main-p1612-p (type: Full Paper) doi:10.1145/3618260.3649788
	Mahdavi, Mohammad	STOC '24: "Prize-Collecting Steiner Tree: ..." Prize-Collecting Steiner Tree: A 1.79 Approximation Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi (University of Maryland, USA) @InProceedings{STOC24p1825, author = {Ali Ahmadi and Iman Gholami and MohammadTaghi Hajiaghayi and Peyman Jabbarzade and Mohammad Mahdavi}, title = {Prize-Collecting Steiner Tree: A 1.79 Approximation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1825-1824}, doi = {10.1145/3618260.3649789}, year = {2024}, } Publisher's Version Article: stoc24main-p1622-p (type: Full Paper) doi:10.1145/3618260.3649789
	Mählmann, Nikolas	STOC '24: "Flip-Breakability: A Combinatorial ..." Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes Jan Dreier, Nikolas Mählmann, and Szymon Toruńczyk (TU Wien, Austria; University of Bremen, Bremen, Germany; University of Warsaw, Poland) @InProceedings{STOC24p1729, author = {Jan Dreier and Nikolas Mählmann and Szymon Toruńczyk}, title = {Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1729-1728}, doi = {10.1145/3618260.3649739}, year = {2024}, } Publisher's Version Article: stoc24main-p867-p (type: Full Paper) doi:10.1145/3618260.3649739
	Makarychev, Yury	STOC '24: "Near-Optimal Streaming Ellipsoidal ..." Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes Yury Makarychev, Naren Sarayu Manoj, and Max Ovsiankin (Toyota Technological Institute, Chicago, USA) @InProceedings{STOC24p1705, author = {Yury Makarychev and Naren Sarayu Manoj and Max Ovsiankin}, title = {Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1705-1704}, doi = {10.1145/3618260.3649692}, year = {2024}, } Publisher's Version Article: stoc24main-p440-p (type: Full Paper) doi:10.1145/3618260.3649692
	Manohar, Peter	STOC '24: "An Exponential Lower Bound ..." An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes Pravesh K. Kothari and Peter Manohar (Institute for Advanced Study, Princeton, USA; Princeton University, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p853, author = {Pravesh K. Kothari and Peter Manohar}, title = {An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {853-852}, doi = {10.1145/3618260.3649640}, year = {2024}, } Publisher's Version Article: stoc24main-p155-p (type: Full Paper) doi:10.1145/3618260.3649640
	Manoj, Naren Sarayu	STOC '24: "Near-Optimal Streaming Ellipsoidal ..." Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes Yury Makarychev, Naren Sarayu Manoj, and Max Ovsiankin (Toyota Technological Institute, Chicago, USA) @InProceedings{STOC24p1705, author = {Yury Makarychev and Naren Sarayu Manoj and Max Ovsiankin}, title = {Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1705-1704}, doi = {10.1145/3618260.3649692}, year = {2024}, } Publisher's Version Article: stoc24main-p440-p (type: Full Paper) doi:10.1145/3618260.3649692
	Mao, Xiao	STOC '24: "Fully Dynamic All-Pairs Shortest ..." Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time Xiao Mao (Stanford University, USA) @InProceedings{STOC24p1261, author = {Xiao Mao}, title = {Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1261-1260}, doi = {10.1145/3618260.3649695}, year = {2024}, } Publisher's Version Article: stoc24main-p466-p (type: Full Paper) doi:10.1145/3618260.3649695 STOC '24: "(1 − 𝜀)-Approximation ..." (1 − 𝜀)-Approximation of Knapsack in Nearly Quadratic Time Xiao Mao (Stanford University, USA) @InProceedings{STOC24p337, author = {Xiao Mao}, title = {(1 − <i>𝜀</i>)-Approximation of Knapsack in Nearly Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {337-336}, doi = {10.1145/3618260.3649677}, year = {2024}, } Publisher's Version Article: stoc24main-p365-p (type: Full Paper) doi:10.1145/3618260.3649677
	Mao, Yuchen	STOC '24: "A Nearly Quadratic-Time FPTAS ..." A Nearly Quadratic-Time FPTAS for Knapsack Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p325, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {A Nearly Quadratic-Time FPTAS for Knapsack}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {325-324}, doi = {10.1145/3618260.3649730}, year = {2024}, } Publisher's Version Article: stoc24main-p797-p (type: Full Paper) doi:10.1145/3618260.3649730 STOC '24: "Approximating Partition in ..." Approximating Partition in Near-Linear Time Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p349, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {Approximating Partition in Near-Linear Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {349-348}, doi = {10.1145/3618260.3649727}, year = {2024}, } Publisher's Version Article: stoc24main-p758-p (type: Full Paper) doi:10.1145/3618260.3649727
	Marx, Dániel	STOC '24: "Counting Small Induced Subgraphs ..." Counting Small Induced Subgraphs with Edge-Monotone Properties Simon Döring, Dániel Marx, and Philip Wellnitz (MPI-INF, Germany; Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany; Saarland Informatics Campus, Saarbrücken, Germany; CISPA Helmholtz Center for Information Security, Germany) @InProceedings{STOC24p1693, author = {Simon Döring and Dániel Marx and Philip Wellnitz}, title = {Counting Small Induced Subgraphs with Edge-Monotone Properties}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1693-1692}, doi = {10.1145/3618260.3649644}, year = {2024}, } Publisher's Version Article: stoc24main-p162-p (type: Full Paper) doi:10.1145/3618260.3649644
	Masařík, Tomáš	STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Mastel, Kieran	STOC '24: "Two Prover Perfect Zero Knowledge ..." Two Prover Perfect Zero Knowledge for MIP* Kieran Mastel and William Slofstra (University of Waterloo, Canada) @InProceedings{STOC24p1093, author = {Kieran Mastel and William Slofstra}, title = {Two Prover Perfect Zero Knowledge for MIP*}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1093-1092}, doi = {10.1145/3618260.3649702}, year = {2024}, } Publisher's Version Article: stoc24main-p555-p (type: Full Paper) doi:10.1145/3618260.3649702
	Mathialagan, Surya	STOC '24: "Towards Optimal Output-Sensitive ..." Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu (Morgan Stanley Research, Canada; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1021, author = {Mina Dalirrooyfard and Surya Mathialagan and Virginia Vassilevska Williams and Yinzhan Xu}, title = {Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1021-1020}, doi = {10.1145/3618260.3649663}, year = {2024}, } Publisher's Version Article: stoc24main-p288-p (type: Full Paper) doi:10.1145/3618260.3649663
	Mátravölgyi, Bence	STOC '24: "Reconfiguration of Basis Pairs ..." Reconfiguration of Basis Pairs in Regular Matroids Kristóf Bérczi, Bence Mátravölgyi, and Tamás Schwarcz (University of Eötvös Loránd, Hungary; ETH Zurich, Switzerland) @InProceedings{STOC24p1837, author = {Kristóf Bérczi and Bence Mátravölgyi and Tamás Schwarcz}, title = {Reconfiguration of Basis Pairs in Regular Matroids}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1837-1836}, doi = {10.1145/3618260.3649660}, year = {2024}, } Publisher's Version Article: stoc24main-p269-p (type: Full Paper) doi:10.1145/3618260.3649660
	McClean, Jarrod R.	STOC '24: "Learning Shallow Quantum Circuits ..." Learning Shallow Quantum Circuits Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean (California Institute of Technology, USA; Google Quantum AI, USA; University of California at Berkeley, USA; University of California at Davis, USA; Harvard University, USA) @InProceedings{STOC24p1489, author = {Hsin-Yuan Huang and Yunchao Liu and Michael Broughton and Isaac Kim and Anurag Anshu and Zeph Landau and Jarrod R. McClean}, title = {Learning Shallow Quantum Circuits}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1489-1488}, doi = {10.1145/3618260.3649722}, year = {2024}, } Publisher's Version Article: stoc24main-p715-p (type: Full Paper) doi:10.1145/3618260.3649722
	McKenzie, Theo	STOC '24: "Explicit Two-Sided Unique-Neighbor ..." Explicit Two-Sided Unique-Neighbor Expanders Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes (Carnegie Mellon University, USA; Stanford University, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p865, author = {Jun-Ting Hsieh and Theo McKenzie and Sidhanth Mohanty and Pedro Paredes}, title = {Explicit Two-Sided Unique-Neighbor Expanders}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {865-864}, doi = {10.1145/3618260.3649705}, year = {2024}, } Publisher's Version Article: stoc24main-p566-p (type: Full Paper) doi:10.1145/3618260.3649705
	Mehraban, Saeed	STOC '24: "Quadratic Lower Bounds on ..." Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach Saeed Mehraban and Mehrdad Tahmasbi (Tufts University, USA; University of Illinois at Urbana-Champaign, USA) @InProceedings{STOC24p673, author = {Saeed Mehraban and Mehrdad Tahmasbi}, title = {Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {673-672}, doi = {10.1145/3618260.3649733}, year = {2024}, } Publisher's Version Article: stoc24main-p819-p (type: Full Paper) doi:10.1145/3618260.3649733
	Mehta, Aranyak	STOC '24: "The Power of Two-Sided Recruitment ..." The Power of Two-Sided Recruitment in Two-Sided Markets Yang Cai, Christopher Liaw, Aranyak Mehta, and Mingfei Zhao (Yale University, USA; Google Research, USA) @InProceedings{STOC24p241, author = {Yang Cai and Christopher Liaw and Aranyak Mehta and Mingfei Zhao}, title = {The Power of Two-Sided Recruitment in Two-Sided Markets}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {241-240}, doi = {10.1145/3618260.3649669}, year = {2024}, } Publisher's Version Article: stoc24main-p319-p (type: Full Paper) doi:10.1145/3618260.3649669
	Meierhans, Simon	STOC '24: "Almost-Linear Time Algorithms ..." Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg (Carnegie Mellon University, USA; ETH Zurich, Switzerland; Institute for Advanced Study, Princeton, USA) @InProceedings{STOC24p1285, author = {Li Chen and Rasmus Kyng and Yang P. Liu and Simon Meierhans and Maximilian Probst Gutenberg}, title = {Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1285-1284}, doi = {10.1145/3618260.3649745}, year = {2024}, } Publisher's Version Article: stoc24main-p949-p (type: Full Paper) doi:10.1145/3618260.3649745 STOC '24: "A Dynamic Shortest Paths Toolbox: ..." A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications Rasmus Kyng, Simon Meierhans, and Maximilian Probst Gutenberg (ETH Zurich, Switzerland) @InProceedings{STOC24p1297, author = {Rasmus Kyng and Simon Meierhans and Maximilian Probst Gutenberg}, title = {A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1297-1296}, doi = {10.1145/3618260.3649767}, year = {2024}, } Publisher's Version Article: stoc24main-p1197-p (type: Full Paper) doi:10.1145/3618260.3649767
	Meka, Raghu	STOC '24: "New Graph Decompositions and ..." New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka (Weizmann Institute of Science, Israel; University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1033, author = {Amir Abboud and Nick Fischer and Zander Kelley and Shachar Lovett and Raghu Meka}, title = {New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1033-1032}, doi = {10.1145/3618260.3649696}, year = {2024}, } Publisher's Version Article: stoc24main-p481-p (type: Full Paper) doi:10.1145/3618260.3649696 STOC '24: "Explicit Separations between ..." Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication Zander Kelley, Shachar Lovett, and Raghu Meka (University of Illinois at Urbana-Champaign, USA; University of California at San Diego, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p1441, author = {Zander Kelley and Shachar Lovett and Raghu Meka}, title = {Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1441-1440}, doi = {10.1145/3618260.3649721}, year = {2024}, } Publisher's Version Article: stoc24main-p701-p (type: Full Paper) doi:10.1145/3618260.3649721
	Mertz, Ian	STOC '24: "Tree Evaluation Is in Space ..." Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛) James Cook and Ian Mertz (Unaffiliated, Canada; University of Warwick, United Kingdom) @InProceedings{STOC24p1405, author = {James Cook and Ian Mertz}, title = {Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1405-1404}, doi = {10.1145/3618260.3649664}, year = {2024}, } Publisher's Version Article: stoc24main-p294-p (type: Full Paper) doi:10.1145/3618260.3649664
	Minzer, Dor	STOC '24: "Product Mixing in Compact ..." Product Mixing in Compact Lie Groups David Ellis, Guy Kindler, Noam Lifshitz, and Dor Minzer (University of Bristol, United Kingdom; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1573, author = {David Ellis and Guy Kindler and Noam Lifshitz and Dor Minzer}, title = {Product Mixing in Compact Lie Groups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1573-1572}, doi = {10.1145/3618260.3649626}, year = {2024}, } Publisher's Version Article: stoc24main-p91-p (type: Full Paper) doi:10.1145/3618260.3649626 STOC '24: "On Approximability of Satisfiable ..." On Approximability of Satisfiable k-CSPs: IV Amey Bhangale, Subhash Khot, and Dor Minzer (University of California at Riverside, USA; New York University, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1585, author = {Amey Bhangale and Subhash Khot and Dor Minzer}, title = {On Approximability of Satisfiable k-CSPs: IV}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1585-1584}, doi = {10.1145/3618260.3649610}, year = {2024}, } Publisher's Version Article: stoc24main-p34-p (type: Full Paper) doi:10.1145/3618260.3649610 STOC '24: "Characterizing Direct Product ..." Characterizing Direct Product Testing via Coboundary Expansion Mitali Bafna and Dor Minzer (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p2197, author = {Mitali Bafna and Dor Minzer}, title = {Characterizing Direct Product Testing via Coboundary Expansion}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2197-2196}, doi = {10.1145/3618260.3649714}, year = {2024}, } Publisher's Version Article: stoc24main-p610-p (type: Full Paper) doi:10.1145/3618260.3649714 STOC '24: "Near Optimal Alphabet-Soundness ..." Near Optimal Alphabet-Soundness Tradeoff PCPs Dor Minzer and Kai Zhe Zheng (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p37, author = {Dor Minzer and Kai Zhe Zheng}, title = {Near Optimal Alphabet-Soundness Tradeoff PCPs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {37-36}, doi = {10.1145/3618260.3649606}, year = {2024}, } Publisher's Version Article: stoc24main-p21-p (type: Full Paper) doi:10.1145/3618260.3649606 STOC '24: "Influences in Mixing Measures ..." Influences in Mixing Measures Frederic Koehler, Noam Lifshitz, Dor Minzer, and Elchanan Mossel (University of Chicago, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p589, author = {Frederic Koehler and Noam Lifshitz and Dor Minzer and Elchanan Mossel}, title = {Influences in Mixing Measures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {589-588}, doi = {10.1145/3618260.3649731}, year = {2024}, } Publisher's Version Article: stoc24main-p798-p (type: Full Paper) doi:10.1145/3618260.3649731
	Mirrokni, Vahab	STOC '24: "Optimal Communication Bounds ..." Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, and Peilin Zhong (Google, United Kingdom; Carnegie Mellon University, USA; Google Research, USA) @InProceedings{STOC24p2125, author = {Hossein Esfandiari and Praneeth Kacham and Vahab Mirrokni and David P. Woodruff and Peilin Zhong}, title = {Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2125-2124}, doi = {10.1145/3618260.3649742}, year = {2024}, } Publisher's Version Article: stoc24main-p901-p (type: Full Paper) doi:10.1145/3618260.3649742
	Modanese, Augusto	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Mohanty, Sidhanth	STOC '24: "Robust Recovery for Stochastic ..." Robust Recovery for Stochastic Block Models, Simplified and Generalized Sidhanth Mohanty, Prasad Raghavendra, and David X. Wu (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p421, author = {Sidhanth Mohanty and Prasad Raghavendra and David X. Wu}, title = {Robust Recovery for Stochastic Block Models, Simplified and Generalized}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {421-420}, doi = {10.1145/3618260.3649761}, year = {2024}, } Publisher's Version Article: stoc24main-p1111-p (type: Full Paper) doi:10.1145/3618260.3649761 STOC '24: "Explicit Two-Sided Unique-Neighbor ..." Explicit Two-Sided Unique-Neighbor Expanders Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes (Carnegie Mellon University, USA; Stanford University, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p865, author = {Jun-Ting Hsieh and Theo McKenzie and Sidhanth Mohanty and Pedro Paredes}, title = {Explicit Two-Sided Unique-Neighbor Expanders}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {865-864}, doi = {10.1145/3618260.3649705}, year = {2024}, } Publisher's Version Article: stoc24main-p566-p (type: Full Paper) doi:10.1145/3618260.3649705
	Moitra, Ankur	STOC '24: "Learning Quantum Hamiltonians ..." Learning Quantum Hamiltonians at Any Temperature in Polynomial Time Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1633, author = {Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang}, title = {Learning Quantum Hamiltonians at Any Temperature in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1633-1632}, doi = {10.1145/3618260.3649619}, year = {2024}, } Publisher's Version Article: stoc24main-p62-p (type: Full Paper) doi:10.1145/3618260.3649619 STOC '24: "Exploring and Learning in ..." Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles Noah Golowich, Ankur Moitra, and Dhruv Rohatgi (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p217, author = {Noah Golowich and Ankur Moitra and Dhruv Rohatgi}, title = {Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {217-216}, doi = {10.1145/3618260.3649710}, year = {2024}, } Publisher's Version Article: stoc24main-p579-p (type: Full Paper) doi:10.1145/3618260.3649710
	Molinaro, Marco	STOC '24: "Supermodular Approximation ..." Supermodular Approximation of Norms and Applications Thomas Kesselheim, Marco Molinaro, and Sahil Singla (University of Bonn, Bonn, Germany; PUC-Rio, Brazil; Georgia Institute of Technology, USA) @InProceedings{STOC24p2053, author = {Thomas Kesselheim and Marco Molinaro and Sahil Singla}, title = {Supermodular Approximation of Norms and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2053-2052}, doi = {10.1145/3618260.3649734}, year = {2024}, } Publisher's Version Article: stoc24main-p820-p (type: Full Paper) doi:10.1145/3618260.3649734
	Mon, Geoffrey	STOC '24: "Relaxed Local Correctability ..." Relaxed Local Correctability from Local Testing Vinayak M. Kumar and Geoffrey Mon (University of Texas at Austin, USA) @InProceedings{STOC24p1765, author = {Vinayak M. Kumar and Geoffrey Mon}, title = {Relaxed Local Correctability from Local Testing}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1765-1764}, doi = {10.1145/3618260.3649611}, year = {2024}, } Publisher's Version Article: stoc24main-p43-p (type: Full Paper) doi:10.1145/3618260.3649611
	Montanaro, Ashley	STOC '24: "Quantum and Classical Query ..." Quantum and Classical Query Complexities of Functions of Matrices Ashley Montanaro and Changpeng Shao (University of Bristol, United Kingdom; Academy of Mathematics and Systems Science at Chinese Academy of Sciences, China) @InProceedings{STOC24p637, author = {Ashley Montanaro and Changpeng Shao}, title = {Quantum and Classical Query Complexities of Functions of Matrices}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {637-636}, doi = {10.1145/3618260.3649665}, year = {2024}, } Publisher's Version Article: stoc24main-p296-p (type: Full Paper) doi:10.1145/3618260.3649665
	Moran, Shay	STOC '24: "Local Borsuk-Ulam, Stability, ..." Local Borsuk-Ulam, Stability, and Replicability Zachary Chase, Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff (Technion, Israel; Google Research, Israel; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p1969, author = {Zachary Chase and Bogdan Chornomaz and Shay Moran and Amir Yehudayoff}, title = {Local Borsuk-Ulam, Stability, and Replicability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1969-1968}, doi = {10.1145/3618260.3649632}, year = {2024}, } Publisher's Version Article: stoc24main-p119-p (type: Full Paper) doi:10.1145/3618260.3649632
	Mossel, Elchanan	STOC '24: "A Unified Approach to Learning ..." A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width Jason Gaitonde and Elchanan Mossel (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p565, author = {Jason Gaitonde and Elchanan Mossel}, title = {A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {565-564}, doi = {10.1145/3618260.3649674}, year = {2024}, } Publisher's Version Article: stoc24main-p346-p (type: Full Paper) doi:10.1145/3618260.3649674 STOC '24: "Influences in Mixing Measures ..." Influences in Mixing Measures Frederic Koehler, Noam Lifshitz, Dor Minzer, and Elchanan Mossel (University of Chicago, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p589, author = {Frederic Koehler and Noam Lifshitz and Dor Minzer and Elchanan Mossel}, title = {Influences in Mixing Measures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {589-588}, doi = {10.1145/3618260.3649731}, year = {2024}, } Publisher's Version Article: stoc24main-p798-p (type: Full Paper) doi:10.1145/3618260.3649731
	Mukhopadhyay, Partha	STOC '24: "Black-Box Identity Testing ..." Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time V. Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay (Institute of Mathematical Sciences, India; Chennai Mathematical Institute, India; Indian Statistical Institute, Kolkata, India) @InProceedings{STOC24p133, author = {V. Arvind and Abhranil Chatterjee and Partha Mukhopadhyay}, title = {Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {133-132}, doi = {10.1145/3618260.3649693}, year = {2024}, } Publisher's Version Article: stoc24main-p448-p (type: Full Paper) doi:10.1145/3618260.3649693
	Nadimpalli, Shivam	STOC '24: "Detecting Low-Degree Truncation ..." Detecting Low-Degree Truncation Anindya De, Huan Li, Shivam Nadimpalli, and Rocco A. Servedio (University of Pennsylvania, USA; Columbia University, USA) @InProceedings{STOC24p1141, author = {Anindya De and Huan Li and Shivam Nadimpalli and Rocco A. Servedio}, title = {Detecting Low-Degree Truncation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1141-1140}, doi = {10.1145/3618260.3649633}, year = {2024}, } Publisher's Version Article: stoc24main-p129-p (type: Full Paper) doi:10.1145/3618260.3649633 STOC '24: "Optimal Non-adaptive Tolerant ..." Optimal Non-adaptive Tolerant Junta Testing via Local Estimators Shivam Nadimpalli and Shyamal Patel (Columbia University, USA) @InProceedings{STOC24p1153, author = {Shivam Nadimpalli and Shyamal Patel}, title = {Optimal Non-adaptive Tolerant Junta Testing via Local Estimators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1153-1152}, doi = {10.1145/3618260.3649687}, year = {2024}, } Publisher's Version Article: stoc24main-p420-p (type: Full Paper) doi:10.1145/3618260.3649687 STOC '24: "On the Pauli Spectrum of QAC0 ..." On the Pauli Spectrum of QAC0 Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen (Columbia University, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1669, author = {Shivam Nadimpalli and Natalie Parham and Francisca Vasconcelos and Henry Yuen}, title = {On the Pauli Spectrum of QAC0}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1669-1668}, doi = {10.1145/3618260.3649662}, year = {2024}, } Publisher's Version Article: stoc24main-p287-p (type: Full Paper) doi:10.1145/3618260.3649662
	Naidu, Kheeran K.	STOC '24: "O(log log n) Passes Is Optimal ..." O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, and Janani Sundaresan (University of Waterloo, Canada; Rutgers University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p925, author = {Sepehr Assadi and Christian Konrad and Kheeran K. Naidu and Janani Sundaresan}, title = {O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {925-924}, doi = {10.1145/3618260.3649763}, year = {2024}, } Publisher's Version Article: stoc24main-p1123-p (type: Full Paper) doi:10.1145/3618260.3649763
	Nanashima, Mikito	STOC '24: "One-Way Functions and Zero ..." One-Way Functions and Zero Knowledge Shuichi Hirahara and Mikito Nanashima (National Institute of Informatics, Tokyo, Japan; Tokyo Institute of Technology, Tokyo, Japan) @InProceedings{STOC24p1921, author = {Shuichi Hirahara and Mikito Nanashima}, title = {One-Way Functions and Zero Knowledge}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1921-1920}, doi = {10.1145/3618260.3649701}, year = {2024}, } Publisher's Version Article: stoc24main-p553-p (type: Full Paper) doi:10.1145/3618260.3649701
	Narayan, Vishnu V.	STOC '24: "Fair Division via Quantile ..." Fair Division via Quantile Shares Yakov Babichenko, Michal Feldman, Ron Holzman, and Vishnu V. Narayan (Technion, Israel; Tel Aviv University, Israel) @InProceedings{STOC24p1369, author = {Yakov Babichenko and Michal Feldman and Ron Holzman and Vishnu V. Narayan}, title = {Fair Division via Quantile Shares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1369-1368}, doi = {10.1145/3618260.3649728}, year = {2024}, } Publisher's Version Article: stoc24main-p764-p (type: Full Paper) doi:10.1145/3618260.3649728
	Natura, Bento	STOC '24: "A Strongly Polynomial Algorithm ..." A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh (CWI, Amsterdam, Netherlands; Georgia Institute of Technology, USA; London School of Economics, United Kingdom) @InProceedings{STOC24p1741, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1741-1740}, doi = {10.1145/3618260.3649764}, year = {2024}, } Publisher's Version Article: stoc24main-p1131-p (type: Full Paper) doi:10.1145/3618260.3649764
	Newman, Alantha	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749
	Newman, Ilan	STOC '24: "Hardness Condensation by Restriction ..." Hardness Condensation by Restriction Mika Göös, Ilan Newman, Artur Riazanov, and Dmitry Sokolov (EPFL, Lausanne, Switzerland; University of Haifa, Israel) @InProceedings{STOC24p2245, author = {Mika Göös and Ilan Newman and Artur Riazanov and Dmitry Sokolov}, title = {Hardness Condensation by Restriction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2245-2244}, doi = {10.1145/3618260.3649711}, year = {2024}, } Publisher's Version Article: stoc24main-p586-p (type: Full Paper) doi:10.1145/3618260.3649711
	Ng, Hiu Tsun	STOC '24: "How Random CSPs Fool Hierarchies ..." How Random CSPs Fool Hierarchies Siu On Chan, Hiu Tsun Ng, and Sijin Peng (Unaffiliated, Hong Kong, China; Chinese University of Hong Kong, China; Tsinghua University, China) @InProceedings{STOC24p2161, author = {Siu On Chan and Hiu Tsun Ng and Sijin Peng}, title = {How Random CSPs Fool Hierarchies}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2161-2160}, doi = {10.1145/3618260.3649613}, year = {2024}, } Publisher's Version Article: stoc24main-p48-p (type: Full Paper) doi:10.1145/3618260.3649613
	Nguyen, Quynh T.	STOC '24: "Circuit-to-Hamiltonian from ..." Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance Anurag Anshu, Nikolas P. Breuckmann, and Quynh T. Nguyen (Harvard University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p649, author = {Anurag Anshu and Nikolas P. Breuckmann and Quynh T. Nguyen}, title = {Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {649-648}, doi = {10.1145/3618260.3649690}, year = {2024}, } Publisher's Version Article: stoc24main-p434-p (type: Full Paper) doi:10.1145/3618260.3649690
	Niazadeh, Rad	STOC '24: "Prophet Inequalities with ..." Prophet Inequalities with Cancellation Costs Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, and Jan Vondrák (University of Chicago, USA; Stanford University, USA) @InProceedings{STOC24p1381, author = {Farbod Ekbatani and Rad Niazadeh and Pranav Nuti and Jan Vondrák}, title = {Prophet Inequalities with Cancellation Costs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1381-1380}, doi = {10.1145/3618260.3649786}, year = {2024}, } Publisher's Version Article: stoc24main-p1593-p (type: Full Paper) doi:10.1145/3618260.3649786
	Nogler, Jakob	STOC '24: "On the Communication Complexity ..." On the Communication Complexity of Approximate Pattern Matching Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz (MPI-INF, Germany; Saarland Informatics Campus, Saarbrücken, Germany; ETH Zurich, Switzerland) @InProceedings{STOC24p1957, author = {Tomasz Kociumaka and Jakob Nogler and Philip Wellnitz}, title = {On the Communication Complexity of Approximate Pattern Matching}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1957-1956}, doi = {10.1145/3618260.3649604}, year = {2024}, } Publisher's Version Article: stoc24main-p13-p (type: Full Paper) doi:10.1145/3618260.3649604
	Nusser, André	STOC '24: "Minimum Star Partitions of ..." Minimum Star Partitions of Simple Polygons in Polynomial Time Mikkel Abrahamsen, Joakim Blikstad, André Nusser, and Hanwen Zhang (University of Copenhagen, Copenhagen, Denmark; KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany) @InProceedings{STOC24p997, author = {Mikkel Abrahamsen and Joakim Blikstad and André Nusser and Hanwen Zhang}, title = {Minimum Star Partitions of Simple Polygons in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {997-996}, doi = {10.1145/3618260.3649756}, year = {2024}, } Publisher's Version Article: stoc24main-p1052-p (type: Full Paper) doi:10.1145/3618260.3649756
	Nuti, Pranav	STOC '24: "Prophet Inequalities with ..." Prophet Inequalities with Cancellation Costs Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, and Jan Vondrák (University of Chicago, USA; Stanford University, USA) @InProceedings{STOC24p1381, author = {Farbod Ekbatani and Rad Niazadeh and Pranav Nuti and Jan Vondrák}, title = {Prophet Inequalities with Cancellation Costs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1381-1380}, doi = {10.1145/3618260.3649786}, year = {2024}, } Publisher's Version Article: stoc24main-p1593-p (type: Full Paper) doi:10.1145/3618260.3649786
	O'Connor, Jack	STOC '24: "Perfect Zero-Knowledge PCPs ..." Perfect Zero-Knowledge PCPs for #P Tom Gur, Jack O'Connor, and Nicholas Spooner (University of Cambridge, United Kingdom; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1909, author = {Tom Gur and Jack O'Connor and Nicholas Spooner}, title = {Perfect Zero-Knowledge PCPs for #P}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1909-1908}, doi = {10.1145/3618260.3649698}, year = {2024}, } Publisher's Version Article: stoc24main-p520-p (type: Full Paper) doi:10.1145/3618260.3649698
	Ohsaka, Naoto	STOC '24: "Probabilistically Checkable ..." Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems Shuichi Hirahara and Naoto Ohsaka (National Institute of Informatics, Tokyo, Japan; CyberAgent, Japan) @InProceedings{STOC24p1597, author = {Shuichi Hirahara and Naoto Ohsaka}, title = {Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1597-1596}, doi = {10.1145/3618260.3649667}, year = {2024}, } Publisher's Version Article: stoc24main-p311-p (type: Full Paper) doi:10.1145/3618260.3649667
	Oliveira, Rafael	STOC '24: "Strong Algebras and Radical ..." Strong Algebras and Radical Sylvester-Gallai Configurations Rafael Oliveira and Akash Kumar Sengupta (University of Waterloo, Canada) @InProceedings{STOC24p121, author = {Rafael Oliveira and Akash Kumar Sengupta}, title = {Strong Algebras and Radical Sylvester-Gallai Configurations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {121-120}, doi = {10.1145/3618260.3649617}, year = {2024}, } Publisher's Version Article: stoc24main-p58-p (type: Full Paper) doi:10.1145/3618260.3649617
	Olver, Neil	STOC '24: "A Strongly Polynomial Algorithm ..." A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh (CWI, Amsterdam, Netherlands; Georgia Institute of Technology, USA; London School of Economics, United Kingdom) @InProceedings{STOC24p1741, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1741-1740}, doi = {10.1145/3618260.3649764}, year = {2024}, } Publisher's Version Article: stoc24main-p1131-p (type: Full Paper) doi:10.1145/3618260.3649764
	Opler, Michal	STOC '24: "Optimization with Pattern-Avoiding ..." Optimization with Pattern-Avoiding Input Benjamin Aram Berendsohn, László Kozma, and Michal Opler (Freie Universität Berlin, Berlin, Germany; Czech Technical University, Prague, Czechia) @InProceedings{STOC24p745, author = {Benjamin Aram Berendsohn and László Kozma and Michal Opler}, title = {Optimization with Pattern-Avoiding Input}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {745-744}, doi = {10.1145/3618260.3649631}, year = {2024}, } Publisher's Version Article: stoc24main-p118-p (type: Full Paper) doi:10.1145/3618260.3649631
	Ostuni, Anthony	STOC '24: "Locality Bounds for Sampling ..." Locality Bounds for Sampling Hamming Slices Daniel M. Kane, Anthony Ostuni, and Kewen Wu (University of California at San Diego, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1417, author = {Daniel M. Kane and Anthony Ostuni and Kewen Wu}, title = {Locality Bounds for Sampling Hamming Slices}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1417-1416}, doi = {10.1145/3618260.3649670}, year = {2024}, } Publisher's Version Article: stoc24main-p320-p (type: Full Paper) doi:10.1145/3618260.3649670
	Ovsiankin, Max	STOC '24: "Near-Optimal Streaming Ellipsoidal ..." Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes Yury Makarychev, Naren Sarayu Manoj, and Max Ovsiankin (Toyota Technological Institute, Chicago, USA) @InProceedings{STOC24p1705, author = {Yury Makarychev and Naren Sarayu Manoj and Max Ovsiankin}, title = {Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1705-1704}, doi = {10.1145/3618260.3649692}, year = {2024}, } Publisher's Version Article: stoc24main-p440-p (type: Full Paper) doi:10.1145/3618260.3649692
	Padmanabhan, Swati	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787
	Pak, Igor	STOC '24: "Equality Cases of the Alexandrov–Fenchel ..." Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy Swee Hong Chan and Igor Pak (Rutgers University, USA; University of California at Los Angeles, USA) @InProceedings{STOC24p961, author = {Swee Hong Chan and Igor Pak}, title = {Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {961-960}, doi = {10.1145/3618260.3649646}, year = {2024}, } Publisher's Version Article: stoc24main-p167-p (type: Full Paper) doi:10.1145/3618260.3649646
	Paneth, Omer	STOC '24: "Batch Proofs Are Statistically ..." Batch Proofs Are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan (Tel Aviv University, Israel; IIT Bombay, India; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p493, author = {Nir Bitansky and Chethan Kamath and Omer Paneth and Ron D. Rothblum and Prashant Nalini Vasudevan}, title = {Batch Proofs Are Statistically Hiding}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {493-492}, doi = {10.1145/3618260.3649775}, year = {2024}, } Publisher's Version Article: stoc24main-p1365-p (type: Full Paper) doi:10.1145/3618260.3649775
	Panigrahi, Debmalya	STOC '24: "Hypergraph Unreliability in ..." Hypergraph Unreliability in Quasi-Polynomial Time Ruoxu Cen, Jason Li, and Debmalya Panigrahi (Duke University, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1885, author = {Ruoxu Cen and Jason Li and Debmalya Panigrahi}, title = {Hypergraph Unreliability in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1885-1884}, doi = {10.1145/3618260.3649753}, year = {2024}, } Publisher's Version Article: stoc24main-p1042-p (type: Full Paper) doi:10.1145/3618260.3649753
	Paraashar, Manaswi	STOC '24: "Local Correction of Linear ..." Local Correction of Linear Functions over the Boolean Cube Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, and Madhu Sudan (Harvard University, USA; Aarhus University, Aarhus, Denmark; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p841, author = {Prashanth Amireddy and Amik Raj Behera and Manaswi Paraashar and Srikanth Srinivasan and Madhu Sudan}, title = {Local Correction of Linear Functions over the Boolean Cube}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {841-840}, doi = {10.1145/3618260.3649746}, year = {2024}, } Publisher's Version Article: stoc24main-p954-p (type: Full Paper) doi:10.1145/3618260.3649746
	Paredes, Pedro	STOC '24: "Explicit Two-Sided Unique-Neighbor ..." Explicit Two-Sided Unique-Neighbor Expanders Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes (Carnegie Mellon University, USA; Stanford University, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p865, author = {Jun-Ting Hsieh and Theo McKenzie and Sidhanth Mohanty and Pedro Paredes}, title = {Explicit Two-Sided Unique-Neighbor Expanders}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {865-864}, doi = {10.1145/3618260.3649705}, year = {2024}, } Publisher's Version Article: stoc24main-p566-p (type: Full Paper) doi:10.1145/3618260.3649705
	Parekh, Ojas	STOC '24: "Exponential Quantum Space ..." Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model John Kallaugher, Ojas Parekh, and Nadezhda Voronova (Sandia National Laboratories, USA; Boston University, USA) @InProceedings{STOC24p2005, author = {John Kallaugher and Ojas Parekh and Nadezhda Voronova}, title = {Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2005-2004}, doi = {10.1145/3618260.3649709}, year = {2024}, } Publisher's Version Article: stoc24main-p577-p (type: Full Paper) doi:10.1145/3618260.3649709
	Parham, Natalie	STOC '24: "On the Pauli Spectrum of QAC0 ..." On the Pauli Spectrum of QAC0 Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen (Columbia University, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1669, author = {Shivam Nadimpalli and Natalie Parham and Francisca Vasconcelos and Henry Yuen}, title = {On the Pauli Spectrum of QAC0}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1669-1668}, doi = {10.1145/3618260.3649662}, year = {2024}, } Publisher's Version Article: stoc24main-p287-p (type: Full Paper) doi:10.1145/3618260.3649662
	Parter, Merav	STOC '24: "Connectivity Labeling and ..." Connectivity Labeling and Routing with Multiple Vertex Failures Merav Parter, Asaf Petruschka, and Seth Pettie (Weizmann Institute of Science, Israel; University of Michigan, USA) @InProceedings{STOC24p901, author = {Merav Parter and Asaf Petruschka and Seth Pettie}, title = {Connectivity Labeling and Routing with Multiple Vertex Failures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {901-900}, doi = {10.1145/3618260.3649729}, year = {2024}, } Publisher's Version Article: stoc24main-p785-p (type: Full Paper) doi:10.1145/3618260.3649729
	Patel, Neel	STOC '24: "Limitations of Stochastic ..." Limitations of Stochastic Selection Problems with Pairwise Independent Priors Shaddin Dughmi, Yusuf Hakan Kalayci, and Neel Patel (University of Southern California, USA) @InProceedings{STOC24p541, author = {Shaddin Dughmi and Yusuf Hakan Kalayci and Neel Patel}, title = {Limitations of Stochastic Selection Problems with Pairwise Independent Priors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {541-540}, doi = {10.1145/3618260.3649718}, year = {2024}, } Publisher's Version Article: stoc24main-p655-p (type: Full Paper) doi:10.1145/3618260.3649718
	Patel, Shyamal	STOC '24: "Optimal Non-adaptive Tolerant ..." Optimal Non-adaptive Tolerant Junta Testing via Local Estimators Shivam Nadimpalli and Shyamal Patel (Columbia University, USA) @InProceedings{STOC24p1153, author = {Shivam Nadimpalli and Shyamal Patel}, title = {Optimal Non-adaptive Tolerant Junta Testing via Local Estimators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1153-1152}, doi = {10.1145/3618260.3649687}, year = {2024}, } Publisher's Version Article: stoc24main-p420-p (type: Full Paper) doi:10.1145/3618260.3649687 STOC '24: "Distribution-Free Testing ..." Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries Xi Chen, Yumou Fei, and Shyamal Patel (Columbia University, USA; Peking University, China) @InProceedings{STOC24p1165, author = {Xi Chen and Yumou Fei and Shyamal Patel}, title = {Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1165-1164}, doi = {10.1145/3618260.3649717}, year = {2024}, } Publisher's Version Article: stoc24main-p650-p (type: Full Paper) doi:10.1145/3618260.3649717 STOC '24: "Polylog-Competitive Deterministic ..." Polylog-Competitive Deterministic Local Routing and Scheduling Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Columbia University, USA; Google Research, Switzerland) @InProceedings{STOC24p889, author = {Bernhard Haeupler and Shyamal Patel and Antti Roeyskoe and Cliff Stein and Goran Zuzic}, title = {Polylog-Competitive Deterministic Local Routing and Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {889-888}, doi = {10.1145/3618260.3649678}, year = {2024}, } Publisher's Version Article: stoc24main-p370-p (type: Full Paper) doi:10.1145/3618260.3649678
	Pegden, Wesley	STOC '24: "Sampling Balanced Forests ..." Sampling Balanced Forests of Grids in Polynomial Time Sarah Cannon, Wesley Pegden, and Jamie Tucker-Foltz (Claremont McKenna College, USA; Carnegie Mellon University, USA; Harvard University, USA) @InProceedings{STOC24p1861, author = {Sarah Cannon and Wesley Pegden and Jamie Tucker-Foltz}, title = {Sampling Balanced Forests of Grids in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1861-1860}, doi = {10.1145/3618260.3649699}, year = {2024}, } Publisher's Version Article: stoc24main-p525-p (type: Full Paper) doi:10.1145/3618260.3649699
	Peng, Binghui	STOC '24: "Fast Swap Regret Minimization ..." Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria Binghui Peng and Aviad Rubinstein (Columbia University, USA; Stanford University, USA) @InProceedings{STOC24p1357, author = {Binghui Peng and Aviad Rubinstein}, title = {Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1357-1356}, doi = {10.1145/3618260.3649691}, year = {2024}, } Publisher's Version Article: stoc24main-p438-p (type: Full Paper) doi:10.1145/3618260.3649691
	Peng, Sijin	STOC '24: "How Random CSPs Fool Hierarchies ..." How Random CSPs Fool Hierarchies Siu On Chan, Hiu Tsun Ng, and Sijin Peng (Unaffiliated, Hong Kong, China; Chinese University of Hong Kong, China; Tsinghua University, China) @InProceedings{STOC24p2161, author = {Siu On Chan and Hiu Tsun Ng and Sijin Peng}, title = {How Random CSPs Fool Hierarchies}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2161-2160}, doi = {10.1145/3618260.3649613}, year = {2024}, } Publisher's Version Article: stoc24main-p48-p (type: Full Paper) doi:10.1145/3618260.3649613
	Petruschka, Asaf	STOC '24: "Connectivity Labeling and ..." Connectivity Labeling and Routing with Multiple Vertex Failures Merav Parter, Asaf Petruschka, and Seth Pettie (Weizmann Institute of Science, Israel; University of Michigan, USA) @InProceedings{STOC24p901, author = {Merav Parter and Asaf Petruschka and Seth Pettie}, title = {Connectivity Labeling and Routing with Multiple Vertex Failures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {901-900}, doi = {10.1145/3618260.3649729}, year = {2024}, } Publisher's Version Article: stoc24main-p785-p (type: Full Paper) doi:10.1145/3618260.3649729
	Pettie, Seth	STOC '24: "Connectivity Labeling and ..." Connectivity Labeling and Routing with Multiple Vertex Failures Merav Parter, Asaf Petruschka, and Seth Pettie (Weizmann Institute of Science, Israel; University of Michigan, USA) @InProceedings{STOC24p901, author = {Merav Parter and Asaf Petruschka and Seth Pettie}, title = {Connectivity Labeling and Routing with Multiple Vertex Failures}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {901-900}, doi = {10.1145/3618260.3649729}, year = {2024}, } Publisher's Version Article: stoc24main-p785-p (type: Full Paper) doi:10.1145/3618260.3649729
	Pilipczuk, Marcin	STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712 STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Pilipczuk, Michał	STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Pitassi, Toniann	STOC '24: "Black-Box PPP Is Not Turing-Closed ..." Black-Box PPP Is Not Turing-Closed Noah Fleming, Stefan Grosser, Toniann Pitassi, and Robert Robere (Memorial University of Newfoundland, Canada; McGill University, Canada; Columbia University, USA) @InProceedings{STOC24p1561, author = {Noah Fleming and Stefan Grosser and Toniann Pitassi and Robert Robere}, title = {Black-Box PPP Is Not Turing-Closed}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1561-1560}, doi = {10.1145/3618260.3649769}, year = {2024}, } Publisher's Version Article: stoc24main-p1259-p (type: Full Paper) doi:10.1145/3618260.3649769
	Potechin, Aaron	STOC '24: "Sum-of-Squares Lower Bounds ..." Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs Pravesh K. Kothari, Aaron Potechin, and Jeff Xu (Carnegie Mellon University, USA; University of Chicago, USA) @InProceedings{STOC24p2137, author = {Pravesh K. Kothari and Aaron Potechin and Jeff Xu}, title = {Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2137-2136}, doi = {10.1145/3618260.3649703}, year = {2024}, } Publisher's Version Article: stoc24main-p556-p (type: Full Paper) doi:10.1145/3618260.3649703
	Pratt, Kevin	STOC '24: "A Stronger Connection between ..." A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture Kevin Pratt (New York University, USA) @InProceedings{STOC24p949, author = {Kevin Pratt}, title = {A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {949-948}, doi = {10.1145/3618260.3649620}, year = {2024}, } Publisher's Version Article: stoc24main-p64-p (type: Full Paper) doi:10.1145/3618260.3649620
	Preskill, John	STOC '24: "Local Minima in Quantum Systems ..." Local Minima in Quantum Systems Chi-Fang Chen, Hsin-Yuan Huang, John Preskill, and Leo Zhou (California Institute of Technology, USA; AWS Center for Quantum Computing, USA; Google Quantum AI, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1465, author = {Chi-Fang Chen and Hsin-Yuan Huang and John Preskill and Leo Zhou}, title = {Local Minima in Quantum Systems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1465-1464}, doi = {10.1145/3618260.3649675}, year = {2024}, } Publisher's Version Article: stoc24main-p355-p (type: Full Paper) doi:10.1145/3618260.3649675
	Probst Gutenberg, Maximilian	STOC '24: "Almost-Linear Time Algorithms ..." Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, and Maximilian Probst Gutenberg (Carnegie Mellon University, USA; ETH Zurich, Switzerland; Institute for Advanced Study, Princeton, USA) @InProceedings{STOC24p1285, author = {Li Chen and Rasmus Kyng and Yang P. Liu and Simon Meierhans and Maximilian Probst Gutenberg}, title = {Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1285-1284}, doi = {10.1145/3618260.3649745}, year = {2024}, } Publisher's Version Article: stoc24main-p949-p (type: Full Paper) doi:10.1145/3618260.3649745 STOC '24: "A Dynamic Shortest Paths Toolbox: ..." A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications Rasmus Kyng, Simon Meierhans, and Maximilian Probst Gutenberg (ETH Zurich, Switzerland) @InProceedings{STOC24p1297, author = {Rasmus Kyng and Simon Meierhans and Maximilian Probst Gutenberg}, title = {A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1297-1296}, doi = {10.1145/3618260.3649767}, year = {2024}, } Publisher's Version Article: stoc24main-p1197-p (type: Full Paper) doi:10.1145/3618260.3649767
	Pyne, Edward	STOC '24: "Opening Up the Distinguisher: ..." Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL Dean Doron, Edward Pyne, and Roei Tell (Ben-Gurion University of the Negev, Israel; Massachusetts Institute of Technology, USA; University of Toronto, Canada) @InProceedings{STOC24p2269, author = {Dean Doron and Edward Pyne and Roei Tell}, title = {Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2269-2268}, doi = {10.1145/3618260.3649772}, year = {2024}, } Publisher's Version Article: stoc24main-p1312-p (type: Full Paper) doi:10.1145/3618260.3649772
	Qian, Luowen	STOC '24: "An Efficient Quantum Parallel ..." An Efficient Quantum Parallel Repetition Theorem and Applications John Bostanci, Luowen Qian, Nicholas Spooner, and Henry Yuen (Columbia University, USA; Boston University, USA; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1645, author = {John Bostanci and Luowen Qian and Nicholas Spooner and Henry Yuen}, title = {An Efficient Quantum Parallel Repetition Theorem and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1645-1644}, doi = {10.1145/3618260.3649603}, year = {2024}, } Publisher's Version Article: stoc24main-p10-p (type: Full Paper) doi:10.1145/3618260.3649603
	Qiu, Frederick	STOC '24: "Settling the Communication ..." Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees Frederick Qiu and S. Matthew Weinberg (Princeton University, USA) @InProceedings{STOC24p1321, author = {Frederick Qiu and S. Matthew Weinberg}, title = {Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1321-1320}, doi = {10.1145/3618260.3649706}, year = {2024}, } Publisher's Version Article: stoc24main-p568-p (type: Full Paper) doi:10.1145/3618260.3649706
	Raghavendra, Prasad	STOC '24: "Robust Recovery for Stochastic ..." Robust Recovery for Stochastic Block Models, Simplified and Generalized Sidhanth Mohanty, Prasad Raghavendra, and David X. Wu (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p421, author = {Sidhanth Mohanty and Prasad Raghavendra and David X. Wu}, title = {Robust Recovery for Stochastic Block Models, Simplified and Generalized}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {421-420}, doi = {10.1145/3618260.3649761}, year = {2024}, } Publisher's Version Article: stoc24main-p1111-p (type: Full Paper) doi:10.1145/3618260.3649761
	Rajgopal, Ninad	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784
	Rao, Anup	STOC '24: "XOR Lemmas for Communication ..." XOR Lemmas for Communication via Marginal Information Siddharth Iyer and Anup Rao (University of Washington, USA) @InProceedings{STOC24p721, author = {Siddharth Iyer and Anup Rao}, title = {XOR Lemmas for Communication via Marginal Information}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {721-720}, doi = {10.1145/3618260.3649726}, year = {2024}, } Publisher's Version Article: stoc24main-p750-p (type: Full Paper) doi:10.1145/3618260.3649726
	Reis, Victor	STOC '24: "Optimal Online Discrepancy ..." Optimal Online Discrepancy Minimization Janardhan Kulkarni, Victor Reis, and Thomas Rothvoss (Microsoft Research, USA; Institute for Advanced Study, Princeton, USA; University of Washington, USA) @InProceedings{STOC24p2041, author = {Janardhan Kulkarni and Victor Reis and Thomas Rothvoss}, title = {Optimal Online Discrepancy Minimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2041-2040}, doi = {10.1145/3618260.3649720}, year = {2024}, } Publisher's Version Article: stoc24main-p695-p (type: Full Paper) doi:10.1145/3618260.3649720
	Ren, Hanlin	STOC '24: "Symmetric Exponential Time ..." Symmetric Exponential Time Requires Near-Maximum Circuit Size Lijie Chen, Shuichi Hirahara, and Hanlin Ren (University of California at Berkeley, USA; National Institute of Informatics, Tokyo, Japan; University of Oxford, United Kingdom) @InProceedings{STOC24p2209, author = {Lijie Chen and Shuichi Hirahara and Hanlin Ren}, title = {Symmetric Exponential Time Requires Near-Maximum Circuit Size}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2209-2208}, doi = {10.1145/3618260.3649624}, year = {2024}, } Publisher's Version Article: stoc24main-p79-p (type: Full Paper) doi:10.1145/3618260.3649624
	Ren, Xuandi	STOC '24: "Parameterized Inapproximability ..." Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, and Kewen Wu (University of California at Berkeley, USA; Nanjing University, China; Peking University, China) @InProceedings{STOC24p49, author = {Venkatesan Guruswami and Bingkai Lin and Xuandi Ren and Yican Sun and Kewen Wu}, title = {Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {49-48}, doi = {10.1145/3618260.3649771}, year = {2024}, } Publisher's Version Article: stoc24main-p1264-p (type: Full Paper) doi:10.1145/3618260.3649771
	Renou, Marc-Olivier	STOC '24: "Nonlocality under Computational ..." Nonlocality under Computational Assumptions Grzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, and Marc-Olivier Renou (EPFL, Lausanne, Switzerland; Aztec Labs, United Kingdom; Chalmers University of Technology, Sweden; Inria - Université Paris-Saclay - CPHT - École Polytechnique - Institut Polytechnique de Paris, France) @InProceedings{STOC24p1129, author = {Grzegorz Gluch and Khashayar Barooti and Alexandru Gheorghiu and Marc-Olivier Renou}, title = {Nonlocality under Computational Assumptions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1129-1128}, doi = {10.1145/3618260.3649750}, year = {2024}, } Publisher's Version Article: stoc24main-p1004-p (type: Full Paper) doi:10.1145/3618260.3649750 STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Riazanov, Artur	STOC '24: "Hardness Condensation by Restriction ..." Hardness Condensation by Restriction Mika Göös, Ilan Newman, Artur Riazanov, and Dmitry Sokolov (EPFL, Lausanne, Switzerland; University of Haifa, Israel) @InProceedings{STOC24p2245, author = {Mika Göös and Ilan Newman and Artur Riazanov and Dmitry Sokolov}, title = {Hardness Condensation by Restriction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2245-2244}, doi = {10.1145/3618260.3649711}, year = {2024}, } Publisher's Version Article: stoc24main-p586-p (type: Full Paper) doi:10.1145/3618260.3649711
	Robere, Robert	STOC '24: "Black-Box PPP Is Not Turing-Closed ..." Black-Box PPP Is Not Turing-Closed Noah Fleming, Stefan Grosser, Toniann Pitassi, and Robert Robere (Memorial University of Newfoundland, Canada; McGill University, Canada; Columbia University, USA) @InProceedings{STOC24p1561, author = {Noah Fleming and Stefan Grosser and Toniann Pitassi and Robert Robere}, title = {Black-Box PPP Is Not Turing-Closed}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1561-1560}, doi = {10.1145/3618260.3649769}, year = {2024}, } Publisher's Version Article: stoc24main-p1259-p (type: Full Paper) doi:10.1145/3618260.3649769
	Roeyskoe, Antti	STOC '24: "Polylog-Competitive Deterministic ..." Polylog-Competitive Deterministic Local Routing and Scheduling Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Columbia University, USA; Google Research, Switzerland) @InProceedings{STOC24p889, author = {Bernhard Haeupler and Shyamal Patel and Antti Roeyskoe and Cliff Stein and Goran Zuzic}, title = {Polylog-Competitive Deterministic Local Routing and Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {889-888}, doi = {10.1145/3618260.3649678}, year = {2024}, } Publisher's Version Article: stoc24main-p370-p (type: Full Paper) doi:10.1145/3618260.3649678 STOC '24: "Low-Step Multi-commodity Flow ..." Low-Step Multi-commodity Flow Emulators Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, and Thatchaphol Saranurak (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Brown University, USA; University of Michigan, USA) @InProceedings{STOC24p97, author = {Bernhard Haeupler and D. Ellis Hershkowitz and Jason Li and Antti Roeyskoe and Thatchaphol Saranurak}, title = {Low-Step Multi-commodity Flow Emulators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {97-96}, doi = {10.1145/3618260.3649689}, year = {2024}, } Publisher's Version Article: stoc24main-p429-p (type: Full Paper) doi:10.1145/3618260.3649689
	Roghani, Mohammad	STOC '24: "Approximating Maximum Matching ..." Approximating Maximum Matching Requires Almost Quadratic Time Soheil Behnezhad, Mohammad Roghani, and Aviad Rubinstein (Northeastern University, USA; Stanford University, USA) @InProceedings{STOC24p505, author = {Soheil Behnezhad and Mohammad Roghani and Aviad Rubinstein}, title = {Approximating Maximum Matching Requires Almost Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {505-504}, doi = {10.1145/3618260.3649785}, year = {2024}, } Publisher's Version Article: stoc24main-p1563-p (type: Full Paper) doi:10.1145/3618260.3649785
	Rohatgi, Dhruv	STOC '24: "Exploring and Learning in ..." Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles Noah Golowich, Ankur Moitra, and Dhruv Rohatgi (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p217, author = {Noah Golowich and Ankur Moitra and Dhruv Rohatgi}, title = {Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {217-216}, doi = {10.1145/3618260.3649710}, year = {2024}, } Publisher's Version Article: stoc24main-p579-p (type: Full Paper) doi:10.1145/3618260.3649710
	Rossman, Benjamin	STOC '24: "Formula Size-Depth Tradeoffs ..." Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication Benjamin Rossman (Duke University, USA) @InProceedings{STOC24p1537, author = {Benjamin Rossman}, title = {Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1537-1536}, doi = {10.1145/3618260.3649628}, year = {2024}, } Publisher's Version Article: stoc24main-p94-p (type: Full Paper) doi:10.1145/3618260.3649628
	Rothblum, Ron D.	STOC '24: "Batch Proofs Are Statistically ..." Batch Proofs Are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan (Tel Aviv University, Israel; IIT Bombay, India; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p493, author = {Nir Bitansky and Chethan Kamath and Omer Paneth and Ron D. Rothblum and Prashant Nalini Vasudevan}, title = {Batch Proofs Are Statistically Hiding}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {493-492}, doi = {10.1145/3618260.3649775}, year = {2024}, } Publisher's Version Article: stoc24main-p1365-p (type: Full Paper) doi:10.1145/3618260.3649775
	Rothvoss, Thomas	STOC '24: "Optimal Online Discrepancy ..." Optimal Online Discrepancy Minimization Janardhan Kulkarni, Victor Reis, and Thomas Rothvoss (Microsoft Research, USA; Institute for Advanced Study, Princeton, USA; University of Washington, USA) @InProceedings{STOC24p2041, author = {Janardhan Kulkarni and Victor Reis and Thomas Rothvoss}, title = {Optimal Online Discrepancy Minimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2041-2040}, doi = {10.1145/3618260.3649720}, year = {2024}, } Publisher's Version Article: stoc24main-p695-p (type: Full Paper) doi:10.1145/3618260.3649720
	Roughgarden, Tim	STOC '24: "The Computer in the Sky (Keynote) ..." The Computer in the Sky (Keynote) Tim Roughgarden (Columbia University, USA; a16z crypto, USA) @InProceedings{STOC24p1, author = {Tim Roughgarden}, title = {The Computer in the Sky (Keynote)}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1-0}, doi = {10.1145/3618260.3664271}, year = {2024}, } Publisher's Version Article: stoc24main-key1-p (type: Invited Talk) doi:10.1145/3618260.3664271
	Rubinstein, Aviad	STOC '24: "Fast Swap Regret Minimization ..." Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria Binghui Peng and Aviad Rubinstein (Columbia University, USA; Stanford University, USA) @InProceedings{STOC24p1357, author = {Binghui Peng and Aviad Rubinstein}, title = {Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1357-1356}, doi = {10.1145/3618260.3649691}, year = {2024}, } Publisher's Version Article: stoc24main-p438-p (type: Full Paper) doi:10.1145/3618260.3649691 STOC '24: "Approximating Maximum Matching ..." Approximating Maximum Matching Requires Almost Quadratic Time Soheil Behnezhad, Mohammad Roghani, and Aviad Rubinstein (Northeastern University, USA; Stanford University, USA) @InProceedings{STOC24p505, author = {Soheil Behnezhad and Mohammad Roghani and Aviad Rubinstein}, title = {Approximating Maximum Matching Requires Almost Quadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {505-504}, doi = {10.1145/3618260.3649785}, year = {2024}, } Publisher's Version Article: stoc24main-p1563-p (type: Full Paper) doi:10.1145/3618260.3649785 STOC '24: "A Constant-Factor Approximation ..." A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, and Jan Vondrák (Weizmann Institute of Science, Israel; Stanford University, USA) @InProceedings{STOC24p529, author = {Shahar Dobzinski and Wenzheng Li and Aviad Rubinstein and Jan Vondrák}, title = {A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {529-528}, doi = {10.1145/3618260.3649740}, year = {2024}, } Publisher's Version Article: stoc24main-p872-p (type: Full Paper) doi:10.1145/3618260.3649740 STOC '24: "Parallel Sampling via Counting ..." Parallel Sampling via Counting Nima Anari, Ruiquan Gao, and Aviad Rubinstein (Stanford University, USA) @InProceedings{STOC24p601, author = {Nima Anari and Ruiquan Gao and Aviad Rubinstein}, title = {Parallel Sampling via Counting}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {601-600}, doi = {10.1145/3618260.3649744}, year = {2024}, } Publisher's Version Article: stoc24main-p931-p (type: Full Paper) doi:10.1145/3618260.3649744 STOC '24: "Approximate Earth Mover’s ..." Approximate Earth Mover’s Distance in Truly-Subquadratic Time Lorenzo Beretta and Aviad Rubinstein (University of Copenhagen, Copenhagen, Denmark; Stanford University, USA) @InProceedings{STOC24p73, author = {Lorenzo Beretta and Aviad Rubinstein}, title = {Approximate Earth Mover’s Distance in Truly-Subquadratic Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {73-72}, doi = {10.1145/3618260.3649629}, year = {2024}, } Publisher's Version Article: stoc24main-p97-p (type: Full Paper) doi:10.1145/3618260.3649629
	Rudelson, Mark	STOC '24: "Optimal Embedding Dimension ..." Optimal Embedding Dimension for Sparse Subspace Embeddings Shabarish Chenakkod, Michał Dereziński, Xiaoyu Dong, and Mark Rudelson (University of Michigan, USA) @InProceedings{STOC24p1225, author = {Shabarish Chenakkod and Michał Dereziński and Xiaoyu Dong and Mark Rudelson}, title = {Optimal Embedding Dimension for Sparse Subspace Embeddings}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1225-1224}, doi = {10.1145/3618260.3649762}, year = {2024}, } Publisher's Version Article: stoc24main-p1115-p (type: Full Paper) doi:10.1145/3618260.3649762
	Rzążewski, Paweł	STOC '24: "Maximum Weight Independent ..." Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, and Paweł Rzążewski (University of California at Santa Barbara, USA; University of Warsaw, Poland; IT University of Copenhagen, Copenhagen, Denmark; Warsaw University of Technology, Poland) @InProceedings{STOC24p757, author = {Peter Gartland and Daniel Lokshtanov and Tomáš Masařík and Marcin Pilipczuk and Michał Pilipczuk and Paweł Rzążewski}, title = {Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {757-756}, doi = {10.1145/3618260.3649791}, year = {2024}, } Publisher's Version Article: stoc24main-p145-p (type: Full Paper) doi:10.1145/3618260.3649791
	Sahami, Arvin	STOC '24: "Explicit Orthogonal Arrays ..." Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters Nicholas Harvey and Arvin Sahami (University of British Columbia, Canada) @InProceedings{STOC24p1393, author = {Nicholas Harvey and Arvin Sahami}, title = {Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1393-1392}, doi = {10.1145/3618260.3649642}, year = {2024}, } Publisher's Version Article: stoc24main-p157-p (type: Full Paper) doi:10.1145/3618260.3649642
	Saks, Michael E.	STOC '24: "Almost Linear Size Edit Distance ..." Almost Linear Size Edit Distance Sketch Michal Koucký and Michael E. Saks (Charles University, Prague, Czechia; Rutgers University, USA) @InProceedings{STOC24p1057, author = {Michal Koucký and Michael E. Saks}, title = {Almost Linear Size Edit Distance Sketch}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1057-1056}, doi = {10.1145/3618260.3649783}, year = {2024}, } Publisher's Version Article: stoc24main-p1527-p (type: Full Paper) doi:10.1145/3618260.3649783
	Salamatian, Bahar	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784
	Saran, Nitika	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Saranurak, Thatchaphol	STOC '24: "Approximating Small Sparse ..." Approximating Small Sparse Cuts Aditya Anand, Euiwoong Lee, Jason Li, and Thatchaphol Saranurak (University of Michigan, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p361, author = {Aditya Anand and Euiwoong Lee and Jason Li and Thatchaphol Saranurak}, title = {Approximating Small Sparse Cuts}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {361-360}, doi = {10.1145/3618260.3649747}, year = {2024}, } Publisher's Version Article: stoc24main-p972-p (type: Full Paper) doi:10.1145/3618260.3649747 STOC '24: "Low-Step Multi-commodity Flow ..." Low-Step Multi-commodity Flow Emulators Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, and Thatchaphol Saranurak (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Brown University, USA; University of Michigan, USA) @InProceedings{STOC24p97, author = {Bernhard Haeupler and D. Ellis Hershkowitz and Jason Li and Antti Roeyskoe and Thatchaphol Saranurak}, title = {Low-Step Multi-commodity Flow Emulators}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {97-96}, doi = {10.1145/3618260.3649689}, year = {2024}, } Publisher's Version Article: stoc24main-p429-p (type: Full Paper) doi:10.1145/3618260.3649689
	Savani, Rahul	STOC '24: "The Complexity of Computing ..." The Complexity of Computing KKT Solutions of Quadratic Programs John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani (University of Liverpool, United Kingdom; University of Oxford, United Kingdom; Alan Turing Institute, United Kingdom) @InProceedings{STOC24p985, author = {John Fearnley and Paul W. Goldberg and Alexandros Hollender and Rahul Savani}, title = {The Complexity of Computing KKT Solutions of Quadratic Programs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {985-984}, doi = {10.1145/3618260.3649647}, year = {2024}, } Publisher's Version Article: stoc24main-p170-p (type: Full Paper) doi:10.1145/3618260.3649647
	Saxena, Nitin	STOC '24: "Learning the Coefficients: ..." Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring C. S. Bhargav, Prateek Dwivedi, and Nitin Saxena (IIT Kanpur, India) @InProceedings{STOC24p157, author = {C. S. Bhargav and Prateek Dwivedi and Nitin Saxena}, title = {Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {157-156}, doi = {10.1145/3618260.3649743}, year = {2024}, } Publisher's Version Article: stoc24main-p922-p (type: Full Paper) doi:10.1145/3618260.3649743
	Schmid, Gustav	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Schramm, Tselil	STOC '24: "Semidefinite Programs Simulate ..." Semidefinite Programs Simulate Approximate Message Passing Robustly Misha Ivkov and Tselil Schramm (Stanford University, USA) @InProceedings{STOC24p397, author = {Misha Ivkov and Tselil Schramm}, title = {Semidefinite Programs Simulate Approximate Message Passing Robustly}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {397-396}, doi = {10.1145/3618260.3649713}, year = {2024}, } Publisher's Version Article: stoc24main-p602-p (type: Full Paper) doi:10.1145/3618260.3649713
	Schwarcz, Tamás	STOC '24: "Reconfiguration of Basis Pairs ..." Reconfiguration of Basis Pairs in Regular Matroids Kristóf Bérczi, Bence Mátravölgyi, and Tamás Schwarcz (University of Eötvös Loránd, Hungary; ETH Zurich, Switzerland) @InProceedings{STOC24p1837, author = {Kristóf Bérczi and Bence Mátravölgyi and Tamás Schwarcz}, title = {Reconfiguration of Basis Pairs in Regular Matroids}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1837-1836}, doi = {10.1145/3618260.3649660}, year = {2024}, } Publisher's Version Article: stoc24main-p269-p (type: Full Paper) doi:10.1145/3618260.3649660
	Sengupta, Akash Kumar	STOC '24: "Strong Algebras and Radical ..." Strong Algebras and Radical Sylvester-Gallai Configurations Rafael Oliveira and Akash Kumar Sengupta (University of Waterloo, Canada) @InProceedings{STOC24p121, author = {Rafael Oliveira and Akash Kumar Sengupta}, title = {Strong Algebras and Radical Sylvester-Gallai Configurations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {121-120}, doi = {10.1145/3618260.3649617}, year = {2024}, } Publisher's Version Article: stoc24main-p58-p (type: Full Paper) doi:10.1145/3618260.3649617
	Servedio, Rocco A.	STOC '24: "Detecting Low-Degree Truncation ..." Detecting Low-Degree Truncation Anindya De, Huan Li, Shivam Nadimpalli, and Rocco A. Servedio (University of Pennsylvania, USA; Columbia University, USA) @InProceedings{STOC24p1141, author = {Anindya De and Huan Li and Shivam Nadimpalli and Rocco A. Servedio}, title = {Detecting Low-Degree Truncation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1141-1140}, doi = {10.1145/3618260.3649633}, year = {2024}, } Publisher's Version Article: stoc24main-p129-p (type: Full Paper) doi:10.1145/3618260.3649633
	Seth, Cameron	STOC '24: "New Graph and Hypergraph Container ..." New Graph and Hypergraph Container Lemmas with Applications in Property Testing Eric Blais and Cameron Seth (University of Waterloo, Canada) @InProceedings{STOC24p1993, author = {Eric Blais and Cameron Seth}, title = {New Graph and Hypergraph Container Lemmas with Applications in Property Testing}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1993-1992}, doi = {10.1145/3618260.3649708}, year = {2024}, } Publisher's Version Article: stoc24main-p576-p (type: Full Paper) doi:10.1145/3618260.3649708
	Shaltiel, Ronen	STOC '24: "Explicit Codes for Poly-Size ..." Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions Ronen Shaltiel and Jad Silbak (University of Haifa, Israel; Northeastern University, USA) @InProceedings{STOC24p2257, author = {Ronen Shaltiel and Jad Silbak}, title = {Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2257-2256}, doi = {10.1145/3618260.3649735}, year = {2024}, } Publisher's Version Article: stoc24main-p823-p (type: Full Paper) doi:10.1145/3618260.3649735
	Shao, Changpeng	STOC '24: "Quantum and Classical Query ..." Quantum and Classical Query Complexities of Functions of Matrices Ashley Montanaro and Changpeng Shao (University of Bristol, United Kingdom; Academy of Mathematics and Systems Science at Chinese Academy of Sciences, China) @InProceedings{STOC24p637, author = {Ashley Montanaro and Changpeng Shao}, title = {Quantum and Classical Query Complexities of Functions of Matrices}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {637-636}, doi = {10.1145/3618260.3649665}, year = {2024}, } Publisher's Version Article: stoc24main-p296-p (type: Full Paper) doi:10.1145/3618260.3649665
	Shaulker, Ariel	STOC '24: "Bilateral Trade with Correlated ..." Bilateral Trade with Correlated Values Shahar Dobzinski and Ariel Shaulker (Weizmann Institute of Science, Israel) @InProceedings{STOC24p277, author = {Shahar Dobzinski and Ariel Shaulker}, title = {Bilateral Trade with Correlated Values}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {277-276}, doi = {10.1145/3618260.3649659}, year = {2024}, } Publisher's Version Article: stoc24main-p256-p (type: Full Paper) doi:10.1145/3618260.3649659
	Shimizu, Nobutaka	STOC '24: "Planted Clique Conjectures ..." Planted Clique Conjectures Are Equivalent Shuichi Hirahara and Nobutaka Shimizu (National Institute of Informatics, Tokyo, Japan; Tokyo Institute of Technology, Tokyo, Japan) @InProceedings{STOC24p409, author = {Shuichi Hirahara and Nobutaka Shimizu}, title = {Planted Clique Conjectures Are Equivalent}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {409-408}, doi = {10.1145/3618260.3649751}, year = {2024}, } Publisher's Version Article: stoc24main-p1010-p (type: Full Paper) doi:10.1145/3618260.3649751
	Shinkar, Igor	STOC '24: "On the Power of Interactive ..." On the Power of Interactive Proofs for Learning Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, and Igor Shinkar (University of Cambridge, United Kingdom; Simon Fraser University, Canada; Qualcomm, Canada) @InProceedings{STOC24p1177, author = {Tom Gur and Mohammad Mahdi Jahanara and Mohammad Mahdi Khodabandeh and Ninad Rajgopal and Bahar Salamatian and Igor Shinkar}, title = {On the Power of Interactive Proofs for Learning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1177-1176}, doi = {10.1145/3618260.3649784}, year = {2024}, } Publisher's Version Article: stoc24main-p1542-p (type: Full Paper) doi:10.1145/3618260.3649784
	Shrivastav, Vishal	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Sidford, Aaron	STOC '24: "Sparsifying Generalized Linear ..." Sparsifying Generalized Linear Models Arun Jambulapati, James R. Lee, Yang P. Liu, and Aaron Sidford (Simons Institute for the Theory of Computing, Berkeley, USA; University of Washington, USA; Institute for Advanced Study, Princeton, USA; Stanford University, USA) @InProceedings{STOC24p1849, author = {Arun Jambulapati and James R. Lee and Yang P. Liu and Aaron Sidford}, title = {Sparsifying Generalized Linear Models}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1849-1848}, doi = {10.1145/3618260.3649684}, year = {2024}, } Publisher's Version Article: stoc24main-p402-p (type: Full Paper) doi:10.1145/3618260.3649684 STOC '24: "Near-Optimal Dynamic Rounding ..." Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs Sayan Bhattacharya, Peter Kiss, Aaron Sidford, and David Wajc (University of Warwick, United Kingdom; Stanford University, USA; Technion, Israel) @InProceedings{STOC24p85, author = {Sayan Bhattacharya and Peter Kiss and Aaron Sidford and David Wajc}, title = {Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {85-84}, doi = {10.1145/3618260.3649648}, year = {2024}, } Publisher's Version Article: stoc24main-p175-p (type: Full Paper) doi:10.1145/3618260.3649648
	Silbak, Jad	STOC '24: "Explicit Codes for Poly-Size ..." Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions Ronen Shaltiel and Jad Silbak (University of Haifa, Israel; Northeastern University, USA) @InProceedings{STOC24p2257, author = {Ronen Shaltiel and Jad Silbak}, title = {Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2257-2256}, doi = {10.1145/3618260.3649735}, year = {2024}, } Publisher's Version Article: stoc24main-p823-p (type: Full Paper) doi:10.1145/3618260.3649735
	Sinclair, Alistair	STOC '24: "Nonlinear Dynamics for the ..." Nonlinear Dynamics for the Ising Model Pietro Caputo and Alistair Sinclair (University Rome III, Italy; University of California at Berkeley, USA) @InProceedings{STOC24p577, author = {Pietro Caputo and Alistair Sinclair}, title = {Nonlinear Dynamics for the Ising Model}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {577-576}, doi = {10.1145/3618260.3649759}, year = {2024}, } Publisher's Version Article: stoc24main-p1091-p (type: Full Paper) doi:10.1145/3618260.3649759
	Singla, Sahil	STOC '24: "Supermodular Approximation ..." Supermodular Approximation of Norms and Applications Thomas Kesselheim, Marco Molinaro, and Sahil Singla (University of Bonn, Bonn, Germany; PUC-Rio, Brazil; Georgia Institute of Technology, USA) @InProceedings{STOC24p2053, author = {Thomas Kesselheim and Marco Molinaro and Sahil Singla}, title = {Supermodular Approximation of Norms and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2053-2052}, doi = {10.1145/3618260.3649734}, year = {2024}, } Publisher's Version Article: stoc24main-p820-p (type: Full Paper) doi:10.1145/3618260.3649734
	Sinha, Makrand	STOC '24: "The Power of Adaptivity in ..." The Power of Adaptivity in Quantum Query Algorithms Uma Girish, Makrand Sinha, Avishay Tal, and Kewen Wu (Princeton University, USA; University of Illinois at Urbana-Champaign, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1657, author = {Uma Girish and Makrand Sinha and Avishay Tal and Kewen Wu}, title = {The Power of Adaptivity in Quantum Query Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1657-1656}, doi = {10.1145/3618260.3649621}, year = {2024}, } Publisher's Version Article: stoc24main-p66-p (type: Full Paper) doi:10.1145/3618260.3649621
	Slivkins, Aleksandrs	STOC '24: "Strategic Budget Selection ..." Strategic Budget Selection in a Competitive Autobidding World Yiding Feng, Brendan Lucier, and Aleksandrs Slivkins (University of Chicago, USA; Microsoft Research, USA) @InProceedings{STOC24p253, author = {Yiding Feng and Brendan Lucier and Aleksandrs Slivkins}, title = {Strategic Budget Selection in a Competitive Autobidding World}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {253-252}, doi = {10.1145/3618260.3649688}, year = {2024}, } Publisher's Version Article: stoc24main-p425-p (type: Full Paper) doi:10.1145/3618260.3649688
	Slofstra, William	STOC '24: "Two Prover Perfect Zero Knowledge ..." Two Prover Perfect Zero Knowledge for MIP* Kieran Mastel and William Slofstra (University of Waterloo, Canada) @InProceedings{STOC24p1093, author = {Kieran Mastel and William Slofstra}, title = {Two Prover Perfect Zero Knowledge for MIP*}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1093-1092}, doi = {10.1145/3618260.3649702}, year = {2024}, } Publisher's Version Article: stoc24main-p555-p (type: Full Paper) doi:10.1145/3618260.3649702
	Sly, Allan	STOC '24: "Local Geometry of NAE-SAT ..." Local Geometry of NAE-SAT Solutions in the Condensation Regime Allan Sly and Youngtak Sohn (Princeton University, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1201, author = {Allan Sly and Youngtak Sohn}, title = {Local Geometry of NAE-SAT Solutions in the Condensation Regime}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1201-1200}, doi = {10.1145/3618260.3649781}, year = {2024}, } Publisher's Version Article: stoc24main-p1497-p (type: Full Paper) doi:10.1145/3618260.3649781
	Sohn, Youngtak	STOC '24: "Local Geometry of NAE-SAT ..." Local Geometry of NAE-SAT Solutions in the Condensation Regime Allan Sly and Youngtak Sohn (Princeton University, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1201, author = {Allan Sly and Youngtak Sohn}, title = {Local Geometry of NAE-SAT Solutions in the Condensation Regime}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1201-1200}, doi = {10.1145/3618260.3649781}, year = {2024}, } Publisher's Version Article: stoc24main-p1497-p (type: Full Paper) doi:10.1145/3618260.3649781
	Sokolov, Dmitry	STOC '24: "Random (log 𝑛)-CNF Are ..." Random (log 𝑛)-CNF Are Hard for Cutting Planes (Again) Dmitry Sokolov (EPFL, Lausanne, Switzerland) @InProceedings{STOC24p2233, author = {Dmitry Sokolov}, title = {Random (log 𝑛)-CNF Are Hard for Cutting Planes (Again)}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2233-2232}, doi = {10.1145/3618260.3649636}, year = {2024}, } Publisher's Version Article: stoc24main-p133-p (type: Full Paper) doi:10.1145/3618260.3649636 STOC '24: "Hardness Condensation by Restriction ..." Hardness Condensation by Restriction Mika Göös, Ilan Newman, Artur Riazanov, and Dmitry Sokolov (EPFL, Lausanne, Switzerland; University of Haifa, Israel) @InProceedings{STOC24p2245, author = {Mika Göös and Ilan Newman and Artur Riazanov and Dmitry Sokolov}, title = {Hardness Condensation by Restriction}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2245-2244}, doi = {10.1145/3618260.3649711}, year = {2024}, } Publisher's Version Article: stoc24main-p586-p (type: Full Paper) doi:10.1145/3618260.3649711
	Sokołowski, Marek	STOC '24: "Almost-Linear Time Parameterized ..." Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth Tuukka Korhonen and Marek Sokołowski (University of Bergen, Norway; University of Warsaw, Poland) @InProceedings{STOC24p1717, author = {Tuukka Korhonen and Marek Sokołowski}, title = {Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1717-1716}, doi = {10.1145/3618260.3649732}, year = {2024}, } Publisher's Version Article: stoc24main-p802-p (type: Full Paper) doi:10.1145/3618260.3649732
	Spooner, Nicholas	STOC '24: "An Efficient Quantum Parallel ..." An Efficient Quantum Parallel Repetition Theorem and Applications John Bostanci, Luowen Qian, Nicholas Spooner, and Henry Yuen (Columbia University, USA; Boston University, USA; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1645, author = {John Bostanci and Luowen Qian and Nicholas Spooner and Henry Yuen}, title = {An Efficient Quantum Parallel Repetition Theorem and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1645-1644}, doi = {10.1145/3618260.3649603}, year = {2024}, } Publisher's Version Article: stoc24main-p10-p (type: Full Paper) doi:10.1145/3618260.3649603 STOC '24: "Perfect Zero-Knowledge PCPs ..." Perfect Zero-Knowledge PCPs for #P Tom Gur, Jack O'Connor, and Nicholas Spooner (University of Cambridge, United Kingdom; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1909, author = {Tom Gur and Jack O'Connor and Nicholas Spooner}, title = {Perfect Zero-Knowledge PCPs for #P}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1909-1908}, doi = {10.1145/3618260.3649698}, year = {2024}, } Publisher's Version Article: stoc24main-p520-p (type: Full Paper) doi:10.1145/3618260.3649698
	Srinivas, Vaidehi	STOC '24: "New Tools for Smoothed Analysis: ..." New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, and Aravindan Vijayaraghavan (University of Utah, USA; Northwestern University, USA) @InProceedings{STOC24p433, author = {Aditya Bhaskara and Eric Evert and Vaidehi Srinivas and Aravindan Vijayaraghavan}, title = {New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {433-432}, doi = {10.1145/3618260.3649765}, year = {2024}, } Publisher's Version Article: stoc24main-p1150-p (type: Full Paper) doi:10.1145/3618260.3649765
	Srinivasan, Srikanth	STOC '24: "On the Power of Homogeneous ..." On the Power of Homogeneous Algebraic Formulas Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas (Université Paris Cité - IMJ-PRG, France; IT University of Copenhagen, Copenhagen, Denmark; University of Copenhagen, Copenhagen, Denmark; Université Savoie Mont Blanc - CNRS - LAMA, France) @InProceedings{STOC24p169, author = {Hervé Fournier and Nutan Limaye and Srikanth Srinivasan and Sébastien Tavenas}, title = {On the Power of Homogeneous Algebraic Formulas}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {169-168}, doi = {10.1145/3618260.3649760}, year = {2024}, } Publisher's Version Article: stoc24main-p1106-p (type: Full Paper) doi:10.1145/3618260.3649760 STOC '24: "Local Correction of Linear ..." Local Correction of Linear Functions over the Boolean Cube Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, and Madhu Sudan (Harvard University, USA; Aarhus University, Aarhus, Denmark; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p841, author = {Prashanth Amireddy and Amik Raj Behera and Manaswi Paraashar and Srikanth Srinivasan and Madhu Sudan}, title = {Local Correction of Linear Functions over the Boolean Cube}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {841-840}, doi = {10.1145/3618260.3649746}, year = {2024}, } Publisher's Version Article: stoc24main-p954-p (type: Full Paper) doi:10.1145/3618260.3649746
	Stehlé, Damien	STOC '24: "Quantum Oblivious LWE Sampling ..." Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs Thomas Debris-Alazard, Pouria Fallahpour, and Damien Stehlé (Inria - Laboratoire LIX - École Polytechnique, France; ENS Lyon - LIP, France; CryptoLab, France) @InProceedings{STOC24p481, author = {Thomas Debris-Alazard and Pouria Fallahpour and Damien Stehlé}, title = {Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {481-480}, doi = {10.1145/3618260.3649766}, year = {2024}, } Publisher's Version Article: stoc24main-p1194-p (type: Full Paper) doi:10.1145/3618260.3649766
	Stein, Cliff	STOC '24: "Polylog-Competitive Deterministic ..." Polylog-Competitive Deterministic Local Routing and Scheduling Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Columbia University, USA; Google Research, Switzerland) @InProceedings{STOC24p889, author = {Bernhard Haeupler and Shyamal Patel and Antti Roeyskoe and Cliff Stein and Goran Zuzic}, title = {Polylog-Competitive Deterministic Local Routing and Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {889-888}, doi = {10.1145/3618260.3649678}, year = {2024}, } Publisher's Version Article: stoc24main-p370-p (type: Full Paper) doi:10.1145/3618260.3649678
	Steurer, David	STOC '24: "Private Graphon Estimation ..." Private Graphon Estimation via Sum-of-Squares Hongjie Chen, Jingqiu Ding, Tommaso D'Orsi, Yiding Hua, Chih-Hung Liu, and David Steurer (ETH Zurich, Switzerland; Bocconi University, Italy; National Taiwan University, Taiwan) @InProceedings{STOC24p205, author = {Hongjie Chen and Jingqiu Ding and Tommaso D'Orsi and Yiding Hua and Chih-Hung Liu and David Steurer}, title = {Private Graphon Estimation via Sum-of-Squares}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {205-204}, doi = {10.1145/3618260.3649643}, year = {2024}, } Publisher's Version Article: stoc24main-p159-p (type: Full Paper) doi:10.1145/3618260.3649643
	Sudan, Madhu	STOC '24: "Local Correction of Linear ..." Local Correction of Linear Functions over the Boolean Cube Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, and Madhu Sudan (Harvard University, USA; Aarhus University, Aarhus, Denmark; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p841, author = {Prashanth Amireddy and Amik Raj Behera and Manaswi Paraashar and Srikanth Srinivasan and Madhu Sudan}, title = {Local Correction of Linear Functions over the Boolean Cube}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {841-840}, doi = {10.1145/3618260.3649746}, year = {2024}, } Publisher's Version Article: stoc24main-p954-p (type: Full Paper) doi:10.1145/3618260.3649746
	Sun, Yican	STOC '24: "Parameterized Inapproximability ..." Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, and Kewen Wu (University of California at Berkeley, USA; Nanjing University, China; Peking University, China) @InProceedings{STOC24p49, author = {Venkatesan Guruswami and Bingkai Lin and Xuandi Ren and Yican Sun and Kewen Wu}, title = {Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {49-48}, doi = {10.1145/3618260.3649771}, year = {2024}, } Publisher's Version Article: stoc24main-p1264-p (type: Full Paper) doi:10.1145/3618260.3649771
	Sundaresan, Janani	STOC '24: "O(log log n) Passes Is Optimal ..." O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, and Janani Sundaresan (University of Waterloo, Canada; Rutgers University, USA; University of Bristol, United Kingdom) @InProceedings{STOC24p925, author = {Sepehr Assadi and Christian Konrad and Kheeran K. Naidu and Janani Sundaresan}, title = {O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {925-924}, doi = {10.1145/3618260.3649763}, year = {2024}, } Publisher's Version Article: stoc24main-p1123-p (type: Full Paper) doi:10.1145/3618260.3649763
	Suomela, Jukka	STOC '24: "No Distributed Quantum Advantage ..." No Distributed Quantum Advantage for Approximate Graph Coloring Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela (TU Munich, Germany; Munich Center for Quantum Science and Technology, Germany; Aalto University, Finland; Bocconi University, Italy; Indian Institute of Science, India; University of Freiburg, Freiburg, Germany; Nagoya University, Nagoya, Japan; Inria, France; Université Paris-Saclay, France; Institut Polytechnique de Paris, France) @InProceedings{STOC24p2113, author = {Xavier Coiteux-Roy and Francesco d'Amore and Rishikesh Gajjala and Fabian Kuhn and François Le Gall and Henrik Lievonen and Augusto Modanese and Marc-Olivier Renou and Gustav Schmid and Jukka Suomela}, title = {No Distributed Quantum Advantage for Approximate Graph Coloring}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2113-2112}, doi = {10.1145/3618260.3649679}, year = {2024}, } Publisher's Version Article: stoc24main-p383-p (type: Full Paper) doi:10.1145/3618260.3649679
	Svensson, Ola	STOC '24: "Online Edge Coloring Is (Nearly) ..." Online Edge Coloring Is (Nearly) as Easy as Offline Joakim Blikstad, Ola Svensson, Radu Vintan, and David Wajc (KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany; EPFL, Lausanne, Switzerland; Technion, Israel) @InProceedings{STOC24p61, author = {Joakim Blikstad and Ola Svensson and Radu Vintan and David Wajc}, title = {Online Edge Coloring Is (Nearly) as Easy as Offline}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {61-60}, doi = {10.1145/3618260.3649741}, year = {2024}, } Publisher's Version Article: stoc24main-p891-p (type: Full Paper) doi:10.1145/3618260.3649741
	Swartworth, William	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787
	Tahmasbi, Mehrdad	STOC '24: "Quadratic Lower Bounds on ..." Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach Saeed Mehraban and Mehrdad Tahmasbi (Tufts University, USA; University of Illinois at Urbana-Champaign, USA) @InProceedings{STOC24p673, author = {Saeed Mehraban and Mehrdad Tahmasbi}, title = {Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {673-672}, doi = {10.1145/3618260.3649733}, year = {2024}, } Publisher's Version Article: stoc24main-p819-p (type: Full Paper) doi:10.1145/3618260.3649733
	Tal, Avishay	STOC '24: "The Power of Adaptivity in ..." The Power of Adaptivity in Quantum Query Algorithms Uma Girish, Makrand Sinha, Avishay Tal, and Kewen Wu (Princeton University, USA; University of Illinois at Urbana-Champaign, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1657, author = {Uma Girish and Makrand Sinha and Avishay Tal and Kewen Wu}, title = {The Power of Adaptivity in Quantum Query Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1657-1656}, doi = {10.1145/3618260.3649621}, year = {2024}, } Publisher's Version Article: stoc24main-p66-p (type: Full Paper) doi:10.1145/3618260.3649621
	Tang, Ewin	STOC '24: "Learning Quantum Hamiltonians ..." Learning Quantum Hamiltonians at Any Temperature in Polynomial Time Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1633, author = {Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang}, title = {Learning Quantum Hamiltonians at Any Temperature in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1633-1632}, doi = {10.1145/3618260.3649619}, year = {2024}, } Publisher's Version Article: stoc24main-p62-p (type: Full Paper) doi:10.1145/3618260.3649619
	Tavenas, Sébastien	STOC '24: "On the Power of Homogeneous ..." On the Power of Homogeneous Algebraic Formulas Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas (Université Paris Cité - IMJ-PRG, France; IT University of Copenhagen, Copenhagen, Denmark; University of Copenhagen, Copenhagen, Denmark; Université Savoie Mont Blanc - CNRS - LAMA, France) @InProceedings{STOC24p169, author = {Hervé Fournier and Nutan Limaye and Srikanth Srinivasan and Sébastien Tavenas}, title = {On the Power of Homogeneous Algebraic Formulas}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {169-168}, doi = {10.1145/3618260.3649760}, year = {2024}, } Publisher's Version Article: stoc24main-p1106-p (type: Full Paper) doi:10.1145/3618260.3649760
	Tell, Roei	STOC '24: "Opening Up the Distinguisher: ..." Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL Dean Doron, Edward Pyne, and Roei Tell (Ben-Gurion University of the Negev, Israel; Massachusetts Institute of Technology, USA; University of Toronto, Canada) @InProceedings{STOC24p2269, author = {Dean Doron and Edward Pyne and Roei Tell}, title = {Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2269-2268}, doi = {10.1145/3618260.3649772}, year = {2024}, } Publisher's Version Article: stoc24main-p1312-p (type: Full Paper) doi:10.1145/3618260.3649772
	Thakkar, Dhara	STOC '24: "The Minimal Faithful Permutation ..." The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups Bireswar Das and Dhara Thakkar (IIT Gandhinagar, India) @InProceedings{STOC24p145, author = {Bireswar Das and Dhara Thakkar}, title = {The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {145-144}, doi = {10.1145/3618260.3649641}, year = {2024}, } Publisher's Version Article: stoc24main-p156-p (type: Full Paper) doi:10.1145/3618260.3649641
	Thomas, Clayton	STOC '24: "Structural Complexities of ..." Structural Complexities of Matching Mechanisms Yannai A. Gonczarowski and Clayton Thomas (Harvard University, USA; Microsoft Research, USA) @InProceedings{STOC24p517, author = {Yannai A. Gonczarowski and Clayton Thomas}, title = {Structural Complexities of Matching Mechanisms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {517-516}, doi = {10.1145/3618260.3649737}, year = {2024}, } Publisher's Version Article: stoc24main-p828-p (type: Full Paper) doi:10.1145/3618260.3649737
	Thorup, Mikkel	STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712 STOC '24: "Better Coloring of 3-Colorable ..." Better Coloring of 3-Colorable Graphs Ken-ichi Kawarabayashi, Mikkel Thorup, and Hirotaka Yoneda (National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p373, author = {Ken-ichi Kawarabayashi and Mikkel Thorup and Hirotaka Yoneda}, title = {Better Coloring of 3-Colorable Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {373-372}, doi = {10.1145/3618260.3649768}, year = {2024}, } Publisher's Version Article: stoc24main-p1255-p (type: Full Paper) doi:10.1145/3618260.3649768
	Tomer, Kabir	STOC '24: "Commitments from Quantum One-Wayness ..." Commitments from Quantum One-Wayness Dakshita Khurana and Kabir Tomer (University of Illinois at Urbana-Champaign, USA) @InProceedings{STOC24p1069, author = {Dakshita Khurana and Kabir Tomer}, title = {Commitments from Quantum One-Wayness}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1069-1068}, doi = {10.1145/3618260.3649654}, year = {2024}, } Publisher's Version Article: stoc24main-p219-p (type: Full Paper) doi:10.1145/3618260.3649654
	Toruńczyk, Szymon	STOC '24: "Flip-Breakability: A Combinatorial ..." Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes Jan Dreier, Nikolas Mählmann, and Szymon Toruńczyk (TU Wien, Austria; University of Bremen, Bremen, Germany; University of Warsaw, Poland) @InProceedings{STOC24p1729, author = {Jan Dreier and Nikolas Mählmann and Szymon Toruńczyk}, title = {Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1729-1728}, doi = {10.1145/3618260.3649739}, year = {2024}, } Publisher's Version Article: stoc24main-p867-p (type: Full Paper) doi:10.1145/3618260.3649739
	Tucker-Foltz, Jamie	STOC '24: "Sampling Balanced Forests ..." Sampling Balanced Forests of Grids in Polynomial Time Sarah Cannon, Wesley Pegden, and Jamie Tucker-Foltz (Claremont McKenna College, USA; Carnegie Mellon University, USA; Harvard University, USA) @InProceedings{STOC24p1861, author = {Sarah Cannon and Wesley Pegden and Jamie Tucker-Foltz}, title = {Sampling Balanced Forests of Grids in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1861-1860}, doi = {10.1145/3618260.3649699}, year = {2024}, } Publisher's Version Article: stoc24main-p525-p (type: Full Paper) doi:10.1145/3618260.3649699
	Tzameret, Iddo	STOC '24: "Functional Lower Bounds in ..." Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Tuomas Hakoniemi, Nutan Limaye, and Iddo Tzameret (University of Helsinki, Helsinki, Finland; IT University of Copenhagen, Copenhagen, Denmark; Imperial College London, United Kingdom) @InProceedings{STOC24p1549, author = {Tuomas Hakoniemi and Nutan Limaye and Iddo Tzameret}, title = {Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1549-1548}, doi = {10.1145/3618260.3649616}, year = {2024}, } Publisher's Version Article: stoc24main-p57-p (type: Full Paper) doi:10.1145/3618260.3649616
	Vadhan, Salil	STOC '24: "Complexity-Theoretic Implications ..." Complexity-Theoretic Implications of Multicalibration Sílvia Casacuberta, Cynthia Dwork, and Salil Vadhan (University of Oxford, United Kingdom; Harvard University, USA) @InProceedings{STOC24p1189, author = {Sílvia Casacuberta and Cynthia Dwork and Salil Vadhan}, title = {Complexity-Theoretic Implications of Multicalibration}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1189-1188}, doi = {10.1145/3618260.3649748}, year = {2024}, } Publisher's Version Article: stoc24main-p982-p (type: Full Paper) doi:10.1145/3618260.3649748
	Vafa, Neekon	STOC '24: "Memory Checking Requires Logarithmic ..." Memory Checking Requires Logarithmic Overhead Elette Boyle, Ilan Komargodski, and Neekon Vafa (Reichman University, Israel; NTT Research, USA; Hebrew University of Jerusalem, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1897, author = {Elette Boyle and Ilan Komargodski and Neekon Vafa}, title = {Memory Checking Requires Logarithmic Overhead}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1897-1896}, doi = {10.1145/3618260.3649686}, year = {2024}, } Publisher's Version Article: stoc24main-p413-p (type: Full Paper) doi:10.1145/3618260.3649686
	Vaikuntanathan, Vinod	STOC '24: "Quantum State Obfuscation ..." Quantum State Obfuscation from Classical Oracles James Bartusek, Zvika Brakerski, and Vinod Vaikuntanathan (University of California at Berkeley, USA; Weizmann Institute of Science, Israel; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1117, author = {James Bartusek and Zvika Brakerski and Vinod Vaikuntanathan}, title = {Quantum State Obfuscation from Classical Oracles}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1117-1116}, doi = {10.1145/3618260.3649673}, year = {2024}, } Publisher's Version Article: stoc24main-p345-p (type: Full Paper) doi:10.1145/3618260.3649673 STOC '24: "SNARGs under LWE via Propositional ..." SNARGs under LWE via Propositional Proofs Zhengzhong Jin, Yael Kalai, Alex Lombardi, and Vinod Vaikuntanathan (Northeastern University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Princeton University, USA) @InProceedings{STOC24p1945, author = {Zhengzhong Jin and Yael Kalai and Alex Lombardi and Vinod Vaikuntanathan}, title = {SNARGs under LWE via Propositional Proofs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1945-1944}, doi = {10.1145/3618260.3649770}, year = {2024}, } Publisher's Version Article: stoc24main-p1260-p (type: Full Paper) doi:10.1145/3618260.3649770
	Valiant, Gregory	STOC '24: "Near-Optimal Mean Estimation ..." Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances Spencer Compton and Gregory Valiant (Stanford University, USA) @InProceedings{STOC24p229, author = {Spencer Compton and Gregory Valiant}, title = {Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {229-228}, doi = {10.1145/3618260.3649754}, year = {2024}, } Publisher's Version Article: stoc24main-p1045-p (type: Full Paper) doi:10.1145/3618260.3649754
	Vasconcelos, Francisca	STOC '24: "On the Pauli Spectrum of QAC0 ..." On the Pauli Spectrum of QAC0 Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen (Columbia University, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1669, author = {Shivam Nadimpalli and Natalie Parham and Francisca Vasconcelos and Henry Yuen}, title = {On the Pauli Spectrum of QAC0}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1669-1668}, doi = {10.1145/3618260.3649662}, year = {2024}, } Publisher's Version Article: stoc24main-p287-p (type: Full Paper) doi:10.1145/3618260.3649662
	Vasudevan, Prashant Nalini	STOC '24: "Batch Proofs Are Statistically ..." Batch Proofs Are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan (Tel Aviv University, Israel; IIT Bombay, India; Technion, Israel; National University of Singapore, Singapore) @InProceedings{STOC24p493, author = {Nir Bitansky and Chethan Kamath and Omer Paneth and Ron D. Rothblum and Prashant Nalini Vasudevan}, title = {Batch Proofs Are Statistically Hiding}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {493-492}, doi = {10.1145/3618260.3649775}, year = {2024}, } Publisher's Version Article: stoc24main-p1365-p (type: Full Paper) doi:10.1145/3618260.3649775
	Végh, László A.	STOC '24: "A Strongly Polynomial Algorithm ..." A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh (CWI, Amsterdam, Netherlands; Georgia Institute of Technology, USA; London School of Economics, United Kingdom) @InProceedings{STOC24p1741, author = {Daniel Dadush and Zhuan Khye Koh and Bento Natura and Neil Olver and László A. Végh}, title = {A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1741-1740}, doi = {10.1145/3618260.3649764}, year = {2024}, } Publisher's Version Article: stoc24main-p1131-p (type: Full Paper) doi:10.1145/3618260.3649764
	Vempala, Santosh S.	STOC '24: "Calibrated Language Models ..." Calibrated Language Models Must Hallucinate Adam Tauman Kalai and Santosh S. Vempala (Open AI, USA; Georgia Institute of Technology, USA) @InProceedings{STOC24p193, author = {Adam Tauman Kalai and Santosh S. Vempala}, title = {Calibrated Language Models Must Hallucinate}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {193-192}, doi = {10.1145/3618260.3649777}, year = {2024}, } Publisher's Version Article: stoc24main-p1400-p (type: Full Paper) doi:10.1145/3618260.3649777
	Vijayaraghavan, Aravindan	STOC '24: "New Tools for Smoothed Analysis: ..." New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, and Aravindan Vijayaraghavan (University of Utah, USA; Northwestern University, USA) @InProceedings{STOC24p433, author = {Aditya Bhaskara and Eric Evert and Vaidehi Srinivas and Aravindan Vijayaraghavan}, title = {New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {433-432}, doi = {10.1145/3618260.3649765}, year = {2024}, } Publisher's Version Article: stoc24main-p1150-p (type: Full Paper) doi:10.1145/3618260.3649765
	Vintan, Radu	STOC '24: "Online Edge Coloring Is (Nearly) ..." Online Edge Coloring Is (Nearly) as Easy as Offline Joakim Blikstad, Ola Svensson, Radu Vintan, and David Wajc (KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany; EPFL, Lausanne, Switzerland; Technion, Israel) @InProceedings{STOC24p61, author = {Joakim Blikstad and Ola Svensson and Radu Vintan and David Wajc}, title = {Online Edge Coloring Is (Nearly) as Easy as Offline}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {61-60}, doi = {10.1145/3618260.3649741}, year = {2024}, } Publisher's Version Article: stoc24main-p891-p (type: Full Paper) doi:10.1145/3618260.3649741
	Vogl, Lukas	STOC '24: "Understanding the Cluster ..." Understanding the Cluster Linear Program for Correlation Clustering Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl (Boston College, USA; Google Research, France; University of Michigan, USA; Nanjing University, China; CNRS - Université Grenoble Alpes, France; EPFL, Lausanne, Switzerland) @InProceedings{STOC24p1789, author = {Nairen Cao and Vincent Cohen-Addad and Euiwoong Lee and Shi Li and Alantha Newman and Lukas Vogl}, title = {Understanding the Cluster Linear Program for Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1789-1788}, doi = {10.1145/3618260.3649749}, year = {2024}, } Publisher's Version Article: stoc24main-p996-p (type: Full Paper) doi:10.1145/3618260.3649749
	Vondrák, Jan	STOC '24: "Prophet Inequalities with ..." Prophet Inequalities with Cancellation Costs Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, and Jan Vondrák (University of Chicago, USA; Stanford University, USA) @InProceedings{STOC24p1381, author = {Farbod Ekbatani and Rad Niazadeh and Pranav Nuti and Jan Vondrák}, title = {Prophet Inequalities with Cancellation Costs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1381-1380}, doi = {10.1145/3618260.3649786}, year = {2024}, } Publisher's Version Article: stoc24main-p1593-p (type: Full Paper) doi:10.1145/3618260.3649786 STOC '24: "A Constant-Factor Approximation ..." A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, and Jan Vondrák (Weizmann Institute of Science, Israel; Stanford University, USA) @InProceedings{STOC24p529, author = {Shahar Dobzinski and Wenzheng Li and Aviad Rubinstein and Jan Vondrák}, title = {A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {529-528}, doi = {10.1145/3618260.3649740}, year = {2024}, } Publisher's Version Article: stoc24main-p872-p (type: Full Paper) doi:10.1145/3618260.3649740
	Voronova, Nadezhda	STOC '24: "Exponential Quantum Space ..." Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model John Kallaugher, Ojas Parekh, and Nadezhda Voronova (Sandia National Laboratories, USA; Boston University, USA) @InProceedings{STOC24p2005, author = {John Kallaugher and Ojas Parekh and Nadezhda Voronova}, title = {Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2005-2004}, doi = {10.1145/3618260.3649709}, year = {2024}, } Publisher's Version Article: stoc24main-p577-p (type: Full Paper) doi:10.1145/3618260.3649709
	Vuong, Thuy-Duong	STOC '24: "Trickle-Down in Localization ..." Trickle-Down in Localization Schemes and Applications Nima Anari, Frederic Koehler, and Thuy-Duong Vuong (Stanford University, USA; University of Chicago, USA) @InProceedings{STOC24p1213, author = {Nima Anari and Frederic Koehler and Thuy-Duong Vuong}, title = {Trickle-Down in Localization Schemes and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1213-1212}, doi = {10.1145/3618260.3649622}, year = {2024}, } Publisher's Version Article: stoc24main-p76-p (type: Full Paper) doi:10.1145/3618260.3649622
	Waingarten, Erik	STOC '24: "Data-Dependent LSH for the ..." Data-Dependent LSH for the Earth Mover’s Distance Rajesh Jayaram, Erik Waingarten, and Tian Zhang (Google Research, USA; University of Pennsylvania, USA) @InProceedings{STOC24p877, author = {Rajesh Jayaram and Erik Waingarten and Tian Zhang}, title = {Data-Dependent LSH for the Earth Mover’s Distance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {877-876}, doi = {10.1145/3618260.3649666}, year = {2024}, } Publisher's Version Article: stoc24main-p310-p (type: Full Paper) doi:10.1145/3618260.3649666
	Wajc, David	STOC '24: "Online Edge Coloring Is (Nearly) ..." Online Edge Coloring Is (Nearly) as Easy as Offline Joakim Blikstad, Ola Svensson, Radu Vintan, and David Wajc (KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany; EPFL, Lausanne, Switzerland; Technion, Israel) @InProceedings{STOC24p61, author = {Joakim Blikstad and Ola Svensson and Radu Vintan and David Wajc}, title = {Online Edge Coloring Is (Nearly) as Easy as Offline}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {61-60}, doi = {10.1145/3618260.3649741}, year = {2024}, } Publisher's Version Article: stoc24main-p891-p (type: Full Paper) doi:10.1145/3618260.3649741 STOC '24: "Near-Optimal Dynamic Rounding ..." Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs Sayan Bhattacharya, Peter Kiss, Aaron Sidford, and David Wajc (University of Warwick, United Kingdom; Stanford University, USA; Technion, Israel) @InProceedings{STOC24p85, author = {Sayan Bhattacharya and Peter Kiss and Aaron Sidford and David Wajc}, title = {Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {85-84}, doi = {10.1145/3618260.3649648}, year = {2024}, } Publisher's Version Article: stoc24main-p175-p (type: Full Paper) doi:10.1145/3618260.3649648
	Walzer, Stefan	STOC '24: "Space Lower Bounds for Dynamic ..." Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval William Kuszmaul and Stefan Walzer (Harvard University, USA; KIT, Karlsruhe, Germany) @InProceedings{STOC24p1273, author = {William Kuszmaul and Stefan Walzer}, title = {Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1273-1272}, doi = {10.1145/3618260.3649649}, year = {2024}, } Publisher's Version Article: stoc24main-p177-p (type: Full Paper) doi:10.1145/3618260.3649649
	Wang, Brandon	STOC '24: "Lenzen’s Distributed Routing ..." Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability Mohsen Ghaffari and Brandon Wang (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p2089, author = {Mohsen Ghaffari and Brandon Wang}, title = {Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2089-2088}, doi = {10.1145/3618260.3649627}, year = {2024}, } Publisher's Version Article: stoc24main-p92-p (type: Full Paper) doi:10.1145/3618260.3649627
	Wang, Hanzhi	STOC '24: "Revisiting Local Computation ..." Revisiting Local Computation of PageRank: Simple and Optimal Hanzhi Wang, Zhewei Wei, Ji-Rong Wen, and Mingji Yang (Renmin University of China, China) @InProceedings{STOC24p1009, author = {Hanzhi Wang and Zhewei Wei and Ji-Rong Wen and Mingji Yang}, title = {Revisiting Local Computation of PageRank: Simple and Optimal}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1009-1008}, doi = {10.1145/3618260.3649661}, year = {2024}, } Publisher's Version Article: stoc24main-p276-p (type: Full Paper) doi:10.1145/3618260.3649661
	Wang, Shuo	STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672
	Wang, Yulin	STOC '24: "Sampling Proper Colorings ..." Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors Yulin Wang, Chihao Zhang, and Zihan Zhang (Shanghai Jiao Tong University, China; SOKENDAI, Japan) @InProceedings{STOC24p1873, author = {Yulin Wang and Chihao Zhang and Zihan Zhang}, title = {Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1873-1872}, doi = {10.1145/3618260.3649724}, year = {2024}, } Publisher's Version Article: stoc24main-p719-p (type: Full Paper) doi:10.1145/3618260.3649724
	Waters, Brent	STOC '24: "Adaptively-Sound Succinct ..." Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation Brent Waters and David J. Wu (University of Texas at Austin, USA; NTT Research, USA) @InProceedings{STOC24p445, author = {Brent Waters and David J. Wu}, title = {Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {445-444}, doi = {10.1145/3618260.3649671}, year = {2024}, } Publisher's Version Article: stoc24main-p330-p (type: Full Paper) doi:10.1145/3618260.3649671 STOC '24: "A New Approach for Non-Interactive ..." A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors Brent Waters (University of Texas at Austin, USA; NTT Research, USA) @InProceedings{STOC24p457, author = {Brent Waters}, title = {A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {457-456}, doi = {10.1145/3618260.3649683}, year = {2024}, } Publisher's Version Article: stoc24main-p401-p (type: Full Paper) doi:10.1145/3618260.3649683
	Weatherspoon, Hakim	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Wei, Zhewei	STOC '24: "Revisiting Local Computation ..." Revisiting Local Computation of PageRank: Simple and Optimal Hanzhi Wang, Zhewei Wei, Ji-Rong Wen, and Mingji Yang (Renmin University of China, China) @InProceedings{STOC24p1009, author = {Hanzhi Wang and Zhewei Wei and Ji-Rong Wen and Mingji Yang}, title = {Revisiting Local Computation of PageRank: Simple and Optimal}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1009-1008}, doi = {10.1145/3618260.3649661}, year = {2024}, } Publisher's Version Article: stoc24main-p276-p (type: Full Paper) doi:10.1145/3618260.3649661
	Weinberg, S. Matthew	STOC '24: "Settling the Communication ..." Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees Frederick Qiu and S. Matthew Weinberg (Princeton University, USA) @InProceedings{STOC24p1321, author = {Frederick Qiu and S. Matthew Weinberg}, title = {Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1321-1320}, doi = {10.1145/3618260.3649706}, year = {2024}, } Publisher's Version Article: stoc24main-p568-p (type: Full Paper) doi:10.1145/3618260.3649706
	Wellnitz, Philip	STOC '24: "Counting Small Induced Subgraphs ..." Counting Small Induced Subgraphs with Edge-Monotone Properties Simon Döring, Dániel Marx, and Philip Wellnitz (MPI-INF, Germany; Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany; Saarland Informatics Campus, Saarbrücken, Germany; CISPA Helmholtz Center for Information Security, Germany) @InProceedings{STOC24p1693, author = {Simon Döring and Dániel Marx and Philip Wellnitz}, title = {Counting Small Induced Subgraphs with Edge-Monotone Properties}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1693-1692}, doi = {10.1145/3618260.3649644}, year = {2024}, } Publisher's Version Article: stoc24main-p162-p (type: Full Paper) doi:10.1145/3618260.3649644 STOC '24: "On the Communication Complexity ..." On the Communication Complexity of Approximate Pattern Matching Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz (MPI-INF, Germany; Saarland Informatics Campus, Saarbrücken, Germany; ETH Zurich, Switzerland) @InProceedings{STOC24p1957, author = {Tomasz Kociumaka and Jakob Nogler and Philip Wellnitz}, title = {On the Communication Complexity of Approximate Pattern Matching}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1957-1956}, doi = {10.1145/3618260.3649604}, year = {2024}, } Publisher's Version Article: stoc24main-p13-p (type: Full Paper) doi:10.1145/3618260.3649604
	Wen, Ji-Rong	STOC '24: "Revisiting Local Computation ..." Revisiting Local Computation of PageRank: Simple and Optimal Hanzhi Wang, Zhewei Wei, Ji-Rong Wen, and Mingji Yang (Renmin University of China, China) @InProceedings{STOC24p1009, author = {Hanzhi Wang and Zhewei Wei and Ji-Rong Wen and Mingji Yang}, title = {Revisiting Local Computation of PageRank: Simple and Optimal}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1009-1008}, doi = {10.1145/3618260.3649661}, year = {2024}, } Publisher's Version Article: stoc24main-p276-p (type: Full Paper) doi:10.1145/3618260.3649661
	Whitmeyer, Michael	STOC '24: "Quantum Time-Space Tradeoffs ..." Quantum Time-Space Tradeoffs for Matrix Problems Paul Beame, Niels Kornerup, and Michael Whitmeyer (University of Washington, USA; University of Texas at Austin, USA) @InProceedings{STOC24p661, author = {Paul Beame and Niels Kornerup and Michael Whitmeyer}, title = {Quantum Time-Space Tradeoffs for Matrix Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {661-660}, doi = {10.1145/3618260.3649700}, year = {2024}, } Publisher's Version Article: stoc24main-p546-p (type: Full Paper) doi:10.1145/3618260.3649700
	Wiederrecht, Sebastian	STOC '24: "Packing Even Directed Circuits ..." Packing Even Directed Circuits Quarter-Integrally Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht (TU Berlin, Berlin, Germany; National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p769, author = {Maximilian Gorsky and Ken-ichi Kawarabayashi and Stephan Kreutzer and Sebastian Wiederrecht}, title = {Packing Even Directed Circuits Quarter-Integrally}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {769-768}, doi = {10.1145/3618260.3649682}, year = {2024}, } Publisher's Version Article: stoc24main-p391-p (type: Full Paper) doi:10.1145/3618260.3649682 STOC '24: "A Flat Wall Theorem for Matching ..." A Flat Wall Theorem for Matching Minors in Bipartite Graphs Archontia C. Giannopoulou and Sebastian Wiederrecht (National and Kapodistrian University of Athens, Athens, Greece; Institute for Basic Science, Daejeon, South Korea) @InProceedings{STOC24p793, author = {Archontia C. Giannopoulou and Sebastian Wiederrecht}, title = {A Flat Wall Theorem for Matching Minors in Bipartite Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {793-792}, doi = {10.1145/3618260.3649774}, year = {2024}, } Publisher's Version Article: stoc24main-p1351-p (type: Full Paper) doi:10.1145/3618260.3649774
	Williams, R. Ryan	STOC '24: "Self-Improvement for Circuit-Analysis ..." Self-Improvement for Circuit-Analysis Problems R. Ryan Williams (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1525, author = {R. Ryan Williams}, title = {Self-Improvement for Circuit-Analysis Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1525-1524}, doi = {10.1145/3618260.3649723}, year = {2024}, } Publisher's Version Article: stoc24main-p718-p (type: Full Paper) doi:10.1145/3618260.3649723 STOC '24: "Beating Brute Force for Compression ..." Beating Brute Force for Compression Problems Shuichi Hirahara, Rahul Ilango, and R. Ryan Williams (National Institute of Informatics, Tokyo, Japan; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p733, author = {Shuichi Hirahara and Rahul Ilango and R. Ryan Williams}, title = {Beating Brute Force for Compression Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {733-732}, doi = {10.1145/3618260.3649778}, year = {2024}, } Publisher's Version Article: stoc24main-p1425-p (type: Full Paper) doi:10.1145/3618260.3649778
	Williams, Virginia Vassilevska	STOC '24: "Towards Optimal Output-Sensitive ..." Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu (Morgan Stanley Research, Canada; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1021, author = {Mina Dalirrooyfard and Surya Mathialagan and Virginia Vassilevska Williams and Yinzhan Xu}, title = {Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1021-1020}, doi = {10.1145/3618260.3649663}, year = {2024}, } Publisher's Version Article: stoc24main-p288-p (type: Full Paper) doi:10.1145/3618260.3649663
	Wilson, Tegan	STOC '24: "Breaking the VLB Barrier for ..." Breaking the VLB Barrier for Oblivious Reconfigurable Networks Tegan Wilson, Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon (Cornell University, USA; Purdue University, USA) @InProceedings{STOC24p2077, author = {Tegan Wilson and Daniel Amir and Nitika Saran and Robert Kleinberg and Vishal Shrivastav and Hakim Weatherspoon}, title = {Breaking the VLB Barrier for Oblivious Reconfigurable Networks}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2077-2076}, doi = {10.1145/3618260.3649608}, year = {2024}, } Publisher's Version Article: stoc24main-p29-p (type: Full Paper) doi:10.1145/3618260.3649608
	Woodruff, David P.	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787 STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672 STOC '24: "Optimal Communication Bounds ..." Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, and Peilin Zhong (Google, United Kingdom; Carnegie Mellon University, USA; Google Research, USA) @InProceedings{STOC24p2125, author = {Hossein Esfandiari and Praneeth Kacham and Vahab Mirrokni and David P. Woodruff and Peilin Zhong}, title = {Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2125-2124}, doi = {10.1145/3618260.3649742}, year = {2024}, } Publisher's Version Article: stoc24main-p901-p (type: Full Paper) doi:10.1145/3618260.3649742
	Wright, John	STOC '24: "A One-Query Lower Bound for ..." A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography Alex Lombardi, Fermi Ma, and John Wright (Princeton University, USA; Simons Institute for the Theory of Computing, Berkeley, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1081, author = {Alex Lombardi and Fermi Ma and John Wright}, title = {A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1081-1080}, doi = {10.1145/3618260.3649650}, year = {2024}, } Publisher's Version Article: stoc24main-p179-p (type: Full Paper) doi:10.1145/3618260.3649650
	Wu, David J.	STOC '24: "Adaptively-Sound Succinct ..." Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation Brent Waters and David J. Wu (University of Texas at Austin, USA; NTT Research, USA) @InProceedings{STOC24p445, author = {Brent Waters and David J. Wu}, title = {Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {445-444}, doi = {10.1145/3618260.3649671}, year = {2024}, } Publisher's Version Article: stoc24main-p330-p (type: Full Paper) doi:10.1145/3618260.3649671
	Wu, David X.	STOC '24: "Robust Recovery for Stochastic ..." Robust Recovery for Stochastic Block Models, Simplified and Generalized Sidhanth Mohanty, Prasad Raghavendra, and David X. Wu (Massachusetts Institute of Technology, USA; University of California at Berkeley, USA) @InProceedings{STOC24p421, author = {Sidhanth Mohanty and Prasad Raghavendra and David X. Wu}, title = {Robust Recovery for Stochastic Block Models, Simplified and Generalized}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {421-420}, doi = {10.1145/3618260.3649761}, year = {2024}, } Publisher's Version Article: stoc24main-p1111-p (type: Full Paper) doi:10.1145/3618260.3649761
	Wu, Kewen	STOC '24: "Locality Bounds for Sampling ..." Locality Bounds for Sampling Hamming Slices Daniel M. Kane, Anthony Ostuni, and Kewen Wu (University of California at San Diego, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1417, author = {Daniel M. Kane and Anthony Ostuni and Kewen Wu}, title = {Locality Bounds for Sampling Hamming Slices}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1417-1416}, doi = {10.1145/3618260.3649670}, year = {2024}, } Publisher's Version Article: stoc24main-p320-p (type: Full Paper) doi:10.1145/3618260.3649670 STOC '24: "The Power of Adaptivity in ..." The Power of Adaptivity in Quantum Query Algorithms Uma Girish, Makrand Sinha, Avishay Tal, and Kewen Wu (Princeton University, USA; University of Illinois at Urbana-Champaign, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1657, author = {Uma Girish and Makrand Sinha and Avishay Tal and Kewen Wu}, title = {The Power of Adaptivity in Quantum Query Algorithms}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1657-1656}, doi = {10.1145/3618260.3649621}, year = {2024}, } Publisher's Version Article: stoc24main-p66-p (type: Full Paper) doi:10.1145/3618260.3649621 STOC '24: "Parameterized Inapproximability ..." Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, and Kewen Wu (University of California at Berkeley, USA; Nanjing University, China; Peking University, China) @InProceedings{STOC24p49, author = {Venkatesan Guruswami and Bingkai Lin and Xuandi Ren and Yican Sun and Kewen Wu}, title = {Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {49-48}, doi = {10.1145/3618260.3649771}, year = {2024}, } Publisher's Version Article: stoc24main-p1264-p (type: Full Paper) doi:10.1145/3618260.3649771
	Wu, Xuan	STOC '24: "On Optimal Coreset Construction ..." On Optimal Coreset Construction for Euclidean (k,z)-Clustering Lingxiao Huang, Jian Li, and Xuan Wu (Nanjing University, China; Tsinghua University, China) @InProceedings{STOC24p1777, author = {Lingxiao Huang and Jian Li and Xuan Wu}, title = {On Optimal Coreset Construction for Euclidean (k,z)-Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1777-1776}, doi = {10.1145/3618260.3649707}, year = {2024}, } Publisher's Version Article: stoc24main-p570-p (type: Full Paper) doi:10.1145/3618260.3649707
	Xie, Zhiye	STOC '24: "Tight Time-Space Tradeoffs ..." Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, and Yuping Ye (NYU Shanghai, China; East China Normal University, China) @InProceedings{STOC24p1933, author = { Akshima and Tyler Besselman and Siyao Guo and Zhiye Xie and Yuping Ye}, title = {Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1933-1932}, doi = {10.1145/3618260.3649752}, year = {2024}, } Publisher's Version Article: stoc24main-p1023-p (type: Full Paper) doi:10.1145/3618260.3649752
	Xu, Jeff	STOC '24: "Sum-of-Squares Lower Bounds ..." Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs Pravesh K. Kothari, Aaron Potechin, and Jeff Xu (Carnegie Mellon University, USA; University of Chicago, USA) @InProceedings{STOC24p2137, author = {Pravesh K. Kothari and Aaron Potechin and Jeff Xu}, title = {Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2137-2136}, doi = {10.1145/3618260.3649703}, year = {2024}, } Publisher's Version Article: stoc24main-p556-p (type: Full Paper) doi:10.1145/3618260.3649703
	Xu, Yinzhan	STOC '24: "Towards Optimal Output-Sensitive ..." Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu (Morgan Stanley Research, Canada; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1021, author = {Mina Dalirrooyfard and Surya Mathialagan and Virginia Vassilevska Williams and Yinzhan Xu}, title = {Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1021-1020}, doi = {10.1145/3618260.3649663}, year = {2024}, } Publisher's Version Article: stoc24main-p288-p (type: Full Paper) doi:10.1145/3618260.3649663 STOC '24: "Shaving Logs via Large Sieve ..." Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More Ce Jin and Yinzhan Xu (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1753, author = {Ce Jin and Yinzhan Xu}, title = {Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1753-1752}, doi = {10.1145/3618260.3649605}, year = {2024}, } Publisher's Version Article: stoc24main-p15-p (type: Full Paper) doi:10.1145/3618260.3649605
	Yan, Shuyi	STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712
	Yang, Guangxu	STOC '24: "Communication Lower Bounds ..." Communication Lower Bounds for Collision Problems via Density Increment Arguments Guangxu Yang and Jiapeng Zhang (University of Southern California, USA) @InProceedings{STOC24p697, author = {Guangxu Yang and Jiapeng Zhang}, title = {Communication Lower Bounds for Collision Problems via Density Increment Arguments}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {697-696}, doi = {10.1145/3618260.3649607}, year = {2024}, } Publisher's Version Article: stoc24main-p25-p (type: Full Paper) doi:10.1145/3618260.3649607
	Yang, Jiaming	STOC '24: "Solving Dense Linear Systems ..." Solving Dense Linear Systems Faster Than via Preconditioning Michał Dereziński and Jiaming Yang (University of Michigan, USA) @InProceedings{STOC24p1237, author = {Michał Dereziński and Jiaming Yang}, title = {Solving Dense Linear Systems Faster Than via Preconditioning}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1237-1236}, doi = {10.1145/3618260.3649694}, year = {2024}, } Publisher's Version Article: stoc24main-p464-p (type: Full Paper) doi:10.1145/3618260.3649694
	Yang, Mingji	STOC '24: "Revisiting Local Computation ..." Revisiting Local Computation of PageRank: Simple and Optimal Hanzhi Wang, Zhewei Wei, Ji-Rong Wen, and Mingji Yang (Renmin University of China, China) @InProceedings{STOC24p1009, author = {Hanzhi Wang and Zhewei Wei and Ji-Rong Wen and Mingji Yang}, title = {Revisiting Local Computation of PageRank: Simple and Optimal}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1009-1008}, doi = {10.1145/3618260.3649661}, year = {2024}, } Publisher's Version Article: stoc24main-p276-p (type: Full Paper) doi:10.1145/3618260.3649661
	Yannakakis, Mihalis	STOC '24: "Computing a Fixed Point of ..." Computing a Fixed Point of Contraction Maps in Polynomial Queries Xi Chen, Yuhao Li, and Mihalis Yannakakis (Columbia University, USA) @InProceedings{STOC24p1513, author = {Xi Chen and Yuhao Li and Mihalis Yannakakis}, title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1513-1512}, doi = {10.1145/3618260.3649623}, year = {2024}, } Publisher's Version Article: stoc24main-p78-p (type: Full Paper) doi:10.1145/3618260.3649623
	Ye, Guanghao	STOC '24: "Improving the Bit Complexity ..." Improving the Bit Complexity of Communication for Distributed Convex Optimization Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, and Guanghao Ye (Massachusetts Institute of Technology, USA; University of Washington, USA; Microsoft Research, USA; Carnegie Mellon University, USA) @InProceedings{STOC24p1249, author = {Mehrdad Ghadiri and Yin Tat Lee and Swati Padmanabhan and William Swartworth and David P. Woodruff and Guanghao Ye}, title = {Improving the Bit Complexity of Communication for Distributed Convex Optimization}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1249-1248}, doi = {10.1145/3618260.3649787}, year = {2024}, } Publisher's Version Article: stoc24main-p1603-p (type: Full Paper) doi:10.1145/3618260.3649787
	Ye, Yuping	STOC '24: "Tight Time-Space Tradeoffs ..." Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, and Yuping Ye (NYU Shanghai, China; East China Normal University, China) @InProceedings{STOC24p1933, author = { Akshima and Tyler Besselman and Siyao Guo and Zhiye Xie and Yuping Ye}, title = {Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1933-1932}, doi = {10.1145/3618260.3649752}, year = {2024}, } Publisher's Version Article: stoc24main-p1023-p (type: Full Paper) doi:10.1145/3618260.3649752
	Yehudayoff, Amir	STOC '24: "Local Borsuk-Ulam, Stability, ..." Local Borsuk-Ulam, Stability, and Replicability Zachary Chase, Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff (Technion, Israel; Google Research, Israel; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p1969, author = {Zachary Chase and Bogdan Chornomaz and Shay Moran and Amir Yehudayoff}, title = {Local Borsuk-Ulam, Stability, and Replicability}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1969-1968}, doi = {10.1145/3618260.3649632}, year = {2024}, } Publisher's Version Article: stoc24main-p119-p (type: Full Paper) doi:10.1145/3618260.3649632
	Yoneda, Hirotaka	STOC '24: "Better Coloring of 3-Colorable ..." Better Coloring of 3-Colorable Graphs Ken-ichi Kawarabayashi, Mikkel Thorup, and Hirotaka Yoneda (National Institute of Informatics, Tokyo, Japan; University of Tokyo, Tokyo, Japan; University of Copenhagen, Copenhagen, Denmark) @InProceedings{STOC24p373, author = {Ken-ichi Kawarabayashi and Mikkel Thorup and Hirotaka Yoneda}, title = {Better Coloring of 3-Colorable Graphs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {373-372}, doi = {10.1145/3618260.3649768}, year = {2024}, } Publisher's Version Article: stoc24main-p1255-p (type: Full Paper) doi:10.1145/3618260.3649768
	Yuen, Henry	STOC '24: "An Efficient Quantum Parallel ..." An Efficient Quantum Parallel Repetition Theorem and Applications John Bostanci, Luowen Qian, Nicholas Spooner, and Henry Yuen (Columbia University, USA; Boston University, USA; University of Warwick, United Kingdom; New York University, USA) @InProceedings{STOC24p1645, author = {John Bostanci and Luowen Qian and Nicholas Spooner and Henry Yuen}, title = {An Efficient Quantum Parallel Repetition Theorem and Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1645-1644}, doi = {10.1145/3618260.3649603}, year = {2024}, } Publisher's Version Article: stoc24main-p10-p (type: Full Paper) doi:10.1145/3618260.3649603 STOC '24: "On the Pauli Spectrum of QAC0 ..." On the Pauli Spectrum of QAC0 Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen (Columbia University, USA; University of California at Berkeley, USA) @InProceedings{STOC24p1669, author = {Shivam Nadimpalli and Natalie Parham and Francisca Vasconcelos and Henry Yuen}, title = {On the Pauli Spectrum of QAC0}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1669-1668}, doi = {10.1145/3618260.3649662}, year = {2024}, } Publisher's Version Article: stoc24main-p287-p (type: Full Paper) doi:10.1145/3618260.3649662
	Zarifis, Nikos	STOC '24: "Super Non-singular Decompositions ..." Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu, and Nikos Zarifis (University of Wisconsin-Madison, USA; University of California at San Diego, USA; University of Texas at Austin, USA) @InProceedings{STOC24p181, author = {Ilias Diakonikolas and Daniel M. Kane and Vasilis Kontonis and Sihan Liu and Nikos Zarifis}, title = {Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {181-180}, doi = {10.1145/3618260.3649776}, year = {2024}, } Publisher's Version Article: stoc24main-p1369-p (type: Full Paper) doi:10.1145/3618260.3649776
	Zenklusen, Rico	STOC '24: "Ghost Value Augmentation for ..." Ghost Value Augmentation for k-Edge-Connectivity D. Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen (Brown University, USA; Institute for Advanced Study, Princeton, USA; ETH Zurich, Switzerland) @InProceedings{STOC24p2065, author = {D. Ellis Hershkowitz and Nathan Klein and Rico Zenklusen}, title = {Ghost Value Augmentation for k-Edge-Connectivity}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2065-2064}, doi = {10.1145/3618260.3649715}, year = {2024}, } Publisher's Version Article: stoc24main-p621-p (type: Full Paper) doi:10.1145/3618260.3649715
	Zhang, Chihao	STOC '24: "Sampling Proper Colorings ..." Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors Yulin Wang, Chihao Zhang, and Zihan Zhang (Shanghai Jiao Tong University, China; SOKENDAI, Japan) @InProceedings{STOC24p1873, author = {Yulin Wang and Chihao Zhang and Zihan Zhang}, title = {Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1873-1872}, doi = {10.1145/3618260.3649724}, year = {2024}, } Publisher's Version Article: stoc24main-p719-p (type: Full Paper) doi:10.1145/3618260.3649724
	Zhang, Guochuan	STOC '24: "A Nearly Quadratic-Time FPTAS ..." A Nearly Quadratic-Time FPTAS for Knapsack Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p325, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {A Nearly Quadratic-Time FPTAS for Knapsack}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {325-324}, doi = {10.1145/3618260.3649730}, year = {2024}, } Publisher's Version Article: stoc24main-p797-p (type: Full Paper) doi:10.1145/3618260.3649730 STOC '24: "Approximating Partition in ..." Approximating Partition in Near-Linear Time Lin Chen, Jiayi Lian, Yuchen Mao, and Guochuan Zhang (Zhejiang University, China) @InProceedings{STOC24p349, author = {Lin Chen and Jiayi Lian and Yuchen Mao and Guochuan Zhang}, title = {Approximating Partition in Near-Linear Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {349-348}, doi = {10.1145/3618260.3649727}, year = {2024}, } Publisher's Version Article: stoc24main-p758-p (type: Full Paper) doi:10.1145/3618260.3649727
	Zhang, Hanwen	STOC '24: "Combinatorial Correlation ..." Combinatorial Correlation Clustering Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, and Hanwen Zhang (Google Research, France; University of Copenhagen, Copenhagen, Denmark; University of Warsaw, Poland) @InProceedings{STOC24p1801, author = {Vincent Cohen-Addad and David Rasmussen Lolck and Marcin Pilipczuk and Mikkel Thorup and Shuyi Yan and Hanwen Zhang}, title = {Combinatorial Correlation Clustering}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1801-1800}, doi = {10.1145/3618260.3649712}, year = {2024}, } Publisher's Version Article: stoc24main-p600-p (type: Full Paper) doi:10.1145/3618260.3649712 STOC '24: "Minimum Star Partitions of ..." Minimum Star Partitions of Simple Polygons in Polynomial Time Mikkel Abrahamsen, Joakim Blikstad, André Nusser, and Hanwen Zhang (University of Copenhagen, Copenhagen, Denmark; KTH Royal Institute of Technology, Stockholm, Sweden; MPI-INF, Germany) @InProceedings{STOC24p997, author = {Mikkel Abrahamsen and Joakim Blikstad and André Nusser and Hanwen Zhang}, title = {Minimum Star Partitions of Simple Polygons in Polynomial Time}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {997-996}, doi = {10.1145/3618260.3649756}, year = {2024}, } Publisher's Version Article: stoc24main-p1052-p (type: Full Paper) doi:10.1145/3618260.3649756
	Zhang, Jiapeng	STOC '24: "A New Information Complexity ..." A New Information Complexity Measure for Multi-pass Streaming with Applications Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, and Jiapeng Zhang (Princeton University, USA; Rutgers University, USA; Shenzhen Research Institute of Big Data, China; Shanghai Jiao Tong University, China; Carnegie Mellon University, USA; University of Southern California, USA) @InProceedings{STOC24p1981, author = {Mark Braverman and Sumegha Garg and Qian Li and Shuo Wang and David P. Woodruff and Jiapeng Zhang}, title = {A New Information Complexity Measure for Multi-pass Streaming with Applications}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1981-1980}, doi = {10.1145/3618260.3649672}, year = {2024}, } Publisher's Version Article: stoc24main-p341-p (type: Full Paper) doi:10.1145/3618260.3649672 STOC '24: "Communication Lower Bounds ..." Communication Lower Bounds for Collision Problems via Density Increment Arguments Guangxu Yang and Jiapeng Zhang (University of Southern California, USA) @InProceedings{STOC24p697, author = {Guangxu Yang and Jiapeng Zhang}, title = {Communication Lower Bounds for Collision Problems via Density Increment Arguments}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {697-696}, doi = {10.1145/3618260.3649607}, year = {2024}, } Publisher's Version Article: stoc24main-p25-p (type: Full Paper) doi:10.1145/3618260.3649607
	Zhang, Tian	STOC '24: "Data-Dependent LSH for the ..." Data-Dependent LSH for the Earth Mover’s Distance Rajesh Jayaram, Erik Waingarten, and Tian Zhang (Google Research, USA; University of Pennsylvania, USA) @InProceedings{STOC24p877, author = {Rajesh Jayaram and Erik Waingarten and Tian Zhang}, title = {Data-Dependent LSH for the Earth Mover’s Distance}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {877-876}, doi = {10.1145/3618260.3649666}, year = {2024}, } Publisher's Version Article: stoc24main-p310-p (type: Full Paper) doi:10.1145/3618260.3649666
	Zhang, Zhijun	STOC '24: "Optimal Multi-pass Lower Bounds ..." Optimal Multi-pass Lower Bounds for MST in Dynamic Streams Sepehr Assadi, Gillat Kol, and Zhijun Zhang (University of Waterloo, Canada; Rutgers University, USA; Princeton University, USA) @InProceedings{STOC24p913, author = {Sepehr Assadi and Gillat Kol and Zhijun Zhang}, title = {Optimal Multi-pass Lower Bounds for MST in Dynamic Streams}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {913-912}, doi = {10.1145/3618260.3649755}, year = {2024}, } Publisher's Version Article: stoc24main-p1046-p (type: Full Paper) doi:10.1145/3618260.3649755
	Zhang, Zihan	STOC '24: "Sampling Proper Colorings ..." Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors Yulin Wang, Chihao Zhang, and Zihan Zhang (Shanghai Jiao Tong University, China; SOKENDAI, Japan) @InProceedings{STOC24p1873, author = {Yulin Wang and Chihao Zhang and Zihan Zhang}, title = {Sampling Proper Colorings on Line Graphs Using (1+o(1))Δ Colors}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1873-1872}, doi = {10.1145/3618260.3649724}, year = {2024}, } Publisher's Version Article: stoc24main-p719-p (type: Full Paper) doi:10.1145/3618260.3649724 STOC '24: "AG Codes Achieve List Decoding ..." AG Codes Achieve List Decoding Capacity over Constant-Sized Fields Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, and Zihan Zhang (Independent, USA; Massachusetts Institute of Technology, USA; Microsoft Research, USA; Ohio State University, USA) @InProceedings{STOC24p817, author = {Joshua Brakensiek and Manik Dhar and Sivakanth Gopi and Zihan Zhang}, title = {AG Codes Achieve List Decoding Capacity over Constant-Sized Fields}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {817-816}, doi = {10.1145/3618260.3649651}, year = {2024}, } Publisher's Version Article: stoc24main-p193-p (type: Full Paper) doi:10.1145/3618260.3649651
	Zhao, Mingfei	STOC '24: "The Power of Two-Sided Recruitment ..." The Power of Two-Sided Recruitment in Two-Sided Markets Yang Cai, Christopher Liaw, Aranyak Mehta, and Mingfei Zhao (Yale University, USA; Google Research, USA) @InProceedings{STOC24p241, author = {Yang Cai and Christopher Liaw and Aranyak Mehta and Mingfei Zhao}, title = {The Power of Two-Sided Recruitment in Two-Sided Markets}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {241-240}, doi = {10.1145/3618260.3649669}, year = {2024}, } Publisher's Version Article: stoc24main-p319-p (type: Full Paper) doi:10.1145/3618260.3649669
	Zheng, Kai Zhe	STOC '24: "Near Optimal Alphabet-Soundness ..." Near Optimal Alphabet-Soundness Tradeoff PCPs Dor Minzer and Kai Zhe Zheng (Massachusetts Institute of Technology, USA) @InProceedings{STOC24p37, author = {Dor Minzer and Kai Zhe Zheng}, title = {Near Optimal Alphabet-Soundness Tradeoff PCPs}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {37-36}, doi = {10.1145/3618260.3649606}, year = {2024}, } Publisher's Version Article: stoc24main-p21-p (type: Full Paper) doi:10.1145/3618260.3649606
	Zhong, Peilin	STOC '24: "Optimal Communication Bounds ..." Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, and Peilin Zhong (Google, United Kingdom; Carnegie Mellon University, USA; Google Research, USA) @InProceedings{STOC24p2125, author = {Hossein Esfandiari and Praneeth Kacham and Vahab Mirrokni and David P. Woodruff and Peilin Zhong}, title = {Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2125-2124}, doi = {10.1145/3618260.3649742}, year = {2024}, } Publisher's Version Article: stoc24main-p901-p (type: Full Paper) doi:10.1145/3618260.3649742
	Zhou, Leo	STOC '24: "Local Minima in Quantum Systems ..." Local Minima in Quantum Systems Chi-Fang Chen, Hsin-Yuan Huang, John Preskill, and Leo Zhou (California Institute of Technology, USA; AWS Center for Quantum Computing, USA; Google Quantum AI, USA; Massachusetts Institute of Technology, USA) @InProceedings{STOC24p1465, author = {Chi-Fang Chen and Hsin-Yuan Huang and John Preskill and Leo Zhou}, title = {Local Minima in Quantum Systems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {1465-1464}, doi = {10.1145/3618260.3649675}, year = {2024}, } Publisher's Version Article: stoc24main-p355-p (type: Full Paper) doi:10.1145/3618260.3649675
	Ziliotto, Bruno	STOC '24: "Prophet Inequalities Require ..." Prophet Inequalities Require Only a Constant Number of Samples Andrés Cristi and Bruno Ziliotto (University of Chile, Chile; Center for Mathematical Modeling, Chile; CNRS, France; Paris Dauphine University, France) @InProceedings{STOC24p553, author = {Andrés Cristi and Bruno Ziliotto}, title = {Prophet Inequalities Require Only a Constant Number of Samples}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {553-552}, doi = {10.1145/3618260.3649773}, year = {2024}, } Publisher's Version Article: stoc24main-p1317-p (type: Full Paper) doi:10.1145/3618260.3649773
	Živný, Stanislav	STOC '24: "Semidefinite Programming and ..." Semidefinite Programming and Linear Equations vs. Homomorphism Problems Lorenzo Ciardo and Stanislav Živný (University of Oxford, United Kingdom) @InProceedings{STOC24p2149, author = {Lorenzo Ciardo and Stanislav Živný}, title = {Semidefinite Programming and Linear Equations vs. Homomorphism Problems}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {2149-2148}, doi = {10.1145/3618260.3649635}, year = {2024}, } Publisher's Version Article: stoc24main-p131-p (type: Full Paper) doi:10.1145/3618260.3649635
	Zuzic, Goran	STOC '24: "Polylog-Competitive Deterministic ..." Polylog-Competitive Deterministic Local Routing and Scheduling Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic (ETH Zurich, Switzerland; Carnegie Mellon University, USA; Columbia University, USA; Google Research, Switzerland) @InProceedings{STOC24p889, author = {Bernhard Haeupler and Shyamal Patel and Antti Roeyskoe and Cliff Stein and Goran Zuzic}, title = {Polylog-Competitive Deterministic Local Routing and Scheduling}, booktitle = {Proc.\ STOC}, publisher = {ACM}, pages = {889-888}, doi = {10.1145/3618260.3649678}, year = {2024}, } Publisher's Version Article: stoc24main-p370-p (type: Full Paper) doi:10.1145/3618260.3649678