Saturday, May 19, 2012 (at New York University) TUTORIAL Algorithmic Trading and Computational Finance, Part I - Michael Kearns 9:45-10:45 WWH Room 109 10:45-11:00 Coffee break Algorithmic Trading and Computational Finance, Part II - Michael Kearns 11:00-12:00 WWH Room 109 12:00-1:30 Lunch (Not Provided) WORKSHOP Computational Algorithms for Distributed Algorithms for Memory- Unique Games Conjecture Sustainability and Streaming Data Sensitive Computing and Related Advances - Steven Phillips - Ashish Goel - Michael Bender - Sanjeev Arora 1:30-3:30 Kirk Pruhs Andrew McGregor Martin Farach-Colton Moses Charikar David Shmoys Sergei Vassilvitskii WWH Room 102 WWH Room 109 WWH Room 1302 WWH Room 101 3:30-4:00 Coffee break Computational Algorithms for Distributed Algorithms for Memory- Unique Games Conjecture Sustainability and Streaming Data Sensitive Computing and Related Advances - Steven Phillips - Ashish Goel - Michael Bender - Sanjeev Arora 4:00-6:00 Kirk Pruhs Andrew McGregor Martin Farach-Colton Moses Charikar David Shmoys Sergei Vassilvitskii WWH Room 102 WWH Room 109 WWH Room 1302 WWH Room 101 7:00-9:00 Reception (at the New Yorker Hotel) Note: WWH stands for Warren Weaver Hall of Courant Institute of Mathematical Sciences, New York University.

STOC 2012 Corporate Supporters

SIGACT and ACM gratefully acknowledge the financial support of

at the Platinum level;

for helping to cover student participation in the conference;

at the Friends level as well. Sunday, May 20, 2012 (at the New Yorker Hotel) Session 1A Chair: Dan Spielman Session 1B Chair: Oded Regev Faster Approximate Multicommodity Flow Using 8:45- Quantum Money from Hidden Subspaces Quadratically Coupled Flows 9:05 - Scott Aaronson, Paul Christiano - Jonathan A. Kelner, Gary L. Miller, Richard Peng When the Cut Condition is Enough: A Complete Certifiable Quantum Dice: Or, True Random Number 9:10- Characterization for Multiflow Problems in Series-Parallel Generation Secure Against Quantum Adversaries 9:30 Networks - Umesh Vazirani, Thomas Vidick - Amit Chakrabarti, Lisa Fleisher, Christophe Weibel Strongly polynomial algorithm for a class of minimum-cost Span Programs for Functions with Constant-Sized 1- 9:35- flow problems with separable convex objectives certificates 9:55 - Laszlo A. Vegh - Aleksandrs Belovs Coffee break Session 2 Chair: Toniann Pitassi 10:25- The Cell Probe Complexity of Dynamic Range Counting 10:45 - Kasper Green Larsen 10:50- Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds 11:10 - Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf Session 3A Chair: Amin Saberi Session 3B Chair: Shubanghi Saraf 11:20- Polyhedral Clinching Auctions and the Adwords Polytope Computing a Nonnegative Matrix Factorization – Provably 11:40 - Gagan Goel, Vahab Mirrokni, Renato Paes Leme - Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra On Identity Testing of Tensors, Low-rank Recovery and 11:45- Matroid Prophet Inequalities Compressed Sensing 12:05 - Robert Kleinberg, Seth Matthew Weinberg - Michael A. Forbes, Amir Shpilka Structure Theorem and Isomorphism Test for Graphs with 12:10- Online matching with concave returns Excluded Topological Subgraphs 12:30 - Nikhil R. Devanur, Kamal Jain - Martin Grohe, Daniel Marx Lunch (Not Provided) Session 4A Chair: Toniann Pitassi Session 4B Chair: Oded Regev 2:00- Short Proofs for the Determinant Identities Solution of the propeller conjecture in $R^3$ 2:20 - Pavel Hrubes, Iddo Tzameret - Steven Heilman, Aukosh Jagannath, Assaf Naor Time-Space Tradeoffs in Resolution: Superpolynomial $2^{log^{1-\epsilon} n}$ Hardness for Closest Vector 2:25- Lower Bounds for Superlinear Space Problem with Preprocessing 2:45 - Paul Beame, Christopher Beck, Russell Impagliazzo - Subhash Khot, Preyas Popat, Nisheeth Vishnoi On the Virtue of Succinct Proofs: Amplifying 2:50- Communication Complexity Hardness to Time-Space Trade- A new point of NP-hardness for Unique Games 3:10 offs in Proof Complexity - Ryan O'Donnell, John Wright - Trinh Huynh, Jakob Nordstrom Hypercontractivity, Sum-of-Squares Proofs, and their Determinism versus Nondeterminism with Arithmetic Tests 3:15- Applications and Computation 3:35 - Boaz Barak, Fernando G.S.L. Brandao, Aram W. Harrow, - Miklos Ajtai Jonathan Kelner, David Steurer, Yuan Zhou Coffee Break Session 5A Chair: Madhur Tulsiani Session 5B Chair: Sanjeev Khanna Approximation Algorithms for Semi-Random Partitioning From Irreducible Representations to Locally Decodable 4:05- Problems Codes 4:25 - Konstantin Makarychev, Yury Makarychev, Aravindan - Klim Efremenko Vijayaraghavan Folded Codes from Function Field Towers and Improved A Near-Linear Time $\eps$-Approximation Algorithm for 4:30- Optimal Rate List Decoding Geometric Bipartite Matching 4:50 - Venkatesan Guruswami, Chaoping Xing - R. Sharathkumar, Pankaj K. Agarwal Using Petal-Decompositions to Build a Low Stretch 4:55- Subspace Evasive Sets Spanning Tree 5:15 - Zeev Dvir, Shachar Lovett - Ittai Abraham, Ofer Neiman Edge Transitive Ramanujan Graphs and Symmetric LDPC Improved Smoothed Analysis of Multiobjective 5:20- Good Codes Optimization 5:40 - Tali Kaufman, Alexander Lubotzky - Tobias Brunsch, Heiko Roglin 5:50 - Poster Session 7:30 Monday, May 21, 2012 (at the New Yorker Hotel) Session 6A Chair: Amin Saberi Session 6B Chair: Rahul Santhanam Tight bounds on computing error-correcting codes by 8:50- Prior-Free Auctions with Ordered Bidders bounded-depth circuits with arbitrary gates 9:10 - Stefano Leonardi, Tim Roughgarden - Anna Gal, Kristoffer Arnsfelt Hansen, Michal Koucky, Pavel Pudlak, Emanuele Viola 9:15- On the limits of black-box reductions in mechanism design Tight Bounds for Monotone Switching Networks via 9:35 - Shuchi Chawla, Nicole Immorlica, Brendan Lucier Fourier Analysis - Siu Man Chan, Aaron Potechin 9:40- Budget Feasible Mechanism Design: From Prior-Free to Interactive Information Complexity 10:00 Bayesian - Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu - Mark Braverman An Algorithmic Characterization of Multi-Dimensional The Multiparty Communication Complexity of Set 10:05- Mechanisms Disjointness 10:25 - Yang Cai, Constantinos Deskalakis, S. Matthew Weinberg - Alexander A. Sherstov Coffee break Session 7A Chair: Satish Rao Session 7B Chair: Shubhanghi Saraf Jacobian Hits Circuits: Hitting-sets, Lower Bounds for 10:55- Fast Matrix Rank Algorithms and Applications Depth-D Occur-k Formulas and Depth-3 Transcendence 11:15 - Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau Degree-k Circuits - Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena Separating multilinear branching programs and formulas 11:20- Nearly Optimal Sparse Fourier Transform - Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir 11:40 - Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price Yehudayoff Polynomial Time Algorithms for Multi-Type Branching Reconstruction of Depth-4 Multlinear circuits with Top 11:45- Processes and Stochastic Context-Free Grammars Fan-in 2 12:05 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis - Ankit Gupta, Neeraj Kayal, Satya Lokam Optmal Online Buffer Scheduling for Block Devices 12:10- Affine Projections of Polynomials - Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald 12:30 - Neeraj Kayal Raecke LUNCH ( PROVIDED !) Session 8A Chair: Suresh Venkatasubramanian Session 8B Chair: Dana Ron The traveling salesman problem: low dimensionality implies Learning Poisson Binomial Distributions 2:00- a polynomial time approximation scheme - Constantinos Daskalakis, Ilias Diakonikolas, Rocco 2:20 - Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer Servedio Nearly optimal solutions for the Chow Parameters Problem 2:25- On Vertex Sparsifiers with Steiner Nodes and low- weight approximation of halfspaces 2:45 - Julia Chuzhoy - Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco Servedio Approximation Algorithms and Hardness of Integral 2:50- Making Polynomials Robust to Noise Concurrent Flow 3:10 - Alexander A. Sherstov - Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li Coffee Break Session 9A Chair: Rahul Santhanam Session 9B Chair: Guy Rothblum Pseudorandom Generators with Long Stretch and Low 3:30- Competitive Contagion in Networks Locality from Random Local One-Way Functions 3:50 - Sanjeev Goyal, Michael Kearns - Benny Applebaum Finding red balloons with split contracts: robustness to Characterizing Pseudoentropy and Simplifying 3:55- individuals' selfishness Pseudorandom Generator Constructions 4:15 - Manuel Cebrian, Lorenzo Coviello, Andrea Vattani, - Salil Vadhan, Colin Jia Zheng Panagiotis Voulgaris A Rigorous Analyis of One-Dimensional Schelling Design Extractors, Non-Malleable Condensers and Privacy 4:20- Segregation - Christina Brandt, Nicole Immorlica, Gautam Amplification 4:40 Kamath, Robert Kleinberg - Xin Li Coffee break Session 10 Chair: David Williamson 5:00- Routing in Undirected Graphs with Constant Congestion 5:20 - Julia Chuzhoy 5:25- Improving Chrisofides' Algorithm for the s-t Path TSP 5:45 - Hyung-Chan An, Robert Kleinberg, David B. Shmoys 5:50- Multiplying Matrices Faster Than Coppersmith-Winograd 6:10 - Virginia Vassilevska Williams 9:00 Business Meeting Tuesday, May 22, 2012 (at the New Yorker Hotel) Session 11A Chair: Rina Panigrahy Session 11B Chair: Dana Ron 8:50- Catching the k-NAESAT threshold Tight Bounds for Distributed Functional Monitoring 9:10 - Amin Coja-Oglan, Konstantinos Panagiotou - David P. Woodruff, Qin Zhang Global Computation in a Poorly Connected World: Fast 9:15- Complexity of Counting CSP with Complex Weights Rumor Spreading with No Dependence on Conductance 9:35 - Jin-Yi Cai, Xi Chen - Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov Tight Time-Space Tradeoff for Mutual Exclusion 9:40- The freezing threshold for k-colourings of a random graph - Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath 10:00 - Michael Molloy Kondapally A Tight RMR Lower Bound for Randomized Mutual 10:05- Robust satisfiability of constraint satisfaction problems Exclusion 10:25 - Libor Barto, Marcin Kozik - George Giakkoupis, Philipp Woelfel 10:25- Coffee break 10:55 Session 12A Chair: Andrew McGregor Session 12B Chair: Tom Hayes A Complementary Pivot Algorithm for Markets under 10:55- Monotone expansion Separable, Piecewise-Linear Concave Utilities 11:15 - Jean Bourgain, Amir Yehudayoff - Jugal Garg, Ruta Mehta, Milind Sohoni, Vijay V. Vazirani Nearly Complete Graphs Decomposable into Large Induced 11:20- Rational Proofs Matchings and their Applications 11:40 - Pablo Azar, Silvio Micali - Noga Alon, Ankur Moitra, Benny Sudakov 11:45- Minimax Option Pricing Meets Black-Scholes in the Limit Probabilistic existence of rigid combinatorial structures 12:05 - Jacob Abernethy, Rafael Frongillo, Andre Wibisono - Greg Kuperberg, Shachar Lovett, Ron Peled A quantitative Gibbard-Satterthwaite theorem without 12:10- From Query Complexity to Computational Complexity neutrality 12:30 - Shahar Dobzinski, Jan Vondrak - Elchanan Mossel, Miklos Z. Racz 12:30- Lunch (Not Provided) 2:00 Session 13A Chair: Andrew McGregor Session 13B Chair: Guy Rothblum Multiway spectral partitioning and higher-order Cheeger inequalities / Many Sparse Cuts via Higher Eigenvalues On-the-Fly Multiparty Computation on the Cloud via 2:00- - James R. Lee, Shayan Oveis Gharan, Luca Trevisan / Multikey Fully Homomorphic Encryption 2:20 Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh - Adriana Lopez-Alt, Eran Tromer, Vinod Vaikuntanathan Vempala Approximating the Exponential, the Lancoz Method and an Multiparty Computation Secure Against Continual Memory 2:25- $\tilde{O}(m)$-Time Spectral Algorithm for Balanced Leakage 2:45 Separator - Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael - Lorenzo Orecchia, Sushant Sachdeva, Nisheeth Vishnoi Tauman Kalai Matroids and Integrality Gaps for Hypergraphic Steiner Tree 2:50- Relaxations Beating Randomized Response on Incoherent Matrices 3:10 - Michel X. Goemans, Neil Olver, Thomas Rothvoss, Rico - Moritz Hardt, Aaron Roth Zenklusen Unconditionally Differentially Private Mechanisms for Strict Fibonacci Heaps 3:15- Linear Queries - Gerth Stolting Brodal, George Lagogiannis, Robert E. 3:35 - Aditya Bhaskara, Daniel Dadush, Ravishankar Tarjan Krishnaswamy, Kunal Talwar 3:40- Tight lower bounds for the online labeling problem Optimal Private Halfspace Counting via Discrepancy 4:00 - Jan Bulanek, Michal Koucky, Michael Saks - S. Muthukrishnan, Aleksandar Nikolov Fully Dynamic Approximate Distance Oracles for Planar 4:05- Graphs via Forbidden-Set Distance labels 4:25 - Ittai Abraham, Shiri Chechik, Cyril Gavoille