LIPIcs, Volume 251, ITCS 2023

• Yael Tauman Kalai LIPIcs, Volume 251, ITCS 2023, Complete Volume 10.4230/LIPIcs.ITCS.2023
• Yael Tauman Kalai Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2023.0
• Amir Abboud and Nathan Wallheimer Worst-Case to Expander-Case Reductions 10.4230/LIPIcs.ITCS.2023.1
• Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan Matroid Partition Property and the Secretary Problem 10.4230/LIPIcs.ITCS.2023.2
• Eric Allender, Shuichi Hirahara, and Harsha Tirumala Kolmogorov Complexity Characterizes Statistical Zero Knowledge 10.4230/LIPIcs.ITCS.2023.3
• Alexandr Andoni, Jarosław Błasiok, and Arnold Filtser Communication Complexity of Inner Product in Symmetric Normed Spaces 10.4230/LIPIcs.ITCS.2023.4
• Anurag Anshu and Tony Metger Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations 10.4230/LIPIcs.ITCS.2023.5
• V. Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, and C. Ramya On Identity Testing and Noncommutative Rank Computation over the Free Skew Field 10.4230/LIPIcs.ITCS.2023.6
• Sepehr Assadi, Aaron Bernstein, and Zachary Langley All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method 10.4230/LIPIcs.ITCS.2023.7
• Idan Attias, Edith Cohen, Moshe Shechner, and Uri Stemmer A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators 10.4230/LIPIcs.ITCS.2023.8
• Moshe Babaioff, Nicole Immorlica, Yingkai Li, and Brendan Lucier Making Auctions Robust to Aftermarkets 10.4230/LIPIcs.ITCS.2023.9
• Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Małgorzata Gałązka, Tomasz Lizurej, and Krzysztof Pietrzak Efficiently Testable Circuits 10.4230/LIPIcs.ITCS.2023.10
• Eric Balkanski, Vasilis Gkatzelis, and Xizhi Tan Strategyproof Scheduling with Predictions 10.4230/LIPIcs.ITCS.2023.11
• Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, and Zhouzi Li Graph Searching with Predictions 10.4230/LIPIcs.ITCS.2023.12
• Ulrich Bauer, Abhishek Rathod, and Meirav Zehavi On Computing Homological Hitting Sets 10.4230/LIPIcs.ITCS.2023.13
• Paul Beame and Sajin Koroth On Disperser/Lifting Properties of the Index and Inner-Product Functions 10.4230/LIPIcs.ITCS.2023.14
• Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, and Madhu Sudan Is This Correct? Let’s Check! 10.4230/LIPIcs.ITCS.2023.15
• Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, and Kamesh Munagala Online Learning and Bandits with Queried Hints 10.4230/LIPIcs.ITCS.2023.16
• Nir Bitansky and Tomer Solomon Bootstrapping Homomorphic Encryption via Functional Encryption 10.4230/LIPIcs.ITCS.2023.17
• Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, and Li-Yang Tan Certification with an NP Oracle 10.4230/LIPIcs.ITCS.2023.18
• Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, and Chris Umans Matrix Multiplication via Matrix Groups 10.4230/LIPIcs.ITCS.2023.19
• Greg Bodwin, Michael Dinitz, and Yasamin Nazari Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free 10.4230/LIPIcs.ITCS.2023.20
• Greg Bodwin and Forest Zhang Opponent Indifference in Rating Systems: A Theoretical Case for Sonas 10.4230/LIPIcs.ITCS.2023.21
• Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček, Alon Rosen, and Nikolaj I. Schwartzbach PPP-Completeness and Extremal Combinatorics 10.4230/LIPIcs.ITCS.2023.22
• Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, and Gal Yehuda On Low-End Obfuscation and Learning 10.4230/LIPIcs.ITCS.2023.23
• Zvika Brakerski, Ran Canetti, and Luowen Qian On the Computational Hardness Needed for Quantum Cryptography 10.4230/LIPIcs.ITCS.2023.24
• Mark Braverman, Subhash Khot, Guy Kindler, and Dor Minzer Improved Monotonicity Testers via Hypercube Embeddings 10.4230/LIPIcs.ITCS.2023.25
• Mark Braverman and Dor Minzer Rounding via Low Dimensional Embeddings 10.4230/LIPIcs.ITCS.2023.26
• Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, and Marc Roth Counting Subgraphs in Somewhere Dense Graphs 10.4230/LIPIcs.ITCS.2023.27
• Anne Broadbent and Eric Culf Rigidity for Monogamy-Of-Entanglement Games 10.4230/LIPIcs.ITCS.2023.28
• Harry Buhrman, Noah Linden, Laura Mančinska, Ashley Montanaro, and Maris Ozols Quantum Majority Vote 10.4230/LIPIcs.ITCS.2023.29
• Sam Buss, Noah Fleming, and Russell Impagliazzo TFNP Characterizations of Proof Systems and Monotone Circuits 10.4230/LIPIcs.ITCS.2023.30
• Diptarka Chakraborty, Debarati Das, and Robert Krauthgamer Clustering Permutations: New Techniques with Streaming Applications 10.4230/LIPIcs.ITCS.2023.31
• Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, and Anupa Sunny Certificate Games 10.4230/LIPIcs.ITCS.2023.32
• Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, and Suhail Sherif Lifting to Parity Decision Trees via Stifling 10.4230/LIPIcs.ITCS.2023.33
• Lijie Chen New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method 10.4230/LIPIcs.ITCS.2023.34
• Lijie Chen, Ryan Williams, and Tianqi Yang Black-Box Constructive Proofs Are Unavoidable 10.4230/LIPIcs.ITCS.2023.35
• Albert Cheu and Chao Yan Necessary Conditions in Multi-Server Differential Privacy 10.4230/LIPIcs.ITCS.2023.36
• Andrew M. Childs, Matthew Coudron, and Amin Shiraz Gilani Quantum Algorithms and the Power of Forgetting 10.4230/LIPIcs.ITCS.2023.37
• Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, and Zihan Tan A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems 10.4230/LIPIcs.ITCS.2023.38
• Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, and Uri Stemmer Generalized Private Selection and Testing with High Confidence 10.4230/LIPIcs.ITCS.2023.39
• Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones Exact Completeness of LP Hierarchies for Linear Codes 10.4230/LIPIcs.ITCS.2023.40
• Zhun Deng, Cynthia Dwork, and Linjun Zhang HappyMap : A Generalized Multicalibration Method 10.4230/LIPIcs.ITCS.2023.41
• Papri Dey, Ravi Kannan, Nick Ryder, and Nikhil Srivastava Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization 10.4230/LIPIcs.ITCS.2023.42
• Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir Podolskii Constant-Depth Sorting Networks 10.4230/LIPIcs.ITCS.2023.43
• Shahar Dobzinski and Ariel Shaulker Rigidity in Mechanism Design and Its Applications 10.4230/LIPIcs.ITCS.2023.44
• Fabien Dufoulon, Yuval Emek, and Ran Gelles Beeping Shortest Paths via Hypergraph Bipartite Decomposition 10.4230/LIPIcs.ITCS.2023.45
• Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds 10.4230/LIPIcs.ITCS.2023.46
• Antoine El-Hayek, Monika Henzinger, and Stefan Schmid Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks 10.4230/LIPIcs.ITCS.2023.47
• Alessandro Epasto, Jieming Mao, Andres Munoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, and Peilin Zhong Differentially Private Continual Releases of Streaming Frequency Moment Estimations 10.4230/LIPIcs.ITCS.2023.48
• Hamza Fawzi, Omar Fawzi, and Samuel O. Scalet A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit 10.4230/LIPIcs.ITCS.2023.49
• Arnold Filtser, Michael Kapralov, and Mikhail Makarov Expander Decomposition in Dynamic Streams 10.4230/LIPIcs.ITCS.2023.50
• Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, and Valentin Polishchuk On Flipping the Fréchet Distance 10.4230/LIPIcs.ITCS.2023.51
• Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence 10.4230/LIPIcs.ITCS.2023.52
• Sevag Gharibian and Dorian Rudolph Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement 10.4230/LIPIcs.ITCS.2023.53
• Badih Ghazi, Ravi Kumar, Pasin Manurangsi, and Thomas Steinke Algorithms with More Granular Differential Privacy Guarantees 10.4230/LIPIcs.ITCS.2023.54
• Badih Ghazi, Ravi Kumar, Jelani Nelson, and Pasin Manurangsi Private Counting of Distinct and k-Occurring Items in Time Windows 10.4230/LIPIcs.ITCS.2023.55
• Uma Girish, Ran Raz, and Wei Zhan Is Untrusted Randomness Helpful? 10.4230/LIPIcs.ITCS.2023.56
• Paul Goldberg and Jiawei Li Consensus Division in an Arbitrary Ratio 10.4230/LIPIcs.ITCS.2023.57
• Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, and Barna Saha An Algorithmic Bridge Between Hamming and Levenshtein Distances 10.4230/LIPIcs.ITCS.2023.58
• Oded Goldreich, Guy N. Rothblum, and Tal Skverer On Interactive Proofs of Proximity with Proof-Oblivious Queries 10.4230/LIPIcs.ITCS.2023.59
• Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, and Udi Wieder Loss Minimization Through the Lens Of Outcome Indistinguishability 10.4230/LIPIcs.ITCS.2023.60
• Roy Gotlib and Tali Kaufman List Agreement Expansion from Coboundary Expansion 10.4230/LIPIcs.ITCS.2023.61
• Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, and João Ribeiro Asynchronous Multi-Party Quantum Computation 10.4230/LIPIcs.ITCS.2023.62
• Fabrizio Grandoni, Claire Mathieu, and Hang Zhou Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm 10.4230/LIPIcs.ITCS.2023.63
• Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom 10.4230/LIPIcs.ITCS.2023.64
• Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, and Janani Sundaresan Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments 10.4230/LIPIcs.ITCS.2023.65
• Iftach Haitner, Noam Mazor, and Jad Silbak Incompressiblity and Next-Block Pseudoentropy 10.4230/LIPIcs.ITCS.2023.66
• Prahladh Harsha, Daniel Mitropolsky, and Alon Rosen Downward Self-Reducibility in TFNP 10.4230/LIPIcs.ITCS.2023.67
• William He and Benjamin Rossman Symmetric Formulas for Products of Permutations 10.4230/LIPIcs.ITCS.2023.68
• Monika Henzinger, Billy Jin, Richard Peng, and David P. Williamson A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems 10.4230/LIPIcs.ITCS.2023.69
• Shuichi Hirahara and Mikito Nanashima Learning Versus Pseudorandom Generators in Constant Parallel Time 10.4230/LIPIcs.ITCS.2023.70
• Yael Hitron, Merav Parter, and Eylon Yogev Secure Distributed Network Optimization Against Eavesdroppers 10.4230/LIPIcs.ITCS.2023.71
• Lunjia Hu and Charlotte Peale Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes 10.4230/LIPIcs.ITCS.2023.72
• Zhuangfei Hu, Xinda Li, David P. Woodruff, Hongyang Zhang, and Shufan Zhang Recovery from Non-Decomposable Distance Oracles 10.4230/LIPIcs.ITCS.2023.73
• Christian Ikenmeyer, Balagopal Komarath, and Nitin Saurabh Karchmer-Wigderson Games for Hazard-Free Computation 10.4230/LIPIcs.ITCS.2023.74
• Yaonan Jin, Pinyan Lu, and Tao Xiao Learning Reserve Prices in Second-Price Auctions 10.4230/LIPIcs.ITCS.2023.75
• Yujia Jin, Vidya Muthukumar, and Aaron Sidford The Complexity of Infinite-Horizon General-Sum Stochastic Games 10.4230/LIPIcs.ITCS.2023.76
• Chris Jones, Kunal Marwaha, Juspreet Singh Sandhu, and Jonathan Shi Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses 10.4230/LIPIcs.ITCS.2023.77
• Tali Kaufman and Ran J. Tessler Garland’s Technique for Posets and High Dimensional Grassmannian Expanders 10.4230/LIPIcs.ITCS.2023.78
• Michael P. Kim and Juan C. Perdomo Making Decisions Under Outcome Performativity 10.4230/LIPIcs.ITCS.2023.79
• Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, and Huacheng Yu Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly 10.4230/LIPIcs.ITCS.2023.80
• Yuqing Kong and Grant Schoenebeck False Consensus, Information Theory, and Prediction Markets 10.4230/LIPIcs.ITCS.2023.81
• Qipeng Liu Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More 10.4230/LIPIcs.ITCS.2023.82
• Yang P. Liu Vertex Sparsification for Edge Connectivity in Polynomial Time 10.4230/LIPIcs.ITCS.2023.83
• Shachar Lovett and Jiapeng Zhang Fractional Certificates for Bounded Functions 10.4230/LIPIcs.ITCS.2023.84
• Pasin Manurangsi Improved Inapproximability of VC Dimension and Littlestone’s Dimension via (Unbalanced) Biclique 10.4230/LIPIcs.ITCS.2023.85
• Uri Meir, Rotem Oshman, Ofer Shayevitz, and Yuval Volkov Resilience of 3-Majority Dynamics to Non-Uniform Schedulers 10.4230/LIPIcs.ITCS.2023.86
• Tomoyuki Morimae and Takashi Yamakawa Proofs of Quantumness from Trapdoor Permutations 10.4230/LIPIcs.ITCS.2023.87
• Amol Pasarkar, Christos Papadimitriou, and Mihalis Yannakakis Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP 10.4230/LIPIcs.ITCS.2023.88
• Toniann Pitassi, Morgan Shirley, and Adi Shraibman The Strength of Equality Oracles in Communication 10.4230/LIPIcs.ITCS.2023.89
• Alexander Poremba Quantum Proofs of Deletion for Learning with Errors 10.4230/LIPIcs.ITCS.2023.90
• Mingda Qiao and Gregory Valiant Online Pen Testing 10.4230/LIPIcs.ITCS.2023.91
• Guy N. Rothblum and Gal Yona Decision-Making Under Miscalibration 10.4230/LIPIcs.ITCS.2023.92
• Aviad Rubinstein and Junyao Zhao Beyond Worst-Case Budget-Feasible Mechanism Design 10.4230/LIPIcs.ITCS.2023.93
• Cynthia Rush, Fiona Skerman, Alexander S. Wein, and Dana Yang Is It Easier to Count Communities Than Find Them? 10.4230/LIPIcs.ITCS.2023.94
• Raghuvansh R. Saxena, Santhoshini Velusamy, and S. Matthew Weinberg An Improved Lower Bound for Matroid Intersection Prophet Inequalities 10.4230/LIPIcs.ITCS.2023.95
• Adrian She and Henry Yuen Unitary Property Testing Lower Bounds by Polynomials 10.4230/LIPIcs.ITCS.2023.96
• Elaine Shi, Hao Chung, and Ke Wu What Can Cryptography Do for Decentralized Mechanism Design? 10.4230/LIPIcs.ITCS.2023.97
• Prayaag Venkat Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices 10.4230/LIPIcs.ITCS.2023.98
• Nikhil Vyas and Ryan Williams On Oracles and Algorithmic Methods for Proving Lower Bounds 10.4230/LIPIcs.ITCS.2023.99
• Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, and Ulrich Schmid The Time Complexity of Consensus Under Oblivious Message Adversaries 10.4230/LIPIcs.ITCS.2023.100
• Emre Yolcu and Marijn J. H. Heule Exponential Separations Using Guarded Extension Variables 10.4230/LIPIcs.ITCS.2023.101