The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
TABLE OF CONTENTS

Foreword (PDF)

pp. x

Committees (PDF)

pp. xi

Reviewers (PDF)

pp. xii
Session 1A, Chair: Rajeev Motwani

The regularity lemma and approximation schemes for dense problems (Abstract)

A. Frieze , Dept. of Math. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
R. Kannan , Dept. of Math. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 12

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Abstract)

A. Frieze , Dept. of Comput. Sci., Princeton Univ., NJ, USA
S. Arora , Dept. of Comput. Sci., Princeton Univ., NJ, USA
H. Kaplan , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 21

Approximate strip packing (Abstract)

E. Remila , LIP, Ecole Normale Superieure de Lyon, France
C. Kenyon , LIP, Ecole Normale Superieure de Lyon, France
pp. 31
Session 1B, Chair: Russell Impagliazzo

A decision procedure for unitary linear quantum cellular automata (Abstract)

C. Durr , Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France
M. Santha , Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France
pp. 38

Polynomial simulations of decohered quantum computers (Abstract)

D. Aharonov , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
M. Ben-Or , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 46

Fault-tolerant quantum computation (Abstract)

P.W. Shor , AT&T Res., Murray Hill, NJ, USA
pp. 56
Session 2A, Chair: David Karger

Single-source unsplittable flow (Abstract)

J.M. Kleinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 68

The optimal path-matching problem (Abstract)

J.F. Geelen , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
W.H. Cunningham , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
pp. 78

Short paths in expander graphs (Abstract)

J. Kleinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
R. Rubinfeld , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 86

Spectral partitioning works: planar graphs and finite element meshes (Abstract)

Shang-Hua Teng , Dept. of Math., MIT, Cambridge, MA, USA
D.A. Spielmat , Dept. of Math., MIT, Cambridge, MA, USA
pp. 96
Session 2B, Chair: Chee Yap

Computing permanents over fields of characteristic 3: where and why it becomes difficult (Abstract)

G. Kogan , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 108

Solving systems of polynomial congruences modulo a large prime (Abstract)

Ming-Deh Huang , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
Yiu-Chung Wong , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
pp. 115

Faster deterministic sorting and searching in linear space (Abstract)

A. Andersson , Dept. of Comput. Sci., Lund Univ., Sweden
pp. 135
Session 3A, Chair: Baruch Schieber

An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups (Abstract)

H. Saran , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
B.S. Rajan , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
V.V. Vazirani , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
pp. 144

Highly fault-tolerant parallel computation (Abstract)

D.A. Spielman , Dept. of Math., MIT, Cambridge, MA, USA
pp. 154

Maximum likelihood decoding of Reed Solomon codes (Abstract)

B. Vucetic , Dept. of Electr. Eng., Sydney Univ., NSW, Australia
V. Ponnampalam , Dept. of Electr. Eng., Sydney Univ., NSW, Australia
pp. 164

New coding techniques for improved bandwidth utilization (Abstract)

M. Adler , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 173
Session 3B, Chair: Sandy Irani

Probabilistic approximation of metric spaces and its algorithmic applications (Abstract)

Y. Bartal , Int. Comput. Sci. Inst., Berkeley, CA, USA
pp. 184

Factoring graphs to bound mixing rates (Abstract)

D. Randall , Dept. of Math. & Stat., York Univ., North York, Ont., Canada
N. Madras , Dept. of Math. & Stat., York Univ., North York, Ont., Canada
pp. 194

Sampling according to the multivariate normal density (Abstract)

R. Kannan , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
Guangxing Li , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 204

Load balancing and density dependent jump Markov processes (Abstract)

M. Mitzenmacher , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 213
Session 4A, Chair: Tandy Warnow

Tree data structures for N-body simulation (Abstract)

R.J. Anderson , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
pp. 224

Efficient information gathering on the Internet (Abstract)

R.M. Karp , Washington Univ., Seattle, WA, USA
O. Waarts , Washington Univ., Seattle, WA, USA
S. Hanks , Washington Univ., Seattle, WA, USA
O. Madani , Washington Univ., Seattle, WA, USA
O. Etzioni , Washington Univ., Seattle, WA, USA
T. Jiang , Washington Univ., Seattle, WA, USA
pp. 234

Approximate option pricing (Abstract)

P. Chalasani , Los Alamos Nat. Lab., NM, USA
I. Saias , Los Alamos Nat. Lab., NM, USA
S. Jha , Los Alamos Nat. Lab., NM, USA
pp. 244
Session 4B, Chair: Dexter Kozen

Temporal logic and semidirect products: an effective characterization of the until hierarchy (Abstract)

T. Wilke , Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada
D. Therien , Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada
pp. 256

Equivalence in finite-variable logics is complete for polynomial time (Abstract)

M. Grohe , Inst. fur Math. Logik, Albert-Ludwigs-Univ., Freiburg, Germany
pp. 264

Simplified and improved resolution lower bounds (Abstract)

P. Beame , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
T. Pitassi , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
pp. 274
Session 5, Chair: Martin Tompa

Computationally hard algebraic problems (Abstract)

M.O. Rabin , Hebrew Univ., Jerusalem, Israel
pp. 284
Session 6A, Chair: Tandy Warnow

Approximating minimum-size k-connected spanning subgraphs via matching (Abstract)

R. Thurimella , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
J. Cheriyan , Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
pp. 292

A 3-approximation for the minimum tree spanning k vertices (Abstract)

N. Garg , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
pp. 302

An 8-approximation algorithm for the subset feedback vertex set problem (Abstract)

L. Zosin , Saarlandes Univ., Saarbrucken, Germany
G. Even , Saarlandes Univ., Saarbrucken, Germany
J.S. Naor , Saarlandes Univ., Saarbrucken, Germany
pp. 310

Efficient approximate and dynamic matching of patterns using a labeling paradigm (Abstract)

S.C. Sahinalp , Maryland Univ., College Park, MD, USA
U. Vishkin , Maryland Univ., College Park, MD, USA
pp. 320
Session 6B, Chair: Russell Impagliazzo

A polynomial-time algorithm for learning noisy linear threshold functions (Abstract)

S. Vempala , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
R. Kannan , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
A. Blum , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
A. Frieze , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 330

Property testing and its connection to learning and approximation (Abstract)

S. Goldwasser , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
D. Ron , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
O. Goldreich , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 339

On the applications of multiplicity automata in learning (Abstract)

N.H. Bshouty , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
S. Varricchio , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
F. Bergadano , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Beimel , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
E. Kushilevitz , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 349

Learning linear transformations (Abstract)

R. Kannan , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
M. Jerrum , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
A. Frieze , Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 359
Session 7A, Chair: S. Rao Kosaraju

Deterministic routing with bounded buffers: turning offline into online protocols (Abstract)

C. Scheideler , Dept. of Math. & Comput. Sci., Paderborn Univ., Germany
F. Meyer auf der Heide , Dept. of Math. & Comput. Sci., Paderborn Univ., Germany
pp. 370

Universal stability results for greedy contention-resolution protocols (Abstract)

Zhiyong Liu , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
J. Kleinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
T. Leighton , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
M. Andrews , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
A. Fernandez , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 380

A general approach to dynamic packet routing with bounded buffers (Abstract)

E. Upfal , Digital Syst. Res. Center, Palo Alto, CA, USA
A.M. Frieze , Digital Syst. Res. Center, Palo Alto, CA, USA
A.Z. Broder , Digital Syst. Res. Center, Palo Alto, CA, USA
pp. 390

Path coloring on the mesh (Abstract)

Y. Rabani , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 400
Session 7B, Chair: Anne Condon

Discrepancy sets and pseudorandom generators for combinatorial rectangles (Abstract)

A. Wigderson , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
R. Armoni , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
M. Saks , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
Shiyu Zhou , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 412

Potential of the approximation method (Abstract)

K. Amano , Graduate Sch. of Inf. Sci., Tohoku Univ., Sendai, Japan
A. Maruoka , Graduate Sch. of Inf. Sci., Tohoku Univ., Sendai, Japan
pp. 431
Session 8A, Chair: Chee Yap

All pairs almost shortest paths (Abstract)

U. Zwick , Dept. of Comput. Sci., Tel Aviv Univ., Israel
D. Dor , Dept. of Comput. Sci., Tel Aviv Univ., Israel
S. Halperin , Dept. of Comput. Sci., Tel Aviv Univ., Israel
pp. 452

Computing vertex connectivity: new bounds from old techniques (Abstract)

M.R. Henzinffer , Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA
H.N. Gabow , Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA
S. Rao , Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA
pp. 462

New lower bounds for halfspace emptiness (Abstract)

J. Erickson , Comput. Sci. Div., California Univ., Berkeley, CA, USA
pp. 472

Binary space partitions for fat rectangles (Abstract)

E.F. Grove , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
T.M. Murali , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
P.K. Agarwal , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
J.S. Vitter , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 482
Session 8B, Chair: Carsten Lund

On the knowledge complexity of N P (Abstract)

G. Tardos , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
E. Petrank , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 494

Incoercible multiparty computation (Abstract)

R. Canetti , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
R. Gennaro , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 504

Pseudorandom functions revisited: the cascade construction and its concrete security (Abstract)

H. Krawczyk , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
M. Bellare , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
R. Canetti , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 514

The geometry of coin-weighing problems (Abstract)

D.N. Kozlov , Raymond & Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
N. Alon , Raymond & Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
V.H. Vu , Raymond & Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
pp. 524
Session 9, Chair: Rajeev Motwani

Universal data compression and portfolio selection (Abstract)

T.M. Cover , Inf. Syst. Lab., Stanford Univ., CA, USA
pp. 534
Session 10A, Chair: Sandy Irani

Near-optimal parallel prefetching and caching (Abstract)

A.R. Karlin , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
T. Kimbrel , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
pp. 540

New algorithms for the disk scheduling problem (Abstract)

L. Zhang , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
M.A. Bender , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
M. Andrews , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 550

Optimal dynamic interval management in external memory (Abstract)

L. Arge , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
J.S. Vitter , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 560

Fast fault-tolerant concurrent access to shared objects (Abstract)

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

Fault tolerant data structures (Abstract)

Y. Aumann , Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
M.A. Bender , Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
pp. 580
Session 10B, Chair: Michael Luby

Approximate checking of polynomials and functional equations (Abstract)

R. Rubinfeld , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
F. Ergun , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
S.R. Kumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 592

Efficient self-testing/self-correction of linear recurrences (Abstract)

S.R. Kumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
D. Sivakumar , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 602

Verifying identities (Abstract)

S. Rajagopalan , Princeton Univ., NJ, USA
L.J. Schulman , Princeton Univ., NJ, USA
pp. 612

Clique is hard to approximate within n1-ε (Abstract)

J. Hastad , R. Inst. of Technol., Stockholm, Sweden
pp. 627

Author Index (PDF)

pp. 637
112 ms
(Ver )