Last update: June 11 STOC 2004 Schedule Chicago Hilton and Towers Hotel 720 South Michigan Avenue, Chicago Saturday, June 12, 2004 5:00 - 9:00 PM Registration desk open 7:00 - 9:00 PM Welcome Reception. Boulevard Room and Foyer, 2nd floor Sunday, June 13, 2004 8:00 AM - 5:00 PM Registration desk open 8:00 - 8:35 AM Continental breakfast. Continental Ballroom Lobby, 1st floor 8:35 - 10:10 AM Session 1A. Continental Ballroom A-B. Chair: Oded Regev 8:35 - 8:55 AM Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Eli Ben-Sasson (Radcliffe/Harvard), Oded Goldreich (Weizmann) Prahladh Harsha (MIT), Madhu Sudan (MIT), Salil Vadhan (Harvard) 9:00 - 9:20 AM A New PCP Outer Verifier with Applications to Homogeneous Linear Equations and Max-Bisection Jonas Holmerin (KTH, Stockholm), Subhash Khot (Georgia Tech) 9:25 - 9:45 AM Asymmetric k-Center is log∗ n - Hard to Approximate Julia Chuzhoy (Technion), Sudipto Guha (UPenn), Eran Halperin (Berkeley), Sanjeev Khanna (UPenn), Guy Kortsarz (Rutgers), Joseph (Seffi) Naor (Technion) 9:50 - 10:10 AM New Hardness Results for Congestion Minimization and Machine Scheduling Julia Chuzhoy (Technion), Joseph (Seffi) Naor (Technion) 8:35 - 10:10 AM Session 1B. Continental Ballroom C. Chair: Sandy Irani 8:35 - 8:55 AM On the Performance of Greedy Algorithms in Packet Buffering Susanne Albers (Freiburg), Markus Schmidt (Freiburg) 9:00 - 9:20 AM Adaptive Routing with End-to-End Feedback: Distributed Learning and Geometric Approaches Baruch Awerbuch (Johns Hopkins), Robert D. Kleinberg (MIT) 9:25 - 9:45 AM Know Thy Neighbor’s Neighbor: The Power of Lookahead in Randomized P2P Net- works Gurmeet Singh Manku (Stanford), Moni Naor (Weizmann), Udi Wieder (Weizmann) 9:50 - 10:10 AM The Zero-One Principle for Switching Networks Yossi Azar (Tel Aviv), Yossi Richter (Tel Aviv) 10:10 - 10:35 AM Coffee break. Continental Ballroom Lobby 1 10:35 - 11:20 AM Session 2A. Continental Ballroom A-B. Chair: Adam Klivans 10:35 - 10:55 AM Approximating the Cut-Norm via Grothendieck’s Inequality Noga Alon (Tel Aviv), Assaf Naor (Microsoft) 11:00 - 11:20 AM Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems Daniel A. Spielman (MIT), Shang-Hua Teng (Boston U.; Akamai) 10:35 - 11:20 AM Session 2B. Continental Ballroom C. Chair: Tal Malkin 10:35 - 10:55 AM Dictionary Matching and Indexing with Errors and Don’t Cares Richard Cole (Courant), Lee-Ad Gottlieb (Courant), Moshe Lewenstein (Bar-Ilan U.) 11:00 - 11:20 AM Sorting and Searching in the Presence of Memory Faults (without Redundancy) Irene Finocchi (U. Roma “Tor Vergata”), Giuseppe F. Italiano (U. Roma “Tor Vergata”) 11:30 - 12:30 PM Session 3 - Invited Talk. Continental Ballroom A-B. Chair: D. Sivaku- mar Quantum Algorithms a Decade After Shor Andris Ambainis (IAS) 12:30 - 2:00 PM Lunch. International Ballroom South, 2nd floor 2:00 - 3:10 PM Session 4A. Continental Ballroom A-B. Chair: Andris Ambainis 2:00 - 2:20 PM Graph Entropy and Quantum Sorting Problems Andrew Chi-Chih Yao (Princeton) 2:25 - 2:45 PM Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson (Berkeley) 2:50 - 3:10 PM Exponential Separation of Quantum and Classical One-way Communication Complex- ity Ziv Bar-Yossef (IBM Almaden), T. S. Jayram (IBM Almaden), Iordanis Kerenidis (Berkeley) 2:00 - 3:10 PM Session 4B. Continental Ballroom C. Chair: Robert Krauthgamer 2:00 - 2:20 PM Approximation Algorithm for k-node Connected Subgraphs via Critical Graphs Guy Kortsarz (Rutgers), Zeev Nutov (Open U., Tel Aviv) 2:25 - 2:45 PM Solving Fractional Packing Problems in O∗(1/ε) Iterations Daniel Bienstock (Columbia), Garud Iyengar (Columbia) 2:50 - 3:10 PM The All-or-Nothing Multicommodity Flow Problem Chandra Chekuri (Lucent), Sanjeev Khanna (UPenn), F. Bruce Shepherd (Lucent) 3:10 - 3:30 PM Coffee break. Continental Ballroom Lobby 3:30 - 4:40 PM Session 5A. Continental Ballroom A-B. Chair: Moses Charikar 3:30 - 3:50 PM Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time- Windows Nikhil Bansal (CMU), Avrim Blum (CMU), Shuchi Chawla (CMU), Adam Meyerson (UCLA) 3:55 - 4:15 PM Estimating the Weight of Metric Minimum Spanning Trees in Sublinear-Time Artur Czumaj (N.J. Inst. Tech.), Christian Sohler (Paderborn) 4:20 - 4:40 PM A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time Liam Roditty (Tel Aviv), Uri Zwick (Tel Aviv) 2 3:30 - 4:40 PM Session 5B. Continental Ballroom C. Chair: D. Sivakumar 3:30 - 3:50 PM Using Nondeterminism to Amplify Hardness Alexander Healy (Harvard), Salil Vadhan (Harvard), Emanuele Viola (Har- vard) 3:55 - 4:15 PM Visibly Pushdown Languages Rajeev Alur (UPenn), P. Madhusudan (UPenn) 4:20 - 4:40 PM Linear FPT Reductions and Computational Lower Bounds Jianer Chen (Texas A&M), Xiuzhen Huang (Texas A&M), Iyad A. Kanj (De- Paul), Ge Xia (Texas A&M) 4:40 - 5:00 PM Coffee break. Continental Ballroom Lobby 5:00 - 5:40 PM Session 6 - Best Paper. Continental Ballroom A-B. Chair: Eva´ Tardos Expander Flows, Geometric Embeddings and Graph Partitioning Sanjeev Arora (Princeton), Satish Rao (Berkeley), Umesh Vazirani (Berkeley) 8:40 - 10:00 PM STOC Business Meeting. Boulevard A-B, 2nd floor It is YOUR business! All participants are invited. Come, let your voice be heard! Monday, June 14, 2004 8:00 AM - 5:00 PM Registration desk open 8:00 - 8:35 AM Continental breakfast. Continental Ballroom Lobby 8:35 - 10:10 AM Session 7A. Continental Ballroom A-B. Chair: Boaz Barak 8:35 - 8:55 AM Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority Rafael Pass (KTH, Stockholm) 9:00 - 9:20 AM New Notions of Security: Achieving Universal Composability without Trusted Setup Manoj Prabhakaran (Princeton), Amit Sahai (Princeton) 9:25 - 9:45 AM Completeness in Two-Party Secure Computation - A Computational View Danny Harnik (Weizmann), Moni Naor (Weizmann), Omer Reingold (Weiz- mann), Alon Rosen (MIT) 9:50 - 10:10 AM Batch Codes and Their Applications Yuval Ishai (Technion), Eyal Kushilevitz (Technion), Rafail Ostrovsky (UCLA), Amit Sahai (Princeton) 8:35 - 10:10 AM Session 7B. Continental Ballroom C. Chair: Robert Krauthgamer 8:35 - 8:55 AM Low Distortion Maps Between Point Sets Claire Kenyon (Ecole´ Poly., Palaiseau), Yuval Rabani (Technion; Cornell), Alistair Sinclair (Berkeley) 9:00 - 9:20 AM Bypassing the Embedding: Approximation Schemes and Compact Representations for Low Dimensional Metrics Kunal Talwar (Berkeley) 9:25 - 9:45 AM Coresets for k-Means and k-Median Clustering Sariel Har-Peled (UIUC), Soham Mazumdar (UIUC) 9:50 - 10:10 AM Isotopic Implicit Surface Meshing Jean-Daniel Boissonnat (INRIA), David Cohen-Steiner (Duke), Gert Veg- ter (RUG, Netherlands) 10:10 - 10:35 AM Coffee break. Continental Ballroom Lobby 3 10:35 - 11:20 AM Session 8A. Continental Ballroom A-B. Chair: Eric Vigoda 10:35 - 10:55 AM Hit-and-run From a Corner Laszl´ o´ Lovasz´ (Microsoft), Santosh Vempala (MIT) 11:00 - 11:20 AM A Simple Polynomial-time Rescaling Algorithm for Solving Linear Programs John Dunagan (Microsoft), Santosh Vempala (MIT) 10:35 - 11:20 AM Session 8B. Continental Ballroom C. Chair: Tal Malkin 10:35 - 10:55 AM Collective Asynchronous Reading with Polylogarithmic Worst-Case Overhead Bogdan S. Chlebus (U. Colo., Denver), Dariusz R. Kowalski (Max Planck), Alexander A. Shvartsman (U. Conn.) 11:00 - 11:20 AM Unconditional Lower Bounds on the Time-Approximation Tradeoffs for the Dis- tributed Minimum Spanning Tree Problem Michael Elkin (Yale) 11:30 - 12:30 PM Session 9 - Invited Talk. Continental Ballroom A-B. Chair: L´aszl´o Babai Network Games Eva´ Tardos (Cornell) 12:30 - 2:00 PM Lunch. International Ballroom South, 2nd floor 2:00 - 3:10 PM Session 10A. Continental Ballroom A-B. Chair: Moses Charikar 2:00 - 2:20 PM Typical Properties of Winners and Losers in Discrete Optimization Rene Beier (Max Planck), Berthold Vocking¨ (Dortmund) 2:25 - 2:45 PM Primal-Dual Algorithms for Deterministic Inventory Problems Retsef Levi (Cornell), Robin Roundy (Cornell), David B. Shmoys (Cornell) 2:50 - 3:10 PM Multi-processor Scheduling to Minimize Flow Time with ε Resource Augmentation Chandra Chekuri (Bell Labs), Ashish Goel (Stanford), Sanjeev Khanna (UPenn), Amit Kumar (IIT Delhi) 2:00 - 3:10 PM Session 10B. Continental Ballroom C. Chair: Irit Dinur 2:00 - 2:20 PM Algorithms for Dynamic Geometric Problems Over Data Streams Piotr Indyk (MIT) 2:25 - 2:45 PM Sublinear Algorithms for Testing Monotone and Unimodal Distributions Tugkan˘ Batu (U. Texas, Austin), Ravi Kumar (IBM Almaden), Ronitt Rubin- feld (MIT) 2:50 - 3:10 PM The Difficulty of Testing for Isomorphism Against a Graph That is Given in Advance Eldar Fischer (Technion) 3:10 - 3:30 PM Coffee break. Continental Ballroom Lobby 3:30 - 4:40 PM Session 11A. Continental Ballroom A-B. Chair: Sandy Irani 3:30 - 3:50 PM An Approximate K¨onig’sTheorem for Edge Coloring Weighted Bipartite Graphs Jose´ R. Correa (MIT), Michel X. Goemans (MIT) 3:55 - 4:15 PM Finding Paths and Cycles of Superpolylogarithmic Length Harold N. Gabow (U. Colo., Boulder) 4:20 - 4:40 PM Boosted Sampling: Approximation Algorithms for Stochastic Optimization Anupam Gupta (CMU), Martin Pal´ (Cornell), R. Ravi (CMU), Amitabh Sinha (CMU) 4 3:30 - 4:40 PM Session 11B. Continental Ballroom C. Chair: Chris Umans 3:30 - 3:50 PM Derandomizing Homomorphism Testing in General Groups Amir Shpilka (Weizmann), Avi Wigderson (IAS) 3:55 - 4:15 PM Better Extractors for Better Codes? Venkatesan Guruswami (U. Wash.) 4:20 - 4:40 PM A New Family of Cayley Expanders (?) Eyal Rozenman (Hebrew U.), Aner Shalev (Hebrew U.), Avi Wigderson (IAS) 4:40 - 4:55 PM Coffee break.