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.
Report on the programming language Haskell
1992527 citationsPaul Hudak, Philip Wadler et al.ACM SIGPLAN Noticesprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Rishiyur S. Nikhil
Since
Specialization
Citations
This map shows the geographic impact of Rishiyur S. Nikhil'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 Rishiyur S. Nikhil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rishiyur S. Nikhil more than expected).
Fields of papers citing papers by Rishiyur S. Nikhil
This network shows the impact of papers produced by Rishiyur S. Nikhil. 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 Rishiyur S. Nikhil. The network helps show where Rishiyur S. Nikhil may publish in the future.
Co-authorship network of co-authors of Rishiyur S. Nikhil
This figure shows the co-authorship network connecting the top 25 collaborators of Rishiyur S. Nikhil.
A scholar is included among the top collaborators of Rishiyur S. Nikhil 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 Rishiyur S. Nikhil. Rishiyur S. Nikhil is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Nikhil, Rishiyur S. & Arvind Arvind. (2009). What is Bluespec?. 39(1). 1–1.13 indexed citations
3.
Arvind, Arvind & Rishiyur S. Nikhil. (2008). Hands-on Introduction to Bluespec System Verilog (BSV) (Abstract).. 205–206.2 indexed citations
4.
Nikhil, Rishiyur S. & Arvind Arvind. (2008). What is Bluespec?. 38(23). 1–1.12 indexed citations
5.
Rehg, James M., Umakishore Ramachandran, Robert H. Halstead, et al.. (2002). Space-Time Memory: A Parallel Programming Abstraction for Dynamic Vision Applications.2 indexed citations
6.
Arvind, Arvind & Rishiyur S. Nikhil. (2001). Implicit Parallel Programming in pH.38 indexed citations
Nikhil, Rishiyur S., et al.. (1992). Atomic data structures for parallel computing.4 indexed citations
13.
Hudak, Paul, Simon Jones, Philip Wadler, et al.. (1992). Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.. ACM SIGPLAN Notices. 27. 1.148 indexed citations
14.
Aditya, Shail & Rishiyur S. Nikhil. (1991). Incremental polymorphism. Lecture notes in computer science. 379–405.15 indexed citations
15.
Heytens, Michael L. & Rishiyur S. Nikhil. (1989). GESTALT. ACM SIGMOD Record. 18(1). 54–67.15 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.