Jon G. Riecke

1.7k total citations
30 papers, 1000 citations indexed

About

Jon G. Riecke is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Jon G. Riecke has authored 30 papers receiving a total of 1000 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 21 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Jon G. Riecke's work include Logic, programming, and type systems (26 papers), Logic, Reasoning, and Knowledge (16 papers) and Formal Methods in Verification (15 papers). Jon G. Riecke is often cited by papers focused on Logic, programming, and type systems (26 papers), Logic, Reasoning, and Knowledge (16 papers) and Formal Methods in Verification (15 papers). Jon G. Riecke collaborates with scholars based in United States, Denmark and Canada. Jon G. Riecke's co-authors include Nevin Heintze, Anindya Basu, Anindya Banerjee, Martı́n Abadi, Carl A. Gunter, Didier Rémy, Peter W. O’Hearn, John Reppy, C. Addison Stone and Albert R. Meyer and has published in prestigious journals such as ACM SIGCOMM Computer Communication Review, ACM SIGPLAN Notices and Information and Computation.

In The Last Decade

Jon G. Riecke

29 papers receiving 888 citations

Peers

Jon G. Riecke
Mads Dam Sweden
Simon Winwood Australia
Toby Murray Australia
Dennis Volpano United States
Rafal Kolanski Australia
David A. Naumann United States
Chris Hawblitzel United States
Mads Dam Sweden
Jon G. Riecke
Citations per year, relative to Jon G. Riecke Jon G. Riecke (= 1×) peers Mads Dam

Countries citing papers authored by Jon G. Riecke

Since Specialization
Citations

This map shows the geographic impact of Jon G. Riecke'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 Jon G. Riecke with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jon G. Riecke more than expected).

Fields of papers citing papers by Jon G. Riecke

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jon G. Riecke. 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 Jon G. Riecke. The network helps show where Jon G. Riecke may publish in the future.

Co-authorship network of co-authors of Jon G. Riecke

This figure shows the co-authorship network connecting the top 25 collaborators of Jon G. Riecke. A scholar is included among the top collaborators of Jon G. Riecke 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 Jon G. Riecke. Jon G. Riecke 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.
Riecke, Jon G. & Anders B. Sandholm. (2002). A Relational Account of Call-by-Value Sequentiality. Information and Computation. 179(2). 296–331. 8 indexed citations
2.
Riecke, Jon G. & C. Addison Stone. (2002). Privacy via Subsumption. Information and Computation. 172(1). 2–28. 19 indexed citations
3.
Cosmadakis, Stavros S., Albert R. Meyer, & Jon G. Riecke. (2002). Completeness for typed lazy inequalities. 312–320. 3 indexed citations
4.
Basu, Anindya & Jon G. Riecke. (2001). Stability issues in OSPF routing. 225–236. 119 indexed citations
5.
Basu, Anindya & Jon G. Riecke. (2001). Stability issues in OSPF routing. ACM SIGCOMM Computer Communication Review. 31(4). 225–236. 29 indexed citations
6.
Riecke, Jon G. & Anders B. Sandholm. (1999). A Relational Account of Call-by-Value Sequentiality. BRICS Report Series. 6(10). 1 indexed citations
7.
Heintze, Nevin & Jon G. Riecke. (1998). The SLam calculus. 365–377. 261 indexed citations
8.
Mitchell, John C. & Jon G. Riecke. (1997). The analysis of programming structure. ACM SIGACT News. 28(2). 24–31. 1 indexed citations
9.
Riecke, Jon G. & Anders B. Sandholm. (1997). A Relational Account of Call-by-Value Sequentiality. BRICS Report Series. 4(41). 2 indexed citations
10.
Riecke, Jon G.. (1997). Programming language semantics. ACM SIGPLAN Notices. 32(1). 106–109. 5 indexed citations
11.
Reppy, John & Jon G. Riecke. (1996). Simple objects for Standard ML. ACM SIGPLAN Notices. 31(5). 171–180. 1 indexed citations
12.
Reppy, John & Jon G. Riecke. (1996). Simple objects for Standard ML. 171–180. 31 indexed citations
13.
Riecke, Jon G.. (1995). Statman′s 1-Section Theorem. Information and Computation. 116(2). 294–303.
14.
Gunter, Carl A., Didier Rémy, & Jon G. Riecke. (1995). A generalization of exceptions and control in ML-like languages. 12–23. 75 indexed citations
15.
O’Hearn, Peter W. & Jon G. Riecke. (1995). Kripke Logical Relations and PCF. Information and Computation. 120(1). 107–116. 42 indexed citations
16.
Riecke, Jon G. & Ramesh Viswanathan. (1995). Isolating side effects in sequential languages. 1–12. 16 indexed citations
17.
Gunter, Carl A., et al.. (1992). Proving memory management invariants for a language based on linear logic. V(1). 139–150. 2 indexed citations
18.
Riecke, Jon G.. (1991). Fully abstract translations between functional languages. 245–254. 24 indexed citations
19.
Riecke, Jon G.. (1990). A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). International Colloquium on Automata, Languages and Programming. 20–31. 3 indexed citations
20.
Meyer, Albert R. & Jon G. Riecke. (1988). Continuations may be unreasonable. 63–71. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026