The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David E. Muller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.308secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002