David E. Muller

4.5k total citations · 1 hit paper
45 papers, 2.5k citations indexed

About

David E. Muller is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, David E. Muller has authored 45 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 7 papers in Electrical and Electronic Engineering. Recurrent topics in David E. Muller's work include semigroups and automata theory (12 papers), Formal Methods in Verification (9 papers) and Logic, programming, and type systems (7 papers). David E. Muller is often cited by papers focused on semigroups and automata theory (12 papers), Formal Methods in Verification (9 papers) and Logic, programming, and type systems (7 papers). David E. Muller collaborates with scholars based in United States, Germany and France. David E. Muller's co-authors include Paul E. Schupp, F. P. Preparata, Franco P. Preparata, Jesse W. M. DuMond, David J. Klein, A. Saoudi, Salomon Sickert, U. Holm, R. Beckmann and Kai Jensen and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Mathematics of Computation.

In The Last Decade

David E. Muller

42 papers receiving 2.2k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A Method for Solving Algebraic Equations Using an Automatic Computer

1956 403 citations David E. Muller profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
David E. Muller United States	18	967	782	428	290	239	45	2.5k
Olga Taussky United States	24	1.5k 1.6×	1.1k 1.4×	499 1.2×	370 1.3×	178 0.7×	99	4.3k
W. Kahan United States	22	1.7k 1.8×	493 0.6×	426 1.0×	225 0.8×	504 2.1×	55	3.6k
James R. Bunch United States	20	1.8k 1.9×	421 0.5×	504 1.2×	395 1.4×	710 3.0×	40	4.0k
Virginia Klema United States	8	598 0.6×	357 0.5×	329 0.8×	217 0.7×	401 1.7×	15	3.0k
Donald J. Rose United States	34	1.9k 2.0×	283 0.4×	1.3k 3.0×	530 1.8×	921 3.9×	74	4.6k
Michael A. Malcolm Canada	9	297 0.3×	244 0.3×	282 0.7×	537 1.9×	258 1.1×	14	2.7k
Christian Bischof Germany	28	1.1k 1.1×	352 0.5×	287 0.7×	495 1.7×	760 3.2×	200	3.4k
Joseph P. S. Kung United States	16	512 0.5×	425 0.5×	407 1.0×	181 0.6×	226 0.9×	75	2.0k
K. O. Geddes Canada	15	620 0.6×	309 0.4×	182 0.4×	120 0.4×	210 0.9×	47	1.9k
A. S. Householder United States	21	1.5k 1.5×	289 0.4×	415 1.0×	123 0.4×	454 1.9×	63	3.9k

Countries citing papers authored by David E. Muller

Since Specialization

Citations

This map shows the geographic impact of David E. Muller's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David E. Muller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David E. Muller more than expected).

Fields of papers citing papers by David E. Muller

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David E. Muller. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David E. Muller. The network helps show where David E. Muller may publish in the future.

Co-authorship network of co-authors of David E. Muller

This figure shows the co-authorship network connecting the top 25 collaborators of David E. Muller. A scholar is included among the top collaborators of David E. Muller based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David E. Muller. David E. Muller is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Muller, David E., et al.. (2021). From LTL to unambiguous Büchi automata via disambiguation of alternating automata. Formal Methods in System Design. 58(1-2). 42–82. 1 indexed citations

2.

Muller, David E. & Salomon Sickert. (2017). LTL to Deterministic Emerson-Lei Automata. SHILAP Revista de lepidopterología. 256. 180–194. 10 indexed citations

3.

Muller, David E.. (2014). Alternative automata-based approaches to probabilistic model checking.. Qucosa (Saxon State and University Library Dresden). 149. 1 indexed citations

4.

Minnick, S., J. J. Beatty, Amit Bhattacharyya, et al.. (2003). Energy Spectra and Charge Ratios of Atmospheric Muons. International Cosmic Ray Conference. 3. 1191. 1 indexed citations

5.

Muller, David E., S. W. Barwick, J. J. Beatty, et al.. (1997). Energy Spectra of Electrons and Positrons from 5 to 100 GeV. ICRC. 4. 237. 2 indexed citations

6.

Swordy, S. P., S. W. Barwick, J. J. Beatty, et al.. (1995). The Relative Fluxes of Protons and Helium Nuclei up to 100 GeV/n. ICRC. 2. 652.

7.

Muller, David E. & Paul E. Schupp. (1995). Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science. 141(1-2). 69–107. 92 indexed citations

8.

Muller, David E. & F. P. Preparata. (1992). Parallel restructuring and evaluation of expressions. Journal of Computer and System Sciences. 44(1). 43–62. 2 indexed citations

9.

Muller, David E., A. Saoudi, & Paul E. Schupp. (1992). Alternating automata, the weak monadic theory of trees and its complexity. Theoretical Computer Science. 97(2). 233–244. 25 indexed citations

10.

Muller, David E. & Paul E. Schupp. (1987). Alternating automata on infinite trees. Theoretical Computer Science. 54(2-3). 267–276. 115 indexed citations

11.

Muller, David E. & F. P. Preparata. (1987). Toward a switching theory of CMOS circuits. 347–348. 1 indexed citations

12.

Muller, David E. & Paul E. Schupp. (1985). The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science. 37. 51–75. 117 indexed citations

13.

Muller, David E. & Paul E. Schupp. (1983). Groups, the Theory of ends, and context-free languages. Journal of Computer and System Sciences. 26(3). 295–310. 117 indexed citations

14.

Preparata, F. P. & David E. Muller. (1979). Finding the intersection of n half-spaces in time O(n log n). Theoretical Computer Science. 8(1). 45–55. 51 indexed citations

15.

Muller, David E. & F. P. Preparata. (1978). Finding the intersection of two convex polyhedra. Theoretical Computer Science. 7(2). 217–236. 186 indexed citations

16.

Preparata, F. P. & David E. Muller. (1977). Finding the Intersection of a Set of n Half-Spaces in Time 0(nlogn). IDEALS (University of Illinois Urbana-Champaign). 1 indexed citations

17.

Muller, David E. & Franco P. Preparata. (1976). Restructuring of Arithmetic Expressions For Parallel Evaluation. Journal of the ACM. 23(3). 534–543. 20 indexed citations

18.

Preparata, F. P., et al.. (1975). Reduction of depth of Boolean networks with a fan-in constraint. IDEALS (University of Illinois Urbana-Champaign). 76. 29522.

19.

Muller, David E.. (1959). Treatment of transition signals in electronic switching circuits by algebraic methods. EC-8(3). 401–401. 17 indexed citations

20.

Muller, David E.. (1954). Application of Boolean algebra to switching circuit design and to error detection. EC-3(3). 6–12. 357 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact