| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 1421183 (Why is no real title available?) | 2000-12-11 | Paper |
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
Theoretical Computer Science | 1997-02-28 | Paper |
FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
International Journal of Foundations of Computer Science | 1993-06-29 | Paper |
Alternating automata, the weak monadic theory of trees and its complexity
Theoretical Computer Science | 1992-09-27 | Paper |
Parallel restructuring and evaluation of expressions
Journal of Computer and System Sciences | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4213466 (Why is no real title available?) | 1990-01-01 | Paper |
ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
Alternating automata on infinite trees
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3999901 (Why is no real title available?) | 1986-01-01 | Paper |
The theory of ends, pushdown automata, and second-order logic
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3983141 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3901534 (Why is no real title available?) | 1984-01-01 | Paper |
Groups, the theory of ends, and context-free languages
Journal of Computer and System Sciences | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3849983 (Why is no real title available?) | 1983-01-01 | Paper |
Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
Bulletin of the American Mathematical Society | 1981-01-01 | Paper |
Finding the intersection of n half-spaces in time O(n log n)
Theoretical Computer Science | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3698377 (Why is no real title available?) | 1979-01-01 | Paper |
Finding the intersection of two convex polyhedra
Theoretical Computer Science | 1978-01-01 | Paper |
Reduction of Depth of Boolean Networks with a Fan-In Constraint
IEEE Transactions on Computers | 1977-01-01 | Paper |
Restructuring of Arithmetic Expressions For Parallel Evaluation
Journal of the ACM | 1976-01-01 | Paper |
Efficient Parallel Evaluation of Boolean Expressions
IEEE Transactions on Computers | 1976-01-01 | Paper |
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM | 1975-01-01 | Paper |
The time required to evaluate division-free arithmetic expressions
Information Processing Letters | 1975-01-01 | Paper |
On the Delay Required to Realize Boolean Functions
IEEE Transactions on Computers | 1971-01-01 | Paper |
Connectivity and Reversibility in Automata
Journal of the ACM | 1970-01-01 | Paper |
Generation of near-optimal universal Boolean functions
Journal of Computer and System Sciences | 1970-01-01 | Paper |
Frequency of decomposability among machines with a large number of states
Journal of Computer and System Sciences | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3273524 (Why is no real title available?) | 1959-01-01 | Paper |
A Method for Solving Algebraic Equations Using an Automatic Computer
Mathematical Tables and Other Aids to Computation | 1956-01-01 | Paper |
Boolean Algebras in Electric Circuit Design
The American Mathematical Monthly | 1954-01-01 | Paper |
