Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A model for spectra-based software diagnosis
2011368 citationsLee Naish, Hua Jie Lee et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Lee Naish'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 Lee Naish with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lee Naish more than expected).
This network shows the impact of papers produced by Lee Naish. 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 Lee Naish. The network helps show where Lee Naish may publish in the future.
Co-authorship network of co-authors of Lee Naish
This figure shows the co-authorship network connecting the top 25 collaborators of Lee Naish.
A scholar is included among the top collaborators of Lee Naish 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 Lee Naish. Lee Naish is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Naish, Lee, Hua Jie Lee, & Kotagiri Ramamohanarao. (2012). Spectral debugging: How much better can we do?. 122. 99–106.6 indexed citations
2.
Smith, Stephen P., et al.. (2012). Individually tailored client-focused reports for ubiquitous devices : an experimental analysis. Journal of the Association for Information Systems. 1–9.1 indexed citations
Naish, Lee, et al.. (2008). Coercion-resistant tallying for STV voting. Minerva Access (University of Melbourne). 15.11 indexed citations
5.
Naish, Lee. (1997). A Declarative Debugging Scheme.. 1997.60 indexed citations
6.
Naish, Lee & Leon Sterling. (1997). A Higher Order Reconstruction of Stepwise Enhancement.1 indexed citations
7.
Naish, Lee. (1996). A Declarative View of Modes.. 185–199.8 indexed citations
8.
Naish, Lee, et al.. (1994). A Declarative Debugger for a Logical-Functional Language.3 indexed citations
9.
Palmer, D.A. & Lee Naish. (1991). NUA-Prolog: An Extension to the WAM for Parallel Andorra.. International Conference on Lightning Protection. 429–442.7 indexed citations
Naish, Lee. (1991). Verification of Logic Programs and Imperative Programs.. John Wiley & Sons, Inc. eBooks. 143–164.4 indexed citations
12.
Naish, Lee, Philip Dart, & Justin Zobel. (1989). The NU-Prolog Debugging Environment.. International Conference on Lightning Protection. 521–536.17 indexed citations
13.
Naish, Lee. (1988). Parallelizing NU-Prolog.. International Conference on Lightning Protection. 1546–1564.23 indexed citations
14.
Ramamohanarao, Kotagiri, John Shepherd, Lee Naish, et al.. (1987). The NU-Prolog Deductive Database System.. IEEE Data(base) Engineering Bulletin. 10. 10–15.8 indexed citations
15.
Naish, Lee, James A. Thom, & Kotagiri Ramamohanarao. (1987). Concurrent Database Updates in PROLOG.. International Conference on Lightning Protection. 178–195.5 indexed citations
16.
Thom, James A., Kotagiri Ramamohanarao, & Lee Naish. (1986). A Superjoin Algorithm for Deductive Databases. Very Large Data Bases. 189–196.16 indexed citations
17.
Naish, Lee. (1985). All Solutions Predicates in Prolog.. 73–77.10 indexed citations
18.
Naish, Lee. (1985). Prolog control rules. International Joint Conference on Artificial Intelligence. 720–722.7 indexed citations
Naish, Lee. (1984). Heterogeneous SLD resolution. The Journal of Logic Programming. 1(4). 297–303.5 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.