Alan L. Selman

3.7k total citations
91 papers, 1.9k citations indexed

About

Alan L. Selman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Alan L. Selman has authored 91 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 74 papers in Computational Theory and Mathematics, 54 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Alan L. Selman's work include Complexity and Algorithms in Graphs (42 papers), Computability, Logic, AI Algorithms (30 papers) and semigroups and automata theory (22 papers). Alan L. Selman is often cited by papers focused on Complexity and Algorithms in Graphs (42 papers), Computability, Logic, AI Algorithms (30 papers) and semigroups and automata theory (22 papers). Alan L. Selman collaborates with scholars based in United States, Germany and Israel. Alan L. Selman's 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 and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and Transactions of the American Mathematical Society.

In The Last Decade

Alan L. Selman

81 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Alan L. Selman United States	25	1.6k	1.1k	215	82	57	91	1.9k
Eric Allender United States	20	1.2k 0.7×	802 0.7×	180 0.8×	88 1.1×	29 0.5×	117	1.4k
Ker‐I Ko United States	20	1.3k 0.8×	687 0.6×	307 1.4×	105 1.3×	102 1.8×	82	1.7k
Richard Beigel United States	24	1.3k 0.8×	1.0k 0.9×	285 1.3×	128 1.6×	30 0.5×	97	1.7k
Ravi B. Boppana United States	13	744 0.5×	532 0.5×	216 1.0×	117 1.4×	57 1.0×	26	1.1k
Jacobo Torán Germany	15	721 0.4×	516 0.5×	153 0.7×	60 0.7×	34 0.6×	56	989
S. Goldwasser United States	15	726 0.5×	983 0.9×	234 1.1×	95 1.2×	51 0.9×	24	1.3k
Juris Hartmanis United States	18	1.6k 1.0×	1.0k 0.9×	254 1.2×	142 1.7×	38 0.7×	43	2.1k
Alasdair Urquhart Canada	18	1.2k 0.7×	1.1k 0.9×	204 0.9×	56 0.7×	46 0.8×	84	1.5k
Peter Bro Miltersen Denmark	18	628 0.4×	712 0.6×	252 1.2×	69 0.8×	20 0.4×	78	1.1k
Amir Shpilka Israel	18	930 0.6×	823 0.7×	275 1.3×	169 2.1×	25 0.4×	110	1.3k

Countries citing papers authored by Alan L. Selman

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

Selman, Alan L.. (2018). Applications of forcing to definability problems in the arithmetical hierarchy. Research Showcase @ Carnegie Mellon University (Carnegie Mellon University).

Glaßer, Christian, et al.. (2008). Non-mitotic sets. Theoretical Computer Science. 410(21-23). 2011–2023. 3 indexed citations

Pavan, A., et al.. (2007). Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theoretical Computer Science. 385(1-3). 167–178. 3 indexed citations

Goldreich, Oded, Arnold L. Rosenberg, & Alan L. Selman. (2006). Theoretical Computer Science: essays in Memory of Shimon Even. CERN Document Server (European Organization for Nuclear Research). 17 indexed citations

Glaßer, Christian, et al.. (2005). Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems. Electronic colloquium on computational complexity.

Pavan, A., et al.. (2004). Properties of NP-complete sets. 184–197.

Selman, Alan L., et al.. (2004). Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. 82–90.

Glaßer, Christian, et al.. (2003). Disjoint NP-Pairs. Electronic colloquium on computational complexity. 10. 1 indexed citations

Fenner, Stephen, et al.. (1999). Complements of Multivalued Functions.. 1999. 10 indexed citations

10.

Hemaspaandra, Edith, Ashish V. Naik, Mitsunori Ogihara, & Alan L. Selman. (1996). P-Selective Sets and Reducing Search to Decision vs Self-Reducibility. Journal of Computer and System Sciences. 53(2). 194–209. 27 indexed citations

11.

Cai, Jin‐Yi & Alan L. Selman. (1995). Average Time Complexity Classes. Electronic colloquium on computational complexity. 2. 1 indexed citations

12.

Selman, Alan L.. (1994). A taxonomy of complexity classes of functions. Journal of Computer and System Sciences. 48(2). 357–381. 85 indexed citations

13.

Selman, Alan L.. (1986). Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986. Springer eBooks. 1 indexed citations

14.

Book, Ronald V., Timothy J. Long, & Alan L. Selman. (1985). Qualitative relativizations of complexity classes. Journal of Computer and System Sciences. 30(3). 395–413. 35 indexed citations

15.

Even, Shimon, Alan L. Selman, & Yacov Yacobi. (1984). The complexity of promise problems with applications to public-key cryptography. Information and Control. 61(2). 159–173. 139 indexed citations

16.

Selman, Alan L.. (1982). Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control. 52(1). 36–51. 38 indexed citations

17.

Selman, Alan L.. (1982). Reductions on NP and P-selective sets. Theoretical Computer Science. 19(3). 287–304. 75 indexed citations

18.

Selman, Alan L.. (1981). Some observations on NP real numbers and P-selective sets. Journal of Computer and System Sciences. 23(3). 326–332. 15 indexed citations

19.

Baker, T. P. & Alan L. Selman. (1979). A second step toward the polynomial hierarchy. Theoretical Computer Science. 8(2). 177–187. 62 indexed citations

20.

Ladner, Richard E., Nancy Lynch, & Alan L. Selman. (1975). A comparison of polynomial time reducibilities. Theoretical Computer Science. 1(2). 103–123. 249 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