David E. Muller
Technische Universität Dresden · 51 works · 4,100 citations · h-index 21
Top works
- Application of Boolean algebra to switching circuit design and to error detection
- Finding the intersection of two convex polyhedra
- A Method for Solving Algebraic Equations Using an Automatic Computer
- Infinite sequences and finite machines
- Complexity in Electronic Switching Circuits
- A method for solving algebraic equations using an automatic computer
- Treatment of transition signals in electronic switching circuits by algebraic methods
- Bounds to Complexities of Networks for Sorting and for Switching
- Logical Design of Digital Computers.
- The theory of ends, pushdown automata, and second-order logic
- Alternating automata on infinite trees
- Finding the intersection of n half-spaces in time O(n log n)
- Finding the Intersection of a Set of n Half-Spaces in Time O(nlogn).
- On the Delay Required to Realize Boolean Functions
- Groups, the Theory of ends, and context-free languages
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Restructuring of Arithmetic Expressions For Parallel Evaluation
- The general synthesis problem for asynchronous digital networks
- Alternating automata on infinite objects, determinacy and Rabin's theorem
- Alternating automata, the weak monadic theory of the tree, and its complexity