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

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)

Oct. 28 1981 to Oct. 30 1981

ISSN: 0272-5428

Table of Contents

Papers
Table of contentsFreely available from IEEE.pp. vii-ix
Papers
New lower bound techniques for VLSIFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
by Frank Thomson Leighton
Papers
Census functions: An approach to VLSI upper boundsFull-text access may be available. Sign in or learn about subscription options.pp. 13-22
by Richard J. Lipton, Jacobo Valdes
Papers
Optimizing synchronous systemsFull-text access may be available. Sign in or learn about subscription options.pp. 23-36
by Charles E. Leiserson, James B. Saxe
Papers
On relations between input and communication/computation in VLSIFull-text access may be available. Sign in or learn about subscription options.pp. 37-44
by Zvi M. Kedem, Alessandro Zorat
Papers
Two-way counter machines and Diophantine equationsFull-text access may be available. Sign in or learn about subscription options.pp. 45-52
by Eitan M. Gurari, Oscar H. Ibarra
Papers
A time-space tradeoff for language recongnitionFull-text access may be available. Sign in or learn about subscription options.pp. 53-57
by Pavol Duris, Zvi Galil
Papers
Simulations among multidimensional turing machinesFull-text access may be available. Sign in or learn about subscription options.pp. 58-67
by Michael C. Loui
Papers
On heads versus tapesFull-text access may be available. Sign in or learn about subscription options.pp. 68-73
by W. Paul
Papers
On the equivalence and containment problems for unambiguous regular expressions, grammars, and automataFull-text access may be available. Sign in or learn about subscription options.pp. 74-81
by Richard E. Stearns, Harry B. Hunt
Papers
On the asymptotic complexity of matrix multiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 82-90
by D. Coppersmith, S. Winograd
Papers
On the direct sum conjectureFull-text access may be available. Sign in or learn about subscription options.pp. 91-94
by Ephraim Feig, Shumel Winograd
Papers
Computation of algebraic functions with root extractionsFull-text access may be available. Sign in or learn about subscription options.pp. 95-100
by Joseph Ja Ja
Papers
An O(N4/3) lower bound on the mono tone network complexity of N-TH degree convolutionFull-text access may be available. Sign in or learn about subscription options.pp. 101-108
by Norbert Blum
Time-space trade-offs for general recursionFull-text access may be available. Sign in or learn about subscription options.pp. 228-234
by Rutger Verbeek
Papers
Non-existence of one-dimensional expanding graphsFull-text access may be available. Sign in or learn about subscription options.pp. 109-114
by Maria Klawe
Papers
A minimum spanning ellipse algorithmFull-text access may be available. Sign in or learn about subscription options.pp. 115-122
by Mark J. Post
Papers
A direct dynamic solution to range search and related problems for product regionsFull-text access may be available. Sign in or learn about subscription options.pp. 123-126
by Z. Aviad, E. Shamir
Papers
Deletion algorithms for hashing that preserve randomnessFull-text access may be available. Sign in or learn about subscription options.pp. 127-132
by Jeffrey Scott Vitter
Papers
Implicit data structures for the weighted dictionary problemFull-text access may be available. Sign in or learn about subscription options.pp. 133-139
by Greg N. Frederickson
Papers
Possible futures, acceptances, refusals, and communicating processesFull-text access may be available. Sign in or learn about subscription options.pp. 140-149
by W. C. Rounds, S. D. Brookes
Papers
Symmetry breaking in distributive networksFull-text access may be available. Sign in or learn about subscription options.pp. 150-158
by Alon Itai, Michael Rodeh
Papers
Unanimity in an unknown and unreliable environmentFull-text access may be available. Sign in or learn about subscription options.pp. 159-168
by D. Dolev
Papers
Symmetry in systems of asynchronous processesFull-text access may be available. Sign in or learn about subscription options.pp. 169-174
by James E. Burns
Papers
A model of concurrent database transactionsFull-text access may be available. Sign in or learn about subscription options.pp. 175-184
by Ravi Sethi
Papers
The complexity of distributed concurrency controlFull-text access may be available. Sign in or learn about subscription options.pp. 185-197
by Paris C. Kanellakis, Christos H. Papadimitriou
Papers
Global decision problems for relational databasesFull-text access may be available. Sign in or learn about subscription options.pp. 198-202
by M. Y. Vardi
Papers
Optimizing conjunctive queries when attribute domains are not disjointFull-text access may be available. Sign in or learn about subscription options.pp. 203-211
by D. S. Johnson, A. Klug
Papers
A fast probabilistic parallel sorting algorithmFull-text access may be available. Sign in or learn about subscription options.pp. 212-219
by Rudiger Reischuk
Papers
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problemFull-text access may be available. Sign in or learn about subscription options.pp. 220-227
by Udi Manber, Martin Tompa
Papers
Towards separating nondeterministic time from deterministic timeFull-text access may be available. Sign in or learn about subscription options.pp. 235-243
by R. Kannan
Papers
A complexity theory based on Boolean algebraFull-text access may be available. Sign in or learn about subscription options.pp. 244-253
by S. Skyum, L. G. Valiant
Papers
Relativizing time and spaceFull-text access may be available. Sign in or learn about subscription options.pp. 254-259
by Ronald V. Book, Christopher B. Wilson, Mei-rui Xu
Papers
Parity, circuits, and the polynomial-time hierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 260-270
by Merrick Furst, James B. Saxe, Michael Sipser
Papers
On the number of P-isomorphism classes of NP-complete setsFull-text access may be available. Sign in or learn about subscription options.pp. 271-278
by Stephen R. Mahaney
Papers
Number theoretic functions computable by polymorphic programsFull-text access may be available. Sign in or learn about subscription options.pp. 279-282
by R. Statman
Papers
The power of parallelism for automatic program synthesisFull-text access may be available. Sign in or learn about subscription options.pp. 283-295
by Carl H. Smith
Papers
On the relation between descriptional complexity and algorithmic probabilityFull-text access may be available. Sign in or learn about subscription options.pp. 296-303
by Peter Gacs
Papers
A circuit-size lower boundFull-text access may be available. Sign in or learn about subscription options.pp. 304-309
by R. Kannan
Papers
Propositional dynamic logic of context-free programsFull-text access may be available. Sign in or learn about subscription options.pp. 310-321
by David Harel, Amir Pnueli, Jonathan Stavi
Papers
The prepositional dynamic logic of deterministic, well-structured programsFull-text access may be available. Sign in or learn about subscription options.pp. 322-334
by Joseph Y. Halpern, John H. Reif
Papers
Unbounded program memory adds to the expressive power of first-order dynamic logicFull-text access may be available. Sign in or learn about subscription options.pp. 335-339
by Jerzy Tiuryn
Papers
Temporal logic can be more expressiveFull-text access may be available. Sign in or learn about subscription options.pp. 340-348
by Pierre Wolper
Papers
On the security of public key protocolsFull-text access may be available. Sign in or learn about subscription options.pp. 350-357
by D. Dolev, A. C. Yao
Papers
Worst-case ration for planar graphs and the method of induction on facesFull-text access may be available. Sign in or learn about subscription options.pp. 358-363
by Christos H. Papadimitriou, Mihalis Yannakakis
Papers
Maximum matching in sparse random graphsFull-text access may be available. Sign in or learn about subscription options.pp. 364-375
by R. M. Karp, M. Sipser
Papers
The complexity of searching a graphFull-text access may be available. Sign in or learn about subscription options.pp. 376-385
by N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, C. H. Papadimitriou
Papers
A complexity calculus for classes of recursive search programs over tree structuresFull-text access may be available. Sign in or learn about subscription options.pp. 386-393
by Philippe Flajolet, Jean-Marc Steyaert
Papers
Probabilistic algorithms in finite fieldsFull-text access may be available. Sign in or learn about subscription options.pp. 394-398
by Michael Ben-Or
Papers
Applying parallel computation algorithms in the design of serial algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 399-408
by Nimrod Megiddo
Papers
Irreducibility testing and factorization of polynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 409-418
by Leonard M. Adleman, Andrew M. Odlyzko
Papers
A decidable mu-calculus: Preliminary reportFull-text access may be available. Sign in or learn about subscription options.pp. 421-427
by V. R. Pratt
Papers
Author indexFreely available from IEEE.pp. 429
Showing 53 out of 53