15. FOCS 1974:
New Orleans,
Louisiana
15th Annual Symposium on Foundations of Computer Science,
New Orleans, Louisiana, 14-16 October 1974. IEEE Computer Society
- Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report).
1-12 BibTeX
- Juris Hartmanis, Janos Simon:
On the Power of Multiplication in Random Access Machines.
13-23 BibTeX
- José Lucas Rangel:
The Equivalence Problem for Regular Expressions over one Letter Is Elementary.
24-27 BibTeX
- Sartaj Sahni, Teofilo F. Gonzalez:
P-Complete Problems and Approximate Solutions.
28-32 BibTeX
- Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
Approximate Algorithms for the Traveling Salesperson Problem.
33-42 BibTeX
- Emily P. Friedman:
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages.
43-51 BibTeX
- Bruno Courcelle:
Recursive Schemes, Algebraic Trees and Deterministic Languages.
52-62 BibTeX
- Joseph A. Goguen, James W. Thatcher:
Initial Algebra Semantics.
63-77 BibTeX
- Christoph M. Hoffmann, Lawrence H. Landweber:
Axiomatic Equivalence of Programs with Structured Variables.
78-83 BibTeX
- Nobuki Tokura, Tadao Kasami, Shukichi Furuta:
Ianov Schemas Augmented by a Pushdown Memory.
84-94 BibTeX
- Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract).
104-109 BibTeX
- Andrew Chi-Chih Yao:
Bounds on Selection Networks.
110-116 BibTeX
- H. T. Kung:
On the Computational Complexity of Finding the Maxima of a Set of Vectors.
117-121 BibTeX
- Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract).
127-132 BibTeX
- John P. Hayes:
Minimization of Fanout in Switching Networks.
133-139 BibTeX
- Edmund A. Lamagna, John E. Savage:
Combinational Complexity of Some Monotone Functions.
140-144 BibTeX
- Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein:
A Comparative Study of Models of Parallel Computation.
145-155 BibTeX
- Michel Hack:
The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems.
156-164 BibTeX
- Robert P. Daley:
Non-Complex Sequences: Characterizations and Examples.
165-169 BibTeX
- Zvi Galil:
Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation.
170-177 BibTeX
- Theodore P. Baker:
``Natural'' Properties of Flowchart Complexity Measures.
178-184 BibTeX
- Alan J. Demers:
Skeletal LR Parsing.
185-198 BibTeX
- Armin B. Cremers, Seymour Ginsburg:
Characterization of Context-Free Grammatical Families.
199-204 BibTeX
- Pawel Kerntopf:
On Boolean Functions Having Maximal Number of Subfunction Classes.
205-211 BibTeX
Copyright © Sat May 16 23:12:24 2009
by Michael Ley (ley@uni-trier.de)
