The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1990)
St. Louis, MO, USA
Oct. 22, 1990 to Oct. 24, 1990
ISBN: 0-8186-2082-X
TABLE OF CONTENTS
Papers

Algebraic methods for interactive proof systems (PDF)

C. Lund , Chicago Univ., IL, USA
L. Fortnow , Chicago Univ., IL, USA
H. Karloff , Chicago Univ., IL, USA
pp. 2-10 vol.1

IP=PSPACE (interactive proof=polynomial space) (PDF)

A. Shamir , Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
pp. 11-15 vol.1

Nondeterministic exponential time has two-prover interactive protocols (PDF)

L. Babai , Chicago Univ., IL, USA
L. Fortnow , Chicago Univ., IL, USA
C. Lund , Chicago Univ., IL, USA
pp. 16-25 vol.1

A characterization of Hash P by arithmetic straight line programs (PDF)

L. Fortnow , Chicago Univ., IL, USA
L. Babai , Chicago Univ., IL, USA
pp. 26-34 vol.1

Perfectly secure message transmission (PDF)

D. Dolev , IBM Almaden Res. Center, San Jose, CA, USA
C. Dwork , IBM Almaden Res. Center, San Jose, CA, USA
pp. 36-45 vol.1

Coin-flipping games immune against linear-sized coalitions (PDF)

N. Alon , IBM Almaden Res. Center, San Jose, CA, USA
M. Naor , IBM Almaden Res. Center, San Jose, CA, USA
pp. 46-54 vol.q

Are wait-free algorithms fast? (PDF)

N. Lynch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
N. Shavit , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
H. Attiya , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 55-64 vol.1

A dining philosophers algorithm with polynomial response time (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 65-74 vol.1

New results on dynamic planar point location (PDF)

S.W. Cheng , Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
R. Janardan , Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
pp. 96-105 vol.1

The computability and complexity of optical beam tracing (PDF)

J.H. Reif , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 106-114 vol.1

Approximate string matching in sublinear expected time (PDF)

E.L. Lawler , Comput. Sci. Div., California Univ., Berkeley, CA, USA
W.I. Chang , Comput. Sci. Div., California Univ., Berkeley, CA, USA
pp. 116-124 vol.1

Towards a DNA sequencing theory (learning a string) (PDF)

M. Li , Waterloo Univ., Ont., Canada
pp. 125-134 vol.1

On the exact complexity of string matching (PDF)

L. Colussi , Dipartimento di Matematica Pura&Appl., Padova Univ., Italy
pp. 135-144 vol.1

Faster tree pattern matching (PDF)

M. Dubiner , Dept. of Appl. Math., Tel-Aviv Univ., Israel
pp. 145-150 vol.1

Specified precision polynomial root isolation is in NC (PDF)

C.A. Neff , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 152-162 vol.1

A tree-partitioning technique with applications to expression evaluation and term matching (PDF)

A.L. Delcher , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
S.R. Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 163-172 vol.1

Efficient parallel algorithms for tree-decomposition and related problems (PDF)

J. Lagergren , Dept. of Numerical Anal.&Comput. Sci., R. Inst. of Technol., Stockholm, Sweden
pp. 173-182 vol.1

Learning conjunctions of Horn clauses (PDF)

D. Angluin , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 186-192 vol.1

Exact identification of circuits using fixed points of amplification functions (PDF)

M.J. Kearns , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
S.A. Goldman , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
R.E. Schapire , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 193-202 vol.1

On the complexity of learning from counterexamples and membership queries (PDF)

G. Turan , Dept. of Math., Stat.&Comput. Sci., Illinois Univ., Chicago, IL, USA
W. Maass , Dept. of Math., Stat.&Comput. Sci., Illinois Univ., Chicago, IL, USA
pp. 203-210 vol.1

Separating distribution-free and mistake-bound learning models over the Boolean domain (PDF)

A. Blum , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 211-218 vol.1

Triangulating a simple polygon in linear time (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 220-230 vol.1

Provably good mesh generation (PDF)

M. Bern , Xerox Palo Alto Res. Center, CA, USA
D. Eppstein , Xerox Palo Alto Res. Center, CA, USA
J. Gilbert , Xerox Palo Alto Res. Center, CA, USA
pp. 231-241 vol.1

Hidden surface removal for axis-parallel polyhedra (PDF)

M. de Berg , Dept. of Comput. Sci., Utrecht Univ., Netherlands
M.H. Overmars , Dept. of Comput. Sci., Utrecht Univ., Netherlands
pp. 252-261 vol.1

A (fairly) simple circuit that (usually) sorts (PDF)

C.G. Plaxton , MIT, Cambridge, MA, USA
T. Leighton , MIT, Cambridge, MA, USA
pp. 264-274 vol.1

Fault tolerant sorting network (PDF)

S. Assaf , Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
E. Upfal , Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
pp. 275-284 vol.1

Deterministic on-line routing on area-universal networks (PDF)

P. Bay , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
G. Bilardi , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 297-306 vol.1

Multiple non-interactive zero knowledge proofs based on a single random string (PDF)

A. Shamir , Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
D. Lapidot , Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
U. Feige , Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
pp. 308-317 vol.1

Efficiently inverting bijections given by straight line programs (PDF)

C. Sturtivant , Dept. of Comput. Sci., Aarhus Univ., Denmark
pp. 327-334 vol.1

Private computations over the integers (PDF)

B. Chor , Dept. of Comput. Sci., Technion, Haifa, Israel
pp. 335-344 vol.1

Exploring an unknown graph (PDF)

X. Deng , Dept. of Comput. Sci.&Eng., California Univ., San Diego, La Jolla, CA, USA
C.H. Papadimitriou , Dept. of Comput. Sci.&Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 355-361 vol. 1

Inferring evolutionary history from DNA sequences (PDF)

S. Kannan , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 362-371 vol.1

Permuting (PDF)

F.E. Fich , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 372-379 vol.1

Efficient distribution-free learning of probabilistic concepts (PDF)

R.E. Schapire , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
M.J. Kearns , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 382-391 vol.1

A Markovian extension of Valiant's learning model (PDF)

U. Vazirani , California Univ., Berkeley, CA, USA
D. Aldous , California Univ., Berkeley, CA, USA
pp. 392-396 vol.1

On threshold circuits for parity (PDF)

R. Paturi , Dept. of Comput. Sci.&Eng., California Univ., San Diego, La Jolla, CA, USA
M.E. Saks , Dept. of Comput. Sci.&Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 397-404 vol.1

Robust separations in inductive inference (PDF)

M.A. Fulk , Rochester Univ., NY, USA
pp. 405-410 vol.1

A time-space tradeoff for Boolean matrix multiplication (PDF)

K. Abrahamson , Dept. of Electr. Eng.&Comput. Sci., Washington State Univ., Pullman, WA, USA
pp. 412-419 vol. 1

Communication-space tradeoffs for unrestricted protocols (PDF)

P. Beame , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
M. Tompa , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
pp. 420-428 vol.1

Time-space tradeoffs for undirected graph traversal (PDF)

P. Beame , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
pp. 429-438 vol.1

Competitive k-server algorithms (PDF)

Y. Rabani , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
Y. Ravid , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
A. Fiat , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
pp. 454-463 vol.2

Randomized online graph coloring (PDF)

S. Vishwanathan , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 464-469 vol.2

Coloring inductive graphs on-line (PDF)

S. Irani , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 470-479 vol.2

Online algorithms for finger searching (PDF)

R. Cole , Courant Inst., New York Univ., NY, USA
A. Raghunathan , Courant Inst., New York Univ., NY, USA
pp. 480-489 vol.2

Communication-optimal maintenance of replicated information (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 492-502 vol.2

Sparse partitions (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 503-513 vol.2

Network synchronization with polylogarithmic overhead (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 514-522 vol.2

General weak random sources (PDF)

D. Zuckerman , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 534-543 vol.2

Simple construction of almost k-wise independent random variables (PDF)

N. Alon , Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
pp. 544-553 vol.2

Some tools for approximate 3-coloring (PDF)

A. Blum , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 554-562 vol.2

Randomness in interactive proofs (PDF)

M. Bellare , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 563-572 vol.2

Parallel linear programming in fixed dimension almost surely in constant time (PDF)

N. Alon , IBM Almaden Res. Center, San Jose, CA, USA
pp. 574-582 vol.2

Reducing the parallel complexity of certain linear programming problems (PDF)

P.M. Vaidya , Dept. of Comput. Sci., Illinois, Univ., Urbana, IL, USA
pp. 583-589 vol.2

Asynchronous PRAMs are (almost) as good as synchronous PRAMs (PDF)

A. Part , Div. of Comput. Sci., California Univ., Davis, CA, USA
C. Martel , Div. of Comput. Sci., California Univ., Davis, CA, USA
R. Subramonian , Div. of Comput. Sci., California Univ., Davis, CA, USA
pp. 590-599 vol.2

Uniform memory hierarchies (PDF)

B. Alpern , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
E. Feig , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
L. Carter , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 600-608 vol.2

On the power of small-depth threshold circuits (PDF)

M. Goldmann , R. Inst. of Technol., Stockholm, Sweden
J. Hastad , R. Inst. of Technol., Stockholm, Sweden
pp. 610-618 vol.2

ON ACC and threshold circuits (PDF)

A.C.-C. Yao , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 619-627 vol.2

Polynomial threshold functions, AC functions and spectrum norms (PDF)

J. Bruck , IBM Almaden Res. Center, San Jose, CA, USA
pp. 632-641 vol.2

Deciding properties of nonregular programs (PDF)

D. Raz , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci. Rehovot, Israel
D. Harel , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci. Rehovot, Israel
pp. 652-661 vol.2

Decision problems for propositional linear logic (PDF)

J. Michell , Dept. of Comput. Sci., Stanford Univ., CA, USA
P. Lincoln , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 662-671 vol.2

Finite-memory automata (PDF)

M. Kaminski , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
N. Francez , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 683-688 vol.2

Probabilities of sentences about very sparse random graphs (PDF)

J.F. Lynch , Dept. of Math.&Comput. Sci., Clarkson Univ., Potsdam, NY, USA
pp. 689-696 vol.2

A fast algorithm for optimally increasing the edge-connectivity (PDF)

C. Martel , Div. of Comput. Sci., California Univ., Davis, CA, USA
D. Naor , Div. of Comput. Sci., California Univ., Davis, CA, USA
D. Gusfield , Div. of Comput. Sci., California Univ., Davis, CA, USA
pp. 698-707 vol.2

Augmenting graphs to meet edge-connectivity requirements (PDF)

A. Frank , Res. Inst. for Discrete Math., Bonn Univ., West Germany
pp. 708-718 vol.2

Approximation through multicommodity flow (PDF)

A. Agrawal , Brown Univ., Providence, RI, USA
P. Klein , Brown Univ., Providence, RI, USA
R. Ravi , Brown Univ., Providence, RI, USA
pp. 726-737 vol.2

Computing with snakes in directed networks of automata (PDF)

A. Litman , Bellcore, Morristown, NJ, USA
S. Even , Bellcore, Morristown, NJ, USA
P. Winkler , Bellcore, Morristown, NJ, USA
pp. 740-745 vol.2

Distributed reactive systems are hard to synthesize (PDF)

R. Rosner , Weizmann Inst. of Sci., Rehovot, Israel
A. Pneuli , Weizmann Inst. of Sci., Rehovot, Israel
pp. 746-757 vol.2

Communication complexity of algebraic computation (PDF)

Z.-Q. Luo , Dept. of Electr.&Comput. Eng., McMaster Univ., Hamilton, Ont., Canada
pp. 758-765 vol.2

Bounds on tradeoffs between randomness and communication complexity (PDF)

O. Goldreich , Dept. of Comput. Sci., Technion, Haifa, Israel
R. Canetti , Dept. of Comput. Sci., Technion, Haifa, Israel
pp. 766-775 vol.2

The complexity of finding medians (PDF)

S. Toda , Dept. of Comput. Sci.&Inf. Math, Univ. of Electro-Commun., Tokyo, Japan
pp. 778-787 vol.2

On the predictability of coupled automata: an allegory about chaos (PDF)

C.H. Papadimitriou , California Univ., La Jolla, CA, USA
S. Buss , California Univ., La Jolla, CA, USA
pp. 788-793 vol.2

On graph-theoretic lemmata and complexity classes (PDF)

C.H. Papadimitriou , Dept. of Comput. Sci.&Eng., California Univ., La Jolla, CA, USA
pp. 794-801 vol.2

No better ways to generate hard NP instances than picking uniformly at random (PDF)

R. Impagliazzo , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 812-821 vol.2

Complexity of unification in free groups and free semi-groups (PDF)

A. Koscielski , Inst. of Comput. Sci., Wroclaw Univ., Poland
pp. 824-829 vol.2

The lattice reduction algorithm of Gauss: an average case analysis (PDF)

B. Vallee , Dept. of Math., Caen Univ., France
pp. 830-839 vol.2

Simplifying nested radicals and solving polynomials by radicals in minimum depth (PDF)

M.-D.A. Huang , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
G. Horng , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
pp. 847-856 vol.2

Some triply-logarithmic parallel algorithms (PDF)

J. Jaja , Maryland Univ., College Park, MD, USA
U. Vishkin , Maryland Univ., College Park, MD, USA
R. Thurimella , Maryland Univ., College Park, MD, USA
S. Krishnamurthy , Maryland Univ., College Park, MD, USA
O. Berkman , Maryland Univ., College Park, MD, USA
pp. 871-881 vol.2

Interpolation of sparse rational functions without knowing bounds on exponents (PDF)

D.Y. Grigoriev , Steklov Inst. of Math., Acad. of Sci., Lenningrad, USSR
pp. 8409-8406 vol.2
87 ms
(Ver 3.1 (10032016))