The Community for Technology Leaders
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) (1982)
Chicago, IL, USA USA
Nov. 3, 1982 to Nov. 5, 1982
ISSN: 0272-5428

On the complexity of unique solutions (Abstract)

Christos H. Papadimitriou , M.I.T. and National Technical University of Athens
pp. 14-20

The computational complexity of simultaneous Diophantine approximation problems (Abstract)

J. C. Lagarias , Bell Laboratories, Murray HllI, New Jersey 07974
pp. 32-39

Generalised symmetries of polynomials in algebraic complexity (Abstract)

C. Sturtivant , Department of Computer Science, Edinburgh University, Scotland
pp. 72-79

Theory and application of trapdoor functions (Abstract)

Andrew C. Yao , Computer Science Division, University of California, Berkely, California 94720
pp. 80-91

An application of number theory to the organization of raster-graphics memory (Abstract)

Benny Chor , Laboratory for Computer Science, MIT, Cambridge, MA 02139
Charles E. Leiserson , Laboratory for Computer Science, MIT, Cambridge, MA 02139
Ronald L. Rivest , Laboratory for Computer Science, MIT, Cambridge, MA 02139
pp. 92-99

Probabilistic analysis of some bin-packing problems (Abstract)

Narendra Karmarkar , Computer Science Division, University of California, Berkeley, CA 94720
pp. 107-111

Table of contents (PDF)

pp. v-vii

Inferring a sequence generated by a linear congruence (Abstract)

Joan B. Plumstead , Computer Science Division, University of California - Berkeley
pp. 153-159

On the program size of perfect and universal hash functions (Abstract)

Kurt Mehlhorn , Universitat des Saarlandes, 6600 Saarbrticken, BRD
pp. 170-175

On equations including string variables (Abstract)

Kazuo Iwama , Department of Computer Sciences, Kyoto Sangyo University, Kyoto 603, Japan
pp. 226-235

Parallel time O(log N) acceptance of deterministic CFLs (Abstract)

John Reif , Aiken Computation Laboratory, Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138
pp. 290-296

Three layers are enough (Abstract)

Franco P. Preparata , Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Witold Lipski , Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland
pp. 350-357

The complexity of compacting hierarchically specified layouts of integrated circuits (Abstract)

Thomas Lengauer , Fachbereich 10, Universitat des Saarlandes, 0-6600 SaarbrUcken, West Germany
pp. 358-368

Optimal allocation of computational resources in VLSI (Abstract)

Zvi M. Kedem , Colunbia University, New York, NY
pp. 379-385
260 ms
(Ver 3.3 (11022016))