Alan L. Selman
About
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
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | Applications of forcing to definability problems in the arithmetical hierarchy | Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) | Alan L. Selman | 0 |
| 2 | Non-mitotic sets | Theoretical Computer Science | Christian Glaßer, Alan L. Selman et al. | 3 |
| 3 | Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy | Theoretical Computer Science | A. Pavan, Alan L. Selman et al. | 3 |
| 4 | Theoretical Computer Science: essays in Memory of Shimon Even | CERN Document Server (European Organization for Nuclear Research) | Oded Goldreich, Arnold L. Rosenberg et al. | 17 |
| 5 | Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems | Electronic colloquium on computational complexity | Christian Glaßer, Alan L. Selman et al. | 0 |
| 6 | Properties of NP-complete sets | A. Pavan, Alan L. Selman et al. | 0 | |
| 7 | Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy | Alan L. Selman et al. | 0 | |
| 8 | Disjoint NP-Pairs | Electronic colloquium on computational complexity | Christian Glaßer, Alan L. Selman et al. | 1 |
| 9 | Complements of Multivalued Functions. | Stephen Fenner, Steven Homer et al. | 10 | |
| 10 | P-Selective Sets and Reducing Search to Decision vs Self-Reducibility | Journal of Computer and System Sciences | Edith Hemaspaandra, Ashish V. Naik et al. | 27 |
| 11 | Average Time Complexity Classes | Electronic colloquium on computational complexity | Jin‐Yi Cai, Alan L. Selman | 1 |
| 12 | A taxonomy of complexity classes of functions | Journal of Computer and System Sciences | Alan L. Selman | 85 |
| 13 | Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986 | Springer eBooks | Alan L. Selman | 1 |
| 14 | Qualitative relativizations of complexity classes | Journal of Computer and System Sciences | Ronald V. Book, Timothy J. Long et al. | 35 |
| 15 | The complexity of promise problems with applications to public-key cryptography | Information and Control | Shimon Even, Alan L. Selman et al. | 139 |
| 16 | Analogues of semirecursive sets and effective reducibilities to the study of NP complexity | Information and Control | Alan L. Selman | 38 |
| 17 | Reductions on NP and P-selective sets | Theoretical Computer Science | Alan L. Selman | 75 |
| 18 | Some observations on NP real numbers and P-selective sets | Journal of Computer and System Sciences | Alan L. Selman | 15 |
| 19 | A second step toward the polynomial hierarchy | Theoretical Computer Science | T. P. Baker, Alan L. Selman | 62 |
| 20 | A comparison of polynomial time reducibilities | Theoretical Computer Science | Richard E. Ladner, Nancy Lynch et al. | 249 |
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.