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.
Countries citing papers authored by Benjamin C. Pierce
Since
Specialization
Citations
This map shows the geographic impact of Benjamin C. Pierce'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 Benjamin C. Pierce with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Benjamin C. Pierce more than expected).
Fields of papers citing papers by Benjamin C. Pierce
This network shows the impact of papers produced by Benjamin C. Pierce. 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 Benjamin C. Pierce. The network helps show where Benjamin C. Pierce may publish in the future.
Co-authorship network of co-authors of Benjamin C. Pierce
This figure shows the co-authorship network connecting the top 25 collaborators of Benjamin C. Pierce.
A scholar is included among the top collaborators of Benjamin C. Pierce 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 Benjamin C. Pierce. Benjamin C. Pierce 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.
Pierce, Benjamin C., et al.. (2024). Stream Types. Proceedings of the ACM on Programming Languages. 8(PLDI). 1412–1436.2 indexed citations
2.
Wang, Meng, et al.. (2023). Reflecting on Random Generation. Proceedings of the ACM on Programming Languages. 7(ICFP). 322–355.4 indexed citations
3.
Haeberlen, Andreas, et al.. (2020). Orchard: Differentially Private Analytics at Scale. Operating Systems Design and Implementation. 1065–1081.3 indexed citations
4.
Hur, Chung-Kil, et al.. (2019). Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).. arXiv (Cornell University).1 indexed citations
5.
Lampropoulos, Leonidas, et al.. (2018). Generating Good Generators for Inductive Relations.3 indexed citations
Haeberlen, Andreas, Benjamin C. Pierce, & Arjun Narayan. (2011). Differential privacy under fire. ScholarlyCommons (University of Pennsylvania). 33–33.72 indexed citations
8.
Bohannon, Aaron & Benjamin C. Pierce. (2010). Featherweight Firefox: formalizing the core of a web browser. 11–11.36 indexed citations
Danvy, Olivier & Benjamin C. Pierce. (2005). Proceedings of the tenth ACM SIGPLAN international conference on Functional programming.1 indexed citations
12.
Hofmann, Martin & Benjamin C. Pierce. (2002). Type Destructors. Information and Computation. 172(1). 29–62.1 indexed citations
13.
Igarashi, Atsushi & Benjamin C. Pierce. (2002). On Inner Classes. Information and Computation. 177(1). 56–89.18 indexed citations
14.
Pierce, Benjamin C. & Naoki Kobayashi. (2001). Theoretical aspects of computer software : 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001 : proceedings. Springer eBooks.3 indexed citations
15.
Hosoya, Haruo & Benjamin C. Pierce. (2000). XDuce: A Typed XML Processing Language (Preliminary Report.5 indexed citations
16.
Pierce, Benjamin C.. (1998). Type Systems for Concurrent Calculi (Abstract). 364–365.
17.
Hofmann, Martin & Benjamin C. Pierce. (1995). Positive subtyping. 186–197.19 indexed citations
18.
Steffen, Martín & Benjamin C. Pierce. (1994). Higher-Order Subtyping. 511–530.22 indexed citations
Pierce, Benjamin C., Didier Rémy, & David N. Turner. (1993). A Typed Higher-Order Programming Language Based on the Pi-Calculus. Kyoto University Research Information Repository (Kyoto University). 851. 46–60.4 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.