LIPIcs, Volume 151, ITCS 2020

• Thomas Vidick LIPIcs, Volume 151, ITCS'20, Complete Volume 10.4230/LIPIcs.ITCS.2020
• Thomas Vidick Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2020.0
• Elazar Goldenberg and Karthik C. S. Hardness Amplification of Optimization Problems 10.4230/LIPIcs.ITCS.2020.1
• Orr Paradise Smooth and Strong PCPs 10.4230/LIPIcs.ITCS.2020.2
• Ariel Schvartzman, S. Matthew Weinberg, Eitan Zlatin, and Albert Zuo Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence 10.4230/LIPIcs.ITCS.2020.3
• Stacey Jeffery Span Programs and Quantum Space Complexity 10.4230/LIPIcs.ITCS.2020.4
• Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, and Shubhangi Saraf DEEP-FRI: Sampling Outside the Box Improves Soundness 10.4230/LIPIcs.ITCS.2020.5
• Nir Bitansky and Idan Gerichter On the Cryptographic Hardness of Local Search 10.4230/LIPIcs.ITCS.2020.6
• Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai Interactive Coding with Constant Round and Communication Blowup 10.4230/LIPIcs.ITCS.2020.7
• Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, and Xiaoming Sun From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces 10.4230/LIPIcs.ITCS.2020.8
• Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Ron D. Rothblum Hard Properties with (Very) Short PCPPs and Their Applications 10.4230/LIPIcs.ITCS.2020.9
• Austin Conner, Joseph M. Landsberg, Fulvio Gesmundo, and Emanuele Ventura Kronecker Powers of Tensors and Strassen’s Laser Method 10.4230/LIPIcs.ITCS.2020.10
• Andrea Lincoln and Nikhil Vyas Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs 10.4230/LIPIcs.ITCS.2020.11
• Siqi Liu, Sidhanth Mohanty, and Elizabeth Yang High-Dimensional Expanders from Expanders 10.4230/LIPIcs.ITCS.2020.12
• Jeremiah Blocki, Seunghoon Lee, and Samson Zhou Approximating Cumulative Pebbling Cost Is Unique Games Hard 10.4230/LIPIcs.ITCS.2020.13
• Michael Mitzenmacher Scheduling with Predictions and the Price of Misprediction 10.4230/LIPIcs.ITCS.2020.14
• Kira Goldner, Nicole Immorlica, and Brendan Lucier Reducing Inefficiency in Carbon Auctions with Imperfect Competition 10.4230/LIPIcs.ITCS.2020.15
• Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, and Gal Yona Preference-Informed Fairness 10.4230/LIPIcs.ITCS.2020.16
• Jin-Yi Cai and Artem Govorov On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of H 10.4230/LIPIcs.ITCS.2020.17
• Kousha Etessami, Christos Papadimitriou, Aviad Rubinstein, and Mihalis Yannakakis Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria 10.4230/LIPIcs.ITCS.2020.18
• Fedor Part and Iddo Tzameret Resolution with Counting: Dag-Like Lower Bounds and Different Moduli 10.4230/LIPIcs.ITCS.2020.19
• Ran Raz and Wei Zhan The Random-Query Model and the Memory-Bounded Coupon Collector 10.4230/LIPIcs.ITCS.2020.20
• Greg Bodwin and Ofer Grossman Strategy-Stealing Is Non-Constructive 10.4230/LIPIcs.ITCS.2020.21
• Noah Fleming and Yuichi Yoshida Distribution-Free Testing of Linear Functions on ℝⁿ 10.4230/LIPIcs.ITCS.2020.22
• Yael Hitron, Nancy Lynch, Cameron Musco, and Merav Parter Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks 10.4230/LIPIcs.ITCS.2020.23
• Georg Loho and László A. Végh Signed Tropical Convexity 10.4230/LIPIcs.ITCS.2020.24
• András Gilyén and Tongyang Li Distributional Property Testing in a Quantum World 10.4230/LIPIcs.ITCS.2020.25
• Alessandro Chiesa, Peter Manohar, and Igor Shinkar On Local Testability in the Non-Signaling Setting 10.4230/LIPIcs.ITCS.2020.26
• Amartya Shankha Biswas, Ronitt Rubinfeld, and Anak Yodpinyanee Local Access to Huge Random Objects Through Partial Sampling 10.4230/LIPIcs.ITCS.2020.27
• Ronitt Rubinfeld and Arsen Vasilyan Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples 10.4230/LIPIcs.ITCS.2020.28
• Gal Sadeh, Edith Cohen, and Haim Kaplan Sample Complexity Bounds for Influence Maximization 10.4230/LIPIcs.ITCS.2020.29
• Nir Bitansky and Nathan Geier On Oblivious Amplification of Coin-Tossing Protocols 10.4230/LIPIcs.ITCS.2020.30
• Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, and Moshe Shenfeld A New Analysis of Differential Privacy’s Generalization Guarantees 10.4230/LIPIcs.ITCS.2020.31
• Domagoj Bradac, Anupam Gupta, Sahil Singla, and Goran Zuzic Robust Algorithms for the Secretary Problem 10.4230/LIPIcs.ITCS.2020.32
• Nathaniel Harms Universal Communication, Universal Graphs, and Graph Labeling 10.4230/LIPIcs.ITCS.2020.33
• Rahul Ilango Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p] 10.4230/LIPIcs.ITCS.2020.34
• Sivaramakrishnan Natarajan Ramamoorthy and Cyrus Rashtchian Equivalence of Systematic Linear Data Structures and Matrix Rigidity 10.4230/LIPIcs.ITCS.2020.35
• Mohammad Hassan Ameri, Jeremiah Blocki, and Samson Zhou Computationally Data-Independent Memory Hard Functions 10.4230/LIPIcs.ITCS.2020.36
• Andrej Bogdanov and Baoxiang Wang Learning and Testing Variable Partitions 10.4230/LIPIcs.ITCS.2020.37
• Suman K. Bera, Noujan Pashanasangi, and C. Seshadhri Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six 10.4230/LIPIcs.ITCS.2020.38
• Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi Parameterization Above a Multiplicative Guarantee 10.4230/LIPIcs.ITCS.2020.39
• Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, and Justin Thaler Ad Hoc Multi-Input Functional Encryption 10.4230/LIPIcs.ITCS.2020.40
• Shuichi Hirahara Unexpected Power of Random Strings 10.4230/LIPIcs.ITCS.2020.41
• Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, and Luca Trevisan Consensus vs Broadcast, with and Without Noise (Extended Abstract) 10.4230/LIPIcs.ITCS.2020.42
• Lior Gishboliner, Asaf Shapira, and Henrique Stagni Testing Linear Inequalities of Subgraph Statistics 10.4230/LIPIcs.ITCS.2020.43
• Guy Blanc, Jane Lange, and Li-Yang Tan Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations 10.4230/LIPIcs.ITCS.2020.44
• Haotian Jiang, Jian Li, Daogao Liu, and Sahil Singla Algorithms and Adaptivity Gaps for Stochastic k-TSP 10.4230/LIPIcs.ITCS.2020.45
• Nils Bertschinger, Martin Hoefer, and Daniel Schmand Strategic Payments in Financial Networks 10.4230/LIPIcs.ITCS.2020.46
• William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, and Meirav Zehavi Fault Tolerant Subgraphs with Applications in Kernelization 10.4230/LIPIcs.ITCS.2020.47
• Yael Hitron, Merav Parter, and Gur Perri The Computational Cost of Asynchronous Neural Communication 10.4230/LIPIcs.ITCS.2020.48
• Konstantin Makarychev and Yury Makarychev Certified Algorithms: Worst-Case Analysis and Beyond 10.4230/LIPIcs.ITCS.2020.49
• Ruben Becker, Yuval Emek, and Christoph Lenzen Low Diameter Graph Decompositions by Approximate Distance Computation 10.4230/LIPIcs.ITCS.2020.50
• Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi Generalized List Decoding 10.4230/LIPIcs.ITCS.2020.51
• Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault Online Computation with Untrusted Advice 10.4230/LIPIcs.ITCS.2020.52
• Andrea Lincoln, Adam Polak, and Virginia Vassilevska Williams Monochromatic Triangles, Intermediate Matrix Products, and Convolutions 10.4230/LIPIcs.ITCS.2020.53
• Nima Anari and Vijay V. Vazirani Matching Is as Easy as the Decision Problem, in the NC Model 10.4230/LIPIcs.ITCS.2020.54
• Avrim Blum and Thodoris Lykouris Advancing Subgroup Fairness via Sleeping Experts 10.4230/LIPIcs.ITCS.2020.55
• Tomer Grossman, Ilan Komargodski, and Moni Naor Instance Complexity and Unlabeled Certificates in the Decision Tree Model 10.4230/LIPIcs.ITCS.2020.56
• Alessandro Chiesa and Siqi Liu On the Impossibility of Probabilistic Proofs in Relativized Worlds 10.4230/LIPIcs.ITCS.2020.57
• Anna Gál and Robert Robere Lower Bounds for (Non-Monotone) Comparator Circuits 10.4230/LIPIcs.ITCS.2020.58
• Nathan Lindzey and Ansis Rosmanis A Tight Lower Bound For Non-Coherent Index Erasure 10.4230/LIPIcs.ITCS.2020.59
• Aviad Rubinstein, Jack Z. Wang, and S. Matthew Weinberg Optimal Single-Choice Prophet Inequalities from Samples 10.4230/LIPIcs.ITCS.2020.60
• Linda Cai, Clay Thomas, and S. Matthew Weinberg Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard 10.4230/LIPIcs.ITCS.2020.61
• Erik D. Demaine, Dylan H. Hendrickson, and Jayson Lynch Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard 10.4230/LIPIcs.ITCS.2020.62
• Adam Bouland, Bill Fefferman, and Umesh Vazirani Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract) 10.4230/LIPIcs.ITCS.2020.63
• Andrei Graur, Tristan Pollner, Vidhya Ramaswamy, and S. Matthew Weinberg New Query Lower Bounds for Submodular Function Minimization 10.4230/LIPIcs.ITCS.2020.64
• Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, and Ariel D. Procaccia Computation-Aware Data Aggregation 10.4230/LIPIcs.ITCS.2020.65
• Francisco Maturana and K. V. Rashmi Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage 10.4230/LIPIcs.ITCS.2020.66
• Federico Echenique and Siddharth Prasad Incentive Compatible Active Learning 10.4230/LIPIcs.ITCS.2020.67
• Rahul Santhanam Pseudorandomness and the Minimum Circuit Size Problem 10.4230/LIPIcs.ITCS.2020.68
• Maryam Aliakbarpour and Sandeep Silwal Testing Properties of Multiple Distributions with Few Samples 10.4230/LIPIcs.ITCS.2020.69
• Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, and Rahul Santhanam Beyond Natural Proofs: Hardness Magnification and Locality 10.4230/LIPIcs.ITCS.2020.70
• Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, and Akshayaram Srinivasan Separating Two-Round Secure Computation From Oblivious Transfer 10.4230/LIPIcs.ITCS.2020.71
• Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, and Joseph Swernofsky Trade-Offs Between Size and Degree in Polynomial Calculus 10.4230/LIPIcs.ITCS.2020.72
• Shant Boodaghians, Rucha Kulkarni, and Ruta Mehta Smoothed Efficient Algorithms and Reductions for Network Coordination Games 10.4230/LIPIcs.ITCS.2020.73
• Tali Kaufman and David Mass Local-To-Global Agreement Expansion via the Variance Method 10.4230/LIPIcs.ITCS.2020.74
• T-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, and Elaine Shi MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture 10.4230/LIPIcs.ITCS.2020.75
• Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, and John Sylvester Choice and Bias in Random Walks 10.4230/LIPIcs.ITCS.2020.76
• Manuel Fernández V, David P. Woodruff, and Taisuke Yasuda Graph Spanners in the Message-Passing Model 10.4230/LIPIcs.ITCS.2020.77
• Afonso S. Bandeira, Dmitriy Kunisky, and Alexander S. Wein Computational Hardness of Certifying Bounds on Constrained PCA Problems 10.4230/LIPIcs.ITCS.2020.78
• Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, and David P. Woodruff Pseudo-Deterministic Streaming 10.4230/LIPIcs.ITCS.2020.79
• Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin Limits to Non-Malleability 10.4230/LIPIcs.ITCS.2020.80
• Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan Cryptography from Information Loss 10.4230/LIPIcs.ITCS.2020.81
• James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, and Mark Zhandry Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption 10.4230/LIPIcs.ITCS.2020.82
• Josh Alman and Virginia Vassilevska Williams OV Graphs Are (Probably) Hard Instances 10.4230/LIPIcs.ITCS.2020.83
• Parikshit Gopalan, Roie Levin, and Udi Wieder Finding Skewed Subcubes Under a Distribution 10.4230/LIPIcs.ITCS.2020.84
• Arnab Bhattacharyya, L. Sunil Chandran, and Suprovat Ghoshal Combinatorial Lower Bounds for 3-Query LDCs 10.4230/LIPIcs.ITCS.2020.85
• Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, and Tal Malkin On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? 10.4230/LIPIcs.ITCS.2020.86