The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1989)
Research Triangle Park, NC, USA
Oct. 30, 1989 to Nov. 1, 1989
ISBN: 0-8186-1982-1
TABLE OF CONTENTS
Papers

Simulating (log/sup c/n)-wise independence in NC (PDF)

J. Rompel , MIT Lab. for Comput. Sci., Cambridge, MA, USA
B. Berger , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 2-7

The probabilistic method yields deterministic parallel algorithms (PDF)

R. Motwani , Dept. of Comput. Sci., Stanford Univ., CA, USA
J. Naor , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 8-13

Dispersers, deterministic amplification, and weak random sources (PDF)

A. Cohen , Hebrew Univ., Jerusalem, Israel
A. Wigderson , Hebrew Univ., Jerusalem, Israel
pp. 14-19

The strength of weak learnability (PDF)

R.E. Schapire , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 28-33

Learning binary relations and total orders (PDF)

S.A. Goldman , MIT Lab. for Comput. Sci., Cambridge, MA, USA
R.L. Rivest , MIT Lab. for Comput. Sci., Cambridge, MA, USA
R.E. Schapire , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 46-51

Efficient NC algorithms for set cover with applications to learning and geometry (PDF)

B. Berger , MIT Lab. for Comput. Sci., Cambridge, MA, USA
J. Rompel , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 54-59

Fast matching algorithms for points on a polygon (PDF)

O. Marcotte , Dept. of Math.&Inf., Quebec Univ., Montral, Que., Canada
pp. 60-65

Ensemble motion planning in trees (PDF)

G.N. Frederickson , Dept. of Comput. Sci., Purdue Univ., Lafayette, IN, USA
D.J. Guan , Dept. of Comput. Sci., Purdue Univ., Lafayette, IN, USA
pp. 66-71

An upper bound on the number of planar k-sets (PDF)

J. Pach , Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary
pp. 72-79

The inverse of an automorphism in polynomial time (PDF)

M. Dickerson , Cornell Univ., Ithaca, NY, USA
pp. 82-87

Testing permutation polynomials (PDF)

J. von zur Gathen , Comput. Sci. Lab., Australian Nat. Univ., Canberra, ACT, Australia
pp. 88-92

Computing irreducible representations of finite groups (PDF)

L. Babai , Eotvos Univ., Budapest, Hungary
pp. 93-98

Galois groups and factoring polynomials over finite fields (PDF)

L. Ronyai , Hungarian Acad. of Sci., Budapest, Hungary
pp. 99-104

Efficient algorithms for independent assignment on graphic and linear matroids (PDF)

H.N. Gabow , Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
Y. Xu , Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
pp. 106-111

Flow in planar graphs with multiple sources and sinks (PDF)

G.L. Miller , Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA
pp. 112-117

A randomized maximum-flow algorithm (PDF)

J. Cheriyan , Fachbereich Inf., Saarlandes Univ., Saarbrucken, West Germany
T. Hagerup , Fachbereich Inf., Saarlandes Univ., Saarbrucken, West Germany
pp. 118-123

Graph products and chromatic numbers (PDF)

N. Linial , IBM Res. Almaden, CA, USA
pp. 124-128

Lower bounds for the stable marriage problem and its variants (PDF)

C. Ng , Dept. of Inf.&Comput. Sci., California Univ., Irvine, CA, USA
pp. 129-133

Datalog vs. first-order logic (PDF)

M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
pp. 142-147

Decidability and expressiveness for first-order logics of probability (PDF)

M. Abadi , Digital Equipment Corp., Maynard, MA, USA
pp. 148-153

Characterizations of the basic feasible functionals of finite type (PDF)

B.M. Kapron , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
S.A. Cook , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 154-159

A really temporal logic (PDF)

T.A. Henzinger , Dept. of Comput. Sci., Stanford Univ., CA, USA
R. Alur , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 164-169

Full abstraction for nondeterministic dataflow networks (PDF)

J.R. Russell , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 170-175

Efficient tree pattern matching (PDF)

S.R. Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 178-183

Pipelining computations in a tree of processors (PDF)

S.R. Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 184-189

Sorting on a parallel pointer machine with applications to set expression evaluation (PDF)

S.R. Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
M.T. Goodrich , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 190-195

Recursive *-tree parallel data-structure (PDF)

O. Berkman , Tel Aviv Univ., Israel
U. Vishkin , Tel Aviv Univ., Israel
pp. 196-202

Computational complexity of roots of real functions (PDF)

K.-I. Ko , Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
pp. 204-209

On the complexity of fixed parameter problems (PDF)

K.R. Abrahamson , Dept. of Comput. Sci., Washington State Univ., Pullman, WA, USA
pp. 210-215

Structure in locally optimal solutions (PDF)

M.W. Krentel , Dept. of Comput. Sci., Rice Univ., Houston, TX, USA
pp. 216-221

Decision versus search problems in super-polynomial time (PDF)

R. Impagliazzo , California Univ., Berkeley, CA, USA
pp. 222-227

One-way functions are essential for complexity based cryptography (PDF)

R. Impagliazzo , Dept. of Math., California Univ., Berkeley, CA, USA
pp. 230-235

Efficient cryptographic schemes provably as secure as subset sum (PDF)

M. Naor , California Univ., Berkeley, CA, USA
R. Impagliazzo , California Univ., Berkeley, CA, USA
pp. 236-241

Lower bounds for pseudorandom number generators (PDF)

A.V. Goldberg , Dept. of Comput. Sci., Stanford Univ., CA, USA
M. Kharitonov , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 242-247

How to recycle random bits (PDF)

R. Impagliazzo , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 248-253

The weighted majority algorithm (PDF)

N. Littlestone , Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA
pp. 256-261

On the complexity of learning from counterexamples (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. 262-267

The equivalence and learning of probabilistic automata (PDF)

W.-G. Tseng , Dept. of Comput. Sci., State Univ. of New York, STony Brook, NY, USA
pp. 268-273

Planning and learning in permutation groups (PDF)

A. Fiat , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
pp. 274-279

An optimal parallel algorithm for graph planarity (PDF)

V. Ramachandran , Texas Univ., Austin, TX, USA
pp. 282-287

The parallel complexity of the subgraph connectivity problem (PDF)

L. Kirousis , Comput. Technol. Inst., Patras Univ., Greece
pp. 294-299

Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph (PDF)

S. Khuller , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
V.V. Vazirani , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
S.G. Mitchell , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 300-305

Lower bounds for algebraic computation trees with integer inputs (PDF)

A.C.-C. Yao , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 308-313

Simplification of nested radicals (PDF)

S. Landau , Dept. of Math. Dept., Wesleyan Univ., Middletown, CT, USA
pp. 314-319

Generalizing the continued fraction algorithm to arbitrary dimensions (PDF)

B. Just , FB Math., Frankfurt Univ., West Germany
pp. 320-324

The complexity of approximating the square root (PDF)

Y. Mansour , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 325-330

Speeding-up linear programming using fast matrix multiplication (PDF)

P.M. Vaidya , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 332-337

A new algorithm for minimizing convex functions over convex sets (PDF)

P.M. Vaidya , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 338-343

Asymptotically fast algorithms for spherical and related transforms (PDF)

J.R. Driscoll , Dept. of Math.&Comput. Sci., Dartmouth Coll., Hanover, NH, USA
D.M. Healy , Dept. of Math.&Comput. Sci., Dartmouth Coll., Hanover, NH, USA
pp. 344-349

Polynomial end-to-end communication (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 358-363

The synchronization of nonuniform networks of finite automata (PDF)

T. Jiang , Dept. of Comput. Sci.&Syst., McMaster Univ., Hamilton, Ont., Canada
pp. 376-381

Efficient simulations of small shared memories on bounded degree networks (PDF)

K.T. Herley , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 390-395

On the network complexity of selection (PDF)

C.G. Plaxton , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 396-401

Power of fast VLSI models is insensitive to wires' thinness (PDF)

G. Itkis , Dept. of Comput. Sci., Boston Univ., MA, USA
L.A. Levin , Dept. of Comput. Sci., Boston Univ., MA, USA
pp. 402-407

Towards optimal distributed consensus (PDF)

P. Berman , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 410-415

Privacy and communication complexity (PDF)

E. Kushilevitz , Dept. of Comput. Sci., Technion, Haifa, Israel
pp. 416-421

Solvability in asynchronous environments (PDF)

L. Moscovici , Dept. of Comput. Sci., Technion, Haifa, Israel
B. Chor , Dept. of Comput. Sci., Technion, Haifa, Israel
pp. 422-427

Multiparty communication complexity (PDF)

D. Dolev , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 428-433

Incremental planarity testing (PDF)

G. Di Battista , Dipartimento di Inf. e Sistemistica, Rome Univ., Italy
pp. 436-441

Generating random spanning trees (PDF)

A. Broder , Digital Equipment Corp., Palo Alto, CA, USA
pp. 442-447

Using cellular graph embeddings in solving all pairs shortest paths problems (PDF)

G.N. Frederickson , Dept. of Comput. Sci., Purdue Univ., Lafayette, IN, USA
pp. 448-453

On the complexity of space bounded interactive proofs (PDF)

A. Condon , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
pp. 462-467

Multiparty computation with faulty majority (PDF)

D. Beaver , Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA
pp. 468-473

Minimum resource zero knowledge proofs (PDF)

S. Micali , MIT, Cambridge, MA, USA
J. Kilian , MIT, Cambridge, MA, USA
pp. 474-479

On the power of 2-way probabilistic finite state automata (PDF)

C. Dwork , IBM Almaden Res. Center, San Jose, CA, USA
L. Stockmeyer , IBM Almaden Res. Center, San Jose, CA, USA
pp. 480-485

Dynamically computing the maxima of decomposable functions, with applications (PDF)

D. Dobkin , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 488-493

Stable maintenance of point set triangulations in two dimensions (PDF)

S. Fortune , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 494-499

Area-optimal three-layer channel routing (PDF)

R. Kuchem , Tech. Hochschule Aachen, West Germany
pp. 506-511

On the computational power of PP and (+)P (PDF)

S. Toda , Dept. of Comput. Sci.&Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
pp. 514-519

Lower bounds for constant depth circuits in the presence of help bits (PDF)

J.-Y. Cai , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 532-537

Randomized search trees (PDF)

R.G. Seidel , Comput. Sci. Div., California Univ., Berkeley, CA, USA
C.R. Aragon , Comput. Sci. Div., California Univ., Berkeley, CA, USA
pp. 540-545

On the complexity of a game related to the dictionary problem (PDF)

S. Naher , FB Inf., Saarlandes Univ., Saarbruecken, West Germany
K. Mehlhorn , FB Inf., Saarlandes Univ., Saarbruecken, West Germany
M. Rauch , FB Inf., Saarlandes Univ., Saarbruecken, West Germany
pp. 546-548

Space-efficient static trees and graphs (PDF)

G. Jacobson , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 549-554

Twists, turns, cascades, deque conjecture, and scanning theorem (PDF)

R. Sundar , Courant Inst., New York Univ., NY, USA
pp. 555-559

Probabilistic communication complexity of Boolean relations (PDF)

R. Raz , Hebrew Univ., Jerusalem, Israel
A. Wigderson , Hebrew Univ., Jerusalem, Israel
pp. 562-567

Subquadratic simulations of circuits by branching programs (PDF)

R.J. Lipton , Dept. of Comput. Sci., Princeton Univ., NJ, USA
J.-Y. Cai , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 568-573

Constant depth circuits, Fourier transform, and learnability (PDF)

N. Linial , IBM Almaden Res. Center, San Jose, CA, USA
pp. 574-579

A note on the power of threshold circuits (PDF)

E. Allender , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
pp. 580-584

An optimal algorithm for intersecting three-dimensional convex polyhedra (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 586-591

On obstructions in relation to a fixed viewpoint (PDF)

K. Mulmuley , Chicago Univ., IL, USA
pp. 592-597

Output-sensitive hidden surface removal (PDF)

M. Overmars , Dept. of Comput. Sci., Utrecht Univ., Netherlands
pp. 598-603

On reversal complexity for alternating Turing machines (PDF)

K. Lorys , Inst. of Comput. Sci., Wroclaw Univ., Poland
M. Liskiewicz , Inst. of Comput. Sci., Wroclaw Univ., Poland
pp. 618-623

Every polynomial-time 1-degree collapses iff P=PSPACE (PDF)

S.A. Kurtz , Chicago Univ., IL, USA
S.A. Fenner , Chicago Univ., IL, USA
pp. 624-629
84 ms
(Ver )