12. SWAT 1971: East Lansing, Michigan, USA

12th Annual Symposium on Switching and Automata Theory, East Lansing, Michigan, USA, October 13-15, 1971. IEEE Computer Society 1971

Session I

H. Raymond Strong:
High Level Languages of Maximum Power. 1-4
Robert L. Constable, David Gries:
On Classes of Program Schemata. 5-19
Wm. A. Brinsfield, Raymond E. Miller:
On the Composition of Parallel Program Schemata. 20-23
Walter A. Burkhard, F. W. Kroon:
Toward a Weakly Invariant Complexity Theory. 24-32
Fred G. Abramson:
Effective Computation over the Real Numbers. 33-37

J. Richard Kane, Stephen S. Yau:
On the Design of Easily Testable Sequential Machines. 38-42
Mohamed Y. Osman, C. Dennis Weiss:
Universal Base Functions and Modules for Realizing Arbitrary Switching Functions. 43-59
Graziano Frosini, Giovanni B. Gerace:
Synthesis of Asynchronous Sequential Circuits with Master-Slave Subcircuits. 60-78
Sheldon B. Akers Jr.:
A Rectangular Logic Array. 79-90
D. A. Stern, Hwa C. Torng:
NAND Cellular Arrays. 91-104
Ivan Hal Sudborough:
Computation by Multi-Head Finite Automata. 105-113

Robert Endre Tarjan:
Depth-First Search and Linear Graph Algorithms (Working Paper). 114-121
John E. Hopcroft, Richard M. Karp:
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. 122-125
Lee E. Heindel, Ellis Horowitz:
On Decreasing the Computing Time for Modular Arithmetic. 126-128
Michael J. Fischer, Albert R. Meyer:
Boolean Matrix Multiplication and Transitive Closure. 129-131
J. Ian Munro, Mike Paterson:
Optimal Algorithms for Parallel Polynomial Evaluation. 132-139
Mike Paterson, Larry J. Stockmeyer:
Bounds on the Evaluation Time for Rational Polynomials. 140-143

Alvy Ray Smith III:
Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata. 144-152
Rina S. Cohen, Karel Culik II:
LR-Regular Grammars-An Extension of LR(k) Grammars. 153-165
Janusz A. Brzozowski, Imre Simon:
Characterizations of Locally Testable Events. 166-176
Edward G. Coffman Jr., Neil D. Jones:
Priority Paging Algorithms and the Extension Problem. 177-181
Michael L. Dertouzos:
Time Bounds on Space Computations. 182-187

Albert R. Meyer, Michael J. Fischer:
Economy of Description by Automata, Grammars, and Formal Systems. 188-191
Eric G. Wagner:
Languages for Defining Sets in Arbitrary Algebras. 192-201
Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities. 202-206
C. L. Liu:
Analysis of Sorting Algorithms. 207-215
Edward M. Reingold:
Computing the Maximum and the Median. 216-218

Last update Fri May 25 08:14:14 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page