Abstract is missing.
- High Level Languages of Maximum PowerH. Raymond Strong. 1-4
- On Classes of Program SchemataRobert L. Constable, David Gries. 5-19
- On the Composition of Parallel Program SchemataWm. A. Brinsfield, Raymond E. Miller. 20-23
- Toward a Weakly Invariant Complexity TheoryWalter A. Burkhard, F. W. Kroon. 24-32
- Effective Computation over the Real NumbersFred G. Abramson. 33-37
- On the Design of Easily Testable Sequential MachinesJ. Richard Kane, Stephen S. Yau. 38-42
- Universal Base Functions and Modules for Realizing Arbitrary Switching FunctionsMohamed Y. Osman, C. Dennis Weiss. 43-59
- Synthesis of Asynchronous Sequential Circuits with Master-Slave SubcircuitsGraziano Frosini, Giovanni B. Gerace. 60-78
- A Rectangular Logic ArraySheldon B. Akers Jr.. 79-90
- NAND Cellular ArraysD. A. Stern, Hwa C. Torng. 91-104
- Computation by Multi-Head Finite AutomataIvan Hal Sudborough. 105-113
- Depth-First Search and Linear Graph Algorithms (Working Paper)Robert Endre Tarjan. 114-121
- A n^5/2 Algorithm for Maximum Matchings in Bipartite GraphsJohn E. Hopcroft, Richard M. Karp. 122-125
- On Decreasing the Computing Time for Modular ArithmeticLee E. Heindel, Ellis Horowitz. 126-128
- Boolean Matrix Multiplication and Transitive ClosureMichael J. Fischer, Albert R. Meyer. 129-131
- Optimal Algorithms for Parallel Polynomial EvaluationJ. Ian Munro, Mike Paterson. 132-139
- Bounds on the Evaluation Time for Rational PolynomialsMike Paterson, Larry J. Stockmeyer. 140-143
- Two-Dimensional Formal Languages and Pattern Recognition by Cellular AutomataAlvy Ray Smith III. 144-152
- LR-Regular Grammars-An Extension of LR(k) GrammarsRina S. Cohen, Karel Culik II. 153-165
- Characterizations of Locally Testable EventsJanusz A. Brzozowski, Imre Simon. 166-176
- Priority Paging Algorithms and the Extension ProblemEdward G. Coffman Jr., Neil D. Jones. 177-181
- Time Bounds on Space ComputationsMichael L. Dertouzos. 182-187
- Economy of Description by Automata, Grammars, and Formal SystemsAlbert R. Meyer, Michael J. Fischer. 188-191
- Languages for Defining Sets in Arbitrary AlgebrasEric G. Wagner. 192-201
- Complete Linear Proofs of Systems of Linear InequalitiesPhilip M. Spira. 202-206
- Analysis of Sorting AlgorithmsC. L. Liu. 207-215
- Computing the Maximum and the MedianEdward M. Reingold. 216-218