19. FOCS 1978: Ann Arbor, Michigan, USA
19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16-18 October 1978. IEEE Computer Society 1978
Session I
Jean Françon, Gérard Viennot, Jean Vuillemin:
Description and Analysis of an Efficient Priority Queue Representation. 1-7


Harry R. Lewis:
Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus. 35-47
Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha:
The Complexity of Checkers on an N * N Board - Preliminary Report. 55-64
Session II



Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version). 84-91
Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer:
Alternating Pushdown Automata (Preliminary Report). 92-106
Janos Simon, John Gill, James Hunt:
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract). 107-112
Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk:
On Alternation (Preliminary Version). 113-122
Session III
Joost Engelfriet, Grzegorz Rozenberg:
Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages. 123-126
Manuel Blum, Dexter Kozen:
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). 132-142

Jean-Paul Van de Wiele:
An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex Numbers. 159-165
Victor Y. Pan:
Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations. 166-176
Session IV

Lawrence Flon, Norihisa Suzuki:
Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs. 184-192


Akira Kanda:
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract). 221-230



Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
