Searching...
Advanced Search
F
FOCS
1986
27th Annual Symposium on Foundations of Computer Science (FOCS 1986)
This Publication
Digital Library
Advanced Search
This Publication
Subscribe to this Publication
Login to access your subscribed content
Bibliographic References
ASCII Text
BibTex
RefWorks Procite/RefMan/EndNote
27th Annual Symposium on Foundations of Computer Science (FOCS 1986)
October 27-October 29
ISBN: 0-8186-0740-8
Table of Contents
Papers
Front cover
(PDF)
pp. C1
ABSTRACT
PDF
Table of contents
(PDF)
pp. xi-xiv
ABSTRACT
PDF
Foreword
(PDF)
pp. iii
ABSTRACT
PDF
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
(Abstract)
Prabhakar Raghavan
pp. 10-18
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On a search problem related to branch-and-bound procedures
(Abstract)
R. M. Karp
M. Saks
A. Wigderson
pp. 19-28
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Probabilistic Boolean decision trees and the complexity of evaluating game trees
(Abstract)
Michael Saks
Avi Wigderson
pp. 29-38
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The asymptotic spectrum of tensors and the exponent of matrix multiplication
(Abstract)
V. Strassen
pp. 49-54
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Storing a dynamic sparse table
(Abstract)
Alfred V. Aho
David Lee
pp. 55-60
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower bounds for accessing binary search trees with rotations
(Abstract)
Robert Wilber
pp. 61-70
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
What search algorithm gives optimal average-case performance when search resources are highly limited?
(Abstract)
David Mutchler
pp. 71-76
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Geometric applications of Davenport-Schinzel sequences
(Abstract)
Micha Sharir
Richard Cole
Klara Kedem
Daniel Leven
Richard Pollack
Shmuel Sifrony
pp. 77-86
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower bounds on the complexity of multidimensional searching
(Abstract)
Bernard Chazelle
pp. 87-96
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
(Abstract)
Ady Wiernik
pp. 97-106
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Proving by example and gap theorems
(Abstract)
Jiawei Hong
pp. 107-116
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An algorithm for constructing the aspect graph
(Abstract)
W. Harry Plantinga
Charles R. Dyer
pp. 123-131
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An algorithmic approach to the automated design of parts orienters
(Abstract)
B. K. Natarajan
pp. 132-142
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Finite-resolution computational geometry
(Abstract)
Daniel H. Greene
F. Frances Yao
pp. 143-152
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On Newton's method for polynomials
(Abstract)
Joel Friedman
pp. 153-161
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
How to generate and exchange secrets
(Abstract)
Andrew Chi-Chih Yao
pp. 162-167
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Information theoretic reductions among disclosure problems
(Abstract)
Gilles Brassard
Claude Crepeau
Jean-Marc Robert
pp. 168-173
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
(Abstract)
Oded Goldreich
Silvio Micali
Avi Wigderson
pp. 174-187
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
(Abstract)
Gilles Brassard
Claude Crepeau
pp. 188-195
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Dynamic deadlock resolution protocols
(Abstract)
Baruch Awerbuch
Silvio Micali
pp. 196-207
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Programming simultaneous actions using common knowledge: Preliminary version
(Abstract)
Yoram Moses
Mark R. Tuttle
pp. 208-221
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Flipping persuasively in constant expected time
(Abstract)
Cynthia Dwork
David Shmoys
Larry Stockmeyer
pp. 222-232
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Atomic shared register access by asynchronous hardware
(Abstract)
Paul M. B. Vitanyi
Baruch Awerbuch
pp. 233-243
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Competitive snoopy caching
(Abstract)
Anna R. Karlin
Mark S. Manasse
Larry Rudolph
Daniel D. Sleator
pp. 244-254
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The distance bound for sorting on mesh-connected processor arrays is tight
(Abstract)
Yiming Ma
Sandeep Sen
Isaac D. Scherson
pp. 255-263
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Meshes with multiple buses
(Abstract)
Quentin F. Stout
pp. 264-273
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Optimal simulations of tree machines
(Abstract)
Sandeep Bhatt
Fan Chung
Tom Leighton
Arnold Rosenberg
pp. 274-282
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
How robust is the n-cube?
(Abstract)
Bernd Becker
Hans-Ulrich Simon
pp. 283-291
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel algorithms for permutation groups and graph isomorphism
(Abstract)
Eugene M. Luks
pp. 292-302
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of isomorphism testing
(Abstract)
Max Garzon
Yechezkel Zalcstein
pp. 313-321
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
FFD bin packing for item sizes with distributions on [0,1/2]
(Abstract)
Sally Floyd
Richard Karp
pp. 322-330
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast solution of some random NP-hard problems
(Abstract)
M. E. Dyer
A. M. Frieze
pp. 331-336
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Complexity classes in communication complexity theory
(Abstract)
Laszlo Babai
Peter Frankl
Janos Simon
pp. 337-347
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A new pebble game that characterizes parallel complexity classes
(Abstract)
H. Venkateswaran
Martin Tompa
pp. 348-360
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
k+1 heads are better than k for PDA's
(Abstract)
Marek Chrobak
Ming Li
pp. 361-367
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the power of interaction
(Abstract)
William Aiellot
Shafi Goldwasser
Johan Hastad
pp. 368-379
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Collapsing degrees
(Abstract)
Stuart A. Kurtz
Stephen R. Mahaney
James S. Royert
pp. 380-389
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Three results on the polynomial isomorphism of complete sets
(Abstract)
Judy Goldsmith
Deborah Joseph
pp. 390-397
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Permanent and determinant
(Abstract)
Joachim von zur Gathen
pp. 398-401
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Time-space tradeoffs for branching programs contrasted with those for straight-line programs
(Abstract)
Karl Abrahamson
pp. 402-409
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Meanders, Ramsey theory and lower bounds for branching programs
(Abstract)
Noga Alon
Wolfgang Maass
pp. 410-417
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The token distribution problem
(Abstract)
David Peleg
Eli Upfal
pp. 418-427
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Separator-based strategies for efficient message routing
(Abstract)
Greg N. Frederickson
Ravi Janardan
pp. 428-437
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel complexity of logical query programs
(Abstract)
Jeffrey D. Ullman
Allen Van Gelder
pp. 438-454
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the power one-way communication
(Abstract)
Jik H. Chang
Oscar H. Ibarra
Anastasios Vergis
pp. 455-464
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An efficient parallel algorithm for planarity
(Abstract)
Philip N. Klein
John H. Reif
pp. 465-477
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximate and exact parallel scheduling with applications to list, tree and graph problems
(Abstract)
Richard Cole
Uzi Vishkin
pp. 478-491
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An optimal randomized parallel algorithm for finding connected components in a graph
(Abstract)
Hillel Gazit
pp. 492-501
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Tight complexity bounds for parallel comparison sorting
(Abstract)
Noga Alon
Yossi Azar
Uzi Vishkin
pp. 502-510
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel merge sort
(Abstract)
Richard Cole
pp. 511-516
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author index
(PDF)
pp. 517
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
Print and Online Advertising Opportunities
