12. FOCS 1971:
East Lansing,
Michigan
12th Annual Symposium on Foundations of Computer Science,
East Lansing, Michigan, October 1971. IEEE Computer Society
- H. Raymond Strong:
High Level Languages of Maximum Power.
1-4 BibTeX
- Robert L. Constable, David Gries:
On Classes of Program Schemata.
5-19 BibTeX
- Wm. A. Brinsfield, Raymond E. Miller:
On the Composition of Parallel Program Schemata.
20-23 BibTeX
- Walter A. Burkhard, F. W. Kroon:
Toward a Weakly Invariant Complexity Theory.
24-32 BibTeX
- Fred G. Abramson:
Effective Computation over the Real Numbers.
33-37 BibTeX
- J. Richard Kane, Stephen S. Yau:
On the Design of Easily Testable Sequential Machines.
38-42 BibTeX
- Mohamed Y. Osman, C. Dennis Weiss:
Universal Base Functions and Modules for Realizing Arbitrary Switching Functions.
43-59 BibTeX
- Graziano Frosini, Giovanni B. Gerace:
Synthesis of Asynchronous Sequential Circuits with Master-Slave Subcircuits.
60-78 BibTeX
- Sheldon B. Akers Jr.:
A Rectangular Logic Array.
79-90 BibTeX
- D. A. Stern, Hwa C. Torng:
NAND Cellular Arrays.
91-104 BibTeX
- Ivan Hal Sudborough:
Computation by Multi-Head Finite Automata.
105-113 BibTeX
- Robert Endre Tarjan:
Depth-First Search and Linear Graph Algorithms (Working Paper).
114-121 BibTeX
- John E. Hopcroft, Richard M. Karp:
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
122-125 BibTeX
- Lee E. Heindel, Ellis Horowitz:
On Decreasing the Computing Time for Modular Arithmetic.
126-128 BibTeX
- Michael J. Fischer, Albert R. Meyer:
Boolean Matrix Multiplication and Transitive Closure.
129-131 BibTeX
- J. Ian Munro, Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation.
132-139 BibTeX
- Mike Paterson, Larry J. Stockmeyer:
Bounds on the Evaluation Time for Rational Polynomials.
140-143 BibTeX
- Alvy Ray Smith III:
Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata.
144-152 BibTeX
- Rina S. Cohen, Karel Culik II:
LR-Regular Grammars-An Extension of LR(k) Grammars.
153-165 BibTeX
- Janusz A. Brzozowski, Imre Simon:
Characterizations of Locally Testable Events.
166-176 BibTeX
- Edward G. Coffman Jr., Neil D. Jones:
Priority Paging Algorithms and the Extension Problem.
177-181 BibTeX
- Michael L. Dertouzos:
Time Bounds on Space Computations.
182-187 BibTeX
- Albert R. Meyer, Michael J. Fischer:
Economy of Description by Automata, Grammars, and Formal Systems.
188-191 BibTeX
- Eric G. Wagner:
Languages for Defining Sets in Arbitrary Algebras.
192-201 BibTeX
- Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities.
202-206 BibTeX
- C. L. Liu:
Analysis of Sorting Algorithms.
207-215 BibTeX
- Edward M. Reingold:
Computing the Maximum and the Median.
216-218 BibTeX
Copyright © Sat May 16 23:12:24 2009
by Michael Ley (ley@uni-trier.de)
