David E. Muller

35 papers A* 3C 1Journal 24Unranked 7

Year	Rank	Type	Title / Venue / Authors
1995	J	`jnl`	Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1992	J	`jnl`	Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. David E. Muller, Ahmed Saoudi, Paul E. Schupp
1992	J	`jnl`	Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. Ahmed Saoudi, David E. Muller, Paul E. Schupp
1992	C	`conf`	On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI David E. Muller, Paul E. Schupp, Ahmed Saoudi
1992	J	`jnl`	Parallel Restructuring and Evaluation of Expressions. J. Comput. Syst. Sci. David E. Muller, Franco P. Preparata
1990	J	`jnl`	On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. Ahmed Saoudi, David E. Muller, Paul E. Schupp
1988	A*	`conf`	Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time LICS David E. Muller, Ahmed Saoudi, Paul E. Schupp
1987	J	`jnl`	Alternating Automata on Infinite Trees. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1987	—	`conf`	Toward a switching theory of CMOS circuits. FJCC David E. Muller, Franco P. Preparata
1986	A*	`conf`	Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP David E. Muller, Ahmed Saoudi, Paul E. Schupp
1985	J	`jnl`	The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. David E. Muller, Paul E. Schupp
1984	—	`conf`	Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words David E. Muller, Paul E. Schupp
1983	J	`jnl`	Groups, the Theory of Ends, and Context-Free Languages. J. Comput. Syst. Sci. David E. Muller, Paul E. Schupp
1981	A*	`conf`	Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems STOC David E. Muller, Paul E. Schupp
1979	J	`jnl`	Finding the Intersection of n Half-Spaces in Time O(n log n). Theor. Comput. Sci. Franco P. Preparata, David E. Muller
1978	J	`jnl`	Finding the Intersection of two Convex Polyhedra. Theor. Comput. Sci. David E. Muller, Franco P. Preparata
1977	J	`jnl`	Reduction of Depth of Boolean Networks with a Fan-In Constraint. IEEE Trans. Computers Franco P. Preparata, David E. Muller, Amnon Barak
1976	J	`jnl`	Efficient Parallel Evaluation of Boolean Expression. IEEE Trans. Computers Franco P. Preparata, David E. Muller
1976	J	`jnl`	Restructuring of Arithmetic Expressions For Parallel Evaluation. J. ACM David E. Muller, Franco P. Preparata
1975	J	`jnl`	Bounds to Complexities of Networks for Sorting and for Switching. J. ACM David E. Muller, Franco P. Preparata
1975	J	`jnl`	The Time Required to Evaluate Division-Free Arithmetic Expressions. Inf. Process. Lett. Franco P. Preparata, David E. Muller
1972	J	`jnl`	A Generalization of the Theory of Incompletely Specified Machines. J. Comput. Syst. Sci. David E. Muller, Raymond E. Miller
1971	J	`jnl`	On the Delay Required to Realize Boolean Functions. IEEE Trans. Computers Franco P. Preparata, David E. Muller
1970	J	`jnl`	Connectivity and Reversibility in Automata. J. ACM Zamir Bavel, David E. Muller
1970	J	`jnl`	Generation of Near-Optimal Universal Boolean Functions. J. Comput. Syst. Sci. Franco P. Preparata, David E. Muller
1968	J	`jnl`	Frequency of Decomposability among Machines with a Large Number of States. J. Comput. Syst. Sci. David E. Muller, Gianfranco R. Putzolu
1968	—	`conf`	Use of Multiple Index Matrices in Generalized Automata Theory SWAT David E. Muller
1967	—	`conf`	The General Synthesis Problem for Asynchronous Digital Networks SWAT David E. Muller
1965	—	`conf`	Reversibility in monadic algebras and automata SWCT Zamir Bavel, David E. Muller
1964	J	`jnl`	The place of logical design and switching theory in the computer curriculum. Commun. ACM David E. Muller
1963	—	`conf`	Infinite sequences and finite machines SWCT David E. Muller
1960	—	`conf`	A Method for Factoring the Action of Asynchronous Circuits SWCT W. D. Frazer, David E. Muller
1959	J	`jnl`	Treatment of transition signals in electronic switching circuits by algebraic methods. IRE Trans. Electron. Comput. David E. Muller
1956	J	`jnl`	Complexity in Electronic Switching Circuits. IRE Trans. Electron. Comput. David E. Muller
1954	J	`jnl`	Application of Boolean algebra to switching circuit design and to error detection. Trans. I R E Prof. Group Electron. Comput. David E. Muller