Available identifiers
zbMath Open muller.david-eDBLP99/4089WikidataQ5233197 ScholiaQ5233197MaRDI QIDQ673777
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4946211 | 2000-12-11 | Paper |
| Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra | 1997-02-28 | Paper |
| FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS | 1993-06-29 | Paper |
| Alternating automata, the weak monadic theory of trees and its complexity | 1992-09-27 | Paper |
| Parallel restructuring and evaluation of expressions | 1992-06-28 | Paper |
| ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359781 | 1990-01-01 | Paper |
| Alternating automata on infinite trees | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4726235 | 1986-01-01 | Paper |
| The theory of ends, pushdown automata, and second-order logic | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3748266 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679818 | 1984-01-01 | Paper |
| Groups, the theory of ends, and context-free languages | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3319342 | 1983-01-01 | Paper |
| Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems | 1981-01-01 | Paper |
| Finding the intersection of n half-spaces in time O(n log n) | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3891762 | 1979-01-01 | Paper |
| Finding the intersection of two convex polyhedra | 1978-01-01 | Paper |
| Reduction of Depth of Boolean Networks with a Fan-In Constraint | 1977-01-01 | Paper |
| Efficient Parallel Evaluation of Boolean Expressions | 1976-01-01 | Paper |
| Restructuring of Arithmetic Expressions For Parallel Evaluation | 1976-01-01 | Paper |
| The time required to evaluate division-free arithmetic expressions | 1975-01-01 | Paper |
| Bounds to Complexities of Networks for Sorting and for Switching | 1975-01-01 | Paper |
| On the Delay Required to Realize Boolean Functions | 1971-01-01 | Paper |
| Generation of near-optimal universal Boolean functions | 1970-01-01 | Paper |
| Connectivity and Reversibility in Automata | 1970-01-01 | Paper |
| Frequency of decomposability among machines with a large number of states | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5558258 | 1959-01-01 | Paper |
| A Method for Solving Algebraic Equations Using an Automatic Computer | 1956-01-01 | Paper |
| Boolean Algebras in Electric Circuit Design | 1954-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: David E. Muller
