sign in sign up
<<
Home , Brent Waters, Jennifer Rexford, Moni Naor, Shafi Goldwasser, Yoav Freund

40th ACM Symposium on Theory of Computing (STOC 2008)

Saturday, May 17, 2008 7:00pm – 10:00pm Registration (Conference Centre) 8:00pm – 10:00pm Reception (Palm Court)

Sunday, May 18, 2008 8:00am – 5:00pm Registration (Conference Centre) 8:10am – 8:35am Breakfast (Conference Centre)

Session 1A Session 1B (Theatre) (Saanich Room) Chair: Venkat Guruswami Chair: David Shmoys (Cornell (University of Washington and University) Institute for Advanced Study) 8:35am - 8:55am Parallel Repetition in Projection The Complexity of Temporal Games and a Concentration Bound Constraint Satisfaction Problems Anup Rao Manuel Bodirsky, Jan Kara 9:00am - 9:20am SDP Gaps and UGC Hardness for An Effective Ergodic Theorem Multiway Cut, 0-Extension and and Some Applications Metric Labeling Satyadev Nandakumar Rajeskar Manokaran, Joseph (Seffi)

Naor, Prasad Raghavendra, Roy Schwartz

9:25am – 9:45am Unique Games on Expanding Algorithms for Subset Selection Constraint Graphs are Easy in Linear Regression , Subhash A. Khot, Abhimanyu Das, David Kempe Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth Vishnoi 9:45am - 10:10am Break

Session 2 (Theatre) Chair: Joan Feigenbaum (Yale University) 10:10am - 11:10am Rethinking Internet Routing Invited talk by (Princeton University) 11:10am - 11:20am Break

Session 3A Session 3B (Theatre) (Saanich Room) Chair: Xiaotie Deng (City Chair: Anupam Gupta (Carnegie University of Hong Kong) Mellon University) The Pattern Matrix Method for 11:20am – 11:40am Interdomain Routing and Games Lower Bounds on Quantum Hagay Levin, Michael Schapira, Communication Aviv Zohar Alexander A. Sherstov 11:45am – 12:05pm Optimal approximation for the Classical Interaction Cannot Submodular Welfare Problem in Replace a Quantum Message the value oracle model Dmitry Gavinsky Jan Vondrak 12:10pm – 12:30pm Optimal Mechanism Design and Span-program-based quantum Money Burning algorithm for evaluating formulas Jason Hartline, Tim Ben W. Reichardt, Robert Spalek Roughgarden 12:30pm - 2:00pm Lunch (Palm Court)

Session 4A Session 4B (Theatre) (Saanich Room) Chair: Rafael Pass (Cornell Chair: Shuchi Chawla (University University) of Wisconsin, Madison) 2:00pm – 2:20pm Delegating Computation: An O(log2 k)-approximation Interactive Proofs for Muggles algorithm for the k-vertex connected subgraph problem , Yael Tauman, Guy Rothblum Jittat Fakcharoenphol, Bundit Laekhanukit 2:25pm – 2:45pm Universal Semantic Minimum k-way cuts via Communication I deterministic greedy tree packing Brendan Juba, Mikkel Thorup 2:50pm – 3:10pm Infeasibility of Instance Network Design for Vertex Compression and Succinct PCPs Connectivity for NP Tanmoy Chakraborty, Julia Lance Fortnow, Rahul Santhanam Chuzhoy, Sanjeev Khanna

3:15pm – 3:35pm A (De)constructive Approach to A Fixed-Parameter Algorithm for Program Checking the Directed Feedback Vertex Set Problem Shafi Goldwasser, Dan Gutfreund, Alex Healy, Tali Kaufman, Guy Jianer Chen, Yang Liu, Songjian Rothblum Lu, Barry O’Sullivan, Igor Razgon 3:35pm - 4:05pm Break

Session 5A Session 5B (Theatre) (Saanich Room) Chair: (Microsoft Chair: Martin Dyer (University of Research) Leeds) 4:05pm-4:25pm Lossy Trapdoor Functions and Tight RMR Lower Bounds for Their Applications Mutual Exclusion and Other Problems Chris Peikert, Hagit Attiya, Danny Hendler, Philipp Woelfel 4:30pm – 4:50pm Trapdoors for Hard Lattices and Randomized K-Server on New Cryptographic Constructions Hierarchical Binary Trees Craig Gentry, Chris Peikert, Vinod Aaron Cote, Adam Meyerson, Vaikuntanathan Laura Poplawski 4:55pm – 5:15pm Finding Short Lattice Vectors Randomized Competitive within Mordell's Inequality Algorithms for Generalized Caching Nicolas Gama, Phong Q. Nguyen Nikhil Bansal, Niv Buchbinder, Joseph (Seffi) Naor 5:15pm - 5:25pm Break 5:25pm - 6:25pm Session 6 (Theatre) Chair: David Shmoys, Cornell University

Algorithms and Inapproximability Results For Every CSP? Prasad Raghavendra

Optimal Hierarchical Decompositions for Congestion Minimization in Networks Harald Räcke 9:00pm-11:00pm Business Meeting (Saanich Room)

Monday, May 19, 2008 8:00am - 5:00pm Registration (Conference Centre) 7:50am - 8:15am Breakfast (Conference Centre)

Session 7A Session 7B (Theatre) (Saanich Room) Chair: Venkat Guruswami Chair: Xiaotie Deng (City (University of Washington and University of Hong Kong) Institute for Advanced Study) 8:15am – 8:35am List-Decoding Reed-Muller Codes Balanced Outcomes in Social over Small Fields Exchange Networks Parikshit Gopalan, Adam R. Jon Kleinberg, Eva Tardos Klivans, David Zuckerman 8:40am – 9:00am Decodability of Group Pricing Combinatorial Markets for Homomorphisms beyond the Tournaments Johnson Bound Yiling Chen, Sharad Goel, David , Elena Grigorescu, Pennock Swastik Kopparty, Madhu Sudan 9:05am – 9:25am Combinatorial Construction of Fast-Converging Tatonnement Locally Testable Codes Algorithms for One-Time and Ongoing Market Problems Or Meir Richard Cole, Lisa Fleischer

9:25am – 9:50am Break

Session 8A Session 8B (Theatre) (Saanich Room) Chair: Konstantin Makarychev Chair: Joan Feigenbaum (Yale (IBM) University) 9:50am – 10:10am Combinatorial construction of Inapproximability of Pure Nash almost-Ramanujan graphs using Equilibria the zig-zag product Alexander Skopalik, Berthold Avraham Ben-Aroya, Amnon Ta- Vöcking Shma

10:15am – 10:35am An optimal SDP algorithm for The Myth of the Folk Theorem Max-Cut, and equally optimal Christian Borgs, Jennifer Chayes, Long Code tests Nicole Immorlica, Adam Tauman Ryan O'Donnell, Yi Wu Kalai, Vahab Mirrokni, 10:40am – 11:00am On Hardness of Learning Regret Minimization and the Price Intersection of Two Halfspaces of Total Anarchy Subhash Khot, Rishi Saket Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth 11:00am - 11:25am Break

Session 9A Session 9B (Theatre) (Saanich Room) Chair: Ronitt Rubinfeld (MIT) Chair: Rafael Pass (Cornell University)

11:25am-11:45am Testing Symmetric Properties of Complete Fairness in Secure Two- Distributions Party Computation Paul Valiant S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell

11:50am-12:10pm Every Minor-Closed Property of Games for Exchanging Information Sparse Graphs is Testable Gillat Kol, Itai Benjamini, Oded Schramm, Asaf Shapira

12:15pm – 12:35pm Algebraic Property Testing: The with Constant Role of Invariance Computational Overhead Tali Kaufman, Madhu Sudan Yuval Ishai, Eyal Kushilevitz, , 12:35pm - 2:00pm Lunch (Palm Court)

Session 10A Session 10B (Theatre) (Saanich Room) Chair: Anupam Gupta (Carnegie Chair: Martin Dyer (University of Mellon University) Leeds)

2:00 pm – 2:20pm The VPN Conjecture is True Fast polynomial factorization and modular composition in small Navin Goyal, Neil Olver, F. B. characteristic Shepherd Christopher Umans

2:25pm – 2:45pm Faster Approximate Lossy A quadratic lower bound for the Generalized Flow via Interior permanent and determinant Point Algorithms problem over any characteristic ≠ Samuel I. Daitch, Daniel A. 2 Spielman Jin-Yi Cai, Xi Chen, Dong Li

2:50pm – 3:10pm On Partitioning Graphs via Single Fast Integer Multiplication Using Commodity Flows Modular Arithmetic Lorenzo Orecchia, Leonard Anindya De, Piyush P Kurur, Schulman, Umesh V. Vazirani, Chandan Saha, Ramprasad Nisheeth K. Vishnoi Saptharishi

3:15pm – 3:35pm Graph and Map Isomorphism and Read-once Polynomial Identity All Polyhedral Embeddings In Testing Linear Time Amir Shpilka, Ilya Volkovich Ken-ichi Kawarabayashi, Bojan Mohar 3:35pm - 4:00pm Break

Session 11B Session 11A (Saanich Room) (Theatre) Chair: Luca Trevisan ( University Chair: : Shai Ben-David of California, Berkeley) (University of Waterloo) 4:00 pm – 4:20pm The Chow Parameters Problem Inverse Conjecture for the Gowers norm is false Ryan O'Donnell, Rocco Servedio Roy Meshulam, Shachar Lovett,

Alex Samorodnitsky

4:25pm – 4:45pm Agnostically Learning Decision Unconditional pseudorandom Trees generators for low degree polynomials Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans Shachar Lovett 4:50pm – 5:10pm Random projection trees and low Graph Sparsification by Effective dimensional manifolds Resistances Sanjoy Dasgupta, , Nikhil Srivastava

8:00 pm – 9:30pm Session 12 (Theatre) Chair: Shuchi Chawla (University of Wisconsin, Madison)

Some Topics in Analysis of Boolean Functions Tutorial by Ryan O'Donnell (Carnegie Mellon University)

Tuesday, May 20, 2008 8:00am-12:00pm Registration 7:50am- 8:20am Breakfast

Session 13A Session 13B (Theatre) (Saanich Room) Chair: Ronitt Rubinfeld (MIT) Chair: Shuchi Chawla (University of Wisconsin, Madison)

8:20am – 8:40am Uniform Direct-Product A Learning Theory Approach to Theorems: Simplified, Optimized, Non-Interactive Database Privacy and Derandomized Avrim Blum, Katrina Ligett, Aaron Russell Impagliazzo, Ragesh Roth Jaiswal , Valentine Kabanets,

8:45am – 9:05am Hardness Amplification Proofs Evolvability from Learning Require Majority Algorithms Ronen Shaltiel, Emanuele Viola Vitaly Feldman

9:10am – 9:30am Direct Product Theorems for On Agnostic Boosting and Parity Classical Communication Learning Complexity via Subdistribution Adam Tauman Kalai, Yishay Bounds Mansour, Elad Verbin Rahul Jain, Hartmut Klauck, Ashwin Nayak 9:30am - 9:50am Break 9:50am - 10:50am Session 14 (Theatre) Chair: Cynthia Dwork (Microsoft Research)

Computing How We Became Human Invited talk by , University of California Santa Cruz 10:50am - 11:10am Break

Session 15A Session 15B (Theatre) (Saanich Room) Chair: : Steve Chien (Microsoft Chair: Konstantin Makarychev Research) (IBM) 11:10am – 11:30am Robust Lower Bounds for A Learning Theoretic Communication and Stream Framework for Clustering with Computation Similarity Functions Amit Chakrabarti, Graham Maria-Florina Balcan, Avrim Cormode, Andrew McGregor Blum, Santosh Vempala 11:35am – 11:55am Sketching in Adversarial Multi-Armed Bandits on Metric Environments Spaces Ilya Mironov, Moni Naor, Gil Robert Kleinberg, Aleksandrs Segev Slivkins, Eli Upfal 12:00pm – 12:20pm Communication in the Presence of Stateless distributed gradient Replication descent for positive linear programs Omer Barkol, Yuval Ishai, Enav Weinreb Baruch Awerbuch, Rohit Khandekar 12:20pm -1:50pm Lunch (Palm Court)

Session 16A Session 16B (Theatre) (Saanich Room) Chair: Luca Trevisan, University Chair: Steve Chien (Microsoft of California, Berkeley Research)

1:50m – 2:10pm Towards an Optimal Separation of Optimal Query Complexity Bounds Space and Length in Resolution for Finding Graphs Jakob Nordström, Johan Håstad Sung-Soon Choi, Jeong Han Kim

2:15pm – 2:35pm Elusive Functions and Lower Additive Approximation for Bounds for Arithmetic Circuits Bounded Degree Survivable Ran Raz Network Design Lap Chi Lau, Mohit Singh

Additive Guarantees for Degree Bounded Directed Network Design Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan

2:40pm – 3:00pm On the constant-depth complexity Logconcave Random Graphs of k-clique Alan Frieze, Santosh Vempala, Benjamin Rossman Juan Vera 3:05pm – 3:25pm Algebrization: A New Barrier in Graphs, polymorphisms and the Complexity Theory complexity of homomorphism problems Scott Aaronson, Avi Wigderson Libor Barto, Marcin Kozik, Todd Niven

3:30pm – 3:50pm Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits Zeev Dvir, Amir Shpilka, Amir Yehudayoff

------Schedule Ends------