Searching...
Advanced Search
F
FOCS
1977
18th Annual Symposium on Foundations of Computer Science (FOCS 1977)
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
18th Annual Symposium on Foundations of Computer Science (FOCS 1977)
September 30-October 31
Table of Contents
Papers
Front cover
(PDF)
pp. C1
ABSTRACT
PDF
Table of contents
(PDF)
pp. iv-v
ABSTRACT
PDF
Foreword
(PDF)
pp. iii
ABSTRACT
PDF
A necessary and sufficient condition for the existence of hoare logics
(Abstract)
Richard J. Lipton
pp. 1-6
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Data types
(Abstract)
Daniel J. Lehmann
Michael B. Smyth
pp. 7-12
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The category-theoretic solution of recursive domain equations
(Abstract)
M. B. Smyth
G. D. Plotkin
pp. 13-17
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Program invariants as fixed points
(Abstract)
Edmund Melson Clarke
pp. 18-29
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Conflunt reductions: Abstract properties and applications to term rewriting systems
(Abstract)
Gerard Huet
pp. 30-45
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The temporal logic of programs
(Abstract)
Amir Pnueli
pp. 46-57
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Language representation theorems: How to generate the R. E. sets from the regular sets
(Abstract)
Ronald V. Book
pp. 58-61
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A new decidable problem, with applications
(Abstract)
Harry R. Lewis
pp. 62-73
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications
(Abstract)
Oscar H. Ibarra
pp. 74-81
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Several results in program size complexity
(Abstract)
Howard P. Katseff
Michael Sipser
pp. 82-89
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The typed ?-calculus is not elementary recursive
(Abstract)
Richard Statman
pp. 90-94
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Precise bounds for presburger arithmetic and the reals with addition: Preliminary report
(Abstract)
Leonard Berman
pp. 95-99
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Recursion theoretic characterizations of complexity theoretic properties
(Abstract)
Victor L. Bennison
Robert I. Soare
pp. 100-106
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The theory of joins in relational data bases
(Abstract)
A. V. Aho
A. Beeri
J. D. Ullman
pp. 107-113
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast decision algorithms based on union and find
(Abstract)
Greg Nelson
Derek C. Oppen
pp. 114-119
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An efficient parallel garbage collection system and ITS correctness proof
(Abstract)
H. T. Kung
S. W. Song
pp. 120-131
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A space efficient method for the lowest common ancestor problem and an application to finding negative cycles
(Abstract)
David Maier
pp. 132-141
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On uniquely represented data strauctures
(Abstract)
Lawrence Snyder
pp. 142-146
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the capability of finite automata in 2 and 3 dimensional space
(Abstract)
Manuel Blum
William J. Sakoda
pp. 147-161
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Applications of a planar separator theorem
(Abstract)
Richard J. Lipton
Robert Endre Tarjan
pp. 162-170
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The power of commutativity
(Abstract)
Laurent Hyafil
pp. 171-174
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On taking roots in finite fields
(Abstract)
Leonard Adleman
Kenneth Manders
Gary Miller
pp. 175-178
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Saving space in fast string-matching
(Abstract)
Zvi Galil
Joel Seiferas
pp. 179-188
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A new proof of the linearity of the Boyer-Moore string searching algorithm
(Abstract)
Leo J. Guibas
Andrew M. Odlyzko
pp. 189-195
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the average number of registers required for evaluating arithmetic expressions
(Abstract)
P. Flajolet
J. C. Raoult
J. Vuillemin
pp. 196-205
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast approximation algorithms for knapsack problems
(Abstract)
E. L. Lawler
pp. 206-213
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Combinatorial analysis of an efficient algorithm for processor and storage allocation
(Abstract)
E. G. Coffman
Joseph Y.-T. Leung
pp. 214-221
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Probabilistic computations: Toward a unified measure of complexity
(Abstract)
Andrew Chi-Chin Yao
pp. 222-227
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On triangulations of a set of points in the plane
(Abstract)
Errol Lynn Lloyd
pp. 228-240
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
New NP-hard and NP-complete polynomial and integer divisibility problems
(Abstract)
David A. Plaisted
pp. 241-253
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower bounds for natural proof systems
(Abstract)
Dexter Kozen
pp. 254-266
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author and subject index
(PDF)
pp. 267-269
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
