Table of Contents

• Interactive Coding for Multiparty ProtocolsAbhishek Jain 0002, Yael Tauman Kalai, Allison Bishop Lewko. 1-10 [doi]
• Maximal Noise in Interactive Communication over Erasure Channels and Channels with FeedbackKlim Efremenko, Ran Gelles, Bernhard Haeupler. 11-20 [doi]
• Simulating Noisy Channel InteractionMark Braverman, Jieming Mao. 21-30 [doi]
• Deterministic Rateless Codes for BSCBenny Applebaum, Liron David, Guy Even. 31-40 [doi]
• Homophily and the Glass Ceiling Effect in Social NetworksChen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne Anne Pignolet. 41-50 [doi]
• Dynamic Models of Reputation and Competition in Job-Market MatchingJon Keinberg, Sigal Oren. 51-60 [doi]
• Voting with Coarse BeliefsSamantha Leung, Edward Lui, Rafael Pass. 61 [doi]
• Complex Contagions in Kleinberg's Small World ModelRoozbeh Ebrahimi, Jie Gao, Golnaz Ghasemiesfeh, Grant Schoenebeck. 63-72 [doi]
• Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]Ruta Mehta, Ioannis Panageas, Georgios Piliouras. 73 [doi]
• Fractal Structures in Adversarial PredictionRina Panigrahy, Preyas Popat. 75-84 [doi]
• On Learning Mixture Models for PermutationsFlavio Chierichetti, Anirban Dasgupta 0001, Ravi Kumar, Silvio Lattanzi. 85-92 [doi]
• Restricted Distribution Automatizability in PAC-SemanticsBrendan Juba. 93-102 [doi]
• A Multiprover Interactive Proof System for the Local Hamiltonian ProblemJoseph Fitzsimons, Thomas Vidick. 103-112 [doi]
• Zero-Information Protocols and Unambiguity in Arthur-Merlin CommunicationMika Göös, Toniann Pitassi, Thomas Watson 0001. 113-122 [doi]
• Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSHMohammad Bavarian, Peter W. Shor. 123-132 [doi]
• Non-Interactive Proofs of ProximityTom Gur, Ron D. Rothblum. 133-142 [doi]
• Arithmetic Cryptography: Extended AbstractBenny Applebaum, Jonathan Avron, Christina Brzuska. 143-151 [doi]
• The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive FaultsNishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas. 153-162 [doi]
• On the Communication Complexity of Secure Function Evaluation with Long OutputPavel Hubacek, Daniel Wichs. 163-172 [doi]
• Privacy-Preserving Public Information for Sequential GamesAvrim Blum, Jamie Morgenstern, Ankit Sharma, Adam D. Smith. 173-180 [doi]
• Uniform Sampling for Matrix ApproximationMichael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford. 181-190 [doi]
• Relax, No Need to Round: Integrality of Clustering FormulationsPranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward. 191-200 [doi]
• On Multiplicative Weight Updates for Concave and Submodular Function MaximizationChandra Chekuri, T. S. Jayram, Jan Vondrák. 201-210 [doi]
• Robust Hierarchical k-Center ClusteringSilvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya Razenshteyn. 211-218 [doi]
• The Computational Benefit of Correlated InstancesIrit Dinur, Shafi Goldwasser, Huijia Lin. 219-228 [doi]
• Why are Images Smooth?Uriel Feige. 229-236 [doi]
• A Physically Universal Cellular AutomatonLuke Schaeffer. 237-246 [doi]
• A New Approach to the Sensitivity ConjectureJustin Gilmer, Michal Koucký, Michael E. Saks. 247-254 [doi]
• Standard Simplices and Pluralities are Not the Most Noise StableSteven Heilman, Elchanan Mossel, Joe Neeman. 255 [doi]
• Communication with Imperfectly Shared RandomnessClément Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan. 257-262 [doi]
• The Circuit-Input Game, Natural Proofs, and Testing Circuits With DataBrynmor Chapman, Ryan Williams. 263-270 [doi]
• Separation between Estimation and ApproximationUriel Feige, Shlomo Jozeph. 271-276 [doi]
• Deterministic Extractors for Additive Sources: Extended AbstractAbhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman. 277-286 [doi]
• It'll Probably Work Out: Improved List-Decoding Through Random OperationsAtri Rudra, Mary Wootters. 287-296 [doi]
• Verifiably Truthful MechanismsSimina Brânzei, Ariel D. Procaccia. 297-306 [doi]
• Mechanism Design with Strategic MediatorsMoshe Babaioff, Moran Feldman, Moshe Tennenholtz. 307-316 [doi]
• Accuracy for Sale: Aggregating Data with a Variance ConstraintRachel Cummings, Katrina Ligett, Aaron Roth, Zhiwei Steven Wu, Juba Ziani. 317-324 [doi]
• Better Outcomes from More RationalityJing Chen, Silvio Micali, Rafael Pass. 325 [doi]
• Direct Sum TestingRoee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar. 327-336 [doi]
• On Sample-Based TestersOded Goldreich, Dana Ron. 337-345 [doi]
• p Testing and Learning of Discrete DistributionsBo Waggoner. 347-356 [doi]
• Sunflowers and Testing Triangle-Freeness of FunctionsIshay Haviv, Ning Xie. 357-366 [doi]
• Sketching Cuts in Graphs and HypergraphsDmitry Kogan, Robert Krauthgamer. 367-376 [doi]
• Very Sparse Additive Spanners and EmulatorsGregory Bodwin, Virginia Vassilevska Williams. 377-382 [doi]
• Monotone Properties of k-Uniform Hypergraphs are Weakly EvasiveTimothy Black. 383-391 [doi]