CSDL - Proceedings F

F
FOCS
1989
30th Annual Symposium on Foundations of Computer Science (FOCS 1989]

This Publication

Digital Library

	This Publication

	Subscribe to this Publication Login to access your subscribed content
	Bibliographic References
	ASCII Text BibTex Refworks Procite/RefMan

30th Annual Symposium on Foundations of Computer Science (FOCS 1989]

Research Triangle Park, NC, USA

October 30-November 01

ISBN: 0-8186-1982-1

Table of Contents

Papers

30th Annual Symposium on Foundations of Computer Science (Cat. No.89CH2808-4) (PDF)

pp. 0_1-

ABSTRACT

PDF

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

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

J. Rompel, MIT Lab. for Comput. Sci., Cambridge, MA, USA

pp. 2-7

ABSTRACT

PDF

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

M. Naor

pp. 8-13

ABSTRACT

PDF

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

A. Cohen, Hebrew Univ., Jerusalem, Israel

A. Wigderson, Hebrew Univ., Jerusalem, Israel

pp. 14-19

ABSTRACT

PDF

On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications (PDF)

A. Siegel, Dept. of Comput. Sci., Stanford Univ., CA, USA

pp. 20-25

ABSTRACT

PDF

The strength of weak learnability (PDF)

R.E. Schapire, MIT Lab. for Comput. Sci., Cambridge, MA, USA

pp. 28-33

ABSTRACT

PDF

A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution (PDF)

M. Li, Dept. of Comput. Sci., York Univ., North York, Ont., Canada

P.M.B. Vitanyi

pp. 34-39

ABSTRACT

PDF

Generalizing the PAC model: sample size bounds from metric dimension-based uniform convergence results (PDF)

D. Haussler, California Univ., Santa Cruz, CA, USA

pp. 40-45

ABSTRACT

PDF

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

ABSTRACT

PDF

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

P.W. Shor

pp. 54-59

ABSTRACT

PDF

Fast matching algorithms for points on a polygon (PDF)

O. Marcotte, Dept. of Math.&Inf., Quebec Univ., Montral, Que., Canada

S. Suri

pp. 60-65

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

Testing permutation polynomials (PDF)

J. von zur Gathen, Comput. Sci. Lab., Australian Nat. Univ., Canberra, ACT, Australia

pp. 88-92

ABSTRACT

PDF

Computing irreducible representations of finite groups (PDF)

L. Babai, Eotvos Univ., Budapest, Hungary

L. Ronyai

pp. 93-98

ABSTRACT

PDF

Galois groups and factoring polynomials over finite fields (PDF)

L. Ronyai, Hungarian Acad. of Sci., Budapest, Hungary

pp. 99-104

ABSTRACT

PDF

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

ABSTRACT

PDF

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

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

J. Naor

pp. 112-117

ABSTRACT

PDF

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

ABSTRACT

PDF

Graph products and chromatic numbers (PDF)

N. Linial, IBM Res. Almaden, CA, USA

U. Vazirani

pp. 124-128

ABSTRACT

PDF

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

ABSTRACT

PDF

Approximation schemes for constrained scheduling problems (PDF)

L.A. Hall, MIT, Cambridge, MA, USA

D.B. Shmoys

pp. 134-139

ABSTRACT

PDF

Datalog vs. first-order logic (PDF)

M. Ajtai, IBM Almaden Res. Center, San Jose, CA, USA

Y. Gurevich

pp. 142-147

ABSTRACT

PDF

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

M. Abadi, Digital Equipment Corp., Maynard, MA, USA

J.Y. Halpern

pp. 148-153

ABSTRACT

PDF

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

S.A. Cook, Dept. of Comput. Sci., Toronto Univ., Ont., Canada

B.M. Kapron, Dept. of Comput. Sci., Toronto Univ., Ont., Canada

pp. 154-159

ABSTRACT

PDF

The 0-1 law fails for the class of existential second order Godel sentences with equality (PDF)

L. Pacholski, Inst. of Math., Polish Acad. of Sci., Wroclaw, Poland

W. Szwast

pp. 160-163

ABSTRACT

PDF

A really temporal logic (PDF)

R. Alur, Dept. of Comput. Sci., Stanford Univ., CA, USA

T.A. Henzinger, Dept. of Comput. Sci., Stanford Univ., CA, USA

pp. 164-169

ABSTRACT

PDF

Full abstraction for nondeterministic dataflow networks (PDF)

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

pp. 170-175

ABSTRACT

PDF

Efficient tree pattern matching (PDF)

S.R. Kosaraju, Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

pp. 178-183

ABSTRACT

PDF

Pipelining computations in a tree of processors (PDF)

S.R. Kosaraju, Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

pp. 184-189

ABSTRACT

PDF

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

M.T. Goodrich, Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

S.R. Kosaraju, Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

pp. 190-195

ABSTRACT

PDF

Recursive *-tree parallel data-structure (PDF)

O. Berkman, Tel Aviv Univ., Israel

U. Vishkin, Tel Aviv Univ., Israel

pp. 196-202

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

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

R. Impagliazzo, California Univ., Berkeley, CA, USA

G. Tardos

pp. 222-227

ABSTRACT

PDF

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

R. Impagliazzo, Dept. of Math., California Univ., Berkeley, CA, USA

M. Luby

pp. 230-235

ABSTRACT

PDF

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

R. Impagliazzo, California Univ., Berkeley, CA, USA

M. Naor, California Univ., Berkeley, CA, USA

pp. 236-241

ABSTRACT

PDF

Lower bounds for pseudorandom number generators (PDF)

M. Kharitonov, Dept. of Comput. Sci., Stanford Univ., CA, USA

A.V. Goldberg, Dept. of Comput. Sci., Stanford Univ., CA, USA

M. Yung

pp. 242-247

ABSTRACT

PDF

How to recycle random bits (PDF)

R. Impagliazzo, Dept. of Comput. Sci., Toronto Univ., Ont., Canada

D. Zuckerman

pp. 248-253

ABSTRACT

PDF

The weighted majority algorithm (PDF)

N. Littlestone, Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA

M.K. Warmuth

pp. 256-261

ABSTRACT

PDF

On the complexity of learning from counterexamples (PDF)

W. Maass, Dept. of Math., Stat.,&Comput. Sci., Illinois Univ., Chicago, IL, USA

G. Turan, Dept. of Math., Stat.,&Comput. Sci., Illinois Univ., Chicago, IL, USA

pp. 262-267

ABSTRACT

PDF

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

ABSTRACT

PDF

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

J. Reif

pp. 282-287

ABSTRACT

PDF

Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs (PDF)

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

B. Schieber

pp. 288-293

ABSTRACT

PDF

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

S.G. Mitchell, Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

V.V. Vazirani, Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

pp. 300-305

ABSTRACT

PDF

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

ABSTRACT

PDF

Simplification of nested radicals (PDF)

S. Landau, Dept. of Math. Dept., Wesleyan Univ., Middletown, CT, USA

pp. 314-319

ABSTRACT

PDF

Generalizing the continued fraction algorithm to arbitrary dimensions (PDF)

B. Just, FB Math., Frankfurt Univ., West Germany

pp. 320-324

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

Interior-point methods in parallel computation (PDF)

A.V. Goldberg, Stanford Univ, CA, USA

pp. 350-355

Polynomial end-to-end communication (PDF)

B. Awerbuch, Dept. of Math., MIT, Cambridge, MA, USA

pp. 358-363

Network decomposition and locality in distributed computation (PDF)

B. Awerbuch, MIT, Cambridge, MA, USA

M. Luby

pp. 364-369

Upper and lower bounds for routing schemes in dynamic networks (PDF)

Y. Afek, AT&T Bell Labs., Murray Hill, NJ, USA

pp. 370-375

The synchronization of nonuniform networks of finite automata (PDF)

T. Jiang, Dept. of Comput. Sci.&Syst., McMaster Univ., Hamilton, Ont., Canada

pp. 376-381

ABSTRACT

PDF

Expanders might be practical: fast algorithms for routing around faults on multibutterflies (PDF)

T. Leighton, Dept. of Math., MIT, Cambridge, MA, USA

B. Maggs

pp. 384-389

ABSTRACT

PDF

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

ABSTRACT

PDF

On the network complexity of selection (PDF)

C.G. Plaxton, Dept. of Comput. Sci., Stanford Univ., CA, USA

pp. 396-401

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

Solvability in asynchronous environments (PDF)

B. Chor, Dept. of Comput. Sci., Technion, Haifa, Israel

L. Moscovici, Dept. of Comput. Sci., Technion, Haifa, Israel

pp. 422-427

ABSTRACT

PDF

Multiparty communication complexity (PDF)

D. Dolev, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

T. Feder

pp. 428-433

ABSTRACT

PDF

Incremental planarity testing (PDF)

G. Di Battista, Dipartimento di Inf. e Sistemistica, Rome Univ., Italy

R. Tamassia

pp. 436-441

ABSTRACT

PDF

Generating random spanning trees (PDF)

A. Broder, Digital Equipment Corp., Palo Alto, CA, USA

pp. 442-447

ABSTRACT

PDF

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

ABSTRACT

PDF

An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (PDF)

E. Dahlhaus, Dept. of Comput. Sci., Bonn Univ., West Germany

M. Karpinski

pp. 454-459

ABSTRACT

PDF

On the complexity of space bounded interactive proofs (PDF)

A. Condon, Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA

R.J. Lipton

pp. 462-467

ABSTRACT

PDF

Multiparty computation with faulty majority (PDF)

D. Beaver, Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA

S. Goldwasser

pp. 468-473

ABSTRACT

PDF

Minimum resource zero knowledge proofs (PDF)

J. Kilian, MIT, Cambridge, MA, USA

S. Micali, MIT, Cambridge, MA, USA

R. Ostrovsky

pp. 474-479

ABSTRACT

PDF

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

ABSTRACT

PDF

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

D. Dobkin, Dept. of Comput. Sci., Princeton Univ., NJ, USA

S. Suri

pp. 488-493

ABSTRACT

PDF

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

S. Fortune, AT&T Bell Labs., Murray Hill, NJ, USA

pp. 494-499

ABSTRACT

PDF

Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic (PDF)

V. Milenkovic, Harvard Univ., Cambridge, MA, USA

pp. 500-505

ABSTRACT

PDF

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

ABSTRACT

PDF

An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations (PDF)

M.R. Fellows, Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA

M.A. Langston

pp. 520-525

ABSTRACT

PDF

Conductance and convergence of Markov chains-a combinatorial treatment of expanders (PDF)

M. Mihail, Harvard Univ., Cambridge, MA, USA

pp. 526-531

ABSTRACT

PDF

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

ABSTRACT

PDF

Randomized search trees (PDF)

C.R. Aragon, Comput. Sci. Div., California Univ., Berkeley, CA, USA

R.G. Seidel, Comput. Sci. Div., California Univ., Berkeley, CA, USA

pp. 540-545

ABSTRACT

PDF

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

K. Mehlhorn, FB Inf., Saarlandes Univ., Saarbruecken, West Germany

S. Naher, FB Inf., Saarlandes Univ., Saarbruecken, West Germany

M. Rauch, FB Inf., Saarlandes Univ., Saarbruecken, West Germany

pp. 546-548

ABSTRACT

PDF

Space-efficient static trees and graphs (PDF)

G. Jacobson, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

pp. 549-554

ABSTRACT

PDF

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

R. Sundar, Courant Inst., New York Univ., NY, USA

pp. 555-559

ABSTRACT

PDF

Probabilistic communication complexity of Boolean relations (PDF)

R. Raz, Hebrew Univ., Jerusalem, Israel

A. Wigderson, Hebrew Univ., Jerusalem, Israel

pp. 562-567

ABSTRACT

PDF

Subquadratic simulations of circuits by branching programs (PDF)

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

R.J. Lipton, Dept. of Comput. Sci., Princeton Univ., NJ, USA

pp. 568-573

ABSTRACT

PDF

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

ABSTRACT

PDF

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

B. Chazelle, Dept. of Comput. Sci., Princeton Univ., NJ, USA

pp. 586-591

ABSTRACT

PDF

On obstructions in relation to a fixed viewpoint (PDF)

K. Mulmuley, Chicago Univ., IL, USA

pp. 592-597

ABSTRACT

PDF

Output-sensitive hidden surface removal (PDF)

M. Overmars, Dept. of Comput. Sci., Utrecht Univ., Netherlands

M. Sharir

pp. 598-603

ABSTRACT

PDF

Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems (PDF)

M.D. Hansen, Dept. of Math., MIT, Cambridge, MA, USA

pp. 604-609

ABSTRACT

PDF

An optimal lower bound on the number of variables for graph identification (PDF)

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

pp. 612-617

On reversal complexity for alternating Turing machines (PDF)

M. Liskiewicz, Inst. of Comput. Sci., Wroclaw Univ., Poland

K. Lorys, Inst. of Comput. Sci., Wroclaw Univ., Poland

pp. 618-623

ABSTRACT

PDF

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

S.A. Fenner, Chicago Univ., IL, USA

S.A. Kurtz, Chicago Univ., IL, USA

J.A. Royer

pp. 624-629

ABSTRACT

PDF

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.

Open
Download