LIPIcs, Volume 185, ITCS 2021

• James R. Lee LIPIcs, Volume 185, ITCS 2021, Complete Volume 10.4230/LIPIcs.ITCS.2021
• James R. Lee Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2021.0
• Yuval Dagan, Yuval Filmus, Daniel Kane, and Shay Moran The Entropy of Lies: Playing Twenty Questions with a Liar 10.4230/LIPIcs.ITCS.2021.1
• Russell Impagliazzo and Sam McGuire Comparing Computational Entropies Below Majority (Or: When Is the Dense Model Theorem False?) 10.4230/LIPIcs.ITCS.2021.2
• Martin Hoefer, Pasin Manurangsi, and Alexandros Psomas Algorithmic Persuasion with Evidence 10.4230/LIPIcs.ITCS.2021.3
• Ishay Haviv The Complexity of Finding Fair Independent Sets in Cycles 10.4230/LIPIcs.ITCS.2021.4
• Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, and Mary Wootters Sharp Threshold Rates for Random Codes 10.4230/LIPIcs.ITCS.2021.5
• Cameron Musco, Christopher Musco, and David P. Woodruff Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation 10.4230/LIPIcs.ITCS.2021.6
• William M. Hoza, Edward Pyne, and Salil Vadhan Pseudorandom Generators for Unbounded-Width Permutation Branching Programs 10.4230/LIPIcs.ITCS.2021.7
• Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, and Juba Ziani Pipeline Interventions 10.4230/LIPIcs.ITCS.2021.8
• Mrinal Kumar and Ben Lee Volk A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits 10.4230/LIPIcs.ITCS.2021.9
• Pasin Manurangsi, Aviad Rubinstein, and Tselil Schramm The Strongish Planted Clique Hypothesis and Its Consequences 10.4230/LIPIcs.ITCS.2021.10
• Nengkun Yu Sample Efficient Identity Testing and Independence Testing of Quantum States 10.4230/LIPIcs.ITCS.2021.11
• Olaf Beyersdorff and Benjamin Böhm Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution 10.4230/LIPIcs.ITCS.2021.12
• William Kretschmer The Quantum Supremacy Tsirelson Inequality 10.4230/LIPIcs.ITCS.2021.13
• Kimberly Ding and S. Matthew Weinberg Approximately Strategyproof Tournament Rules in the Probabilistic Setting 10.4230/LIPIcs.ITCS.2021.14
• Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, and Anannya Upasana Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! 10.4230/LIPIcs.ITCS.2021.15
• William Kuszmaul and Alek Westover The Variable-Processor Cup Game 10.4230/LIPIcs.ITCS.2021.16
• Uri Meir Comparison Graphs: A Unified Method for Uniformity Testing 10.4230/LIPIcs.ITCS.2021.17
• Shyam Narayanan and Michael Ren Circular Trace Reconstruction 10.4230/LIPIcs.ITCS.2021.18
• Tony Metger and Thomas Vidick Self-Testing of a Single Quantum Device Under Computational Assumptions 10.4230/LIPIcs.ITCS.2021.19
• Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, and Sandip Sinha Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime 10.4230/LIPIcs.ITCS.2021.20
• Sébastien Bubeck, Niv Buchbinder, Christian Coester, and Mark Sellke Metrical Service Systems with Transformations 10.4230/LIPIcs.ITCS.2021.21
• Surbhi Goel, Adam Klivans, Pasin Manurangsi, and Daniel Reichman Tight Hardness Results for Training Depth-2 ReLU Networks 10.4230/LIPIcs.ITCS.2021.22
• Pranjal Dutta, Nitin Saxena, and Thomas Thierauf A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization 10.4230/LIPIcs.ITCS.2021.23
• Alexander Golovnev, Alexander S. Kulikov, and R. Ryan Williams Circuit Depth Reductions 10.4230/LIPIcs.ITCS.2021.24
• Weiming Feng, Kun He, Xiaoming Sun, and Yitong Yin Dynamic Inference in Probabilistic Graphical Models 10.4230/LIPIcs.ITCS.2021.25
• Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality 10.4230/LIPIcs.ITCS.2021.26
• Mark Braverman, Subhash Khot, and Dor Minzer On Rich 2-to-1 Games 10.4230/LIPIcs.ITCS.2021.27
• Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, and Ami Paz Distributed Quantum Proofs for Replicated Data 10.4230/LIPIcs.ITCS.2021.28
• Mikito Nanashima On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions 10.4230/LIPIcs.ITCS.2021.29
• Boaz Barak, Chi-Ning Chou, and Xun Gao Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits 10.4230/LIPIcs.ITCS.2021.30
• Joshua A. Grochow and Youming Qiao On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness 10.4230/LIPIcs.ITCS.2021.31
• Gregory Rosenthal Bounds on the QAC^0 Complexity of Approximating Parity 10.4230/LIPIcs.ITCS.2021.32
• Noga Ron-Zewi, Ronen Shaltiel, and Nithin Varma Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists) 10.4230/LIPIcs.ITCS.2021.33
• Jay Mardia Is the Space Complexity of Planted Clique Recovery the Same as That of Detection? 10.4230/LIPIcs.ITCS.2021.34
• Joshua Lau and Angus Ritossa Algorithms and Hardness for Multidimensional Range Updates and Queries 10.4230/LIPIcs.ITCS.2021.35
• Dorit Aharonov and Alex B. Grilo Two Combinatorial MA-Complete Problems 10.4230/LIPIcs.ITCS.2021.36
• Curtis Bechtel and Shaddin Dughmi Delegated Stochastic Probing 10.4230/LIPIcs.ITCS.2021.37
• Irit Dinur, Yuval Filmus, Prahladh Harsha, and Madhur Tulsiani Explicit SoS Lower Bounds from High-Dimensional Expanders 10.4230/LIPIcs.ITCS.2021.38
• Zachary Remscrim Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines 10.4230/LIPIcs.ITCS.2021.39
• Jiabao Lin On the Complexity of #CSP^d 10.4230/LIPIcs.ITCS.2021.40
• Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, and Amir Yehudayoff Interactive Proofs for Verifying Machine Learning 10.4230/LIPIcs.ITCS.2021.41
• Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Yuichi Yoshida Ordered Graph Limits and Their Applications 10.4230/LIPIcs.ITCS.2021.42
• Ofer Grossman and Justin Holmgren Error Correcting Codes for Uncompressed Messages 10.4230/LIPIcs.ITCS.2021.43
• Robert Kleinberg, Oliver Korten, Daniel Mitropolsky, and Christos Papadimitriou Total Functions in the Polynomial Hierarchy 10.4230/LIPIcs.ITCS.2021.44
• Noah Burrell and Grant Schoenebeck Relaxing Common Belief for Social Networks 10.4230/LIPIcs.ITCS.2021.45
• Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, and Geng Zhao Tiered Random Matching Markets: Rank Is Proportional to Popularity 10.4230/LIPIcs.ITCS.2021.46
• Geoffroy Couteau, Pooya Farshim, and Mohammad Mahmoody Black-Box Uselessness: Composing Separations in Cryptography 10.4230/LIPIcs.ITCS.2021.47
• Venkatesan Guruswami and Vinayak M. Kumar Pseudobinomiality of the Sticky Random Walk 10.4230/LIPIcs.ITCS.2021.48
• Lior Eldar Robust Quantum Entanglement at (Nearly) Room Temperature 10.4230/LIPIcs.ITCS.2021.49
• Abhijit S. Mudigonda and R. Ryan Williams Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers 10.4230/LIPIcs.ITCS.2021.50
• Spyros Angelopoulos Online Search with a Hint 10.4230/LIPIcs.ITCS.2021.51
• Pál András Papp and Roger Wattenhofer Sequential Defaulting in Financial Networks 10.4230/LIPIcs.ITCS.2021.52
• Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization 10.4230/LIPIcs.ITCS.2021.53
• Uma Girish, Ran Raz, and Avishay Tal Quantum Versus Randomized Communication Complexity, with Efficient Players 10.4230/LIPIcs.ITCS.2021.54
• Kush Bhatia, Peter L. Bartlett, Anca D. Dragan, and Jacob Steinhardt Agnostic Learning with Unknown Utilities 10.4230/LIPIcs.ITCS.2021.55
• Lijie Chen, Badih Ghazi, Ravi Kumar, and Pasin Manurangsi On Distributed Differential Privacy and Counting Distinct Elements 10.4230/LIPIcs.ITCS.2021.56
• Noam Solomon and Shay Solomon A Generalized Matching Reconfiguration Problem 10.4230/LIPIcs.ITCS.2021.57
• Yuichi Yoshida and Samson Zhou Sensitivity Analysis of the Maximum Matching Problem 10.4230/LIPIcs.ITCS.2021.58
• Vijay V. Vazirani and Mihalis Yannakakis Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets 10.4230/LIPIcs.ITCS.2021.59
• Rajko Nenadov, Angelika Steger, and Pascal Su An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability 10.4230/LIPIcs.ITCS.2021.60
• Srinivasan Arunachalam and Supartha Podder Communication Memento: Memoryless Communication Complexity 10.4230/LIPIcs.ITCS.2021.61
• Michael B. Cohen, Aaron Sidford, and Kevin Tian Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration 10.4230/LIPIcs.ITCS.2021.62
• Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein Training (Overparametrized) Neural Networks in Near-Linear Time 10.4230/LIPIcs.ITCS.2021.63
• Jeremiah Blocki and Mike Cinkoske A New Connection Between Node and Edge Depth Robust Graphs 10.4230/LIPIcs.ITCS.2021.64
• Anthony Leverrier, Vivien Londe, and Gilles Zémor Towards Local Testability for Quantum Coding 10.4230/LIPIcs.ITCS.2021.65
• Peter Dixon, A. Pavan, and N. V. Vinodchandran Complete Problems for Multi-Pseudodeterministic Computations 10.4230/LIPIcs.ITCS.2021.66
• Yuval Emek, Shay Kutten, and Yangguang Shi Online Paging with a Vanishing Regret 10.4230/LIPIcs.ITCS.2021.67
• Ilan Komargodski and Elaine Shi Differentially Oblivious Turing Machines 10.4230/LIPIcs.ITCS.2021.68
• Anindya De, Shivam Nadimpalli, and Rocco A. Servedio Quantitative Correlation Inequalities via Semigroup Interpolation 10.4230/LIPIcs.ITCS.2021.69
• Benjamin Rossman Shrinkage of Decision Lists and DNF Formulas 10.4230/LIPIcs.ITCS.2021.70
• Kunal Mittal and Ran Raz Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines 10.4230/LIPIcs.ITCS.2021.71
• Stefan Dziembowski, Grzegorz Fabiański, Sebastian Faust, and Siavash Riahi Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma 10.4230/LIPIcs.ITCS.2021.72
• Sander Borst, Daniel Dadush, Neil Olver, and Makrand Sinha Majorizing Measures for the Optimizer 10.4230/LIPIcs.ITCS.2021.73
• Hedyeh Beyhaghi and Éva Tardos Randomness and Fairness in Two-Sided Matching with Limited Interviews 10.4230/LIPIcs.ITCS.2021.74
• Justin Holmgren and Alexander S. Wein Counterexamples to the Low-Degree Conjecture 10.4230/LIPIcs.ITCS.2021.75
• Jop Briët and Farrokh Labib High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.76
• Nicole Immorlica, Ian A. Kash, and Brendan Lucier Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions 10.4230/LIPIcs.ITCS.2021.77
• Grant Schoenebeck and Fang-Yi Yu Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach 10.4230/LIPIcs.ITCS.2021.78
• Sara Ahmadian, Allen Liu, Binghui Peng, and Morteza Zadimoghaddam Distributed Load Balancing: A New Framework and Improved Guarantees 10.4230/LIPIcs.ITCS.2021.79
• Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma Erasure-Resilient Sublinear-Time Graph Algorithms 10.4230/LIPIcs.ITCS.2021.80
• Yang Cai and Grigoris Velegkas How to Sell Information Optimally: An Algorithmic Study 10.4230/LIPIcs.ITCS.2021.81
• Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena Computation over the Noisy Broadcast Channel with Malicious Parties 10.4230/LIPIcs.ITCS.2021.82
• Nima Anari, Nathan Hu, Amin Saberi, and Aaron Schild Sampling Arborescences in Parallel 10.4230/LIPIcs.ITCS.2021.83
• Moshe Babaioff, Richard Cole, Jason Hartline, Nicole Immorlica, and Brendan Lucier Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.84
• Moses Charikar, Shivam Garg, Deborah M. Gordon, and Kirankumar Shiragur A Model for Ant Trail Formation and its Convergence Properties (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.85
• José Correa, Paul Dütting, Felix Fischer, Kevin Schewior, and Bruno Ziliotto Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.86
• Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, and Marc Vinyals Complexity Measures on the Symmetric Group and Beyond (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.87
• Yiding Feng and Rad Niazadeh Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.88
• Yuval Filmus, Or Meir, and Avishay Tal Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract) 10.4230/LIPIcs.ITCS.2021.89