Abstract is missing.
- Equilibrium Selection in Information Elicitation without Verification via Information MonotonicityYuqing Kong, Grant Schoenebeck. [doi]
- Recovering Structured Probability MatricesQingqing Huang, Sham M. Kakade, Weihao Kong, Gregory Valiant. [doi]
- A Local-Search Algorithm for Steiner ForestMartin Groß 0001, Anupam Gupta, Amit Kumar 0001, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt 0001, José Verschae. [doi]
- Competing Bandits: Learning Under CompetitionYishay Mansour, Aleksandrs Slivkins, Zhiwei Steven Wu. [doi]
- Minimum Circuit Size, Graph Isomorphism, and Related ProblemsEric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan. [doi]
- Resilience: A Criterion for Learning in the Presence of Arbitrary OutliersJacob Steinhardt, Moses Charikar, Gregory Valiant. [doi]
- Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable SetsOded Goldreich 0001, Guy N. Rothblum. [doi]
- A Candidate for a Strong Separation of Information and CommunicationMark Braverman, Anat Ganor, Gillat Kol, Ran Raz. [doi]
- Selection Problems in the Presence of Implicit BiasJon M. Kleinberg, Manish Raghavan. [doi]
- Edge Estimation with Independent Set OraclesPaul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha. [doi]
- Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time HierarchyErik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams. [doi]
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner NetworkIrit Dinur, Pasin Manurangsi. [doi]
- Stabbing PlanesPaul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere. [doi]
- Computing Exact Minimum Cuts Without Knowing the GraphAviad Rubinstein, Tselil Schramm, S. Matthew Weinberg. [doi]
- Limits for Rumor Spreading in Stochastic PopulationsLucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale. [doi]
- Local Algorithms for Bounded Degree Sparsifiers in Sparse GraphsShay Solomon. [doi]
- Efficient Testing without Efficient RegularityLior Gishboliner, Asaf Shapira. [doi]
- A Complete Characterization of Unitary Quantum SpaceBill Fefferman, Cedric Yen-Yu Lin. [doi]
- Size, Cost and Capacity: A Semantic Technique for Hard Random QBFsOlaf Beyersdorff, Joshua Blinkhorn, Luke Hinde. [doi]
- Zero-Knowledge Proofs of ProximityItay Berman, Ron D. Rothblum, Vinod Vaikuntanathan. [doi]
- Further Limitations of the Known Approaches for Matrix MultiplicationJosh Alman, Virginia Vassilevska Williams. [doi]
- Approximate Clustering with Same-Cluster QueriesNir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar 0001. [doi]
- Finite Sample Differentially Private Confidence IntervalsVishesh Karwa, Salil P. Vadhan. [doi]
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and HardnessCameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, David P. Woodruff. [doi]
- Distance-Preserving Graph ContractionsAaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny. [doi]
- Scheduling with Explorable UncertaintyChristoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner. [doi]
- Improper Learning by RefutingPravesh K. Kothari, Roi Livni. [doi]
- Lattice-based Locality Sensitive Hashing is OptimalKarthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, Elena Grigorescu. [doi]
- A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas LemmaGreg Yang. [doi]
- An Axiomatic Study of Scoring Rule MarketsRafael M. Frongillo, Bo Waggoner. [doi]
- Matrix Completion and Related Problems via Strong DualityMaria-Florina Balcan, Yingyu Liang, David P. Woodruff, Hongyang Zhang. [doi]
- Local Decoding and Testing of Polynomials over GridsSrikanth Srinivasan 0001, Madhu Sudan. [doi]
- On Price versus QualityAvrim Blum, Yishay Mansour. [doi]
- Foundations of Homomorphic Secret SharingElette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro. [doi]
- Towards a Unified Complexity Theory of Total FunctionsPaul W. Goldberg, Christos H. Papadimitriou. [doi]
- Pseudo-Deterministic ProofsShafi Goldwasser, Ofer Grossman, Dhiraj Holden. [doi]
- Relaxed Locally Correctable CodesTom Gur, Govind Ramnarayan, Ron D. Rothblum. [doi]
- Quantum Query Algorithms are Completely Bounded FormsSrinivasan Arunachalam, Jop Briët, Carlos Palazuelos. [doi]
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number TheoryJin-yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk. [doi]
- Learning Discrete Distributions from Untrusted BatchesMingda Qiao, Gregory Valiant. [doi]
- A Quasi-Random Approach to Matrix Spectral AnalysisMichael Ben-Or, Lior Eldar. [doi]
- Learning Dynamics and the Co-Evolution of Competing Sexual SpeciesGeorgios Piliouras, Leonard J. Schulman. [doi]
- Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant TheoryPeter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson. [doi]
- Differential Privacy on Finite ComputersVictor Balcer, Salil P. Vadhan. [doi]
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower BoundsAmir Abboud, Aviad Rubinstein. [doi]
- Pseudorandom Generators for Low Sensitivity FunctionsPooya Hatami, Avishay Tal. [doi]
- Long Term Memory and the Densest K-Subgraph ProblemRobert A. Legenstein, Wolfgang Maass 0001, Christos H. Papadimitriou, Santosh Srinivas Vempala. [doi]
- Graph Clustering using Effective ResistanceVedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan. [doi]
- Making Asynchronous Distributed Computations Robust to Channel NoiseKeren Censor Hillel, Ran Gelles, Bernhard Haeupler. [doi]
- Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized ComplexityDaniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice CaseYuqing Kong, Grant Schoenebeck. [doi]
- Non-Negative Sparse Regression and Column Subset Selection with L1 ErrorAditya Bhaskara, Silvio Lattanzi. [doi]
- Entropy Samplers and Strong Generic Lower Bounds For Space Bounded LearningDana Moshkovitz, Michal Moshkovitz. [doi]
- Toward a Theory of Markov Influence Systems and their RenormalizationBernard Chazelle. [doi]
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order MethodJelena Diakonikolas, Lorenzo Orecchia. [doi]
- Convergence Results for Neural Networks via ElectrodynamicsRina Panigrahy, Ali Rahimi, Sushant Sachdeva, Qiuyi Zhang. [doi]
- Barriers for Rank Methods in Arithmetic ComplexityKlim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson. [doi]
- Proofs of Proximity for Distribution TestingAlessandro Chiesa, Tom Gur. [doi]
- Information Value of Two-Prover GamesMark Braverman, Young Kun-Ko. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]