Searching...
Advanced Search
F
FOCS
1982
23rd Annual Symposium on Foundations of Computer Science (FOCS 1982)
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
23rd Annual Symposium on Foundations of Computer Science (FOCS 1982)
November 03-November 05
Table of Contents
Papers
Front cover
(PDF)
pp. C1
ABSTRACT
PDF
Table of contents
(PDF)
pp. v-vii
ABSTRACT
PDF
Foreword
(PDF)
Michael J. Fischer
Seymour Ginsburg
David G. Kirkpatrick
Richard E. Ladner
Gary L. Miller
Nicholas Pippenger
Dana Scott
Leslie G. Valiant
Mihalis Yannakakis
F. Frances Yao
pp. iii
ABSTRACT
PDF
A complexity theory for unbounded fan-in parallelism
(Abstract)
Ashok K. Chandra
Larry J. Stockmeyer
Uzi Vishkin
pp. 1-13
ABSTRACT
PDF
PURCHASE ARTICLE: $19
On the complexity of unique solutions
(Abstract)
Christos H. Papadimitriou
pp. 14-20
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-complete
(Abstract)
Thiet-Dung Huynh
pp. 21-31
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The computational complexity of simultaneous Diophantine approximation problems
(Abstract)
J. C. Lagarias
pp. 32-39
ABSTRACT
PDF
PURCHASE ARTICLE: $19
A natural encoding scheme proved probabilistic polynomial complete
(Abstract)
Umesh V. Vazirani
Vijay V. Vazirani
pp. 40-44
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Three applications of Kolmogorov-complexity
(Abstract)
Stefan Reisch
Georg Schnitger
pp. 45-52
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On-line simulation of k+1 tapes by k tapes requires nonlinear time
(Abstract)
W. Paul
pp. 53-56
ABSTRACT
PDF
PURCHASE ARTICLE: $19
A polynomial-time reduction from bivariate to univariate integral polynomial factorization
(Abstract)
Erich Kaltofen
pp. 57-64
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast parallel matrix and GCD computations
(Abstract)
Allan Borodin
Joachim von zur Gathem
John Hopcroft
pp. 65-71
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Generalised symmetries of polynomials in algebraic complexity
(Abstract)
C. Sturtivant
pp. 72-79
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Theory and application of trapdoor functions
(Abstract)
Andrew C. Yao
pp. 80-91
ABSTRACT
PDF
PURCHASE ARTICLE: $19
An application of number theory to the organization of raster-graphics memory
(Abstract)
Benny Chor
Charles E. Leiserson
Ronald L. Rivest
pp. 92-99
ABSTRACT
PDF
PURCHASE ARTICLE: $19
An application of higher reciprocity to computational number theory
(Abstract)
Leonard M. Adleman
Robert McDonnell
pp. 100-106
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Probabilistic analysis of some bin-packing problems
(Abstract)
Narendra Karmarkar
pp. 107-111
ABSTRACT
PDF
PURCHASE ARTICLE: $19
How to generate cryptographically strong sequences of pseudo random bits
(Abstract)
Manuel Blum
Silvio Micali
pp. 112-117
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs
(Abstract)
Zvi Galil
Christof M. Hoffmann
Eugene M. Luks
Claus P. Schnorr
Andreas Weber
pp. 118-125
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A compact representation for permutation groups
(Abstract)
Mark Jerrum
pp. 126-133
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Why and how to establish a private code on a public network
(Abstract)
Shafi Goldwasser
Silvio Micali
Po Tong
pp. 134-144
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
(Abstract)
Adi Shamir
pp. 145-152
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Inferring a sequence generated by a linear congruence
(Abstract)
Joan B. Plumstead
pp. 153-159
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Protocols for secure computations
(Abstract)
Andrew C. Yao
pp. 160-164
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Storing a sparse table with O(1) worst case access time
(Abstract)
Michael L. Fredman
Janos Komlos
Endre Szemeredi
pp. 165-169
ABSTRACT
PDF
PURCHASE ARTICLE: $19
On the program size of perfect and universal hash functions
(Abstract)
Kurt Mehlhorn
pp. 170-175
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On decomposition of relational databases
(Abstract)
Moshe Y. Vardi
pp. 176-185
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Generic transformation of data structures
(Abstract)
Colm O'Dunlaing
Chee K. Yap
pp. 186-195
ABSTRACT
PDF
PURCHASE ARTICLE: $19
'Eventual' is earlier than 'immediate'
(Abstract)
Danny Dolev
Ruediger Reischuk
H. Raymond Strong
pp. 196-203
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Deterministic process logic is elementary
(Abstract)
Joseph Y. Halpern
pp. 204-216
ABSTRACT
PDF
PURCHASE ARTICLE: $19
A temporal logic to deal with fairness in transition systems
(Abstract)
J. P. Queille
J. Sifakis
pp. 217-225
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On equations including string variables
(Abstract)
Kazuo Iwama
pp. 226-235
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Substitution of bounded rational cone
(Abstract)
Joffroy Beauquier
Michel Latteux
pp. 236-243
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel algorithms for minimum cuts and maximum flows in planar networks
(Abstract)
Donald B. Johnson
Shankar M. Venkatesan
pp. 244-254
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs
(Abstract)
Zvi Galil
Silvio Micali
Harold Gabow
pp. 255-261
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Polynomial time algorithms for the MIN CUT problem on degree restricted trees
(Abstract)
Moon-Jung Chung
Fillia Makedon
Ivan Hal Sudborough
Jonathan Turner
pp. 262-271
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Using clerk in parallel processing
(Abstract)
Quentin F. Stout
pp. 272-279
ABSTRACT
PDF
PURCHASE ARTICLE: $19
On the movement of robot arms in 2-dimensional bounded regions
(Abstract)
John Hopcroft
Deborah Joseph
Sue Whitesides
pp. 280-289
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Parallel time O(log N) acceptance of deterministic CFLs
(Abstract)
John Reif
pp. 290-296
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Wafer-scale integration of systolic arrays
(Abstract)
Frank Thomson Leighton
Charles E. Leiserson
pp. 297-311
ABSTRACT
PDF
PURCHASE ARTICLE: $19
An efficient approximation scheme for the one-dimensional bin-packing problem
(Abstract)
Narendra Karmarkar
Richard M. Karp
pp. 312-320
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The ellipsoid algorithm for linear inequalities in exact arithmetic
(Abstract)
Silvio Ursic
pp. 321-326
ABSTRACT
PDF
PURCHASE ARTICLE: $19
An old linear programming algorithm runs in polynomial time
(Abstract)
Boris Yamnitsky
Leonid A. Levin
pp. 327-328
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Linear-time algorithms for linear programming in R3 and related problems
(Abstract)
Nimrod Megiddo
pp. 329-338
ABSTRACT
PDF
PURCHASE ARTICLE: $19
A theorem on polygon cutting with applications
(Abstract)
Bernard Chazelle
pp. 339-349
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Three layers are enough
(Abstract)
Franco P. Preparata
Witold Lipski
pp. 350-357
ABSTRACT
PDF
PURCHASE ARTICLE: $19
The complexity of compacting hierarchically specified layouts of integrated circuits
(Abstract)
Thomas Lengauer
pp. 358-368
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On driving many long lines in a VLSI layout
(Abstract)
Vijaya Ramachandran
pp. 369-378
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Optimal allocation of computational resources in VLSI
(Abstract)
Zvi M. Kedem
pp. 379-385
ABSTRACT
PDF
PURCHASE ARTICLE: $19
Author index
(PDF)
pp. 387
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
