Foundations of Computer Science

October 17-19,1999 New York City, New York

sponsored by

IEEE Computer Society Technical Committee on Mathematical Foundations of Computing

IEEE

COMPUTER SOCIETY

Los Alamitos, California Washington . Brussels • Tokyo

Table of Contents

Foreword

Committees

Machtey Award

Reviewers

Session 1

Chair: David Shmoys

Primal-Dual Approximation Algorithms for Metric Facility Location and /c-Median Problems 2

K. Jain and V. V. Vazirani

Approximation Algorithms for Classification Problems with Pairwise Relationships:

Metric Labeling and Markov Random Fields 14 J. Kleinberg and E. Tardos

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities 24 L. K. Fleischer

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates 32

F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis,

M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko

Session 2

Chair: Paul Beame

A -/i2-Lower Bound for the Rank of nxn-Matrix Multiplication over Arbitrary Fields 45 2

M. Bläser

Improved Bounds for Sampling Colorings 51

E. Vigoda

A Non-linear Time Lower Bound for Boolean Branching Programs 60 M. Ajtai

.xii

xiii

xiii

xiv

v

Derandomizing Arthur-Merlin Games Using Hitting Sets 71 P. Bro Miltersen and N. V. Vinodchandran

Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure

in Digraphs 81

V. King

Session 3

Chair: Joseph Mitchell

Knuth Prize Lecture 91 Laszlo Lovdsz

Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time 92

T. M. Chan

Taking a Walk in a Planar Arrangement 100

S. Har-Peled

Session 4

Chair: Michael Mitsenmacher

PSPACE Has Constant-round Quantum Interactive Proof Systems 112 J. Watrous

Verifiable Random Functions 120

S. Micali, M. Rabin, and S. Vadhan

How Asymmetry Helps Load Balancing 131

B. Vöcking

Noncryptographic Selection Protocols 142

U. Feige

Session 5A

Chair: Andrei Broder

A Sublinear Time Approximation Scheme for Clustering in Metric Spaces 154

P. Indyk

vi

Efficient Regular Data Structures and Algorithms for Location and Proximity Problems 160 A. Amir, A. Efrat, P. Indyk, and H. Samet

Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings 171

M. Farach-Colton and P. Indyk

Session 5B

Chair: Eric Allender

Near-Optimal Conversion of Hardness into Pseudo-Randomness 181

R. Impagliazzo, R. Shaltiel, and A. Wigderson

Error Reduction for Extractors 191

R. Raz, O. Reingold and S. Vadhan

Primality and Identity Testing Via Chinese Remaindering 202

M. Agrawal and S. Biswas

Session 6A

Chair: Dana Randall

On Counting Independent Sets in Sparse Graphs 210

M. Dyer, A. Frieze, and M. Jerrum

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics 218

C. Borgs, J. Chayes, A. Frieze, J. H. Kim, P. Tetali, E. Vigoda, and V. H. Vu

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions 230 B. Morris and A. Sinclair

Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain 241

V.S. Anil Kumar and H. Ramesh

Session 6B

Chair: James Aspnes

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction 253 D. Peleg and V. Rubinovich

Long-lived Adaptive Collect with Applications 262 Y. Afek, G. Stupp, and D. Touitou

vn

A Theoretical Framework for Memory-Adaptive Algorithms 273 R. D. Barve and J. S. Vitter

Cache-Oblivious Algorithms 285

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran

Session 7A

Chair: Satish Rao

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals 299

J. Feldman and M. Ruhl

Setting Parameters by Example 309 D. Eppstein

Finding Double Euler Trails of Planar Graphs in Linear Time 319

Z.-Z. Chen, X. He, and C.-H. Huang

Edge-Disjoint Routing in Plane Switch Graphs in Linear Time 330

K. Weihe

Session 7B

Chair: Peter Shor

On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes 341

J. Watrous

A Better Lower Bound for Quantum Algorithms Searching an Ordered List 352

A. Ambainis

Bounds for Small-Error and Zero-Error Quantum Algorithms 358

H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka

Optimal Lower Bounds for Quantum Automata and Random Access Codes 369

A. Nayak

vni

Session 8A

Chair: Joseph Mitchell

Improved Combinatorial Algorithms for the Facility Location and ^-Median Problems 378

M. Charikar and S. Guha

Loväsz's Lemma for the Three-Dimensional AT-Level of Concave Surfaces and its Applications 389 N. Katoh and T. Tokuyama

Cuts, Trees and fpEmbeddings of Graphs 399

A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair

Session 8B

Chair: Paul Beame

A Probabilistic Algorithm for £-SAT and Constraint Satisfaction Problems 410 U. Schöning

Random CNF's are Hard for the Polynomial Calculus 415 E. Ben-Sasson and R. lmpagliazzo

A Study of Proof Search Algorithms for Resolution and Polynomial Calculus 422

M. L. Bonet and N. Galesi

Session 9A

Chair: Yair Bartal

Online Scheduling to Minimize Average Stretch 433 S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. E. Gehrke

Weak Adversaries for the A-Server Problem 444

E. Koutsoupias

Finely-Competitive Paging 450

A. Blum, C. Burch, and A. Kalai

Session 9B

Chair: Luca Trevisan

On the Complexity of SAT 459

R. J. Lipton and A. Viglas

IX

Hardness of Approximating V £ Minimization Problems 465

C. Umans

Hardness of Approximating the Minimum Distance of a Linear Code 475 /. Dumer, D. Micciancio, and M. Sudan

Session 10A

Chair: Ming Li

On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof

of Universality for Shor's Basis 486 P. O. Boykin, T, Mor, M. Pulver, V. Roy chow dhury, and F. Vatan

Satisfiability of Word Equations with Constants is in PSPACE 495

W. Plandowski

An Approximate L'-Difference Algorithm for Massive Data Streams 501

J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan

Algorithmic Aspects of Protein Structure Similarity 512 D. Goldman, S. Istrail, and C. H. Papadimitriou

Session 10B

Chair: Luca Trevisan

Magic Functions 523 C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer

Limits on the Efficiency of One-Way Permutation-Based Hash Functions 535

J. H. Kim, D. R. Simon, and P. Tetali

Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security 543

A. Sahai

Non-Interactive CryptoComputing For NC1 554 T. Sander, A. Young, and M. Yung

Session IIA

Chair: Susanne Albers

Fairness in Routing and Load Balancing 568 J. Kleinberg, Y. Rabani, and E. Tardos

x

Stochastic Load Balancing and Related Problems 579 A. Goel and P. Indyk

Reducing Network Congestion and Blocking Probability Through Balanced Allocation 587

M. J. Luczak and E. Upfal

Finding Maximal Repetitions in a Word in Linear Time 596

R. Kolpakov and G. Kucherov

All Pairs Shortest Paths in Undirected Graphs with Integer Weights 605

A. Shoshan and U. Zwick

Session IIB

Chair: Nader Bshouty

An Algorithmic Theory of Learning: Robust Concepts and Random Projection 616

R. I. Arriaga and S. Vempala

Boosting and Hard-Core Sets 624 A. R. Klivans and R. A. Servedio

Learning Mixtures of Gaussians 634

S. Dasgupta

Regular Languages Are Testable with a Constant Number of Queries 645 N. Ahn, M. Krivelevich, I. Newman, and M. Szegedy

Efficient Testing of Large Graphs 656 N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy

Author Index 667

XI