Lane A. Hemachandra
About
In The Last Decade
Lane A. Hemachandra
54 papers receiving 892 citations
Peers
Comparison fields: 5 of 50
- Computational Theory and Mathematics 771
- Artificial Intelligence 567
- Computer Networks and Communications 146
- Electrical and Electronic Engineering 87
- Signal Processing 46
Countries citing papers authored by Lane A. Hemachandra
This map shows the geographic impact of Lane A. Hemachandra'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 Lane A. Hemachandra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lane A. Hemachandra more than expected).
Fields of papers citing papers by Lane A. Hemachandra
This network shows the impact of papers produced by Lane A. Hemachandra. 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 Lane A. Hemachandra. The network helps show where Lane A. Hemachandra may publish in the future.
Co-authorship network of co-authors of Lane A. Hemachandra
This figure shows the co-authorship network connecting the top 25 collaborators of Lane A. Hemachandra. A scholar is included among the top collaborators of Lane A. Hemachandra 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 Lane A. Hemachandra. Lane A. Hemachandra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Promises and fault-tolerant database access | 4 |
| 2 | 7 | |
| 3 | 41 | |
| 4 | Is #P Closed under Substraction? | 2 |
| 5 | 2 | |
| 6 | 9 | |
| 7 | Collapsing Degrees via Strong Computation (Extended Abstract) | 1 |
| 8 | 8 | |
| 9 | 6 | |
| 10 | 27 | |
| 11 | A Note on Relativizing Complexity Classes with Tally Oracles | 2 |
| 12 | 13 | |
| 13 | 19 | |
| 14 | On the Power of Probabilistic Polynomial Time: P NP[log] subseteq PP. | 3 |
| 15 | Using Randomness to Characterize the Complexity of Computation | 3 |
| 16 | 79 | |
| 17 | 35 | |
| 18 | 8 | |
| 19 | 6 | |
| 20 | 1 |
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.