


default search action
6th ITCS 2015: Rehovot, Israel
- Tim Roughgarden:

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015. ACM 2015, ISBN 978-1-4503-3333-7
Session 1
- Abhishek Jain

, Yael Tauman Kalai, Allison Bishop Lewko:
Interactive Coding for Multiparty Protocols. 1-10 - Klim Efremenko

, Ran Gelles, Bernhard Haeupler
:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. 11-20 - Mark Braverman, Jieming Mao:

Simulating Noisy Channel Interaction. 21-30 - Benny Applebaum, Liron David, Guy Even:

Deterministic Rateless Codes for BSC. 31-40
Session 2
- Chen Avin

, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet:
Homophily and the Glass Ceiling Effect in Social Networks. 41-50 - Jon M. Kleinberg, Sigal Oren

:
Dynamic Models of Reputation and Competition in Job-Market Matching. 51-60 - Samantha Leung, Edward Lui, Rafael Pass:

Voting with Coarse Beliefs. 61 - Roozbeh Ebrahimi, Jie Gao, Golnaz Ghasemiesfeh, Grant Schoenebeck

:
Complex Contagions in Kleinberg's Small World Model. 63-72
Session 3
- Ruta Mehta, Ioannis Panageas, Georgios Piliouras:

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]. 73 - Rina Panigrahy, Preyas Popat:

Fractal Structures in Adversarial Prediction. 75-84 - Flavio Chierichetti, Anirban Dasgupta

, Ravi Kumar, Silvio Lattanzi:
On Learning Mixture Models for Permutations. 85-92 - Brendan Juba:

Restricted Distribution Automatizability in PAC-Semantics. 93-102
Session 4
- Joseph F. Fitzsimons, Thomas Vidick

:
A Multiprover Interactive Proof System for the Local Hamiltonian Problem. 103-112 - Mika Göös, Toniann Pitassi, Thomas Watson:

Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. 113-122 - Mohammad Bavarian, Peter W. Shor:

Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. 123-132 - Tom Gur

, Ron D. Rothblum:
Non-Interactive Proofs of Proximity. 133-142
Session 5
- Benny Applebaum, Jonathan Avron, Christina Brzuska:

Arithmetic Cryptography: Extended Abstract. 143-151 - Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky

, Vassilis Zikas:
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. 153-162 - Pavel Hubácek

, Daniel Wichs
:
On the Communication Complexity of Secure Function Evaluation with Long Output. 163-172 - Avrim Blum, Jamie Morgenstern, Ankit Sharma, Adam D. Smith:

Privacy-Preserving Public Information for Sequential Games. 173-180
Session 6
- Michael B. Cohen

, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford:
Uniform Sampling for Matrix Approximation. 181-190 - Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar

, Ravishankar Krishnaswamy, Soledad Villar, Rachel A. Ward
:
Relax, No Need to Round: Integrality of Clustering Formulations. 191-200 - Chandra Chekuri

, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. 201-210 - Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn:

Robust Hierarchical k-Center Clustering. 211-218
Session 8
- Irit Dinur

, Shafi Goldwasser, Huijia Lin:
The Computational Benefit of Correlated Instances. 219-228 - Uriel Feige:

Why are Images Smooth? 229-236 - Luke Schaeffer:

A Physically Universal Cellular Automaton. 237-246
Session 9
- Justin Gilmer, Michal Koucký

, Michael E. Saks:
A New Approach to the Sensitivity Conjecture. 247-254 - Steven Heilman, Elchanan Mossel, Joe Neeman:

Standard Simplices and Pluralities are Not the Most Noise Stable. 255 - Clément Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan:

Communication with Imperfectly Shared Randomness. 257-262
Session 10
- Brynmor Chapman, Ryan Williams

:
The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data. 263-270 - Uriel Feige, Shlomo Jozeph:

Separation between Estimation and Approximation. 271-276 - Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:

Deterministic Extractors for Additive Sources: Extended Abstract. 277-286 - Atri Rudra, Mary Wootters:

It'll Probably Work Out: Improved List-Decoding Through Random Operations. 287-296
Session 11
- Simina Brânzei, Ariel D. Procaccia:

Verifiably Truthful Mechanisms. 297-306 - Moshe Babaioff, Moran Feldman

, Moshe Tennenholtz:
Mechanism Design with Strategic Mediators. 307-316 - Rachel Cummings, Katrina Ligett

, Aaron Roth
, Zhiwei Steven Wu, Juba Ziani
:
Accuracy for Sale: Aggregating Data with a Variance Constraint. 317-324 - Jing Chen, Silvio Micali, Rafael Pass:

Better Outcomes from More Rationality. 325
Session 12
- Roee David, Irit Dinur

, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. 327-336 - Oded Goldreich

, Dana Ron
:
On Sample-Based Testers. 337-345 - Bo Waggoner:

Lp Testing and Learning of Discrete Distributions. 347-356 - Ishay Haviv, Ning Xie

:
Sunflowers and Testing Triangle-Freeness of Functions. 357-366
Session 13
- Dmitry Kogan, Robert Krauthgamer:

Sketching Cuts in Graphs and Hypergraphs. 367-376 - Gregory Bodwin, Virginia Vassilevska Williams:

Very Sparse Additive Spanners and Emulators. 377-382 - Timothy Black:

Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive. 383-391

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













