1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 1982
Default Cover Image

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)

Nov. 3 1982 to Nov. 5 1982

ISSN: 0272-5428

Table of Contents

A complexity theory for unbounded fan-in parallelismFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
The computational complexity of simultaneous Diophantine approximation problemsFull-text access may be available. Sign in or learn about subscription options.pp. 32-39
by J. C. Lagarias
Papers
A complexity theory for unbounded fan-in parallelismFull-text access may be available. Sign in or learn about subscription options.pp. 1-13
by Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
Papers
On the complexity of unique solutionsFull-text access may be available. Sign in or learn about subscription options.pp. 14-20
by Christos H. Papadimitriou
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemFull-text access may be available. Sign in or learn about subscription options.pp. 145-152
by Adi Shamir
Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-completeFull-text access may be available. Sign in or learn about subscription options.pp. 21-31
by Thiet-Dung Huynh
Papers
A natural encoding scheme proved probabilistic polynomial completeFull-text access may be available. Sign in or learn about subscription options.pp. 40-44
by Umesh V. Vazirani, Vijay V. Vazirani
Storing a sparse table with O(1) worst case access timeFull-text access may be available. Sign in or learn about subscription options.pp. 165-169
by Michael L. Fredman, Janos Komlos, Endre Szemeredi
Papers
Three applications of Kolmogorov-complexityFull-text access may be available. Sign in or learn about subscription options.pp. 45-52
by Stefan Reisch, Georg Schnitger
Papers
On-line simulation of k+1 tapes by k tapes requires nonlinear timeFull-text access may be available. Sign in or learn about subscription options.pp. 53-56
by W. Paul
Papers
A polynomial-time reduction from bivariate to univariate integral polynomial factorizationFull-text access may be available. Sign in or learn about subscription options.pp. 57-64
by Erich Kaltofen
Generic transformation of data structuresFull-text access may be available. Sign in or learn about subscription options.pp. 186-195
by Colm O'Dunlaing, Chee K. Yap
Papers
Fast parallel matrix and GCD computationsFull-text access may be available. Sign in or learn about subscription options.pp. 65-71
by Allan Borodin, Joachim von zur Gathem, John Hopcroft
Papers
Generalised symmetries of polynomials in algebraic complexityFull-text access may be available. Sign in or learn about subscription options.pp. 72-79
by C. Sturtivant
Papers
Theory and application of trapdoor functionsFull-text access may be available. Sign in or learn about subscription options.pp. 80-91
by Andrew C. Yao
Papers
An application of number theory to the organization of raster-graphics memoryFull-text access may be available. Sign in or learn about subscription options.pp. 92-99
by Benny Chor, Charles E. Leiserson, Ronald L. Rivest
Papers
An application of higher reciprocity to computational number theoryFull-text access may be available. Sign in or learn about subscription options.pp. 100-106
by Leonard M. Adleman, Robert McDonnell
Papers
Probabilistic analysis of some bin-packing problemsFull-text access may be available. Sign in or learn about subscription options.pp. 107-111
by Narendra Karmarkar
Papers
How to generate cryptographically strong sequences of pseudo random bitsFull-text access may be available. Sign in or learn about subscription options.pp. 112-117
by Manuel Blum, Silvio Micali
Papers
An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphsFull-text access may be available. Sign in or learn about subscription options.pp. 118-125
by Zvi Galil, Christof M. Hoffmann, Eugene M. Luks, Claus P. Schnorr, Andreas Weber
Papers
A compact representation for permutation groupsFull-text access may be available. Sign in or learn about subscription options.pp. 126-133
by Mark Jerrum
Papers
Why and how to establish a private code on a public networkFull-text access may be available. Sign in or learn about subscription options.pp. 134-144
by Shafi Goldwasser, Silvio Micali, Po Tong
Papers
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemFull-text access may be available. Sign in or learn about subscription options.pp. 145-152
by Adi Shamir
Papers
Inferring a sequence generated by a linear congruenceFull-text access may be available. Sign in or learn about subscription options.pp. 153-159
by Joan B. Plumstead
Papers
Protocols for secure computationsFull-text access may be available. Sign in or learn about subscription options.pp. 160-164
by Andrew C. Yao
Papers
Storing a sparse table with O(1) worst case access timeFull-text access may be available. Sign in or learn about subscription options.pp. 165-169
by Michael L. Fredman, Janos Komlos, Endre Szemeredi
Papers
On the program size of perfect and universal hash functionsFull-text access may be available. Sign in or learn about subscription options.pp. 170-175
by Kurt Mehlhorn
Papers
On decomposition of relational databasesFull-text access may be available. Sign in or learn about subscription options.pp. 176-185
by Moshe Y. Vardi
Papers
Generic transformation of data structuresFull-text access may be available. Sign in or learn about subscription options.pp. 186-195
by Colm O'Dunlaing, Chee K. Yap
Papers
'Eventual' is earlier than 'immediate'Full-text access may be available. Sign in or learn about subscription options.pp. 196-203
by Danny Dolev, Ruediger Reischuk, H. Raymond Strong
Papers
Deterministic process logic is elementaryFull-text access may be available. Sign in or learn about subscription options.pp. 204-216
by Joseph Y. Halpern
Papers
A temporal logic to deal with fairness in transition systemsFull-text access may be available. Sign in or learn about subscription options.pp. 217-225
by J. P. Queille, J. Sifakis
Papers
On equations including string variablesFull-text access may be available. Sign in or learn about subscription options.pp. 226-235
by Kazuo Iwama
Substitution of bounded rational coneFull-text access may be available. Sign in or learn about subscription options.pp. 236-243
by Joffroy Beauquier, Michel Latteux
Papers
Parallel algorithms for minimum cuts and maximum flows in planar networksFull-text access may be available. Sign in or learn about subscription options.pp. 244-254
by Donald B. Johnson, Shankar M. Venkatesan
Papers
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphsFull-text access may be available. Sign in or learn about subscription options.pp. 255-261
by Zvi Galil, Silvio Micali, Harold Gabow
Papers
Polynomial time algorithms for the MIN CUT problem on degree restricted treesFull-text access may be available. Sign in or learn about subscription options.pp. 262-271
by Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan Turner
Papers
Using clerk in parallel processingFull-text access may be available. Sign in or learn about subscription options.pp. 272-279
by Quentin F. Stout
Papers
On the movement of robot arms in 2-dimensional bounded regionsFull-text access may be available. Sign in or learn about subscription options.pp. 280-289
by John Hopcroft, Deborah Joseph, Sue Whitesides
Papers
Parallel time O(log N) acceptance of deterministic CFLsFull-text access may be available. Sign in or learn about subscription options.pp. 290-296
by John Reif
Papers
Wafer-scale integration of systolic arraysFull-text access may be available. Sign in or learn about subscription options.pp. 297-311
by Frank Thomson Leighton, Charles E. Leiserson
Papers
An efficient approximation scheme for the one-dimensional bin-packing problemFull-text access may be available. Sign in or learn about subscription options.pp. 312-320
by Narendra Karmarkar, Richard M. Karp
Papers
The ellipsoid algorithm for linear inequalities in exact arithmeticFull-text access may be available. Sign in or learn about subscription options.pp. 321-326
by Silvio Ursic
Papers
An old linear programming algorithm runs in polynomial timeFull-text access may be available. Sign in or learn about subscription options.pp. 327-328
by Boris Yamnitsky, Leonid A. Levin
Papers
Linear-time algorithms for linear programming in R3 and related problemsFull-text access may be available. Sign in or learn about subscription options.pp. 329-338
by Nimrod Megiddo
Papers
A theorem on polygon cutting with applicationsFull-text access may be available. Sign in or learn about subscription options.pp. 339-349
by Bernard Chazelle
Papers
Three layers are enoughFull-text access may be available. Sign in or learn about subscription options.pp. 350-357
by Franco P. Preparata, Witold Lipski
Papers
The complexity of compacting hierarchically specified layouts of integrated circuitsFull-text access may be available. Sign in or learn about subscription options.pp. 358-368
by Thomas Lengauer
Papers
On driving many long lines in a VLSI layoutFull-text access may be available. Sign in or learn about subscription options.pp. 369-378
by Vijaya Ramachandran
Papers
Optimal allocation of computational resources in VLSIFull-text access may be available. Sign in or learn about subscription options.pp. 379-385
by Zvi M. Kedem
Papers
Author indexFreely available from IEEE.pp. 387
Showing 51 out of 51