dblp.uni-trier.dewww.uni-trier.de

David E. Muller Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*1995
30EEDavid E. Muller, Paul E. Schupp: Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141(1&2): 69-107 (1995)
1992
29 David E. Muller, Paul E. Schupp, Ahmed Saoudi: On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI 1992: 2-5
28 Ahmed Saoudi, David E. Muller, Paul E. Schupp: Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. 3(3): 233-244 (1992)
27 David E. Muller, Franco P. Preparata: Parallel Restructuring and Evaluation of Expressions. J. Comput. Syst. Sci. 44(1): 43-62 (1992)
26 David E. Muller, Ahmed Saoudi, Paul E. Schupp: Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. 97(2): 233-244 (1992)
1990
25 Ahmed Saoudi, David E. Muller, Paul E. Schupp: On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. 1(1): 11-22 (1990)
1988
24 David E. Muller, Ahmed Saoudi, Paul E. Schupp: Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time LICS 1988: 422-427
1987
23 David E. Muller, Paul E. Schupp: Alternating Automata on Infinite Trees. Theor. Comput. Sci. 54: 267-276 (1987)
1986
22EEDavid E. Muller, Ahmed Saoudi, Paul E. Schupp: Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP 1986: 275-283
1985
21 David E. Muller, Paul E. Schupp: The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. 37: 51-75 (1985)
1984
20EEDavid E. Muller, Paul E. Schupp: Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words 1984: 100-107
1983
19 David E. Muller, Paul E. Schupp: Groups, the Theory of Ends, and Context-Free Languages. J. Comput. Syst. Sci. 26(3): 295-310 (1983)
1981
18 David E. Muller, Paul E. Schupp: Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems STOC 1981: 46-54
1979
17 Franco P. Preparata, David E. Muller: Finding the Intersection of n Half-Spaces in Time O(n log n). Theor. Comput. Sci. 8: 45-55 (1979)
1978
16 David E. Muller, Franco P. Preparata: Finding the Intersection of two Convex Polyhedra. Theor. Comput. Sci. 7: 217-236 (1978)
1977
15 Franco P. Preparata, David E. Muller, Amnon Barak: Reduction of Depth of Boolean Networks with a Fan-In Constraint. IEEE Trans. Computers 26(5): 474-479 (1977)
1976
14 Franco P. Preparata, David E. Muller: Efficient Parallel Evaluation of Boolean Expression. IEEE Trans. Computers 25(5): 548-549 (1976)
13EEDavid E. Muller, Franco P. Preparata: Restructuring of Arithmetic Expressions For Parallel Evaluation. J. ACM 23(3): 534-543 (1976)
1975
12 Franco P. Preparata, David E. Muller: The Time Required to Evaluate Division-Free Arithmetic Expressions. Inf. Process. Lett. 3(5): 144-146 (1975)
11EEDavid E. Muller, Franco P. Preparata: Bounds to Complexities of Networks for Sorting and for Switching. J. ACM 22(2): 195-201 (1975)
1972
10 David E. Muller, Raymond E. Miller: A Generalization of the Theory of Incompletely Specified Machines. J. Comput. Syst. Sci. 6(5): 419-447 (1972)
1970
9EEZamir Bavel, David E. Muller: Connectivity and Reversibility in Automata. J. ACM 17(2): 231-240 (1970)
8 Franco P. Preparata, David E. Muller: Generation of Near-Optimal Universal Boolean Functions. J. Comput. Syst. Sci. 4(2): 93-102 (1970)
1968
7 David E. Muller: Use of Multiple Index Matrices in Generalized Automata Theory FOCS 1968: 395-404
6 David E. Muller, Gianfranco R. Putzolu: Frequency of Decomposability among Machines with a Large Number of States. J. Comput. Syst. Sci. 2(3): 219-227 (1968)
1967
5 David E. Muller: The General Synthesis Problem for Asynchronous Digital Networks FOCS 1967: 71-82
1965
4 Zamir Bavel, David E. Muller: Reversibility in monadic algebras and automata FOCS 1965: 242-247
1964
3EEDavid E. Muller: The place of logical design and switching theory in the computer curriculum. Commun. ACM 7(4): 222-225 (1964)
1963
2 David E. Muller: Infinite sequences and finite machines FOCS 1963: 3-16
1960
1 W. D. Frazer, David E. Muller: A Method for Factoring the Action of Asynchronous Circuits FOCS 1960: 246-249

Coauthor Index

1Amnon Barak (Amnon B. Barak) [15]
2Zamir Bavel [4] [9]
3W. D. Frazer [1]
4Raymond E. Miller [10]
5Franco P. Preparata [8] [11] [12] [13] [14] [15] [16] [17] [27]
6Gianfranco R. Putzolu [6]
7Ahmed Saoudi [22] [24] [25] [26] [28] [29]
8Paul E. Schupp [18] [19] [20] [21] [22] [23] [24] [25] [26] [28] [29] [30]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)