CSDL - Proceedings F

Committees (PDF)

pp. xi

Reviewers (PDF)

pp. xii

Session 1A, Chair: Rajeev Motwani

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

S. Arora, Princeton Univ., NJ, USA

pp. 2

PDF

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

PDF

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

S. Arora, Dept. of Comput. Sci., Princeton Univ., NJ, USA

A. Frieze, Dept. of Comput. Sci., Princeton Univ., NJ, USA

H. Kaplan, Dept. of Comput. Sci., Princeton Univ., NJ, USA

pp. 21

PDF

Approximate strip packing (Abstract)

C. Kenyon, LIP, Ecole Normale Superieure de Lyon, France

E. Remila, LIP, Ecole Normale Superieure de Lyon, France

pp. 31

PDF

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

PDF

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

PDF

Fault-tolerant quantum computation (Abstract)

P.W. Shor, AT&T Res., Murray Hill, NJ, USA

pp. 56

PDF

Session 2A, Chair: David Karger

Single-source unsplittable flow (Abstract)

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

pp. 68

PDF

The optimal path-matching problem (Abstract)

W.H. Cunningham, Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada

J.F. Geelen, Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada

pp. 78

PDF

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

PDF

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

D.A. Spielmat, Dept. of Math., MIT, Cambridge, MA, USA

Shang-Hua Teng, Dept. of Math., MIT, Cambridge, MA, USA

pp. 96

PDF

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

PDF

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

PDF

Median Selection Requires Comparisons (Abstract)

D. Dor

U. Zwick

pp. 125

PDF

Faster deterministic sorting and searching in linear space (Abstract)

A. Andersson, Dept. of Comput. Sci., Lund Univ., Sweden

pp. 135

PDF

Session 3A, Chair: Baruch Schieber

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

V.V. Vazirani, Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA

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

pp. 144

PDF

Highly fault-tolerant parallel computation (Abstract)

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

pp. 154

PDF

Maximum likelihood decoding of Reed Solomon codes (Abstract)

V. Ponnampalam, Dept. of Electr. Eng., Sydney Univ., NSW, Australia

B. Vucetic, Dept. of Electr. Eng., Sydney Univ., NSW, Australia

pp. 164

PDF

New coding techniques for improved bandwidth utilization (Abstract)

M. Adler, Div. of Comput. Sci., California Univ., Berkeley, CA, USA

pp. 173

PDF

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

PDF

Factoring graphs to bound mixing rates (Abstract)

N. Madras, Dept. of Math. & Stat., York Univ., North York, Ont., Canada

D. Randall, Dept. of Math. & Stat., York Univ., North York, Ont., Canada

pp. 194

PDF

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

PDF

Load balancing and density dependent jump Markov processes (Abstract)

M. Mitzenmacher, Dept. of Comput. Sci., California Univ., Berkeley, CA, USA

pp. 213

PDF

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

PDF

Efficient information gathering on the Internet (Abstract)

O. Etzioni, Washington Univ., Seattle, WA, USA

S. Hanks, Washington Univ., Seattle, WA, USA

T. Jiang, Washington Univ., Seattle, WA, USA

R.M. Karp, Washington Univ., Seattle, WA, USA

O. Madani, Washington Univ., Seattle, WA, USA

O. Waarts, Washington Univ., Seattle, WA, USA

pp. 234

PDF

Approximate option pricing (Abstract)

P. Chalasani, Los Alamos Nat. Lab., NM, USA

S. Jha, Los Alamos Nat. Lab., NM, USA

I. Saias, Los Alamos Nat. Lab., NM, USA

pp. 244

PDF

Session 4B, Chair: Dexter Kozen

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

D. Therien, Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada

T. Wilke, Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada

pp. 256

PDF

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

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

pp. 264

PDF

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

PDF

Session 5, Chair: Martin Tompa

Computationally hard algebraic problems (Abstract)

M.O. Rabin, Hebrew Univ., Jerusalem, Israel

pp. 284

PDF

Session 6A, Chair: Tandy Warnow

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

J. Cheriyan, Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada

R. Thurimella, Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada

pp. 292

PDF

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

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

pp. 302

PDF

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

G. Even, Saarlandes Univ., Saarbrucken, Germany

J.S. Naor, Saarlandes Univ., Saarbrucken, Germany

L. Zosin, Saarlandes Univ., Saarbrucken, Germany

pp. 310

PDF

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

PDF

Session 6B, Chair: Russell Impagliazzo

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

A. Blum, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

A. Frieze, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

R. Kannan, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

S. Vempala, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

pp. 330

PDF

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

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

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

pp. 339

PDF

On the applications of multiplicity automata in learning (Abstract)

A. Beimel, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

F. Bergadano, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

N.H. Bshouty, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

E. Kushilevitz, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

S. Varricchio, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

pp. 349

PDF

Learning linear transformations (Abstract)

A. Frieze, Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA

M. Jerrum, Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA

R. Kannan, Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA, USA

pp. 359

PDF

Session 7A, Chair: S. Rao Kosaraju

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

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

C. Scheideler, Dept. of Math. & Comput. Sci., Paderborn Univ., Germany

pp. 370

PDF

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

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

B. Awerbuch, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

A. Fernandez, 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

Zhiyong Liu, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

pp. 380

PDF

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

A.Z. Broder, Digital Syst. Res. Center, Palo Alto, CA, USA

A.M. Frieze, Digital Syst. Res. Center, Palo Alto, CA, USA

E. Upfal, Digital Syst. Res. Center, Palo Alto, CA, USA

pp. 390

PDF

Path coloring on the mesh (Abstract)

Y. Rabani, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

pp. 400

PDF

Session 7B, Chair: Anne Condon

Discrepancy sets and pseudorandom generators for combinatorial rectangles (Abstract)

R. Armoni, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

M. Saks, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

A. Wigderson, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

Shiyu Zhou, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

pp. 412

PDF

The Boolean isomorphism problem (Abstract)

M. Agrawal

T Thierauf

pp. 422

PDF

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

PDF

Static Dictionaries on RAMs: Query Time is Necessary and Sufficient (Abstract)

S. Riis

pp. 441

PDF

Session 8A, Chair: Chee Yap

All pairs almost shortest paths (Abstract)

D. Dor, Dept. of Comput. Sci., Tel Aviv Univ., Israel

S. Halperin, Dept. of Comput. Sci., Tel Aviv Univ., Israel

U. Zwick, Dept. of Comput. Sci., Tel Aviv Univ., Israel

pp. 452

PDF

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

M.R. Henzinffer, Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA

S. Rao, Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA

H.N. Gabow, Syst. Res. Center, Digital Equipment Corp., Palo Alto, CA, USA

pp. 462

PDF

New lower bounds for halfspace emptiness (Abstract)

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

pp. 472

PDF

Binary space partitions for fat rectangles (Abstract)

P.K. Agarwal, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

E.F. Grove, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

T.M. Murali, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

J.S. Vitter, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA

pp. 482

PDF

Session 8B, Chair: Carsten Lund

On the knowledge complexity of N P (Abstract)

E. Petrank, Dept. of Comput. Sci., Toronto Univ., Ont., Canada

G. Tardos, Dept. of Comput. Sci., Toronto Univ., Ont., Canada

pp. 494

PDF

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

PDF

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

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

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

pp. 514

PDF

The geometry of coin-weighing problems (Abstract)

N. Alon, Raymond & Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel

D.N. Kozlov, 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

PDF

Session 9, Chair: Rajeev Motwani

Universal data compression and portfolio selection (Abstract)

T.M. Cover, Inf. Syst. Lab., Stanford Univ., CA, USA

pp. 534

PDF

Session 10A, Chair: Sandy Irani

Near-optimal parallel prefetching and caching (Abstract)

T. Kimbrel, Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA

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

pp. 540

PDF

New algorithms for the disk scheduling problem (Abstract)

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

M.A. Bender, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

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

pp. 550

PDF

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

PDF

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

C.G. Plaxton, Dept. of Comput. Sci., Texas Univ., Austin, TX, USA

R. Rajaraman, Dept. of Comput. Sci., Texas Univ., Austin, TX, USA

pp. 570

PDF

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

PDF

Session 10B, Chair: Michael Luby

Approximate checking of polynomials and functional equations (Abstract)

F. Ergun, Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

S.R. Kumar, Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

R. Rubinfeld, Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

pp. 592

PDF

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

PDF

Verifying identities (Abstract)

S. Rajagopalan, Princeton Univ., NJ, USA

L.J. Schulman, Princeton Univ., NJ, USA

pp. 612

PDF

Gadgets Approximation, and Linear Programming (Abstract)

pp. 617

PDF

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

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

pp. 627

PDF

Author Index (PDF)

pp. 637