Conference Organization
SIGACT Chair
F. Tom Leighton
Program Chair
Allan Borodin
Local Committee
Lawrence L. Larmore (General Chair), Wolfgang W. Bein (Treasurer),
Ajoy Datta, Laxmi Gewali (Registration Co-Chairs)
Publicity Chair
Ian Par berry
Site Coordinator
Alok Aggarwal
Best Student Paper Award
Linear-Time Encodable and Decodable Error-Correcting Codes
Daniel A. Spielman, M.I.T.
SIGACT Institutional Sponsors
Academic Press, Inc.
AT&T Bell Laboratories
Bellcore
IBM Corporation, Almaden Research Center
IBM Corporation, TJ Watson Research Center
International Thomson Publishing
PWS Publishing Co.
Xerox PARC
Fachbereichsbibliothek Informatik TU Darmstadt
Twenty-Seventh Annual ACM Symposium on
Theory of Computing
May 29 - June 1, 1995, Las Vegas, Nevada
Table of Contents
TUESDAY, MAY 30, 1995
Session 1A: Chaired by Madhu Sudan
Improved Approximation Algorithms for Uniform Connectivity Problems
Samir Khuller and Balaji Raghavachari 1
A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem
David R. Karger 11
Adding Multiple Cost Constraints to Combinatorial Optimization Problems, with Applications to Multicommodity Flows
David Karger and Serge Plotkin 18
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
Jon Kleinberg and Eva Tardos 26
Session I B : Chaired by Michael Ben Or
Secure Hypergraphs: Privacy from Partial Broadcast
Matthew Franklin and Moti Yung 36
Incremental Cryptography and Application to Virus Protection
Mihir Bellare, Oded Goldreich and Shan Goldwasser • 45
Provably Secure Session Key Distribution—The Three Party Case
Mihir Bellare and Phillip Rogaway 57
Security of Quantum Protocols Against Coherent Measurements
Andrew Chi-Chih Yao 67
Session 2A: Chaired by Andrei Broder Efficient Stopping Rules for Markov Chains
Laszlo Lovasz and Peter Winkler 76 A Computational View of Population Genetics
Yuval Rabani, Yuri Rabinovich and Alistair Sinclair 83
Session 2B: Chaired by Hal Gabow
Persistent Lists with Catenation via Recursive Slow-Down
Haim Kaplan and Robert E. Tarjan 93
On Data Structures and Asymmetric Communication Complexity
Peter Bro Miltersen, Noam Nisan, Shmuel Safra and Avi Wigderson 103
Invited session I: Chaired by Richard Karp What Do We Know About the Metropolis Algorithm?
Persi Diaconis and Laurent Saloff-Coste 112
Session 3A: Chaired by Neil Immerman
A Lower Bound for Integer Multiplication with Read-Once Branching Programs
Stephen Ponzio 130
Symmetric Logspace is Closed Under Complement
Noam Nisan and Amnon Ta-Shma 140
A Nearly Optimal Time-Space Lower Bound for Directed st-Connectivity on the NNJAG Model
Jeff Edmonds and Chung. Keung Poon 147
Session 3B: Chaired by Hal Gabow
Fast Protein Folding in the Hydrophobic-hydrophilic Model Within Three-eights of Optimal
William E. Hart and Sorin Istrail 157
Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees
S. Rao Kosaraju and Arthur L. Delcher 169
Transforming Cabbage into Turnip (polynomial algorithm for sorting signed permutations by reversals)
Sridhar Hannenhalli and Pavel Pevzner 178
Session 4A: Chaired by Michael Ben Or How Many Queries are Needed to Learn?
Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan and Dawn Wilkins 190
Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
Marek Karpinski and Angus Macintyre 200
Additive Versus Exponentiated Gradient Updates for Linear Prediction
Jyrki Kivinen and Manfred K. Warmuth 209
On the Fourier Spectrum of Monotone Functions
Nader H. Bshouty and Christino Tamon 219
Session 4B: Chaired by Andrei Broder
Stochastic Contention Resolution With Short Delays
Prabhakar Raghavan and Eli Upfal 229
Parallel Randomized Load Balancing
Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher and Lars Rasmussen 238
Bounding Delays in Packet-Routing Networks
Mor Harchol-Balter and David Wolfe 248
Many-to-One Packet Routing on Grids
Yishay Manour and Boaz Patt-Shamir 258
WEDNESDAY, MAY 31, 1995
Session 5A: Chaired by Christos Papadimitriou
Improved Approximations of Packing and Covering Problems
Aravind Srinivasan 268
Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
Baruch Awerbuch, Yossi Azar, Avrim Blum and Santosh Vempala 277
Polynomial Time Approximation Schemes for Dense Instances of MV-Hard Problems
Sanjeev Arora, David Karger and Marek Karpinski 284
A Constant-Factor Approximation for the k-MST Problem in the Plane
Avrim Blum, Prasad Chalasani and Santosh Vempala 294
Session 5 B : Chaired by Moshe Vardi
The Relative Complexity of NP Search Problems
Paul Beame, Stephen Cook, Jeff Edmonds, Russell Impagliazzo and Toniann Pitassi 303
Descriptive Complexity Theory over the Real Numbers
Erich Griidel and Klaus Meer 315 Average-Case Completeness of a Word Problem for Groups
Jie Wang 325
On Real Turing Machines that Toss Coins
Felipe Cucker, Marek Karpinski, Pascal Koiran and Thomas Lickteig 335
Session 6A: Chaired by Christos Papadimitriou
Motion Planning for a Steering-Constrained Robot Through Moderate Obstacles
Pankaj K. Agarwal, Prabhakar Raghavan and Hisao Tamaki 343
Randomized Query Processing in Robot Motion Planning
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani and Prabhakar Raghavan 353
Session 6B: Chaired by Moshe Vardi
Distinguishing Tests for Nondeterministic and Probabilistic Machines
Rajeev Alur, Costas Courcoubetis and Mihalis Yannakakis 363
What's Decidable about Hybrid Automata?
Thomas A. Henzinger, Peter W. Kopke, Anuj Puri and Pravin Varaiya 373
Invited session II: Chaired by Allan Borodin Two Steiner Tree Packing Problems
William R. Pulleyblank 383
Session 7A: Chaired by Michael Ben Or
Linear-Time Encodable and Decodable Error-Correcting Codes
Daniel A. Spielman 388
Subquadratic-Time Factoring of Polynomials over Finite Fields
Erich Kaltofen and Victor Shoup 398
Testing Multivariate Linear Functions: Overcoming the Generator Bottleneck
Funda Ergiin 407
Session 7 B : Chaired by Ketan Mulmuley A Tight Lower Bound for Searching a Sorted Array
Arne Andersson, Johan Hastad and Ola Petersson 417
Sorting in Linear Time?
Arne Andersson, Torben Hagerup, Stefan Nilsson and Rajeev Raman 427
Lower Bounds for Sorting Networks
Nabil Kahale, Tom Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel and Endre Szemeredi 437
Session 8A: Chaired by Madhu Sudan
A Parallel Repetition Theorem
Ran Raz 447
Impossibility Results for Recycling Random Bits in Two-Prover Proof Systems
Uriel Feige and Joe Kilian 457
Knowledge on the Average—Perfect, Statistical and Logarithmic
William Aiello, Mihir Bellare and Ramarathnam Venkatesan 469
Explicit Dispersers with Polylog Degree
Michael Saks, Aravind Srinivasan and Shiyu Zhou 479
Session 8B: Chaired by Hal Gabow Euclidean Spanners: Short, Thin, and Lanky
Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe and Michiel Smid 489
Short Length Versions of Menger's Theorem
Zvi Galil and Xiangdong Yu : 499 A 2-Level Cactus Model for the System of Minimum and Minimum+1 Edge-Cuts in a Graph and Its
Incremental Maintenance
Yefim Dinitz and Zeev Nutov 509
Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation
Monika Rauch Henzinger and Valerie King 519
THURSDAY, JUNE 1, 1995
. Session 9A: Chaired by Andrei Broder
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
Shlomi Dolev, Evangelos Kranakis, Danny Krizanc and David Peleg 528 Wait-Free Made Fast
Yehuda Afek, Dalia Dauber and Dan Touitou 538
Tight Analyses of Two Local Load Balancing Algorithms
Bhaskar Ghosh, F. T. Leighton, Bruce M. Maggs, S. Muthukrishan, C. Greg Plaxton, R. Rajaraman, Andrea W. Richa, Robert E. Tarjan and David Zuckerman 548
Log-Space Polynomial End-to-End Communication
Eyal Kushilevitz, Rafail Ostrovsky and Adi Rosen 559
Session 9B: Chaired by Neillmmerman
Monotone Circuits for Connectivity Have Depth (logn)2"0^1)
Mikael Goldmann and Johan Hastad 569 Lower Bounds for Cutting Planes Proofs with Small Coefficients
Maria Bonet, Toniann Pitassi and Ran Raz 575
More on the Complexity of Negation-limited Circuits
Robert Beals, Tetsuro Nishino and Keisuke Tanaka 585
On Randomized One-Round Communication Complexity
Ilan Kremer, Noam Nissan and Dana Ron 596
Session 10A: Chaired by Allan Borodin
Bouding the Power of Preemption in Randomized Scheduling
Ran Canetti and Sandy Irani 606
Bandwidth Allocation with Preemption
Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour and Baruch Schieber 616
Randomized and Multipointer Paging with Locality of Reference
Amos Fiat and Anna R. Karlin 626
Session 10B: Chaired by Christos Papadimitriou
Randomized Graph Products, Chromatic Numbers, and the Lovasz "d-Function
Uriel Feige 635
The k-Steiner Ratio in Graphs
Al Borchers and Ding-Zhu Du 641
Recognition of Graphs with Threshold Dimension Two
Thomas Raschle and Klaus Simon 650
Session 11A: Chaired by Ketan Mulmuley
Geometric Lower Bounds for Parametric Matroid Optimization
David Eppstein 662
Computing Faces in Segment and Simplex Arrangements
Nancy M. Amato, Michael T. Goodrich and Edgar A. Ramos 672
A Delaunay Based Numerical Method for Three Dimensions: generation, formulation, and partition
Gary L. Miller, Dafna Talmor, Shang-Hua Teng and Noel Walkington 683
Session 11B: Chaired by Richard Karp
A Fully-Dynamic Data Structure for External Substring Search
Paolo Ferragina and Roberto Grossi 693
String Matching in Lempel-Ziv Compressed Strings
Martin Farach and Mikkel Thorup 703
Work-Time-Optimal Parallel Algorithms for String Problems
Artur Czumaj, Zvi Galii, Leszek Gasieniec, Kunsoo Park and Wojciech Plandowski 713
Session 12A: Chaired by Allan Borodin
On the Complexity of Bilinear Forms
Noam Nisan and Avi Wigderson 723
Lower Bounds for Off-Line Range Searching
Bernard Chazelle 733
Session 12B: Chaired by Madhu Sudan
Optimal (up to Ploylog Factors) Sequential and Parallel Algorithms for Approximating Complex Polynomial Zeros
Victor Y. Pan 741
Work Efficient Parallel Solution of Toeplitz Systems and Polynomial GCD
John H. Reif 751