13. FOCS 1972:
College Park,
Maryland
13th Annual Symposium on Foundations of Computer Science,
College Park, Maryland, 25-27 October 1972. IEEE Computer Society
- Barry K. Rosen:
Program Equivalence and Context-Free Grammars.
7-18 BibTeX
- Denis J. Kfoury:
Effective Computability in Algebraic Structures (A Schematology Approach).
19-26 BibTeX
- John C. Cherniavsky, Robert L. Constable:
Representing Program Schemes in Logic.
27-39 BibTeX
- George Tourlakis, John Mylopoulos:
Some Results in Computational Topology.
40-51 BibTeX
- Joseph A. Goguen:
On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes.
52-60 BibTeX
- Albert R. Meyer, Robert Moll:
Honest Bounds for Complexity Classes of Recursive Functions.
61-66 BibTeX
- Luigi Logrippo:
Renamings in Program Schemas (Extended Abstract).
67-70 BibTeX
- John L. Bruno, Edward G. Coffman Jr., W. H. Hosken:
Consistency of Synchronization Nets using P and V Operations.
71-77 BibTeX
- Robert M. Keller:
On the Decomposition of Asynchronous Systems.
78-89 BibTeX
- R. Moenck, Allan Borodin:
Fast Modular Transforms via Division.
90-96 BibTeX
- Ellis Horowitz:
The Efficient Calculation of Powers of Polynomials.
97-104 BibTeX
- Mary Shaw, J. F. Traub:
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives.
105-107 BibTeX
- John Mylopoulos:
On the Relation of Graph Grammars and Graph Automata.
108-120 BibTeX
- R. Hossley, Charles Rackoff:
The Emptiness Problem for Automata on Infinite Trees.
121-124 BibTeX
- Albert R. Meyer, Larry J. Stockmeyer:
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space.
125-129 BibTeX
- Sartaj Sahni:
Some Related Problems from Network Flows, Game Theory and Integer Programming.
130-138 BibTeX
- Nathan Friedman:
Some Results on the Effect of Arithmetics on Comparison Problems.
139-143 BibTeX
- David S. Johnson:
Fast Allocation Algorithms.
144-154 BibTeX
- C. L. Liu:
Optimal Scheduling on Multi-Processor Computing Systems.
155-160 BibTeX
- Jeffrey D. Ullman:
A Fast Algorithm for the Elimination of Common Subexpressions.
161-176 BibTeX
- Sheldon B. Akers Jr.:
Universal Test Sets for Logic Networks.
177-184 BibTeX
- Kewal K. Saluja, Sudhakar M. Reddy:
Multiple Faults in Reed-Muller Canonic Networks.
185-191 BibTeX
- C. C. Huang, Richard Y. Kain, Larry L. Kinney:
Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits.
192-199 BibTeX
- Jean Berstel:
On Sets of Numbers Recognized by Push-Down Automata.
200-206 BibTeX
- Brenda S. Baker, Ronald V. Book:
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract.
207-211 BibTeX
- J. Robert Jump, P. S. Thiagarajan:
On the Equivalence of Asynchronous Control Structures.
212-223 BibTeX
- T. S. E. Maibaum:
The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets.
224-230 BibTeX
Copyright © Sat May 16 23:12:24 2009
by Michael Ley (ley@uni-trier.de)
