Application of Boolean algebra to switching circuit design and to error detection. - David E. Muller (Trans. I R E Prof. Group Electron. Comput., 1954)

Complexity in Electronic Switching Circuits. - David E. Muller (IRE Trans. Electron. Comput., 1956)

Treatment of transition signals in electronic switching circuits by algebraic methods. - David E. Muller (IRE Trans. Electron. Comput., 1959)

A Method for Factoring the Action of Asynchronous Circuits - W. D. Frazer; David E. Muller (SWCT, 1960)

Infinite sequences and finite machines - David E. Muller (SWCT, 1963)

The place of logical design and switching theory in the computer curriculum. - David E. Muller (Commun. ACM, 1964)

Reversibility in monadic algebras and automata - Zamir Bavel; David E. Muller (SWCT, 1965)

The General Synthesis Problem for Asynchronous Digital Networks - David E. Muller (SWAT, 1967)

Use of Multiple Index Matrices in Generalized Automata Theory - David E. Muller (SWAT, 1968)

Frequency of Decomposability among Machines with a Large Number of States. - David E. Muller; Gianfranco R. Putzolu (J. Comput. Syst. Sci., 1968)

Connectivity and Reversibility in Automata. - Zamir Bavel; David E. Muller (J. ACM, 1970)

Generation of Near-Optimal Universal Boolean Functions. - Franco P. Preparata; David E. Muller (J. Comput. Syst. Sci., 1970)

On the Delay Required to Realize Boolean Functions. - Franco P. Preparata; David E. Muller (IEEE Trans. Computers, 1971)

A Generalization of the Theory of Incompletely Specified Machines. - David E. Muller; Raymond E. Miller (J. Comput. Syst. Sci., 1972)

The Time Required to Evaluate Division-Free Arithmetic Expressions. - Franco P. Preparata; David E. Muller (Inf. Process. Lett., 1975)

Bounds to Complexities of Networks for Sorting and for Switching. - David E. Muller; Franco P. Preparata (J. ACM, 1975)

Restructuring of Arithmetic Expressions For Parallel Evaluation. - David E. Muller; Franco P. Preparata (J. ACM, 1976)

Efficient Parallel Evaluation of Boolean Expression. - Franco P. Preparata; David E. Muller (IEEE Trans. Computers, 1976)

Reduction of Depth of Boolean Networks with a Fan-In Constraint. - Franco P. Preparata; David E. Muller; Amnon Barak (IEEE Trans. Computers, 1977)

Finding the Intersection of two Convex Polyhedra. - David E. Muller; Franco P. Preparata (Theor. Comput. Sci., 1978)

Finding the Intersection of n Half-Spaces in Time O(n log n). - Franco P. Preparata; David E. Muller (Theor. Comput. Sci., 1979)

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems - David E. Muller; Paul E. Schupp (STOC, 1981)

Groups, the Theory of Ends, and Context-Free Languages. - David E. Muller; Paul E. Schupp (J. Comput. Syst. Sci., 1983)

Alternating automata on infinite objects, determinacy and Rabin's theorem. - David E. Muller; Paul E. Schupp (Automata on Infinite Words, 1984)

The Theory of Ends, Pushdown Automata, and Second-Order Logic. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1985)

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. - David E. Muller; Ahmed Saoudi; Paul E. Schupp (ICALP, 1986)

Toward a switching theory of CMOS circuits. - David E. Muller; Franco P. Preparata (FJCC, 1987)

Alternating Automata on Infinite Trees. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1987)

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time - David E. Muller; Ahmed Saoudi; Paul E. Schupp (LICS, 1988)

On the Complexity of omega-Tree Sets and Nerode Theorem. - Ahmed Saoudi; David E. Muller; Paul E. Schupp (Int. J. Found. Comput. Sci., 1990)

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. - David E. Muller; Paul E. Schupp; Ahmed Saoudi (ICCI, 1992)

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. - Ahmed Saoudi; David E. Muller; Paul E. Schupp (Int. J. Found. Comput. Sci., 1992)

Parallel Restructuring and Evaluation of Expressions. - David E. Muller; Franco P. Preparata (J. Comput. Syst. Sci., 1992)

Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. - David E. Muller; Ahmed Saoudi; Paul E. Schupp (Theor. Comput. Sci., 1992)

Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. - David E. Muller; Paul E. Schupp (Theor. Comput. Sci., 1995)