E. Allen Emerson
- Computational Theory and Mathematics top 0.02%
- Artificial Intelligence top 0.2%
- Software top 0.1%
- Hardware and Architecture top 0.5%
- Computer Networks and Communications top 1%
- Co-authors
- A. Prasad SistlaE. M. ClarkeJoseph Y. HalpernCharanjit S. JutlaEdmund M. ClarkeChin‐Laung LeiKedar S. NamjoshiPaul C. Attie
- Topics
- Formal Methods in Verification (61 papers)Logic, programming, and type systems (40 papers)semigroups and automata theory (16 papers)
- Partner nations
- United StatesNetherlandsIreland
In The Last Decade
E. Allen Emerson
74 papers receiving 5.6k citations
Hit Papers
Peers
Comparison fields: 5 of 88
- Computational Theory and Mathematics 4.9k
- Artificial Intelligence 3.8k
- Software 2.1k
- Hardware and Architecture 909
- Computer Networks and Communications 901
Countries citing papers authored by E. Allen Emerson
This map shows the geographic impact of E. Allen Emerson'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 E. Allen Emerson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. Allen Emerson more than expected).
Fields of papers citing papers by E. Allen Emerson
This network shows the impact of papers produced by E. Allen Emerson. 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 E. Allen Emerson. The network helps show where E. Allen Emerson may publish in the future.
Co-authorship network of co-authors of E. Allen Emerson
This figure shows the co-authorship network connecting the top 25 collaborators of E. Allen Emerson. A scholar is included among the top collaborators of E. Allen Emerson 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 E. Allen Emerson. E. Allen Emerson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 12 | |
| 2 | 23 | |
| 3 | 2 | |
| 4 | 42 | |
| 5 | 2 | |
| 6 | 3 | |
| 7 | Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract). | 3 |
| 8 | Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) | 78 |
| 9 | Synthesis of concurrent systems with many similar sequential processes | 5 |
| 10 | On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract) | 4 |
| 11 | Efficient Temporal Reasoning. | 7 |
| 12 | The Complexity of Tree Automata and Logics of Programs (Extended Abstract) | 30 |
| 13 | 153 | |
| 14 | Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) | 30 |
| 15 | EFFICIENT MODEL CHECKING IN FRAGMENTS OF THE PROPOSITIONAL MU-CALCULUS. | 194 |
| 16 | 208 | |
| 17 | Branching Time Logic Strikes Back | 2 |
| 18 | 95 | |
| 19 | 42 | |
| 20 | 313 |
About E. Allen Emerson
E. Allen Emerson is a scholar working on Software, Computational Theory and Mathematics and Hardware and Architecture, having authored 76 papers that have together received 6.3k indexed citations. Recurring topics across this work include Formal Methods in Verification (61 papers), Logic, programming, and type systems (40 papers) and semigroups and automata theory (16 papers). The work is most often cited by research in Software (2.1k citations), Computational Theory and Mathematics (4.9k citations) and Hardware and Architecture (909 citations). E. Allen Emerson has collaborated with scholars based in United States, Netherlands and Ireland. Frequent co-authors include A. Prasad Sistla, E. M. Clarke, Joseph Y. Halpern, Charanjit S. Jutla, Edmund M. Clarke, Chin‐Laung Lei, Kedar S. Namjoshi, Paul C. Attie, Joseph Sifakis and Aloysius K. Mok. Their work appears in journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.
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.