Larry Stockmeyer

8.6k citations
49 papers · 4.8k · 2 hit papers · h-index 24

Impact in

Papers in

Larry Stockmeyer

48 papers receiving 4.3k citations

Larry Stockmeyer's Hit Papers

Consensus in the presence of partial synchrony 1988 · 972 citations
9720+16+33Years since publication4008001.2k

Peers

Larry Stockmeyer
Comparison fields: 5 of 99
  • Computational Theory and Mathematics 2.0k
  • Computer Networks and Communications 2.5k
  • Hardware and Architecture 634
  • Computer Graphics and Computer-Aided Design 246
  • Discrete Mathematics and Combinatorics 173
Replace Arnold L. Rosenberg with:
Arnold L. Rosenberg United States
Shimon Even Israel
Zvi Galil United States
Don Coppersmith United States
Frank Thomson Leighton United States
Daniel D. Sleator United States
Stephen Cook Canada
Carsten Lund United States
Alon Itai Israel
Michael S. Paterson United Kingdom
Larry Stockmeyer relative to Arnold L. Rosenberg United States Arnold L. Rosenberg's profile →
Citations per field
00.5×5.5×
Arnold L. Rosenberg · 1×
Citations per year

Countries citing papers authored by Larry Stockmeyer

Since Specialization
Citations

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

Fields of papers citing papers by Larry Stockmeyer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Larry Stockmeyer, 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 Larry Stockmeyer Line = papers co-authored together Larry Stockmeyer links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

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

#Work
1
Some simplified NP-complete graph problems
Hit paper breakdown →
19761253
2
Consensus in the presence of partial synchrony
Hit paper breakdown →
1988972
3 1974362
4 1987346
5 1983247
6 1984191
7 1995124
8 1985120
9 1983116
10 1984101
11 198577
12 197371
13 200263
14 199860
15 199352
16 200449
17 199046
18 199245
19 198744
20 198538

About Larry Stockmeyer

Larry Stockmeyer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture and Information Systems, having authored 49 papers that have together received 4.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (19 papers), Distributed systems and fault tolerance (13 papers), Advanced Graph Theory Research (11 papers), semigroups and automata theory (9 papers), Cryptography and Data Security (8 papers), Optimization and Search Problems (8 papers), Algorithms and Data Compression (6 papers) and Machine Learning and Algorithms (6 papers). The work is most often cited by research in Computational Theory and Mathematics (2.0k citations), Computer Networks and Communications (2.5k citations), Hardware and Architecture (634 citations), Computer Graphics and Computer-Aided Design (246 citations) and Discrete Mathematics and Combinatorics (173 citations). Larry Stockmeyer has collaborated with scholars based in United States, Israel and India. Frequent co-authors include Cynthia Dwork, M. R. Garey, David S. Johnson, Nancy Lynch, Danny Dolev, Uzi Vishkin, D. S. Johnson, Moni Naor, Ronald Fagin and Ashok K. Chandra. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing, Theoretical Computer Science, Algorithmica and Journal of Symbolic Logic.

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