The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1995)
Milwaukee, Wisconsin
Oct. 23, 1995 to Oct. 25, 1995
ISSN: 0272-5428
ISBN: 0-8186-7183-1
TABLE OF CONTENTS

Foreword (PDF)

pp. xi

Referrees (PDF)

pp. xii

Committees (PDF)

pp. xiii
Session 1, Chair: Steve Cook

Cognitive computation (Abstract)

L.G. Valiant , Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA
pp. 2
Session 2A, Chair: László Babai

Lower bounds on arithmetic circuits via partial derivatives (Abstract)

N. Nisan , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
A. Wigderson , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 16

Pseudorandom generators, measure theory, and natural proofs (Abstract)

Jin-Yi Cai , Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
K.W. Regan , Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
D. Sivakumar , Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
pp. 26

Counting bottlenecks to show monotone P ? NP (Abstract)

A. Haken , 1805 Augusta Drive, Champaign, IL, USA
pp. 36

Private information retrieval (Abstract)

E. Kushilevitz , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
M. Sudan , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
B. Chor , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
O. Goldreich , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 41
Session 2B, Chair: Serge Plotkin

Disjoint paths in densely embedded graphs (Abstract)

J. Kzeinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
E. Tardos , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 52

Divide-and-conquer approximation algorithms via spreading metrics (Abstract)

S. Rao , Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany
G. Even , Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany
B. Schieber , Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany
J. Naor , Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany
pp. 62

The loading time scheduling problem (Abstract)

S. Khuller , Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
J. Naor , Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
R. Bhatia , Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
pp. 72

Approximability of flow shop scheduling (Abstract)

L.A. Hall , Dept. of Math. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 82
Session 3A, Chair: Nicholas Pippenger

Contention resolution with bounded delay (Abstract)

A. Srinivasan , Dept. of Comput. Sci., Warwick Univ., Coventry, UK
M. Paterson , Dept. of Comput. Sci., Warwick Univ., Coventry, UK
pp. 104

Tight bounds for a distributed selection game with applications to fixed-connection machines (Abstract)

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

Efficient parallel solution of sparse eigenvalue and eigenvector problems (Abstract)

J.H. Reif , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 123
Session 3B, Chair: Umesh Vazirani

Approximating the volume of definable sets (Abstract)

P. Koiran , LIP, CNRS, Lyon, France
pp. 134

An optimal algorithm for Monte Carlo estimation (Abstract)

R. Karp , Sect. on Med. Inf., Stanford Univ. Sch. of Med., Palo Alto, CA, USA
S. Ross , Sect. on Med. Inf., Stanford Univ. Sch. of Med., Palo Alto, CA, USA
M. Luby , Sect. on Med. Inf., Stanford Univ. Sch. of Med., Palo Alto, CA, USA
P. Dagum , Sect. on Med. Inf., Stanford Univ. Sch. of Med., Palo Alto, CA, USA
pp. 142

Markov chain algorithms for planar lattice structures (Abstract)

A. Sinclair , Int. Comput. Sci. Inst., Berkeley, CA, USA
M. Luby , Int. Comput. Sci. Inst., Berkeley, CA, USA
D. Randall , Int. Comput. Sci. Inst., Berkeley, CA, USA
pp. 150
Session 4A, Chair: Steven Rudich

Derandomizing semidefinite programming based approximation algorithms (Abstract)

S. Mahajan , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
H. Ramesh , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
pp. 162

Synthesizers and their application to the parallel construction of pseudo-random functions (Abstract)

O. Reingold , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
M. Naor , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 170

Splitters and near-optimal derandomization (Abstract)

L.J. Schulman , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
M. Naor , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
A. Srinivasan , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 182
Session 4B, Chair: Edith Cohen

A unified analysis of paging and caching (Abstract)

E. Torng , Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
pp. 194

Application-controlled paging for a shared cache (Abstract)

E.F. Grove , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
J.S. Vitter , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
R.D. Barve , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 204

Speed is as powerful as clairvoyance [scheduling problems] (Abstract)

K. Pruhs , Dept. of Comput. Sci., Pittsburgh Univ., PA, USA
B. Kalyanasundaram , Dept. of Comput. Sci., Pittsburgh Univ., PA, USA
pp. 214
Session 5, Chair: Andrew C-C. Yao

Perspectives on database theory (Abstract)

M. Yannakakis , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 224
Session 6A, Chair: Pankaj Agarwal

Algebraic decomposition of non-convex polyhedra (Abstract)

H. Edelsbrunner , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
pp. 248

Improved lower bound on testing membership to a polyhedron by algebraic decision trees (Abstract)

N. Vorobjov , Dept. of Comput. Sci. & Math., Penn State Univ., University Park, PA, USA
M. Karpinski , Dept. of Comput. Sci. & Math., Penn State Univ., University Park, PA, USA
D. Grigoriev , Dept. of Comput. Sci. & Math., Penn State Univ., University Park, PA, USA
pp. 258

Optimal algorithms for curves on surfaces (Abstract)

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

Finding points on curves over finite fields (Abstract)

I. Shparlinski , FB Math.-Inf., Paderborn Univ., Germany
J. von zur Gathen , FB Math.-Inf., Paderborn Univ., Germany
pp. 284
Session 6B, Chair: John Canny

Learning polynomials with queries: The highly noisy case (Abstract)

O. Goldreich , Weizmann Inst. of Sci., Rehovot, Israel
M. Sudan , Weizmann Inst. of Sci., Rehovot, Israel
R. Rubinfeld , Weizmann Inst. of Sci., Rehovot, Israel
pp. 294

Simple learning algorithms for decision trees and multivariate polynomials (Abstract)

N.H. Bshouty , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
Y. Mansour , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 304

Tracking the best disjunction (Abstract)

M.K. Warmuth , Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
P. Auer , Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
pp. 312

Gambling in a rigged casino: The adversarial multi-armed bandit problem (Abstract)

R.E. Schapire , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
N. Cesa-Bianchi , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
P. Auer , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
Y. Freund , Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
pp. 322

Efficient algorithms for learning to play repeated games against computationally bounded adversaries (Abstract)

R.E. Schapire , AT&T Bell Labs., USA
D. Ron , AT&T Bell Labs., USA
M. Kearns , AT&T Bell Labs., USA
R. Rubinfeld , AT&T Bell Labs., USA
Y. Freund , AT&T Bell Labs., USA
Y. Mansour , AT&T Bell Labs., USA
pp. 332
Session 7A, Chair: Uri Feige

RSPACE(S) ⊆ DSPACE(S^3/2) (Abstract)

S. Zhou , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
M. Saks , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
pp. 344

Sparse P-hard sets yield space-efficient algorithms (Abstract)

M. Ogihara , Dept. of Comput. Sci., Rochester Univ., NY, USA
pp. 354

The resolution of a Hartmanis conjecture (Abstract)

Jin-Yi Cai , Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
D. Sivakumar , Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
pp. 362
Session 7B, Chair: Martin Dyer

A scheduling model for reduced CPU energy (Abstract)

F. Yao , Xerox Palo Alto Res. Center, CA, USA
S. Shenker , Xerox Palo Alto Res. Center, CA, USA
A. Demers , Xerox Palo Alto Res. Center, CA, USA
pp. 374

Load balancing in the L/sub p/ norm (Abstract)

Ming-Yang Kao , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
J.S. Vitter , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
Y. Azar , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
B. Awerbuch , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
E.F. Grove , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
P. Krishnan , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 383

Competitive access time via dynamic storage rearrangement (Abstract)

A. Fiat , Dept. of Comput. Sci., Tel Aviv Univ., Israel
Y. Mansour , Dept. of Comput. Sci., Tel Aviv Univ., Israel
A. Rosen , Dept. of Comput. Sci., Tel Aviv Univ., Israel
O. Waarts , Dept. of Comput. Sci., Tel Aviv Univ., Israel
pp. 392
Session 8A, Chair: Uri Feige

Reductions, codes, PCPs, and inapproximability (Abstract)

S. Arora , Princeton Univ., NJ, USA
pp. 404

Improved hardness results for approximating the chromatic number (Abstract)

M. Furer , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
pp. 414

Free bits, PCPs and non-approximability-towards tight results (Abstract)

O. Goldreich , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
M. Sudan , 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
pp. 422

Linearity testing in characteristic two (Abstract)

J. Hastad , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
D. Coppersmith , 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
M. Sudan , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
M. Kiwi , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 432
Session 8B, Chair: Edith Cohen

3-coloring in time 0(1.3446^n): a no-MIS algorithm (Abstract)

R. Beigel , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
D. Eppstein , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 444

Computing simulations on finite and infinite graphs (Abstract)

M.R. Henzinger , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
P.W. Kopke , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
T.A. Henzinger , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 453

Minimum coloring random and semi-random graphs in polynomial expected time (Abstract)

C.R. Subramanian , Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
pp. 463

Improved algorithms and analysis for secretary problems and generalizations (Abstract)

O. Waarts , IBM Almaden Res. Center, San Jose, CA, USA
N. Megiddo , IBM Almaden Res. Center, San Jose, CA, USA
M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
pp. 473
Session 9, Chair: John Canny

Controllability, recognizability, and complexity issues in robot motion planning (Abstract)

J.-C. Latombe , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 484
Session 10A, Chair: Steven Rudich

Coding for computing (Abstract)

A. Orlitsky , AT&T Bell Labs., Murray Hill, NJ, USA
J.R. Roche , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 502

Linear time erasure codes with nearly optimal recovery (Abstract)

M. Luby , Dept. of Math., Tel Aviv Univ., Israel
N. Alon , Dept. of Math., Tel Aviv Univ., Israel
J. Edmonds , Dept. of Math., Tel Aviv Univ., Israel
pp. 512

Using autoreducibility to separate complexity classes (Abstract)

L. Fortnow , CWI, Amsterdam, Netherlands
H. Buhrman , CWI, Amsterdam, Netherlands
L. Torenvliet , CWI, Amsterdam, Netherlands
pp. 520

On one-dimensional quantum cellular automata (Abstract)

J. Watrous , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
pp. 528

Hard-core distributions for somewhat hard problems (Abstract)

R. Impagliazzo , Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 538
Session 10B, Chair: Cynthia Dwork

Efficient access to optical bandwidth (Abstract)

Satish Rao , Bellcore, Piscataway, NJ, USA
C. Kaklamanis , Bellcore, Piscataway, NJ, USA
M. Mihail , Bellcore, Piscataway, NJ, USA
pp. 548

Routing on butterfly networks with random faults (Abstract)

R. Cole , Courant Inst. of Math. Sci., New York Univ., NY, USA
B. Maggs , Courant Inst. of Math. Sci., New York Univ., NY, USA
R. Sitaraman , Courant Inst. of Math. Sci., New York Univ., NY, USA
pp. 558

Fault diagnosis in a flash (Abstract)

W. Hurwood , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
N. Kahale , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
R. Beigel , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 571

Transforming men into mice (polynomial algorithm for genomic distance problem) (Abstract)

S. Hannenhalli , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
P.A. Pevzner , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
pp. 581

Algorithms for matrix groups and the Tits alternative (Abstract)

R. Beals , Sch. of Math., Inst. for Adv. Study, Princeton, NJ, USA
pp. 593
Session 11A, Chair: Martin Dyer

Optimal on-line search and sublinear time update in string matching (Abstract)

P. Ferragina , Dipartimento di Inf., Pisa Univ., Italy
R. Grossi , Dipartimento di Inf., Pisa Univ., Italy
pp. 604

Reconstructing strings from substrings in rounds (Abstract)

D. Margaritis , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
S.S. Skiena , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
pp. 613

The bit vector intersection problem (Abstract)

R.M. Karp , California Univ., Berkeley, CA, USA
G. Zweig , California Univ., Berkeley, CA, USA
O. Waarts , California Univ., Berkeley, CA, USA
pp. 621

Faster algorithms for the construction of parameterized suffix trees (Abstract)

S. Rao Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 631
Session 11B, Chair: Pankaj Agarwal

An approximation scheme for planar graph TSP (Abstract)

E. Koutsoupias , Dept. of Math. & Comput. Sci., Emory Univ., Atlanta, GA, USA
M. Grigni , Dept. of Math. & Comput. Sci., Emory Univ., Atlanta, GA, USA
C. Papadimitriou , Dept. of Math. & Comput. Sci., Emory Univ., Atlanta, GA, USA
pp. 640

Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking (Abstract)

C. Okasaki , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 646

Sublogarithmic searching without multiplications (Abstract)

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

Fully dynamic biconnectivity and transitive closure (Abstract)

V. King , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
M.R. Henzinger , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 664
Session 12A, Chair: Laszlo Babai

Lower bounds for monotone span programs (Abstract)

M. Paterson , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Beimel , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Gal , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 674

On computing Boolean functions by sparse real polynomials (Abstract)

M. Krause , Lehrstuhl Inf. II, Dortmund Univ., Germany
P. Pudlak , Lehrstuhl Inf. II, Dortmund Univ., Germany
pp. 682

Improved depth lower bounds for small distance connectivity (Abstract)

R. Impagliazzo , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
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. 692
Session 12B

Tight fault locality (Abstract)

D. Peleg , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
S. Kutten , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 704

Faster approximate agreement with multi-writer registers (Abstract)

E. Schenk , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 714

Resolving message complexity of Byzantine Agreement and beyond (Abstract)

Z. Galil , Columbia Univ., New York, NY, USA
A. Mayer , Columbia Univ., New York, NY, USA
Moti Yung , Columbia Univ., New York, NY, USA
pp. 724

Author Index (PDF)

pp. 734
103 ms
(Ver )