John Maraist

562 total citations
12 papers, 306 citations indexed

About

John Maraist is a scholar working on Artificial Intelligence, Computer Networks and Communications and Information Systems. According to data from OpenAlex, John Maraist has authored 12 papers receiving a total of 306 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 3 papers in Computer Networks and Communications and 3 papers in Information Systems. Recurrent topics in John Maraist's work include Logic, programming, and type systems (5 papers), Logic, Reasoning, and Knowledge (3 papers) and Advanced Software Engineering Methodologies (3 papers). John Maraist is often cited by papers focused on Logic, programming, and type systems (5 papers), Logic, Reasoning, and Knowledge (3 papers) and Advanced Software Engineering Methodologies (3 papers). John Maraist collaborates with scholars based in United Kingdom, Australia and Germany. John Maraist's co-authors include Martin Odersky, Philip Wadler, Matthias Felleisen, Zena M. Ariola, David N. Turner, Robert P. Goldman, Christopher Geib, Paul Robertson, Robert Balzer and Mark Burstein and has published in prestigious journals such as Theoretical Computer Science, Journal of Functional Programming and Electronic Notes in Theoretical Computer Science.

In The Last Decade

John Maraist

10 papers receiving 277 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
John Maraist United Kingdom 6 290 178 58 54 29 12 306
Herman Geuvers Netherlands 11 297 1.0× 228 1.3× 21 0.4× 37 0.7× 26 0.9× 51 343
Yukiyoshi Kameyama Japan 10 223 0.8× 90 0.5× 90 1.6× 45 0.8× 63 2.2× 39 272
Jana Dunfield Canada 9 222 0.8× 113 0.6× 47 0.8× 54 1.0× 72 2.5× 18 236
Sigbjørn Finne United Kingdom 6 191 0.7× 71 0.4× 143 2.5× 127 2.4× 49 1.7× 9 282
Stefan Blom Netherlands 9 121 0.4× 156 0.9× 50 0.9× 57 1.1× 21 0.7× 31 219
Bernard Serpette France 8 98 0.3× 62 0.3× 56 1.0× 71 1.3× 27 0.9× 18 158
Pierre-Malo Deniélou United Kingdom 9 215 0.7× 104 0.6× 37 0.6× 132 2.4× 50 1.7× 10 251
Josef Svenningsson Sweden 8 153 0.5× 74 0.4× 111 1.9× 59 1.1× 45 1.6× 17 211
Lasse R. Nielsen Denmark 8 323 1.1× 186 1.0× 68 1.2× 38 0.7× 63 2.2× 18 338
Mads Sig Ager Denmark 10 382 1.3× 212 1.2× 118 2.0× 47 0.9× 57 2.0× 19 402

Countries citing papers authored by John Maraist

Since Specialization
Citations

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

Fields of papers citing papers by John Maraist

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of John Maraist

This figure shows the co-authorship network connecting the top 25 collaborators of John Maraist. A scholar is included among the top collaborators of John Maraist 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 John Maraist. John Maraist is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

12 of 12 papers shown
1.
Maraist, John. (2017). String Shuffling over a Gap between Parsing and Plan Recognition.. National Conference on Artificial Intelligence. 3 indexed citations
2.
Musliner, David J., et al.. (2012). Identifying Culprits When Probabilistic Verification Fails. 1111–1119.
3.
Burstein, Mark, Robert P. Goldman, Paul Robertson, et al.. (2012). STRATUS: Strategic and Tactical Resiliency against Threats to Ubiquitous Systems. 47–54. 7 indexed citations
4.
Goldman, Robert P. & John Maraist. (2009). SHOPPER: interpreter for a high-level web services language. 1 indexed citations
5.
Geib, Christopher, John Maraist, & Robert P. Goldman. (2008). A new probabilistic plan recognition algorithm based on string rewriting. International Conference on Automated Planning and Scheduling. 91–98. 22 indexed citations
6.
Maraist, John, Martin Odersky, David N. Turner, & Philip Wadler. (1999). Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Theoretical Computer Science. 228(1-2). 175–210. 41 indexed citations
7.
Maraist, John, Martin Odersky, & Philip Wadler. (1998). The call-by-need lambda calculus. Journal of Functional Programming. 8(3). 275–317. 57 indexed citations
8.
Salzmann, Christian & John Maraist. (1997). A Pattern-Based Approach for a Flexible, Self-Extending Document System. 2 indexed citations
9.
Maraist, John. (1997). Comparing reduction strategies in resource conscious lambda calculi. 2 indexed citations
10.
Maraist, John. (1996). Separating weakening and contraction in a linear lambda calculus. Repository KITopen (Karlsruhe Institute of Technology). 151–166. 2 indexed citations
11.
Ariola, Zena M., John Maraist, Martin Odersky, Matthias Felleisen, & Philip Wadler. (1995). A call-by-need lambda calculus. Edinburgh Research Explorer. 233–246. 151 indexed citations
12.
Maraist, John, Martin Odersky, David N. Turner, & Philip Wadler. (1995). Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus. Electronic Notes in Theoretical Computer Science. 1. 370–392. 18 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