Alan L. Selman
- Computational Theory and Mathematics top 0.2%
- Artificial Intelligence top 1%
- Computer Networks and Communications top 5%
- Electrical and Electronic Engineering
- Geometry and Topology top 10%
- Co-authors
- Nancy LynchRichard E. LadnerTimothy J. LongRonald V. BookSteven HomerShimon EvenYacov YacobiNeil D. Jones
- Topics
- Complexity and Algorithms in Graphs (42 papers)Computability, Logic, AI Algorithms (30 papers)semigroups and automata theory (22 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceComputer Networks and Communications
- Journals
- Communications of the ACMJournal of the ACMTransactions of the American Mathematical Society
- Partner nations
- United StatesGermanyIsrael
In The Last Decade
Alan L. Selman
81 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 71
- Computational Theory and Mathematics 1.6k
- Artificial Intelligence 1.1k
- Computer Networks and Communications 215
- Electrical and Electronic Engineering 82
- Geometry and Topology 57
Countries citing papers authored by Alan L. Selman
This map shows the geographic impact of Alan L. Selman'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 Alan L. Selman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alan L. Selman more than expected).
Fields of papers citing papers by Alan L. Selman
This network shows the impact of papers produced by Alan L. Selman. 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 Alan L. Selman. The network helps show where Alan L. Selman may publish in the future.
Co-authorship network of co-authors of Alan L. Selman
This figure shows the co-authorship network connecting the top 25 collaborators of Alan L. Selman. A scholar is included among the top collaborators of Alan L. Selman 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 Alan L. Selman. Alan L. Selman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 3 | |
| 3 | 3 | |
| 4 | 17 | |
| 5 | Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems | 0 |
| 6 | 0 | |
| 7 | 0 | |
| 8 | Disjoint NP-Pairs | 1 |
| 9 | Complements of Multivalued Functions. | 10 |
| 10 | 27 | |
| 11 | Average Time Complexity Classes | 1 |
| 12 | 85 | |
| 13 | 1 | |
| 14 | 35 | |
| 15 | 139 | |
| 16 | 38 | |
| 17 | 75 | |
| 18 | 15 | |
| 19 | 62 | |
| 20 | 249 |
About Alan L. Selman
Alan L. Selman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Theoretical Computer Science, having authored 91 papers that have together received 1.9k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (42 papers), Computability, Logic, AI Algorithms (30 papers) and semigroups and automata theory (22 papers). The work is most often cited by research in Computational Theory and Mathematics (1.6k citations), Artificial Intelligence (1.1k citations) and Computer Networks and Communications (215 citations). Alan L. Selman has collaborated with scholars based in United States, Germany and Israel. Frequent co-authors include Nancy Lynch, Richard E. Ladner, Timothy J. Long, Ronald V. Book, Steven Homer, Shimon Even, Yacov Yacobi, Neil D. Jones, T. P. Baker and Ashish V. Naik. Their work appears in journals such as Communications of the ACM, Journal of the ACM and Transactions of the American Mathematical Society.
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.