CSDL - 38th Annual Symposium on Foundations of Computer Science (FOCS

2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1997)

Miami Beach, FL

Oct. 19, 1997 to Oct. 22, 1997

ISSN: 0272-5428

ISBN: 0-8186-8197-7

TABLE OF CONTENTS

Session 1A, Chair: Monika Rauch Henzinger

Beyond the flow decomposition barrier (Abstract)

S. Rao , NEC Res. Inst., Princeton, NJ, USA

A.V. Goldberg , NEC Res. Inst., Princeton, NJ, USA

pp. 2

Undirected single source shortest paths in linear time (Abstract)

M. Thorup

pp. 12

A Faster Deterministic Algorithm for Minimum Spanning Trees (Abstract)

Bernard Chazelle , Princeton University

pp. 22

Flows in undirected unit capacity networks (Abstract)

S. Rao , NEC Res. Inst., Princeton, NJ, USA

A.V. Goldberg , NEC Res. Inst., Princeton, NJ, USA

pp. 32

Session 1B, Chair: Ronitt Rubinfeld

Randomized and deterministic algorithms for the dimension of algebraic varieties (Abstract)

P. Koiran , Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France

pp. 36

Deciding properties of polynomials without factoring (Abstract)

M.A. Shokrollahi , Int. Comput. Sci. Inst., Berkeley, CA, USA

T. Sander , Int. Comput. Sci. Inst., Berkeley, CA, USA

pp. 46

An Improved Algorithm for Quantifier Elimination Over Real Closed Fields (Abstract)

Saugata Basu , IBM T.J. Watson Research Center

pp. 56

On the power of quantum finite state automata (Abstract)

J. Watrous , Dept. of Comput. Sci., Eotvos Lorand Geophys. Inst. of Hungary, Budapest, Hungary

A. Kondacs , Dept. of Comput. Sci., Eotvos Lorand Geophys. Inst. of Hungary, Budapest, Hungary

pp. 66

Invited Talk

Two Decades of Temporal Logic: Achievements and Challenges (PDF)

Amir Pnueli , Department of Applied Mathematics and Computer Science, Weizmann Institute of Science

pp. 78

Session 2A, Chair: Nir Shavit

Computable obstructions to wait-free computability (Abstract)

J. Havlicek , Texas Univ., Austin, TX, USA

pp. 80

Reliable cellular automata with self-organization (Abstract)

P. Gacs , Dept. of Comput. Sci., Boston Univ., MA, USA

pp. 90

Alternating-time Temporal Logic (Abstract)

Thomas A. Henzinger , University of California, Berkeley,

Orna Kupferman , University of California, Berkeley,

Rajeev Alur , University of Pennsylvania

pp. 100

On the Complexity of a Set-Union Problem (Abstract)

Richard J. Lipton , Princeton University

Andy Neitzke , Princeton University

Paul J. Martino , Princeton University

pp. 110

Session 2B, Chair: Raimund Seidel

Succinct representation of balanced parentheses, static trees and planar graphs (Abstract)

J.I. Munro , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada

V. Raman , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada

pp. 118

Deterministic Superimposed Coding with Applications to Pattern Matching (Abstract)

Piotr Indyk , Stanford University

pp. 127

Optimal suffix tree construction with large alphabets (Abstract)

M. Farach , Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ, USA

pp. 137

Pattern matching with swaps (Abstract)

N. Lewenstein , Georgia Tech. Res. Inst., Atlanta, GA, USA

G.M. Landau , Georgia Tech. Res. Inst., Atlanta, GA, USA

M. Lewenstein , Georgia Tech. Res. Inst., Atlanta, GA, USA

Y. Aumann , Georgia Tech. Res. Inst., Atlanta, GA, USA

A. Amir , Georgia Tech. Res. Inst., Atlanta, GA, USA

pp. 144

Session 3A, Chair: Ken Clarkson

Improved bounds on planar k-sets and k-levels (Abstract)

T.K. Dey , Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India

pp. 156

Computing integral points in convex semi-algebraic sets (Abstract)

L. Khachiyan , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA

L. Porkolab , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA

pp. 162

The Computational Complexity of Knot and Link Problems (Abstract)

Nicholas Pippenger , University of British Columbia

Joel Hass , University of California

Jeffrey C. Lagarias , AT&T Labs - Research

pp. 172

Approximating Shortest Paths on a Nonconvex Polyhedron (Abstract)

Kasturi R. Varadarajan , Duke University,

Pankaj K. Agarwal , Duke University,

pp. 182

Session 3B, Chair: Steven Phillips

Randomized Allocation Processes (Abstract)

Volker Stemann , University of Paderborn

Artur Czumaj , University of Paderborn

pp. 194

The analysis of a list-coloring algorithm on a random graph (Abstract)

D. Achlioptas , Dept. of Comput. Sci., Toronto Univ., Ont., Canada

M. Molloy , Dept. of Comput. Sci., Toronto Univ., Ont., Canada

pp. 204

Contention Resolution with Guaranteed Constant Expected Delay (Abstract)

Philip D. MacKenzie , Boise State University

Leslie Ann Goldberg , University of Warwick

pp. 213

Path coupling: A technique for proving rapid mixing in Markov chains (Abstract)

R. Bubley , Sch. of Comput. Studies, Leeds Univ., UK

M. Dyer , Sch. of Comput. Studies, Leeds Univ., UK

pp. 223

Session 4A, Chair: Noam Nisan

Separation of the monotone NC hierarchy (Abstract)

P. McKenzie , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel

R. Raz , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel

pp. 234

Making nondeterminism unambiguous (Abstract)

E. Allender , Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany

K. Reinhardt , Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany

pp. 244

No feasible interpolation for TC/sup 0/-Frege proofs (Abstract)

R. Raz , Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain

T. Pitassi , Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain

M.L. Bonet , Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain

pp. 254

Weak random sources, hitting sets, and BPP simulations (Abstract)

A.E. Andreev , Moscow Univ., Russia

J.D.P. Rolim , Moscow Univ., Russia

A.E.F. Clementi , Moscow Univ., Russia

L. Trevisan , Moscow Univ., Russia

pp. 264

Session 4B, Chair: Greg Plaxton

Parallelizing Elimination Orders with Linear Fill (Abstract)

R. Ravi , Carnegie Mellon University

Claudson F. Bornstein , Carnegie Mellon University

Gary Miller , Carnegie Mellon University

Bruce M. Maggs , Carnegie Mellon University

pp. 274

Exploiting Locality for Data Management in Systems of Limited Bandwidth (Abstract)

B. Voecking , University of Paderborn

B. Maggs , University of Paderborn

F. Meyer auf der Heide , University of Paderborn

M. Westermann , University of Paderborn

pp. 284

General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) (Abstract)

T. Leighton , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

M. Harchol-Balter , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

M. Andrews , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

L. Zhang , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

A. Fernandez , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

pp. 294

Global Optimization Using Local Information with Applications to Flow Control (Abstract)

Yair Bartal , University of California, Berkeley

Danny Raz , University of California, Berkeley

John W. Byers , University of California, Berkeley

pp. 303

Invited Talk

New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven) (Abstract)

S. Goldwasser , Lab. for Comput. Sci., MIT, Cambridge, MA, USA

pp. 314

Session 5A, Chair: Anna Karlin

Truly online paging with locality of reference (Abstract)

M. Mendel , Dept. of Comput. Sci., Tel Aviv Univ., Israel

A. Fiat , Dept. of Comput. Sci., Tel Aviv Univ., Israel

pp. 326

The Competitive Analysis of Risk Taking with Applications to Online Trading (Abstract)

Sabah al-Binali , Columbia University

pp. 336

Minimizing flow time nonclairvoyantly (Abstract)

K.R. Pruhs , Dept. of Comput. Sci., Pittsburgh Univ., PA, USA

B. Kalyanasundaram , Dept. of Comput. Sci., Pittsburgh Univ., PA, USA

pp. 345

Storage Management for Evolving Databases (Abstract)

J. Kleinberg , Cornell University

P. Raghavan , IBM Almaden Research Center

S. Venkatasubramanian , Stanford University

R. Motwani , Stanford University

pp. 353

Session 5B, Chair: Uri Feige

Replication is not needed: single database, computationally-private information retrieval (Abstract)

R. Ostrovsky , Technion-Israel Inst. of Technol., Haifa, Israel

E. Kushilevitz , Technion-Israel Inst. of Technol., Haifa, Israel

pp. 364

Does Parallel Repetition Lower the Error in Computationally Sound Protocols? (Abstract)

Russell Impagliazzo , University of California at San Diego

Moni Naor , Weizmann Institute of Science

Mihir Bellare , University of California at San Diego

pp. 374

Optimal-resilience proactive public-key cryptosystems (Abstract)

Y. Frankel , CertCo LLC, New York, NY, USA

Moti Yung , CertCo LLC, New York, NY, USA

P. Gemmell , CertCo LLC, New York, NY, USA

P.D. MacKenzie , CertCo LLC, New York, NY, USA

pp. 384

A Concrete Security Treatment of Symmetric Encryption (Abstract)

Phillip Rogaway , University of California at Davis

Eron Jokipii , University of California at San Diego

Anand Desai , University of California at San Diego

Mihir Bellare , University of California at San Diego

pp. 394

Session 6A, Chair: Madhu Sudan

A 7/8-Approximation Algorithm for MAX 3SAT? (Abstract)

Uri Zwick , Tel-Aviv University

Howard Karloff , Georgia Institute of Technology

pp. 406

Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems (Abstract)

A. Srinivasan , Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore

pp. 416

Improved Approximation Algorithms for Unsplittable Flow Problems (Abstract)

Stavros G. Kolliopoulos , Dartmouth College

Clifford Stein , Dartmouth College

pp. 426

Session 6B, Chair: Hugo Krawczyk

Lower bounds for the signature size of incremental schemes (Abstract)

M. Fischlin , Fachbereich Math., Frankfurt Univ., Germany

pp. 438

A Complete Promise Problem for Statistical Zero-Knowledge (Abstract)

Salil Vadhan , Massachusetts Institute of Technology

Amit Sahai , Massachusetts Institute of Technology

pp. 448

Number-theoretic constructions of efficient pseudo-random functions (Abstract)

M. Naor , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel

O. Reingold , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel

pp. 458

An Improved Worst-Case to Average-Case Connection for Lattice Problems (Abstract)

Ajay P. Nerurkar , State University of New York at Buffalo

Jin-yi Cai , State University of New York at Buffalo

pp. 468

Session 7A, Chair: Christos Papadimitriou

Finding an Even Hole in a Graph (Abstract)

pp. 480

Edge-Connectivity Augmentation Preserving Simplicity (Abstract)

Joergen Bang-Jensen , Odense University

Tibor Jordan , Odense University

pp. 486

Hamiltonian Cycles in Solid Grid Graphs (Abstract)

William Lenhart , University of California, Berkeley

Christopher Umans , University of California, Berkeley

pp. 496

Session 7B, Chair: Ravi Kannan

A Random Sampling based Algorithm for Learning the Intersection of Half-spaces (Abstract)

Santosh Vempala , Carnegie Mellon University

pp. 508

Learning noisy perceptrons by a perceptron in polynomial time (Abstract)

E. Cohen , AT&T Labs.-Res., Florham Park, NJ, USA

pp. 514

Nearly tight bounds on the learnability of evolution (Abstract)

R. Desper , Latvian State Univ., Riga, Latvia

A. Ambainis , Latvian State Univ., Riga, Latvia

M. Farach , Latvian State Univ., Riga, Latvia

S. Kannan , Latvian State Univ., Riga, Latvia

pp. 524

Session 8A, Chair: Phil Klein

Improved approximations for shallow-light spanning trees (Abstract)

J. Naor , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

B. Schieber , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

pp. 536

Buy-at-bulk network design (Abstract)

B. Awerbuch , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

Y. Azar , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

pp. 542

A 2-approximation algorithm for the directed multiway cut problem (Abstract)

L. Zosin , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

J. Naor , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

pp. 548

Nearly linear time approximation schemes for Euclidean TSP and other geometric problems (Abstract)

S. Arora

pp. 554

Session 8B, Chair: Tao Jiang

Satisfiability Coding Lemma (Abstract)

P. Pudlak , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA

F. Zane , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA

R. Paturi , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA

pp. 566

The Minimization Problem for Boolean Formulas (Abstract)

Edith Hemaspaandra , Le Moyne College

Gerd Wechsung , Institut fuer Informatik Friedrich-Schiller-Universitaet Jena

pp. 575

Tight bounds for depth-two superconcentrators (Abstract)

J. Radhakrishnan , Tata Inst. of Fundamental Res., Mumbai, India

A. Ta-Shma , Tata Inst. of Fundamental Res., Mumbai, India

pp. 585

Constant depth circuits and the Lutz hypothesis (Abstract)

Jin-Yi Cai , State Univ. of New York, Buffalo, NY, USA

M. Strauss , State Univ. of New York, Buffalo, NY, USA

D. Sivakumar , State Univ. of New York, Buffalo, NY, USA

pp. 595