LIPIcs, Volume 287, ITCS 2024

Venkatesan Guruswami LIPIcs, Volume 287, ITCS 2024, Complete Volume 10.4230/LIPIcs.ITCS.2024
Venkatesan Guruswami Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2024.0
Scott Aaronson, Harry Buhrman, and William Kretschmer A Qubit, a Coin, and an Advice String Walk into a Relational Problem 10.4230/LIPIcs.ITCS.2024.1
Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou Quantum Pseudoentanglement 10.4230/LIPIcs.ITCS.2024.2
Maryam Aliakbarpour, Rose Silver, Thomas Steinke, and Jonathan Ullman Differentially Private Medians and Interior Points for Non-Pathological Data 10.4230/LIPIcs.ITCS.2024.3
Josh Alman, Ethan Turok, Hantao Yu, and Hengzhi Zhang Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming 10.4230/LIPIcs.ITCS.2024.4
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, and Manolis Zampetakis On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games 10.4230/LIPIcs.ITCS.2024.5
Prabhanjan Ananth, Yao-Ting Lin, and Henry Yuen Pseudorandom Strings from Pseudorandom Quantum States 10.4230/LIPIcs.ITCS.2024.6
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, and Kasturi Varadarajan Geometric Covering via Extraction Theorem 10.4230/LIPIcs.ITCS.2024.7
Siddharth Barman, Anand Krishna, Pooja Kulkarni, and Shivika Narang Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations 10.4230/LIPIcs.ITCS.2024.8
Roozbeh Bassirian, Bill Fefferman, and Kunal Marwaha Quantum Merlin-Arthur and Proofs Without Relative Phase 10.4230/LIPIcs.ITCS.2024.9
Gabriel Bathie and R. Ryan Williams Towards Stronger Depth Lower Bounds 10.4230/LIPIcs.ITCS.2024.10
Omri Ben-Eliezer, Esty Kelman, Uri Meir, and Sofya Raskhodnikova Property Testing with Online Adversaries 10.4230/LIPIcs.ITCS.2024.11
Aaron Bernstein, Greg Bodwin, and Nicole Wein Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? 10.4230/LIPIcs.ITCS.2024.12
Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco, Archan Ray, Sushant Sachdeva, and David P. Woodruff Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra 10.4230/LIPIcs.ITCS.2024.13
Kaartik Bhushan, Venkata Koppula, and Manoj Prabhakaran Homomorphic Indistinguishability Obfuscation and Its Applications 10.4230/LIPIcs.ITCS.2024.14
Hadley Black, Eric Blais, and Nathaniel Harms Testing and Learning Convex Sets in the Ternary Hypercube 10.4230/LIPIcs.ITCS.2024.15
Keller Blackwell and Mary Wootters A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications 10.4230/LIPIcs.ITCS.2024.16
Jarosław Błasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, and Preetum Nakkiran Loss Minimization Yields Multicalibration for Large Neural Networks 10.4230/LIPIcs.ITCS.2024.17
Avrim Blum and Melissa Dutz Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round 10.4230/LIPIcs.ITCS.2024.18
Greg Bodwin and Henry Fleischmann Spanning Adjacency Oracles in Sublinear Time 10.4230/LIPIcs.ITCS.2024.19
Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, and Jeroen Zuiddam Discreteness of Asymptotic Tensor Ranks (Extended Abstract) 10.4230/LIPIcs.ITCS.2024.20
Jop Briët, Harry Buhrman, Davi Castro-Silva, and Niels M. P. Neumann Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract) 10.4230/LIPIcs.ITCS.2024.21
Karl Bringmann, Allan Grønlund, Marvin Künnemann, and Kasper Green Larsen The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds 10.4230/LIPIcs.ITCS.2024.22
Clément L. Canonne and Yucheng Sun Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine 10.4230/LIPIcs.ITCS.2024.23
Matthias C. Caro, Marcel Hinsche, Marios Ioannou, Alexander Nietner, and Ryan Sweke Classical Verification of Quantum Learning 10.4230/LIPIcs.ITCS.2024.24
Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, and Tanmay Sinha Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning 10.4230/LIPIcs.ITCS.2024.25
Yi-Jun Chang The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees 10.4230/LIPIcs.ITCS.2024.26
Abhranil Chatterjee, Mrinal Kumar, and Ben Lee Volk Determinants vs. Algebraic Branching Programs 10.4230/LIPIcs.ITCS.2024.27
Eshan Chattopadhyay, Jesse Goodman, and Mohit Gurumukhani Extractors for Polynomial Sources over 𝔽₂ 10.4230/LIPIcs.ITCS.2024.28
Eshan Chattopadhyay and Jyun-Jie Liao Recursive Error Reduction for Regular Branching Programs 10.4230/LIPIcs.ITCS.2024.29
Zongchen Chen and Elchanan Mossel Influence Maximization in Ising Models 10.4230/LIPIcs.ITCS.2024.30
Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang, and Chuanqi Zhang On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups 10.4230/LIPIcs.ITCS.2024.31
Justin Y. Chen, Piotr Indyk, and David P. Woodruff Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions 10.4230/LIPIcs.ITCS.2024.32
Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, and Rocco A. Servedio Testing Intersecting and Union-Closed Families 10.4230/LIPIcs.ITCS.2024.33
Alessandro Chiesa, Ziyi Guan, and Burcu Yıldız On Parallel Repetition of PCPs 10.4230/LIPIcs.ITCS.2024.34
Romain Cosson and Laurent Massoulié Collective Tree Exploration via Potential Function Method 10.4230/LIPIcs.ITCS.2024.35
Varsha Dani, Thomas P. Hayes, Seth Pettie, and Jared Saia Fraud Detection for Random Walks 10.4230/LIPIcs.ITCS.2024.36
Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, and Abhishek Shetty Smooth Nash Equilibria: Algorithms and Complexity 10.4230/LIPIcs.ITCS.2024.37
Erik D. Demaine, Yael Kirkpatrick, and Rebecca Lin Graph Threading 10.4230/LIPIcs.ITCS.2024.38
Atanas Dinev and S. Matthew Weinberg Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids 10.4230/LIPIcs.ITCS.2024.39
Nico Döttling and Tamer Mour On the Black-Box Complexity of Correlation Intractability 10.4230/LIPIcs.ITCS.2024.40
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson The Message Complexity of Distributed Graph Optimization 10.4230/LIPIcs.ITCS.2024.41
Fabien Dufoulon, Michael Moorman, William K. Moses Jr., and Gopal Pandurangan Time- and Communication-Efficient Overlay Network Construction via Gossip 10.4230/LIPIcs.ITCS.2024.42
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, and Vladimir Lysikov Homogeneous Algebraic Complexity Theory and Algebraic Formulas 10.4230/LIPIcs.ITCS.2024.43
Tomer Ezra, Michal Feldman, and Maya Schlesinger On the (In)approximability of Combinatorial Contracts 10.4230/LIPIcs.ITCS.2024.44
Yumou Fei, Leslie Ann Goldberg, and Pinyan Lu Two-State Spin Systems with Negative Interactions 10.4230/LIPIcs.ITCS.2024.45
Rex Fernando, Yuval Gelles, and Ilan Komargodski Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election 10.4230/LIPIcs.ITCS.2024.46
Renato Ferreira Pinto Jr. and Nathaniel Harms Distribution Testing with a Confused Collector 10.4230/LIPIcs.ITCS.2024.47
Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, and Marc Vinyals Proving Unsatisfiability with Hitting Formulas 10.4230/LIPIcs.ITCS.2024.48
Nick Fischer, Piotr Kaliciak, and Adam Polak Deterministic 3SUM-Hardness 10.4230/LIPIcs.ITCS.2024.49
Lukáš Folwarczný, Mika Göös, Pavel Hubáček, Gilbert Maystre, and Weiqiang Yuan One-Way Functions vs. TFNP: Simpler and Improved 10.4230/LIPIcs.ITCS.2024.50
Rafael Frongillo, Maneesha Papireddygari, and Bo Waggoner An Axiomatic Characterization of CFMMs and Equivalence to Prediction Markets 10.4230/LIPIcs.ITCS.2024.51
Haosen Ge, Hamsa Bastani, and Osbert Bastani Rethinking Fairness for Human-AI Collaboration (Extended Abstract) 10.4230/LIPIcs.ITCS.2024.52
Prantar Ghosh and Vihan Shah New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification 10.4230/LIPIcs.ITCS.2024.53
Louis Golowich and Tali Kaufman NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes 10.4230/LIPIcs.ITCS.2024.54
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan Electrical Flows for Polylogarithmic Competitive Oblivious Routing 10.4230/LIPIcs.ITCS.2024.55
Mayank Goswami and Riko Jacob An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio 10.4230/LIPIcs.ITCS.2024.56
Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius, and Divyarthi Mohan Communicating with Anecdotes (Extended Abstract) 10.4230/LIPIcs.ITCS.2024.57
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, and Adi Shraibman An Improved Protocol for ExactlyN with More Than 3 Players 10.4230/LIPIcs.ITCS.2024.58
Jason Hartline and Aleck Johnsen Equivocal Blends: Prior Independent Lower Bounds 10.4230/LIPIcs.ITCS.2024.59
Ishay Haviv The Chromatic Number of Kneser Hypergraphs via Consensus Division 10.4230/LIPIcs.ITCS.2024.60
Lisa Hellerstein, Naifeng Liu, and Kevin Schewior Quickly Determining Who Won an Election 10.4230/LIPIcs.ITCS.2024.61
Monika Henzinger, Barna Saha, Martin P. Seybold, and Christopher Ye On the Complexity of Algorithms with Predictions for Dynamic Graph Problems 10.4230/LIPIcs.ITCS.2024.62
Pavel Hubáček, Erfan Khaniki, and Neil Thapen TFNP Intersections Through the Lens of Feasible Disjunction 10.4230/LIPIcs.ITCS.2024.63
Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, and Saket Saurabh Exponential-Time Approximation Schemes via Compression 10.4230/LIPIcs.ITCS.2024.64
Ragesh Jaiswal, Amit Kumar, and Jatin Yadav FPT Approximation for Capacitated Sum of Radii 10.4230/LIPIcs.ITCS.2024.65
Ce Jin, R. Ryan Williams, and Nathaniel Young A VLSI Circuit Model Accounting for Wire Delay 10.4230/LIPIcs.ITCS.2024.66
Thomas Karam Small Sunflowers and the Structure of Slice Rank Decompositions 10.4230/LIPIcs.ITCS.2024.67
Ari Karchmer Distributional PAC-Learning from Nisan’s Natural Proofs 10.4230/LIPIcs.ITCS.2024.68
Ohad Klein, Joseph Slote, Alexander Volberg, and Haonan Zhang Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality 10.4230/LIPIcs.ITCS.2024.69
Weihao Kong, Mingda Qiao, and Rajat Sen A Combinatorial Approach to Robust PCA 10.4230/LIPIcs.ITCS.2024.70
Euiwoong Lee and Pasin Manurangsi Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs 10.4230/LIPIcs.ITCS.2024.71
Xingjian Li, Qipeng Liu, Angelos Pelecanos, and Takashi Yamakawa Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle 10.4230/LIPIcs.ITCS.2024.72
Minming Li, Peter Robinson, and Xianbin Zhu Dynamic Maximal Matching in Clique Networks 10.4230/LIPIcs.ITCS.2024.73
Yuhao Li, William Pires, and Robert Robere Intersection Classes in TFNP and Proof Complexity 10.4230/LIPIcs.ITCS.2024.74
Jiawei Li Total NP Search Problems with Abundant Solutions 10.4230/LIPIcs.ITCS.2024.75
Roi Livni Making Progress Based on False Discoveries 10.4230/LIPIcs.ITCS.2024.76
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi Kernelization of Counting Problems 10.4230/LIPIcs.ITCS.2024.77
Baptiste Louf, Colin McDiarmid, and Fiona Skerman Modularity and Graph Expansion 10.4230/LIPIcs.ITCS.2024.78
Arvind V. Mahankali, David P. Woodruff, and Ziyu Zhang Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions 10.4230/LIPIcs.ITCS.2024.79
Noam Mazor and Rafael Pass The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False 10.4230/LIPIcs.ITCS.2024.80
Jason Milionis, Ciamac C. Moallemi, and Tim Roughgarden A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers 10.4230/LIPIcs.ITCS.2024.81
Barak Nehoran and Mark Zhandry A Computational Separation Between Quantum No-Cloning and No-Telegraphing 10.4230/LIPIcs.ITCS.2024.82
Ofer Neiman and Idan Shabat On the Size Overhead of Pairwise Spanners 10.4230/LIPIcs.ITCS.2024.83
Rian Neogi, Kanstantsin Pashkovich, and Chaitanya Swamy Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints 10.4230/LIPIcs.ITCS.2024.84
Aleksandar Nikolov and Haohua Tang General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation 10.4230/LIPIcs.ITCS.2024.85
Charlotte Out, Nicolás Rivera, Thomas Sauerwald, and John Sylvester Rumors with Changing Credibility 10.4230/LIPIcs.ITCS.2024.86
Shir Peleg, Amir Shpilka, and Ben Lee Volk Tensor Reconstruction Beyond Constant Rank 10.4230/LIPIcs.ITCS.2024.87
Asaf Petruschka, Shay Sapir, and Elad Tzalik Color Fault-Tolerant Spanners 10.4230/LIPIcs.ITCS.2024.88
Kevin Pratt On Generalized Corners and Matrix Multiplication 10.4230/LIPIcs.ITCS.2024.89
Aaron (Louie) Putterman and Edward Pyne Pseudorandom Linear Codes Are List-Decodable to Capacity 10.4230/LIPIcs.ITCS.2024.90
C. Ramya and Pratik Shastri Lower Bounds for Planar Arithmetic Circuits 10.4230/LIPIcs.ITCS.2024.91
Joseph Slote Parity vs. AC0 with Simple Quantum Preprocessing 10.4230/LIPIcs.ITCS.2024.92
Zhao Song, Lichen Zhang, and Ruizhe Zhang Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time 10.4230/LIPIcs.ITCS.2024.93
Teresa Anna Steiner Differentially Private Approximate Pattern Matching 10.4230/LIPIcs.ITCS.2024.94
Iddo Tzameret and Lu-Ming Zhang Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness 10.4230/LIPIcs.ITCS.2024.95
Gregory Valiant Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis 10.4230/LIPIcs.ITCS.2024.96
Adam Bene Watts and John Bostanci Quantum Event Learning and Gentle Random Measurements 10.4230/LIPIcs.ITCS.2024.97
Ke Wu, Elaine Shi, and Hao Chung Maximizing Miner Revenue in Transaction Fee Mechanism Design 10.4230/LIPIcs.ITCS.2024.98
Huacheng Yu and Wei Zhan Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions 10.4230/LIPIcs.ITCS.2024.99
Huacheng Yu and Wei Zhan Sampling, Flowers and Communication 10.4230/LIPIcs.ITCS.2024.100
Mark Zhandry Quantum Money from Abelian Group Actions 10.4230/LIPIcs.ITCS.2024.101
Mark Zhandry The Space-Time Cost of Purifying Quantum Computations 10.4230/LIPIcs.ITCS.2024.102
Mingxun Zhou, Mengshi Zhao, T-H. Hubert Chan, and Elaine Shi Advanced Composition Theorems for Differential Obliviousness 10.4230/LIPIcs.ITCS.2024.103