21. FOCS 1980:
Syracuse, New York, USA
21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13-15 October 1980.
IEEE Computer Society 1980
Session I
Session II
- Stephen R. Mahaney:
Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis.
54-60

- Ivan Hal Sudborough:
Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes.
62-73

- Neil Immerman:
Upper and Lower Bounds for First Order Expressibility.
74-82

- Eitan M. Gurari:
The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable.
83-85

- Gary L. Peterson:
Succinct Representation, Random Strings, and Complexity Classes.
86-95

Session III
- Gérard P. Huet, Jean-Marie Hullot:
Proofs by Induction in Equational Theories with Constructors.
96-107

- Paul Chew:
An Improved Algorithm for Computing With Equations.
108-117

- Robert L. Constable:
Programs and Types.
118-128

- David Harel, Dexter Kozen, Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness.
129-142

- Nissim Francez, Daniel J. Lehmann, Amir Pnueli:
A Linear History Semantics for Distributed Languages (Extended Abstract).
143-151

- Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract).
152-160

- Bruno Courcelle, Paul Franchi-Zannettacci:
On the Expressive Power of Attribute Grammars.
161-172

- A. J. Kfoury:
Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report).
173-184

- Neil D. Jones, Steven S. Muchnick:
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra.
185-190

Session IV
Session V
Session VI
Late Paper
Last update Fri May 24 02:34:23 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page