LIPIcs, Volume 215, ITCS 2022

• Mark Braverman LIPIcs, Volume 215, ITCS 2022, Complete Volume 10.4230/LIPIcs.ITCS.2022
• Mark Braverman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2022.0
• Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, and Andres Perlroth Maximizing Revenue in the Presence of Intermediaries 10.4230/LIPIcs.ITCS.2022.1
• Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, and Maciej Obremski Algebraic Restriction Codes and Their Applications 10.4230/LIPIcs.ITCS.2022.2
• Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, and Ryan Williams Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity 10.4230/LIPIcs.ITCS.2022.3
• Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta Pre-Constrained Encryption 10.4230/LIPIcs.ITCS.2022.4
• Nima Anari, Michał Dereziński, Thuy-Duong Vuong, and Elizabeth Yang Domain Sparsification of Discrete Distributions Using Entropic Independence 10.4230/LIPIcs.ITCS.2022.5
• Anurag Anshu and Chinmay Nirkhe Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians 10.4230/LIPIcs.ITCS.2022.6
• Shiri Antaki, Quanquan C. Liu, and Shay Solomon Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems 10.4230/LIPIcs.ITCS.2022.7
• Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, and Toniann Pitassi Secret Sharing, Slice Formulas, and Monotone Real Circuits 10.4230/LIPIcs.ITCS.2022.8
• Sepehr Assadi and Vihan Shah An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams 10.4230/LIPIcs.ITCS.2022.9
• Sepehr Assadi and Chen Wang Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions 10.4230/LIPIcs.ITCS.2022.10
• Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, and Konstantin Zabarnyi Multi-Channel Bayesian Persuasion 10.4230/LIPIcs.ITCS.2022.11
• Marshall Ball, Oded Goldreich, and Tal Malkin Randomness Extraction from Somewhat Dependent Sources 10.4230/LIPIcs.ITCS.2022.12
• Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing 10.4230/LIPIcs.ITCS.2022.13
• Boaz Barak and Kunal Marwaha Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs 10.4230/LIPIcs.ITCS.2022.14
• James Bartusek and Giulio Malavolta Indistinguishability Obfuscation of Null Quantum Circuits and Applications 10.4230/LIPIcs.ITCS.2022.15
• Anubhav Baweja, Justin Jia, and David P. Woodruff An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes 10.4230/LIPIcs.ITCS.2022.16
• Balaram Behera, Edin Husić, Shweta Jain, Tim Roughgarden, and C. Seshadhri FPT Algorithms for Finding Near-Cliques in c-Closed Graphs 10.4230/LIPIcs.ITCS.2022.17
• Michael A. Bender, Martín Farach-Colton, and William Kuszmaul What Does Dynamic Optimality Mean in External Memory? 10.4230/LIPIcs.ITCS.2022.18
• Huck Bennett, Chris Peikert, and Yi Tang Improved Hardness of BDD and SVP Under Gap-(S)ETH 10.4230/LIPIcs.ITCS.2022.19
• Amey Bhangale, Prahladh Harsha, and Sourya Roy Mixing of 3-Term Progressions in Quasirandom Groups 10.4230/LIPIcs.ITCS.2022.20
• Amey Bhangale and Aleksa Stanković Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs 10.4230/LIPIcs.ITCS.2022.21
• Vijay Bhattiprolu, Euiwoong Lee, and Madhur Tulsiani Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem 10.4230/LIPIcs.ITCS.2022.22
• Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J.A. Gregor Lagodzinski, Martin Schirneck, and Simon Wietheger Fixed-Parameter Sensitivity Oracles 10.4230/LIPIcs.ITCS.2022.23
• Amartya Shankha Biswas, Edward Pyne, and Ronitt Rubinfeld Local Access to Random Walks 10.4230/LIPIcs.ITCS.2022.24
• Greg Bodwin, Michael Dinitz, and Yasamin Nazari Vertex Fault-Tolerant Emulators 10.4230/LIPIcs.ITCS.2022.25
• Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, and Akshayaram Srinivasan Bounded Indistinguishability for Simple Sources 10.4230/LIPIcs.ITCS.2022.26
• Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, and Ohad Klein Locality-Preserving Hashing for Shifts with Connections to Cryptography 10.4230/LIPIcs.ITCS.2022.27
• Zvika Brakerski and Vinod Vaikuntanathan Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE 10.4230/LIPIcs.ITCS.2022.28
• Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhoň, and Zoltán Vidnyánszky Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics 10.4230/LIPIcs.ITCS.2022.29
• Liron Bronfman and Ron D. Rothblum PCPs and Instance Compression from a Cryptographic Lens 10.4230/LIPIcs.ITCS.2022.30
• Harry Buhrman, Bruno Loff, Subhasree Patro, and Florian Speelman Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks 10.4230/LIPIcs.ITCS.2022.31
• Johannes Bund, Christoph Lenzen, and Moti Medina Small Hazard-Free Transducers 10.4230/LIPIcs.ITCS.2022.32
• Sílvia Casacuberta and Rasmus Kyng Faster Sparse Matrix Inversion and Rank Computation in Finite Fields 10.4230/LIPIcs.ITCS.2022.33
• Bruno P. Cavalar and Zhenjian Lu Algorithms and Lower Bounds for Comparator Circuits from Shrinkage 10.4230/LIPIcs.ITCS.2022.34
• Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, and Rotem Oshman Quantum Distributed Algorithms for Detection of Cliques 10.4230/LIPIcs.ITCS.2022.35
• Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled, and Tigran Tonoyan Distributed Vertex Cover Reconfiguration 10.4230/LIPIcs.ITCS.2022.36
• Amit Chakrabarti, Prantar Ghosh, and Manuel Stoeckl Adversarially Robust Coloring for Graph Streams 10.4230/LIPIcs.ITCS.2022.37
• Brynmor Chapman and R. Ryan Williams Smaller ACC0 Circuits for Symmetric Functions 10.4230/LIPIcs.ITCS.2022.38
• Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, and Partha Mukhopadhyay Monotone Complexity of Spanning Tree Polynomial Re-Visited 10.4230/LIPIcs.ITCS.2022.39
• Eshan Chattopadhyay, Jesse Goodman, and David Zuckerman The Space Complexity of Sampling 10.4230/LIPIcs.ITCS.2022.40
• Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, and Ruta Mehta On the Existence of Competitive Equilibrium with Chores 10.4230/LIPIcs.ITCS.2022.41
• Shuchi Chawla and Meena Jagadeesan Individual Fairness in Advertising Auctions Through Inverse Proportionality 10.4230/LIPIcs.ITCS.2022.42
• Xue Chen, Kuan Cheng, Xin Li, and Minghui Ouyang Improved Decoding of Expander Codes 10.4230/LIPIcs.ITCS.2022.43
• Yiling Chen, Alon Eden, and Juntao Wang Cursed yet Satisfied Agents 10.4230/LIPIcs.ITCS.2022.44
• Lijie Chen, Shuichi Hirahara, and Neekon Vafa Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions 10.4230/LIPIcs.ITCS.2022.45
• Sitan Chen, Zhao Song, Runzhou Tao, and Ruizhe Zhang Symmetric Sparse Boolean Matrix Factorization and Applications 10.4230/LIPIcs.ITCS.2022.46
• Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, and Ruizhe Zhang Quantum Meets the Minimum Circuit Size Problem 10.4230/LIPIcs.ITCS.2022.47
• Matthias Christandl, Omar Fawzi, Hoang Ta, and Jeroen Zuiddam Larger Corner-Free Sets from Combinatorial Degenerations 10.4230/LIPIcs.ITCS.2022.48
• Giorgos Christodoulou, Vasilis Gkatzelis, and Daniel Schoepflin Optimal Deterministic Clock Auctions and Beyond 10.4230/LIPIcs.ITCS.2022.49
• Roni Con and Itzhak Tamo Nonlinear Repair Schemes of Reed-Solomon Codes. 10.4230/LIPIcs.ITCS.2022.50
• Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones A Complete Linear Programming Hierarchy for Linear Codes 10.4230/LIPIcs.ITCS.2022.51
• Anuj Dawar and Gregory Wilsenach Lower Bounds for Symmetric Circuits for the Determinant 10.4230/LIPIcs.ITCS.2022.52
• Anindya De, Shivam Nadimpalli, and Rocco A. Servedio Convex Influences 10.4230/LIPIcs.ITCS.2022.53
• Abhinav Deshpande, Alexey V. Gorshkov, and Bill Fefferman The Importance of the Spectral Gap in Estimating Ground-State Energies 10.4230/LIPIcs.ITCS.2022.54
• Shahar Dobzinski and Sigal Oren Mechanism Design with Moral Bidders 10.4230/LIPIcs.ITCS.2022.55
• Yevgeniy Dodis, Harish Karthikeyan, and Daniel Wichs Small-Box Cryptography 10.4230/LIPIcs.ITCS.2022.56
• Nico Döttling, Vipul Goyal, Giulio Malavolta, and Justin Raizes Interaction-Preserving Compilers for Secure Computation 10.4230/LIPIcs.ITCS.2022.57
• Shaddin Dughmi Matroid Secretary Is Equivalent to Contention Resolution 10.4230/LIPIcs.ITCS.2022.58
• Kunal Dutta, Arijit Ghosh, and Shay Moran Uniform Brackets, Containers, and Combinatorial Macbeath Regions 10.4230/LIPIcs.ITCS.2022.59
• Farzam Ebrahimnejad and James R. Lee Multiscale Entropic Regularization for MTS on General Metric Spaces 10.4230/LIPIcs.ITCS.2022.60
• Farzam Ebrahimnejad, Ansh Nagda, and Shayan Oveis Gharan Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs 10.4230/LIPIcs.ITCS.2022.61
• Talya Eden, Piotr Indyk, and Haike Xu Embeddings and Labeling Schemes for A* 10.4230/LIPIcs.ITCS.2022.62
• Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-joung Kwon A Unifying Framework for Characterizing and Computing Width Measures 10.4230/LIPIcs.ITCS.2022.63
• Ronen Eldan and Dana Moshkovitz Reduction from Non-Unique Games to Boolean Unique Games 10.4230/LIPIcs.ITCS.2022.64
• Reyad Abed Elrazik, Robert Robere, Assaf Schuster, and Gal Yehuda Pseudorandom Self-Reductions for NP-Complete Problems 10.4230/LIPIcs.ITCS.2022.65
• Meryem Essaidi, Matheus V. X. Ferreira, and S. Matthew Weinberg Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions 10.4230/LIPIcs.ITCS.2022.66
• Michael Ezra and Ron D. Rothblum Small Circuits Imply Efficient Arthur-Merlin Protocols 10.4230/LIPIcs.ITCS.2022.67
• Omar Fawzi, Alexander Müller-Hermes, and Ala Shayeghi A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation 10.4230/LIPIcs.ITCS.2022.68
• Noah Fleming, Mika Göös, Stefan Grosser, and Robert Robere On Semi-Algebraic Proofs and Algorithms 10.4230/LIPIcs.ITCS.2022.69
• Noah Fleming, Toniann Pitassi, and Robert Robere Extremely Deep Proofs 10.4230/LIPIcs.ITCS.2022.70
• Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, and Mary Wootters On the Download Rate of Homomorphic Secret Sharing 10.4230/LIPIcs.ITCS.2022.71
• Peter Frankl, Svyatoslav Gryaznov, and Navid Talebanfard A Variant of the VC-Dimension with Applications to Depth-3 Circuits 10.4230/LIPIcs.ITCS.2022.72
• Hugo Rincon Galeana, Sergio Rajsbaum, and Ulrich Schmid Continuous Tasks and the Asynchronous Computability Theorem 10.4230/LIPIcs.ITCS.2022.73
• Luca Ganassali, Laurent Massoulié, and Marc Lelarge Correlation Detection in Trees for Planted Graph Alignment 10.4230/LIPIcs.ITCS.2022.74
• Sevag Gharibian and Dorian Rudolph On Polynomially Many Queries to NP or QMA Oracles 10.4230/LIPIcs.ITCS.2022.75
• Uma Girish and Ran Raz Eliminating Intermediate Measurements Using Pseudorandom Generators 10.4230/LIPIcs.ITCS.2022.76
• Guy Goldberg and Guy N. Rothblum Sample-Based Proofs of Proximity 10.4230/LIPIcs.ITCS.2022.77
• Oded Goldreich and Dana Ron Testing Distributions of Huge Objects 10.4230/LIPIcs.ITCS.2022.78
• Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, and Udi Wieder Omnipredictors 10.4230/LIPIcs.ITCS.2022.79
• W. T. Gowers and Emanuele Viola Mixing in Non-Quasirandom Groups 10.4230/LIPIcs.ITCS.2022.80
• Vipul Goyal, Justin Raizes, and Pratik Soni Time-Traveling Simulators Using Blockchains and Their Applications 10.4230/LIPIcs.ITCS.2022.81
• Varun Gupta, Christopher Jung, Georgy Noarov, Mallesh M. Pai, and Aaron Roth Online Multivalid Learning: Means, Moments, and Prediction Intervals 10.4230/LIPIcs.ITCS.2022.82
• MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, and Hsin-Hao Su Adaptive Massively Parallel Constant-Round Tree Contraction 10.4230/LIPIcs.ITCS.2022.83
• Shuichi Hirahara and Rahul Santhanam Errorless Versus Error-Prone Average-Case Complexity 10.4230/LIPIcs.ITCS.2022.84
• Shuichi Hirahara and Rahul Santhanam Excluding PH Pessiland 10.4230/LIPIcs.ITCS.2022.85
• Mojtaba Hosseini and Vijay V. Vazirani Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu 10.4230/LIPIcs.ITCS.2022.86
• Gábor Ivanyos, Tushant Mittal, and Youming Qiao Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras 10.4230/LIPIcs.ITCS.2022.87
• Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, and Madhur Tulsiani Explicit Abelian Lifts and Quantum LDPC Codes 10.4230/LIPIcs.ITCS.2022.88
• Chris Jones and Aaron Potechin Almost-Orthogonal Bases for Inner Product Polynomials 10.4230/LIPIcs.ITCS.2022.89
• Iden Kalemaj, Sofya Raskhodnikova, and Nithin Varma Sublinear-Time Computation in the Presence of Online Erasures 10.4230/LIPIcs.ITCS.2022.90
• Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, and Samson Zhou Noisy Boolean Hidden Matching with Applications 10.4230/LIPIcs.ITCS.2022.91
• Gili Karni, Guy N. Rothblum, and Gal Yona On Fairness and Stability in Two-Sided Matchings 10.4230/LIPIcs.ITCS.2022.92
• Sanjeev Khanna and Christian Konrad Optimal Bounds for Dominating Set in Graph Streams 10.4230/LIPIcs.ITCS.2022.93
• Peter Kiss Deterministic Dynamic Matching in Worst-Case Update Time 10.4230/LIPIcs.ITCS.2022.94
• Yuqing Kong More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of Tasks 10.4230/LIPIcs.ITCS.2022.95
• Hung Le, Lazar Milenković, Shay Solomon, and Virginia Vassilevska Williams Dynamic Matching Algorithms Under Vertex Updates 10.4230/LIPIcs.ITCS.2022.96
• François Le Gall and Saeed Seddighin Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems 10.4230/LIPIcs.ITCS.2022.97
• Jasper C.H. Lee and Paul Valiant Optimal Sub-Gaussian Mean Estimation in Very High Dimensions 10.4230/LIPIcs.ITCS.2022.98
• Alexander Lindermayr, Nicole Megow, and Bertrand Simon Double Coverage with Machine-Learned Advice 10.4230/LIPIcs.ITCS.2022.99
• Jiahui Liu, Qipeng Liu, and Luowen Qian Beating Classical Impossibility of Position Verification 10.4230/LIPIcs.ITCS.2022.100
• Yang P. Liu, Ashwin Sah, and Mehtaab Sawhney A Gaussian Fixed Point Random Walk 10.4230/LIPIcs.ITCS.2022.101
• Alex Lombardi and Vinod Vaikuntanathan Correlation-Intractable Hash Functions via Shift-Hiding 10.4230/LIPIcs.ITCS.2022.102
• Dimitrios Los and Thomas Sauerwald Balanced Allocations with Incomplete Information: The Power of Two Queries 10.4230/LIPIcs.ITCS.2022.103
• Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, and Jiapeng Zhang Lifting with Sunflowers 10.4230/LIPIcs.ITCS.2022.104
• Jieming Mao, Renato Paes Leme, and Kangning Wang Interactive Communication in Bilateral Trade 10.4230/LIPIcs.ITCS.2022.105
• Arya Mazumdar and Soumyabrata Pal Support Recovery in Universal One-Bit Compressed Sensing 10.4230/LIPIcs.ITCS.2022.106
• Boaz Menuhin and Moni Naor Keep That Card in Mind: Card Guessing with Limited Memory 10.4230/LIPIcs.ITCS.2022.107
• Hariharan Narayanan, Rikhav Shah, and Nikhil Srivastava A Spectral Approach to Polytope Diameter 10.4230/LIPIcs.ITCS.2022.108
• Sam Olesker-Taylor and Luca Zanetti Geometric Bounds on the Fastest Mixing Markov Chain 10.4230/LIPIcs.ITCS.2022.109
• Shir Peleg, Ben Lee Volk, and Amir Shpilka Lower Bounds on Stabilizer Rank 10.4230/LIPIcs.ITCS.2022.110
• Mohammad Roghani, Amin Saberi, and David Wajc Beating the Folklore Algorithm for Dynamic Matching 10.4230/LIPIcs.ITCS.2022.111
• Gregory Rosenthal and Henry Yuen Interactive Proofs for Synthesizing Quantum States and Unitaries 10.4230/LIPIcs.ITCS.2022.112
• Aviad Rubinstein and Junyao Zhao Budget-Smoothed Analysis for Submodular Maximization 10.4230/LIPIcs.ITCS.2022.113
• Ziv Scully, Isaac Grosof, and Michael Mitzenmacher Uniform Bounds for Scheduling with Job Size Estimates 10.4230/LIPIcs.ITCS.2022.114
• Masoud Seddighin and Saeed Seddighin 3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time 10.4230/LIPIcs.ITCS.2022.115
• Ronen Shaltiel and Emanuele Viola On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization 10.4230/LIPIcs.ITCS.2022.116
• Noah Shutty and Mary Wootters Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data 10.4230/LIPIcs.ITCS.2022.117
• Gaurav Sinha Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In Two 10.4230/LIPIcs.ITCS.2022.118
• Dieter van Melkebeek and Andrew Morgan Polynomial Identity Testing via Evaluation of Rational Functions 10.4230/LIPIcs.ITCS.2022.119
• Weina Wang, Anupam Gupta, and Jalani K. Williams Probing to Minimize 10.4230/LIPIcs.ITCS.2022.120