Countries citing papers authored by J. Nathan Foster
Since
Specialization
Citations
This map shows the geographic impact of J. Nathan Foster'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 J. Nathan Foster with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Nathan Foster more than expected).
Fields of papers citing papers by J. Nathan Foster
This network shows the impact of papers produced by J. Nathan Foster. 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 J. Nathan Foster. The network helps show where J. Nathan Foster may publish in the future.
Co-authorship network of co-authors of J. Nathan Foster
This figure shows the co-authorship network connecting the top 25 collaborators of J. Nathan Foster.
A scholar is included among the top collaborators of J. Nathan Foster 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 J. Nathan Foster. J. Nathan Foster is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
19 of 19 papers shown
1.
Foster, J. Nathan, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, & Alan Schmitt. (2015). POPL 2005. ACM SIGPLAN Notices. 50(8S). 49–62.1 indexed citations
2.
Foster, J. Nathan, Benjamin C. Pierce, & Steve Zdancewic. (2009). Updatable Security Views. 29. 60–74.23 indexed citations
3.
Pierce, Benjamin C. & J. Nathan Foster. (2009). Bidirectional programming languages.19 indexed citations
4.
Czarnecki, Krzysztof, J. Nathan Foster, Zhenjiang Hu, & James F. Terwilliger. (2009). Bidirectional Transformations: A Cross-Discipline Perspective GRACE Meeting Notes, State of the Art, and Outlook.11 indexed citations
5.
Foster, J. Nathan, Ravi Konuru, Jérǒme Simèon, & Lionel Villard. (2008). An Algebraic Approach to View Maintenance for XQuery..5 indexed citations
6.
Bohannon, Aaron, et al.. (2008). Boomerang. 407–419.106 indexed citations
7.
Foster, J. Nathan, et al.. (2008). Quotient lenses. 383–396.32 indexed citations
8.
Foster, J. Nathan, Todd J. Green, & Val Tannen. (2008). Annotated XML. 271–280.65 indexed citations
9.
Foster, J. Nathan, et al.. (2008). Quotient lenses. ACM SIGPLAN Notices. 43(9). 383–396.40 indexed citations
Foster, J. Nathan & Grigoris Karvounarakis. (2007). Caching and Replication in Mobile Data Management.. IEEE Data(base) Engineering Bulletin. 30. 13–20.12 indexed citations
12.
Foster, J. Nathan, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, & Alan Schmitt. (2007). Combinators for bidirectional tree transformations. ACM Transactions on Programming Languages and Systems. 29(3). 17–17.223 indexed citations
13.
Foster, J. Nathan, Benjamin C. Pierce, & Alan Schmitt. (2007). A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice. ScholarlyCommons (University of Pennsylvania). 80–90.8 indexed citations
14.
Foster, J. Nathan & Dimitrios Vytiniotis. (2006). A Theory of Featherweight Java in Isabelle/HOL.. 2006.3 indexed citations
Foster, J. Nathan, et al.. (2005). Schema-Directed Data Synchronization. ScholarlyCommons (University of Pennsylvania).3 indexed citations
17.
Foster, J. Nathan, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, & Alan Schmitt. (2005). Combinators for bi-directional tree transformations. ACM SIGPLAN Notices. 40(1). 233–246.20 indexed citations
Foster, J. Nathan. (2001). Rupiah: Towards an Expressive Static Type System for Java.3 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.