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