Experts ranked by H-index.

An expert has index h if h of his or her N papers have at least h citations each, and the other (N − h) papers have at most h citations each. More Information.

If you find a bug, please Email to us.

Home

H-index

Citation

Uptrend

Activity

Longevity

Diversity

Sociability

New Star

Show all topics

1

Mihalis Yannakakis

( Professor of Computer Science, Computer Systems Laboratory Dept. of Electrical Engineering School of Engineering Stanford University)

H-index: 75; Papers: 197; Citation: 18747
highest-cited paper: Optimization, Approximation, and Complexity Classes (1991) at J. Comput. Syst. Sci.(Cited By 1284)
Homepage: http://forum.stanford.edu/research/yannakakis.html

Expertise: Communication Complexity / Lower Bounds; Finite Languages / Database Queries; Model Checking / Hybrid Systems; Approximation Algorithms / Perfect Graphs;

2

Richard M. Karp

(Professor, Department of Electrical Engineering and Computer Science University of California at Berkeley)

H-index: 73; Papers: 194; Citation: 26728
highest-cited paper: A scalable content-addressable network (2001) at SIGCOMM(Cited By 6558)
Homepage: http://www.cs.berkeley.edu/~karp/

Expertise: Communication Complexity / Lower Bounds; Data Compression / Arithmetic Coding; Approximation Algorithms / Perfect Graphs;

5

David Peleg

(The Norman D. Cohen Professorial Chair of Computer Sciences, The Norman D. Cohen Professorial Chair of Computer Sciences Department of Computer Science and Applied Mathematics)

H-index: 58; Papers: 275; Citation: 10683
highest-cited paper: Online Tracking of Mobile Users (1995) at J. ACM(Cited By 360)
Homepage: http://www.wisdom.weizmann.ac.il/~peleg/

Expertise: Dynamic Networks / Extended Abstract; Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Random graph / Independence number;

11

Zvi Galil

(Professor , Computer Science Department of Columbia University)

H-index: 48; Papers: 171; Citation: 6613
highest-cited paper: Explicit Constructions of Linear Size Superconcentrators (1979) at FOCS(Cited By 355)
Homepage: http://www.cs.columbia.edu/~galil/

Expertise: Communication Complexity / Lower Bounds; Automata Theory / Slender Languages; Approximation Algorithms / Perfect Graphs;

12

Luca Trevisan

(associate professor , University of California at Berkeley Computer Science )

H-index: 48; Papers: 143; Citation: 5388
highest-cited paper: Pseudorandom Generators without the XOR Lemma (2001) at J. Comput. Syst. Sci.(Cited By 0)
Homepage: http://www.cs.berkeley.edu/~luca/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Logic Programs / Algebraic Semantics;

13

Donald E. Knuth

( Professor Emeritus of The Art of Computer Programming at Stanford University, Stanford University)

H-index: 47; Papers: 118; Citation: 25368
highest-cited paper: Fast Pattern Matching in Strings (1977) at SIAM J. Comput.(Cited By 1823)
Homepage: http://www-cs-faculty.stanford.edu/~uno/

Expertise: Database Systems / Programming Languages; Computer / Systems; Parallel Algorithm / Optimal Edge Search; Approximation Algorithms / Perfect Graphs; Finite Sets / New Designs;

14

Phillip B. Gibbons

(Principal Research Scientist , Intel Research Pittsburgh Computer Science Departments at Carnegie Mellon University and the University of Pittsburgh)

H-index: 47; Papers: 115; Citation: 9323
highest-cited paper: Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors (1998) at 25 Years ISCA: Retrospectives and Reprints(Cited By 1294)
Homepage: http://info.pittsburgh.intel-research.net/People/gibbons/

Expertise: Dynamic Networks / Extended Abstract; XML Data; Sensor Networks / Outdoor wireless; Approximation Algorithms / Perfect Graphs;

15

Uriel Feige

(Professor, Department of Computer Science and Applied Mathematics)

H-index: 45; Papers: 153; Citation: 10224
highest-cited paper: A Threshold of ln n for Approximating Set Cover (1998) at J. ACM(Cited By 1119)
Homepage: http://www.wisdom.weizmann.ac.il/~feige

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs;

19

Uzi Vishkin

(Professor, Univ. of Md Institute for Advanced Computer Studies (UMIACS) Department of Electrical and Computer Engineering Algorithms and Theory Group)

H-index: 42; Papers: 135; Citation: 6816
highest-cited paper: On Finding Lowest Common Ancestors: Simplification and Parallelization (1988) at AWOC(Cited By 427)
Homepage: http://www.umiacs.umd.edu/~vishkin/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Parallel Algorithms / Wormhole Networks; Data Compression / Arithmetic Coding;

26

Sanjeev Khanna

(Professor, Department of Computer and Information Science University of Pennsylvania)

H-index: 39; Papers: 136; Citation: 5233
highest-cited paper: Why and Where: A Characterization of Data Provenance (2001) at ICDT(Cited By 450)
Homepage: http://www.cis.upenn.edu/~sanjeev/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs;

32

Sudipto Guha

(Department of Computer and Information Science University of Pennsylvania)

H-index: 37; Papers: 113; Citation: 11066
highest-cited paper: Cure: An Efficient Clustering Algorithm for Large Databases (2001) at Inf. Syst.(Cited By 2)
Homepage: http://www.cis.upenn.edu/~sudipto/

Expertise: Communication Complexity / Lower Bounds; XML Data; Approximation Algorithms / Perfect Graphs;

34

Roger Wattenhofer

(Distributed Computing Group (DCG) Computer Engineering and Networks Laboratory (TIK) Information Technology and Electrical Engineering (ITET) )

H-index: 37; Papers: 147; Citation: 5359
highest-cited paper: FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment (2002) at OSDI(Cited By 568)
Homepage: http://www.dcg.ethz.ch/members/roger.html

Expertise: Dynamic Networks / Extended Abstract; Sensor Networks / Outdoor wireless; Approximation Algorithms / Perfect Graphs; ATM Networks;

35

Yossi Azar

(Professor, Dept. of Computer Science Tel-Aviv University )

H-index: 37; Papers: 144; Citation: 5132
highest-cited paper: Balanced allocations (extended abstract) (1994) at STOC(Cited By 409)
Homepage: http://www.math.tau.ac.il/~azar/

Expertise: Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Dynamic Networks / Extended Abstract;

38

Emo Welzl

(Professor, Department of Computer Science Institute of Theoretical Computer Science)

H-index: 36; Papers: 140; Citation: 4103
highest-cited paper: A Subexponential Bound for Linear Programming (1996) at Algorithmica(Cited By 239)
Homepage: http://www.inf.ethz.ch/~emo/

Expertise: Convex Polygons / Planar Arrangements; Automata Theory / Slender Languages; Approximation Algorithms / Perfect Graphs;

39

Andrew Tomkins

( Yahoo Research)

H-index: 35; Papers: 80; Citation: 7953
highest-cited paper: Graph structure in the Web (2000) at Computer Networks(Cited By 1723)
Homepage: http://www.tomkinshome.com/andrew/

Expertise: Web Mining; Data mining; XML Data; Approximation Algorithms / Perfect Graphs;

40

Moses Charikar

(Assistant Professor, Dept. of Computer Science Princeton University)

H-index: 35; Papers: 98; Citation: 5697
highest-cited paper: Finding frequent items in data streams (2004) at Theor. Comput. Sci.(Cited By 398)
Homepage: http://www.cs.princeton.edu/~moses/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs;

42

David S. Johnson

(Head, Algorithms and Optimization Department AT&T Labs - Research )

H-index: 34; Papers: 74; Citation: 92127
highest-cited paper: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Cited By 29847)
Homepage: http://www.research.att.com/~dsj/

Expertise: Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds;

43

Soumen Chakrabarti

(Associate Professor faculty member, Computer Science and Engineering Indian Institute of Technology Bombay Department of Computer Science)

H-index: 34; Papers: 76; Citation: 6481
highest-cited paper: Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery (1999) at Computer Networks(Cited By 1106)
Homepage: http://www.cse.iitb.ac.in/soumen/

Expertise: Web Mining; XML Data; Data mining; Machine Learning; Approximation Algorithms / Perfect Graphs;

48

Paul Beame

(Professor , Department of Computer Science and Engineering University of Washington )

H-index: 34; Papers: 90; Citation: 3957
highest-cited paper: Model Checking Large Software Specifications (1998) at IEEE Trans. Software Eng.(Cited By 246)
Homepage: http://www.cs.washington.edu/homes/beame/

Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs;

Experts ranked by H-index.

Which ranks do you think most useful