Eric Lehman

4.9k citations
21 papers · 2.5k · 1 hit paper · h-index 14

Impact in

Papers in

Eric Lehman

20 papers receiving 2.3k citations

Eric Lehman's Hit Papers

Consistent hashing and random trees 1997 · 1.4k citations
1.4k0+9+19Years since publication4008001.2k

Peers

Eric Lehman
Comparison fields: 5 of 43
  • Computer Networks and Communications 1.3k
  • Discrete Mathematics and Combinatorics 196
  • Computational Theory and Mathematics 472
  • Information Systems 380
  • Artificial Intelligence 509
Replace Paul W. Beame with:
Paul W. Beame United States
J. Lawrence Carter United States
Yeow Meng Chee Singapore
Yaacov Yesha United States
Artur Czumaj United Kingdom
Marijn J. H. Heule United States
Mark G. Karpovsky United States
Brenda S. Baker United States
Michael Rodeh Israel
Shmuel Zaks Israel
Eric Lehman relative to Paul W. Beame United States Paul W. Beame's profile →
Citations per field
00.5×2×3×3.6×
Paul W. Beame · 1×
Citations per year

Countries citing papers authored by Eric Lehman

Since Specialization
Citations

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

Fields of papers citing papers by Eric Lehman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

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

All Works

20 of 20 papers shown

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

#Work
1
Consistent hashing and random trees
Hit paper breakdown →
19971400
2 2005265
3 2004153
4 2000141
5 2002133
6 1999102
7 200268
8 199762
9 200245
10 199530
11 200126
12 200217
13 200216
14 200214
15 200911
16
Mathematics for computer science
20175
17 19944
18
Approximation Algorithms for Grammar-Based Data Compression
20023
19 20023
20 19941

About Eric Lehman

Eric Lehman is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications and Electrical and Electronic Engineering, having authored 21 papers that have together received 2.5k indexed citations. Recurring topics across this work include VLSI and FPGA Design Techniques (6 papers), Algorithms and Data Compression (6 papers), Complexity and Algorithms in Graphs (5 papers), Limits and Structures in Graph Theory (4 papers), Computability, Logic, AI Algorithms (3 papers), semigroups and automata theory (2 papers), Cooperative Communication and Network Coding (1 paper) and Mathematics Education and Programs (1 paper). The work is most often cited by research in Computer Networks and Communications (1.3k citations), Discrete Mathematics and Combinatorics (196 citations), Computational Theory and Mathematics (472 citations), Information Systems (380 citations) and Artificial Intelligence (509 citations). Eric Lehman has collaborated with scholars based in United States and Israel. Frequent co-authors include Rina Panigrahy‎, Tom Leighton, David R. Karger, Abhi A. Shelat, April Rasala Lehman, Dana Ron, Oded Goldreich, Manoj Prabhakaran, Moses Charikar and Amit Sahai. Their work appears in journals such as IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Journal of Combinatorial Theory Series A, COMBINATORICA, IEEE Transactions on Information Theory and Lecture notes in computer science.

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