Searching...
Advanced Search
F
FOCS
1980
21st Annual Symposium on Foundations of Computer Science (FOCS 1980)
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
21st Annual Symposium on Foundations of Computer Science (FOCS 1980)
October 13-October 15
Table of Contents
Papers
[Front cover]
(PDF)
pp. C1
ABSTRACT
PDF
Table of contents
(PDF)
pp. iv-vi
ABSTRACT
PDF
Foreword
(PDF)
pp. iii
ABSTRACT
PDF
On linear characterizations of combinatorial optimization problems
(Abstract)
Richard M. Karp
Christos H. Papadimitriou
pp. 1-9
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On a class of totally unimodular matrices
(Abstract)
Mihalis Yannakakis
pp. 10-16
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
(Abstract)
Silvio Micali
Vijay V. Vazirani
pp. 17-27
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Some theorems about matrix multiplication
(Abstract)
T. C. Hu
M. T. Shing
pp. 28-35
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Polynomial-time algorithms for permutation groups
(Abstract)
Merrick Furst
John Hopcroft
Eugene Luks
pp. 36-41
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Isomorphism of graphs of bounded valence can be tested in polynomial time
(Abstract)
Eugene M. Luks
pp. 42-49
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A fast algorithm for multiprocessor scheduling
(Abstract)
Barbara Simons
pp. 50-53
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
(Abstract)
Stephen R. Mahaney
pp. 54-60
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Efficient algorithms for path system problems and applications to alternating and time-space complexity classes
(Abstract)
Ivan Hal Sudborough
pp. 62-73
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Upper and lower bounds for first order expressibility
(Abstract)
Neil Immerman
pp. 74-82
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The equivalence problem for deterministic two-way sequential transducers is decidable
(Abstract)
Eitan M. Gurari
pp. 83-85
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Succinct representation random strings, and complexity classes
(Abstract)
Gary L. Peterson
pp. 86-95
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Proofs by induction in equational theories with constructors
(Abstract)
Gerard Huet
Jean-Marie Hullot
pp. 96-107
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An improved algorithm for computing with equations
(Abstract)
Paul Chew
pp. 108-117
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Programs and types
(Abstract)
Robert L. Constable
pp. 118-128
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Process logic: Expressiveness, decidability, completeness
(Abstract)
David Harel
Dexter Kozen
Rohit Parikh
pp. 129-142
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A linear history semantics for distributed languages extended abstract
(Abstract)
N. Francez
D. Lehmann
A. Pnueli
pp. 143-151
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of recursion schemes and recursive programming languages
(Abstract)
Harry B. Hunt
Daniel J. Rosenkrantz
pp. 152-160
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the expressive power of attribute grammars
(Abstract)
Bruno Courcelle
Paul Franchi-Zannettacci
pp. 161-172
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Loop elimination and loop reduction—A model-theoretic analysis of programs
(Abstract)
A. J. Kfoury
pp. 173-184
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra
(Abstract)
Neil D. Jones
Steven S. Muchnick
pp. 185-190
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The inherent complexity of dynamic data structures which accommodate range queries
(Abstract)
Michael L. Fredman
pp. 191-199
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Efficient uses of the past
(Abstract)
David P. Dobkin
J. Ian Munro
pp. 200-206
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Exploring binary trees and other simple trees
(Abstract)
Philippe Flajolet
Andrew Odlyzko
pp. 207-216
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A general class of resource tradeoffs
(Abstract)
Jon Louis Bentley
Donna J. Brown
pp. 217-228
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Some observations on the average behavior of heapsort
(Abstract)
Ernst-Erich Doberkat
pp. 229-237
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Tuning the coalesced hashing method to obtain optimum performance
(Abstract)
Jeffrey Scott Vitter
pp. 238-247
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Biased 2-3 trees
(Abstract)
Samuel W. Bent
Daniel D. Sleator
Robert E. Tarjan
pp. 248-254
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Implicit data structures with fast update
(Abstract)
Greg N. Frederickson
pp. 255-259
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The compilation of regular expressions into integrated circuits
(Abstract)
Robert W. Floyd
Jeffrey D. Ullman
pp. 260-269
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Area-efficient graph layouts
(Abstract)
Charles E. Leiserson
pp. 270-281
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A polynomial time algorithm for optimal routing around a rectangle
(Abstract)
Andrea S. LaPaugh
pp. 282-293
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A combinatorial limit to the computing power of V.L.S.I. circuits
(Abstract)
Jean Vuillemin
pp. 294-300
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the priority approach to hidden-surface algorithms
(Abstract)
F. Frances Yao
pp. 301-307
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A linear time algorithm for the lowest common ancestors problem
(Abstract)
Dov Harel
pp. 308-319
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parsing for structural editors
(Abstract)
Mark Wegman
pp. 320-327
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Algebraic dependencies
(Abstract)
Mihalis Yannakakis
Christos H. Papdimitriou
pp. 328-332
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Structure and complexity of relational queries
(Abstract)
Ashok K. Chandra
David Harel
pp. 333-347
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On similarity and duality of computation
(Abstract)
Hong Jai-Wei
pp. 348-359
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Hardware complexity and parallel computation
(Abstract)
Patrick W. Dymond
Stephen A. Cook
pp. 360-372
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A distributed abstract data type implemented by a probabilistic communication scheme
(Abstract)
Nissim Francez
Michael Rodeh
pp. 373-379
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A time-luck tradeoff in cryptography
(Abstract)
Gilles Brassard
pp. 380-386
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On distinguishing prime numbers from composite numbers
(Abstract)
Leonard M. Adleman
pp. 387-406
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
N-process synchronization by 4.log2N-valued shared variable
(Abstract)
Michael O. Rabin
pp. 407-410
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A recognition algorithm for deterministic CFLs optimal in time and space
(Abstract)
Braunmuhl von Braunmuhl
Verbeek Rutger
pp. 411-420
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author index
(PDF)
pp. 421
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
