Mark R. Tuttle

3.8k citations
60 papers · 2.0k · 1 hit paper · h-index 20

Impact in

Papers in

Mark R. Tuttle

57 papers receiving 1.9k citations

Mark R. Tuttle's Hit Papers

Hierarchical correctness proofs for distributed algorithms 1987 · 625 citations
6250+13+26Years since publication200400600

Peers

Mark R. Tuttle
Comparison fields: 5 of 58
  • Software 241
  • Hardware and Architecture 395
  • Computational Theory and Mathematics 877
  • Computer Networks and Communications 1.2k
  • Artificial Intelligence 925
Replace Gerda Janssens with:
Gerda Janssens Belgium
Nissim Francez Israel
Shaula Yemini United States
Marcello Bonsangue Netherlands
Carel S. Schölten United States
Gert Smolka Germany
Jeremy Gibbons United Kingdom
Radha Jagadeesan United States
Frank S. de Boer Netherlands
Robert E. Strom United States
Mark R. Tuttle relative to Gerda Janssens Belgium Gerda Janssens's profile →
Citations per field
00.5×2×4×6×
Gerda Janssens · 1×
Citations per year

Countries citing papers authored by Mark R. Tuttle

Since Specialization
Citations

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

Fields of papers citing papers by Mark R. Tuttle

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Mark R. Tuttle, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Mark R. Tuttle Line = papers co-authored together Mark R. Tuttle links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 60 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Hierarchical correctness proofs for distributed algorithms
Hit paper breakdown →
1987625
2 1991180
3 1988133
4 1993102
5 200885
6 199184
7 200062
8 199856
9 200851
10 201148
11 200348
12 200539
13
Time-Constrained Automata (Extended Abstract)
199135
14 200935
15 198830
16
Redo Recovery after System Crashes
199525
17 200220
18 202020
19 200420
20 199319

About Mark R. Tuttle

Mark R. Tuttle is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Hardware and Architecture and Information Systems, having authored 60 papers that have together received 2.0k indexed citations. Recurring topics across this work include Distributed systems and fault tolerance (30 papers), Formal Methods in Verification (14 papers), Parallel Computing and Optimization Techniques (12 papers), Optimization and Search Problems (10 papers), Security and Verification in Computing (10 papers), Petri Nets in System Modeling (7 papers), Cryptography and Data Security (7 papers) and Logic, programming, and type systems (7 papers). The work is most often cited by research in Software (241 citations), Hardware and Architecture (395 citations), Computational Theory and Mathematics (877 citations), Computer Networks and Communications (1.2k citations) and Artificial Intelligence (925 citations). Mark R. Tuttle has collaborated with scholars based in United States, Israel and United Kingdom. Frequent co-authors include Nancy Lynch, Martı́n Abadi, Yoram Moses, Joseph Y. Halpern, Maurice Herlihy, Michael Merritt, Francesmary Modugno, David Lomet, Zvi Lotker and Sergio Rajsbaum. Their work appears in journals such as Journal of the ACM, Formal Methods in System Design, Algorithmica, Software Practice and Experience and Formal Aspects of Computing.

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