The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2000)
Redondo Beach, California
Nov. 12, 2000 to Nov. 14, 2000
ISSN: 0272-5428
ISBN: 0-7695-0850-2
TABLE OF CONTENTS

Foreword (PDF)

pp. xii

Committees (PDF)

pp. xiii

Reviewers (PDF)

pp. xiv
Session 1, Chair: David Zuckerman

Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors (Abstract)

S. Vadhan , AT&T Labs.-Res., Florham Park, NJ, USA
A. Wigderson , AT&T Labs.-Res., Florham Park, NJ, USA
O. Reingold , AT&T Labs.-Res., Florham Park, NJ, USA
pp. 3

Universality and tolerance (Abstract)

E. Szemeredi , Dept. of Math., Tel Aviv Univ., Israel
N. Alon , Dept. of Math., Tel Aviv Univ., Israel
M. Capalbo , Dept. of Math., Tel Aviv Univ., Israel
V. Rodl , Dept. of Math., Tel Aviv Univ., Israel
A. Rucinski , Dept. of Math., Tel Aviv Univ., Israel
Y. Kohayakawa , Dept. of Math., Tel Aviv Univ., Israel
pp. 14

Extracting randomness via repeated condensing (Abstract)

R. Shaltiel , AT&T Labs.-Res., Florham Park, NJ, USA
O. Reingold , AT&T Labs.-Res., Florham Park, NJ, USA
A. Wigderson , AT&T Labs.-Res., Florham Park, NJ, USA
pp. 22

Extracting randomness from samplable distributions (Abstract)

S. Vadhan , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
L. Trevisan , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
pp. 32

Pseudorandom generators in propositional proof complexity (Abstract)

A.A. Razborov , Moscow State Univ., Russia
E. Ben-Sasson , Moscow State Univ., Russia
A. Wigderson , Moscow State Univ., Russia
M. Alekhnovich , Moscow State Univ., Russia
pp. 43
Session 2, Chair: David Williamson

Stochastic models for the Web graph (Abstract)

P. Raghavan , IBM Almaden Res. Center, San Jose, CA, USA
S. Rajagopalan , IBM Almaden Res. Center, San Jose, CA, USA
R. Kumar , IBM Almaden Res. Center, San Jose, CA, USA
E. Upfal , IBM Almaden Res. Center, San Jose, CA, USA
D. Sivakumar , IBM Almaden Res. Center, San Jose, CA, USA
A. Tomkins , IBM Almaden Res. Center, San Jose, CA, USA
pp. 57

Optimization problems in congestion control (Abstract)

C. Papadimitriou , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
S. Shenker , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
E. Koutsoupias , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
R. Karp , Inst. of Int. Comput. Sci., California Univ., Berkeley, CA, USA
pp. 66

Fairness measures for resource allocation (Abstract)

J. Kleinberg , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
A. Kumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 75

On the approximability of trade-offs and optimal access of Web sources (Abstract)

C.H. Papadimitriou , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
M. Yannakakis , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 86

How bad is selfish routing? (Abstract)

T. Roughgarden , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
E. Tardos , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 93
Session 3, Chair: Sanjeev Arora

A polylogarithmic approximation of the minimum bisection (Abstract)

R. Krauthgamer , Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
U. Feige , Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
pp. 105

Nested graph dissection and approximation algorithms (Abstract)

S. Guha , Stanford Univ., CA, USA
pp. 126

Approximating the single source unsplittable min-cost flow problem (Abstract)

M. Skutella , Fachbereich Math., Tech. Univ. Berlin, Germany
pp. 136
Session 4, Chair: Michael Sipser

Hardness of approximate hypergraph coloring (Abstract)

V. Guruswami , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
J. Hastad , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
M. Sudan , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 149

"Soft-decision" decoding of Chinese remainder codes (Abstract)

M. Sudan , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
V. Guruswami , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
A. Sahai , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 159

Super-linear time-space tradeoff lower bounds for randomized computation (Abstract)

M. Saks , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
Xiaodong Sun , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
P. Beame , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
E. Vee , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
pp. 169

On the hardness of graph isomorphism (Abstract)

J. Toran , Abteilung Theor. Inf., Ulm Univ., Germany
pp. 180
Session 5, Chair: R. Ravi

New data structures for orthogonal range searching (Abstract)

S. Alstrup , Dept. of IT, Copenhagen Univ., Denmark
G. Stolting Brodal , Dept. of IT, Copenhagen Univ., Denmark
T. Rauhe , Dept. of IT, Copenhagen Univ., Denmark
pp. 198

Nearly optimal expected-case planar point location (Abstract)

T. Malamatos , Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China
D.M. Mount , Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China
S. Arya , Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China
pp. 208

On levels in arrangements of curves (Abstract)

T.M. Chan , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
pp. 219
Session 6, Chair: Avrim Blum

Detecting a network failure (Abstract)

J. Kleinberg , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 231

Testing of clustering (Abstract)

S. Dar , Dept. of Math., Tel Aviv Univ., Israel
N. Alon , Dept. of Math., Tel Aviv Univ., Israel
D. Ron , Dept. of Math., Tel Aviv Univ., Israel
M. Parnas , Dept. of Math., Tel Aviv Univ., Israel
pp. 240

Testing of function that have small width branching programs (Abstract)

I. Newman , Dept. of Comput. Sci., Haifa Univ., Israel
pp. 251

Testing that distributions are close (Abstract)

T. Batu , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
W.D. Smith , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
L. Fortnow , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
R. Rubinfeld , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
P. White , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 259

Using upper confidence bounds for online learning (Abstract)

P. Auer , Inst. for Theor. Comput. Sci., Graz Univ. of Technol., Austria
pp. 270
Session 7, Chair: Joe Kilian

Zaps and their applications (Abstract)

M. Naor , Compaq Syst. Res. Centre, Palo Alto, CA, USA
C. Dwork , Compaq Syst. Res. Centre, Palo Alto, CA, USA
pp. 283

Lower bounds on the efficiency of generic cryptographic constructions (Abstract)

L. Trevisan , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
R. Gennaro , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 305

Concurrent oblivious transfer (Abstract)

P. MacKenzie , Lucent Technol. Bell Labs., Murray Hill, NJ, USA
J.A. Garay , Lucent Technol. Bell Labs., Murray Hill, NJ, USA
pp. 314

The relationship between public key encryption and oblivious transfer (Abstract)

M. Viswanathan , Pennsylvania Univ., Philadelphia, PA, USA
Y. Gertner , Pennsylvania Univ., Philadelphia, PA, USA
T. Malkin , Pennsylvania Univ., Philadelphia, PA, USA
O. Reingold , Pennsylvania Univ., Philadelphia, PA, USA
S. Kannan , Pennsylvania Univ., Philadelphia, PA, USA
pp. 325
Session 8, Chair: Leonard Schulman

The online median problem (Abstract)

R.R. Mettu , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
C.G. Plaxton , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
pp. 339

Polynomial time approximation schemes for geometric k-clustering (Abstract)

Y. Rabani , Telcordia Technol., Morristown, NJ, USA
R. Ostrovsky , Telcordia Technol., Morristown, NJ, USA
pp. 349

Clustering data streams (Abstract)

L. O'Callaghan , Dept. of Comput. Sci., Stanford Univ., CA, USA
S. Guha , Dept. of Comput. Sci., Stanford Univ., CA, USA
R. Motwani , Dept. of Comput. Sci., Stanford Univ., CA, USA
N. Mishra , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 359

On clusterings-good, bad and spectral (Abstract)

S. Vempala , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
R. Kannan , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
A. Veta , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 367
Session 9, Chair: Leonard Schulman

Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier (Abstract)

G.F. Italiano , Dipartimento di Inf. e Sistemistica, Rome Univ., Italy
C. Demetrescu , Dipartimento di Inf. e Sistemistica, Rome Univ., Italy
pp. 381

Opportunistic data structures with applications (Abstract)

P. Ferragina , Dipt. di Inf., Pisa Univ., Italy
G. Manzini , Dipt. di Inf., Pisa Univ., Italy
pp. 390

Cache-oblivious B-trees (Abstract)

M. Farach-Colton , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
M.A. Bender , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
E.D. Demaine , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
pp. 399

Using expander graphs to find vertex connectivity (Abstract)

H.N. Gabow , Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
pp. 410
Session 10, Chair: Mario Szegedy

On the boundary complexity of the union of fat triangles (Abstract)

G. Tardos , City Coll., CUNY, NY, USA
J. Pach , City Coll., CUNY, NY, USA
pp. 423

Straightening polygonal arcs and convexifying polygonal cycles (Abstract)

R. Connelly , Dept. of Math., Cornell Univ., Ithaca, NY, USA
G. Rote , Dept. of Math., Cornell Univ., Ithaca, NY, USA
E.D. Demaine , Dept. of Math., Cornell Univ., Ithaca, NY, USA
pp. 432

A combinatorial approach to planar non-colliding robot arm motion planning (Abstract)

I. Streinu , Dept. of Comput. Sci., Smith Coll., Northampton, MA, USA
pp. 443

Topological persistence and simplification (Abstract)

H. Edelsbrunner , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
D. Letscher , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
A. Zomorodian , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 454
Session 11, Chair: Leslie Goldberg

The cover time, the blanket time, and the Matthews bound (Abstract)

J. Kahn , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
L. Lovasz , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
V.H. Vu , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
J.H. Kim , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
pp. 467

The product replacement algorithm is polynomial (Abstract)

I. Pak , Dept. of Math., Yale Univ., New Haven, CT, USA
pp. 476

Sampling adsorbing staircase walks using a new Markov chain decomposition method (Abstract)

R.A. Martin , Sch. of Math., Georgia Inst. of Technol., Atlanta, GA, USA
D. Randall , Sch. of Math., Georgia Inst. of Technol., Atlanta, GA, USA
pp. 492

The randomness recycler: a new technique for perfect sampling (Abstract)

M. Huber , Dept. of Math. Sci., Johns Hopkins Univ., MD, USA
J.A. Fill , Dept. of Math. Sci., Johns Hopkins Univ., MD, USA
pp. 503
Session 12, Chair: Umesh Vazirani

An improved quantum Fourier transform algorithm and applications (Abstract)

L. Hales , Group in Logic & the Methodology of Sci., California Univ., Berkeley, CA, USA
S. Hallgren , Group in Logic & the Methodology of Sci., California Univ., Berkeley, CA, USA
pp. 515

Fast parallel circuits for the quantum Fourier transform (Abstract)

R. Cleve , Calgary Univ., Alta., Canada
J. Watrous , Calgary Univ., Alta., Canada
pp. 526

Succinct quantum proofs for properties of finite groups (Abstract)

J. Watrous , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 537

Private quantum channels (Abstract)

A. Tapp , California Univ., Berkeley, CA, USA
A. Ambainis , California Univ., Berkeley, CA, USA
R. de Wolf , California Univ., Berkeley, CA, USA
M. Mosca , California Univ., Berkeley, CA, USA
pp. 547

The quantum complexity of set membership (Abstract)

J. Radhakrishnan , Sch. of Technol. & Comput. Sci., Tata Inst. of Fundamental Res., Mumbai, India
S. Venkatesh , Sch. of Technol. & Comput. Sci., Tata Inst. of Fundamental Res., Mumbai, India
P. Sen , Sch. of Technol. & Comput. Sci., Tata Inst. of Fundamental Res., Mumbai, India
pp. 554
Session 13, Chair: Leslie Goldberg

Randomized rumor spreading (Abstract)

C. Schindelhauer , California Univ., Berkeley, CA, USA
B. Vocking , California Univ., Berkeley, CA, USA
S. Shenker , California Univ., Berkeley, CA, USA
R. Karp , California Univ., Berkeley, CA, USA
pp. 565

Fast broadcasting and gossiping in radio networks (Abstract)

W. Rytter , Dept. of Comput. Sci., California Univ., Riverside, CA, USA
L. Gasieniec , Dept. of Comput. Sci., California Univ., Riverside, CA, USA
M. Chrobak , Dept. of Comput. Sci., California Univ., Riverside, CA, USA
pp. 575

Linear waste of best fit bin packing on skewed distributions (Abstract)

M. Mitzenmacher , Paris-Sud Univ., France
C. Kenyon , Paris-Sud Univ., France
pp. 582

Optimal myopic algorithms for random 3-SAT (Abstract)

D. Achioptas , Microsoft Res., Redmond, WA, USA
G.B. Sorkin , Microsoft Res., Redmond, WA, USA
pp. 590
Session 14, Chair: David Williamson

Hierarchical placement and network design problems (Abstract)

K. Munagala , Dept. of Comput. Sci., Stanford Univ., CA, USA
A. Meyerson , Dept. of Comput. Sci., Stanford Univ., CA, USA
S. Guha , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 603

Building Steiner trees with incomplete global knowledge (Abstract)

M. Minkoff , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
D.R. Karget , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 613

Cost-distance: two metric network design (Abstract)

A. Meyerson , Dept. of Comput. Sci., Stanford Univ., CA, USA
K. Munagala , Dept. of Comput. Sci., Stanford Univ., CA, USA
S. Plotkin , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 624

Combinatorial feature selection problems (Abstract)

M. Charikar , Dept. of Comput. Sci., Stanford Univ., CA, USA
V. Guruswami , Dept. of Comput. Sci., Stanford Univ., CA, USA
S. Rajagopalan , Dept. of Comput. Sci., Stanford Univ., CA, USA
A. Sahai , Dept. of Comput. Sci., Stanford Univ., CA, USA
R. Kumar , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 631
Session 15, Chair: Michael Sipser

The common fragment of CTL and LTL (Abstract)

M. Maidi , Siemens Corp. Technol., Munchen, Germany
pp. 643

On the existence of booster types (Abstract)

E. Ruppert , Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
M. Herlihy , Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
pp. 653

Existential second-order logic over graphs: charting the tractability frontier (Abstract)

T. Schwentick , Tech. Univ. Wien, Austria
P.G. Kolaitis , Tech. Univ. Wien, Austria
G. Gottlob , Tech. Univ. Wien, Austria
pp. 664

On computing the determinant and Smith form of an integer matrix (Abstract)

W. Eberly , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
M. Giesbrecht , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
G. Villard , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 675

Author Index (PDF)

pp. 687
82 ms
(Ver )