LIPIcs, Volume 94, ITCS 2018

• Anna R. Karlin LIPIcs, Volume 94, ITCS'18, Complete Volume 10.4230/LIPIcs.ITCS.2018
• Anna R. Karlin Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2018.0
• Klim Efremenko, Ankit Garg, Rafael Oliveira, and Avi Wigderson Barriers for Rank Methods in Arithmetic Complexity 10.4230/LIPIcs.ITCS.2018.1
• Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, and Michael Kowalczyk A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory 10.4230/LIPIcs.ITCS.2018.2
• Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos Quantum Query Algorithms are Completely Bounded Forms 10.4230/LIPIcs.ITCS.2018.3
• Bill Fefferman and Cedric Yen-Yu Lin A Complete Characterization of Unitary Quantum Space 10.4230/LIPIcs.ITCS.2018.4
• Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, and Hongyang Zhang Matrix Completion and Related Problems via Strong Duality 10.4230/LIPIcs.ITCS.2018.5
• Michael Ben-Or and Lior Eldar A Quasi-Random Approach to Matrix Spectral Analysis 10.4230/LIPIcs.ITCS.2018.6
• Aditya Bhaskara and Silvio Lattanzi Non-Negative Sparse Regression and Column Subset Selection with L1 Error 10.4230/LIPIcs.ITCS.2018.7
• Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, and David P. Woodruff Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness 10.4230/LIPIcs.ITCS.2018.8
• Olaf Beyersdorff, Joshua Blinkhorn, and Luke Hinde Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs 10.4230/LIPIcs.ITCS.2018.9
• Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, and Robert Robere Stabbing Planes 10.4230/LIPIcs.ITCS.2018.10
• Mark Braverman, Anat Ganor, Gillat Kol, and Ran Raz A Candidate for a Strong Separation of Information and Communication 10.4230/LIPIcs.ITCS.2018.11
• Mark Braverman and Young Kun Ko Information Value of Two-Prover Games 10.4230/LIPIcs.ITCS.2018.12
• Yuqing Kong and Grant Schoenebeck Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity 10.4230/LIPIcs.ITCS.2018.13
• Yuqing Kong and Grant Schoenebeck Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case 10.4230/LIPIcs.ITCS.2018.14
• Rafael Frongillo and Bo Waggoner An Axiomatic Study of Scoring Rule Markets 10.4230/LIPIcs.ITCS.2018.15
• Avrim Blum and Yishay Mansour On Price versus Quality 10.4230/LIPIcs.ITCS.2018.16
• Shafi Goldwasser, Ofer Grossman, and Dhiraj Holden Pseudo-Deterministic Proofs 10.4230/LIPIcs.ITCS.2018.17
• Oded Goldreich and Guy N. Rothblum Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets 10.4230/LIPIcs.ITCS.2018.18
• Itay Berman, Ron D. Rothblum, and Vinod Vaikuntanathan Zero-Knowledge Proofs of Proximity 10.4230/LIPIcs.ITCS.2018.19
• Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, and Andrew Morgan Minimum Circuit Size, Graph Isomorphism, and Related Problems 10.4230/LIPIcs.ITCS.2018.20
• Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, and Stefano Tessaro Foundations of Homomorphic Secret Sharing 10.4230/LIPIcs.ITCS.2018.21
• Rina Panigrahy, Ali Rahimi, Sushant Sachdeva, and Qiuyi Zhang Convergence Results for Neural Networks via Electrodynamics 10.4230/LIPIcs.ITCS.2018.22
• Jelena Diakonikolas and Lorenzo Orecchia Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method 10.4230/LIPIcs.ITCS.2018.23
• Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory 10.4230/LIPIcs.ITCS.2018.24
• Josh Alman and Virginia Vassilevska Williams Further Limitations of the Known Approaches for Matrix Multiplication 10.4230/LIPIcs.ITCS.2018.25
• Srikanth Srinivasan and Madhu Sudan Local Decoding and Testing of Polynomials over Grids 10.4230/LIPIcs.ITCS.2018.26
• Tom Gur, Govind Ramnarayan, and Ron D. Rothblum Relaxed Locally Correctable Codes 10.4230/LIPIcs.ITCS.2018.27
• Dana Moshkovitz and Michal Moshkovitz Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning 10.4230/LIPIcs.ITCS.2018.28
• Pooya Hatami and Avishay Tal Pseudorandom Generators for Low Sensitivity Functions 10.4230/LIPIcs.ITCS.2018.29
• Christoph Dürr, Thomas Erlebach, Nicole Megow, and Julie Meißner Scheduling with Explorable Uncertainty 10.4230/LIPIcs.ITCS.2018.30
• Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, and José Verschae A Local-Search Algorithm for Steiner Forest 10.4230/LIPIcs.ITCS.2018.31
• Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, and Meirav Zehavi Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity 10.4230/LIPIcs.ITCS.2018.32
• Jon Kleinberg and Manish Raghavan Selection Problems in the Presence of Implicit Bias 10.4230/LIPIcs.ITCS.2018.33
• Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, and Virginia Vassilevska Williams Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy 10.4230/LIPIcs.ITCS.2018.34
• Amir Abboud and Aviad Rubinstein Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds 10.4230/LIPIcs.ITCS.2018.35
• Irit Dinur and Pasin Manurangsi ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network 10.4230/LIPIcs.ITCS.2018.36
• Paul W. Goldberg and Christos H. Papadimitriou Towards a Unified Complexity Theory of Total Functions 10.4230/LIPIcs.ITCS.2018.37
• Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, and Makrand Sinha Edge Estimation with Independent Set Oracles 10.4230/LIPIcs.ITCS.2018.38
• Aviad Rubinstein, Tselil Schramm, and S. Matthew Weinberg Computing Exact Minimum Cuts Without Knowing the Graph 10.4230/LIPIcs.ITCS.2018.39
• Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar Approximate Clustering with Same-Cluster Queries 10.4230/LIPIcs.ITCS.2018.40
• Vedat Levi Alev, Nima Anari, Lap Chi Lau, and Shayan Oveis Gharan Graph Clustering using Effective Resistance 10.4230/LIPIcs.ITCS.2018.41
• Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, and Elena Grigorescu Lattice-based Locality Sensitive Hashing is Optimal 10.4230/LIPIcs.ITCS.2018.42
• Victor Balcer and Salil Vadhan Differential Privacy on Finite Computers 10.4230/LIPIcs.ITCS.2018.43
• Vishesh Karwa and Salil Vadhan Finite Sample Differentially Private Confidence Intervals 10.4230/LIPIcs.ITCS.2018.44
• Jacob Steinhardt, Moses Charikar, and Gregory Valiant Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers 10.4230/LIPIcs.ITCS.2018.45
• Qingqing Huang, Sham M. Kakade, Weihao Kong, and Gregory Valiant Recovering Structured Probability Matrices 10.4230/LIPIcs.ITCS.2018.46
• Mingda Qiao and Gregory Valiant Learning Discrete Distributions from Untrusted Batches 10.4230/LIPIcs.ITCS.2018.47
• Yishay Mansour, Aleksandrs Slivkins, and Zhiwei Steven Wu Competing Bandits: Learning Under Competition 10.4230/LIPIcs.ITCS.2018.48
• Lucas Boczkowski, Ofer Feinerman, Amos Korman, and Emanuele Natale Limits for Rumor Spreading in Stochastic Populations 10.4230/LIPIcs.ITCS.2018.49
• Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler Making Asynchronous Distributed Computations Robust to Channel Noise 10.4230/LIPIcs.ITCS.2018.50
• Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, and Frieder Smolny Distance-Preserving Graph Contractions 10.4230/LIPIcs.ITCS.2018.51
• Shay Solomon Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs 10.4230/LIPIcs.ITCS.2018.52
• Alessandro Chiesa and Tom Gur Proofs of Proximity for Distribution Testing 10.4230/LIPIcs.ITCS.2018.53
• Lior Gishboliner and Asaf Shapira Efficient Testing without Efficient Regularity 10.4230/LIPIcs.ITCS.2018.54
• Pravesh K. Kothari and Roi Livni Improper Learning by Refuting 10.4230/LIPIcs.ITCS.2018.55
• Greg Yang A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma 10.4230/LIPIcs.ITCS.2018.56
• Robert Legenstein, Wolfgang Maass, Christos H. Papadimitriou, and Santosh S. Vempala Long Term Memory and the Densest K-Subgraph Problem 10.4230/LIPIcs.ITCS.2018.57
• Bernard Chazelle Toward a Theory of Markov Influence Systems and their Renormalization 10.4230/LIPIcs.ITCS.2018.58
• Georgios Piliouras and Leonard J. Schulman Learning Dynamics and the Co-Evolution of Competing Sexual Species 10.4230/LIPIcs.ITCS.2018.59