Experts ranked by Total Citation Number.

1 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;

2 Clifford Stein (Professor , IEOR Columbia University)
	H-index: 28; Papers: 45; Citation: 66081   highest-cited paper: Introduction to Algorithms, Second Edition (2001) (Cited By 31) Homepage: http://www.columbia.edu/~cs2035/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;

4 Rajeev Motwani (Professor and Director of Graduate Studies, Stanford University)
	H-index: 72; Papers: 183; Citation: 39124   highest-cited paper: Randomized Algorithms (1997) at The Computer Science and Engineering Handbook(Cited By 3616) Homepage: http://theory.stanford.edu/~rajeev/
Expertise: Communication Complexity / Lower Bounds;   XML Data;   Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

5 Prabhakar Raghavan ( Consulting Professor of Computer Science, Yahoo)
	H-index: 65; Papers: 169; Citation: 34844   highest-cited paper: Randomized Algorithms (1997) at The Computer Science and Engineering Handbook(Cited By 3616) Homepage: http://theory.stanford.edu/~pragh/
Expertise: Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   XML Data;   Approximation Algorithms / Perfect Graphs;   Web Mining;

6 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;

7 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;

8 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;

9 David S. Johnson
	H-index: 29; Papers: 36; Citation: 17721   highest-cited paper: Approximation Algorithms for Combinatorial Problems (1974) at J. Comput. Syst. Sci.(Cited By 1516) Homepage:
Expertise: Approximation Algorithms / Perfect Graphs;

10 Kurt Mehlhorn (Department 1: Algorithms and Complexity)
	H-index: 55; Papers: 297; Citation: 13493   highest-cited paper: The LEDA Platform for Combinatorial and Geometric Computing (1996) at GI Jahrestagung(Cited By 1420) Homepage: http://www.mpi-sb.mpg.de/~mehlhorn/
Expertise: Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;   Communication Complexity / Lower Bounds;   Parallel Algorithm / Optimal Edge Search;   Automata Theory / Slender Languages;

11 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;

12 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;

13 Amos Fiat (professor, School of Computer Science Tel Aviv University)
	H-index: 43; Papers: 114; Citation: 10594   highest-cited paper: How to Prove Yourself: Practical Solutions to Identification and Signature Problems (1986) at CRYPTO(Cited By 1772) Homepage: http://www.math.tau.ac.il/~fiat/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Signature Schemes / Authenticated Key Exchange Secure;

14 Moti Yung (Research Scientist, Columbia University)
	H-index: 54; Papers: 294; Citation: 10530   highest-cited paper: Perfectly Secure Key Distribution for Dynamic Conferences (1998) at Inf. Comput.(Cited By 679) Homepage: http://www.cs.columbia.edu/~moti/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   ATM Networks;   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;

16 Baruch Awerbuch (Professor)
	H-index: 56; Papers: 179; Citation: 9954   highest-cited paper: Complexity of Network Synchronization (1985) at J. ACM(Cited By 521) Homepage: http://www.cs.jhu.edu/~baruch/
Expertise: Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   ATM Networks;   Approximation Algorithms / Perfect Graphs;   Sensor Networks / Outdoor wireless;

17 Avrim Blum (Professor of Computer Science, Department of Computer Science Carnegie Mellon University)
	H-index: 50; Papers: 141; Citation: 9707   highest-cited paper: Selection of Relevant Features and Examples in Machine Learning (1997) at Artif. Intell.(Cited By 1227) Homepage: http://www.cs.cmu.edu/~avrim/
Expertise: Communication Complexity / Lower Bounds;   Machine Learning;   Mechanism design / Learning Stochastic Finite Automata;   Approximation Algorithms / Perfect Graphs;

18 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;

19 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;

20 Yishay Mansour (School of Computer Science Tel Aviv University)
	H-index: 48; Papers: 216; Citation: 7805   highest-cited paper: Constant Depth Circuits, Fourier Transform, and Learnability (1993) at J. ACM(Cited By 382) Homepage: http://www.math.tau.ac.il/~mansour/
Expertise: Communication Complexity / Lower Bounds;   Machine Learning;   Dynamic Networks / Extended Abstract;   Approximation Algorithms / Perfect Graphs;   Mechanism design / Learning Stochastic Finite Automata;

21 Michael Mitzenmacher (Professor of Computer Science, Computer Science Division of Engineering and Applied Sciences Harvard University)
	H-index: 37; Papers: 128; Citation: 7717   highest-cited paper: A Digital Fountain Approach to Reliable Distribution of Bulk Data (1998) at SIGCOMM(Cited By 813) Homepage: http://www.eecs.harvard.edu/~michaelm/
Expertise: Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   Approximation Algorithms / Perfect Graphs;   Channel state information / Universal coding;   Data Compression / Arithmetic Coding;

22 Mario Szegedy (Professor , Department of Computer Science State University of NJ )
	H-index: 29; Papers: 77; Citation: 7663   highest-cited paper: Proof verification and the hardness of approximation problems (1998) at Electronic Colloquium on Computational Complexity (ECCC)(Cited By 1237) Homepage: http://www.cs.rutgers.edu/~szegedy/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;

23 Andrew V. Goldberg (Microsoft Research )
	H-index: 38; Papers: 86; Citation: 7456   highest-cited paper: A new approach to the maximum-flow problem (1988) at J. ACM(Cited By 1184) Homepage: http://www.avglab.com/andrew/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Dynamic Networks / Extended Abstract;

25 Daniel Dominic Sleator (Professor, Computer Science)
	H-index: 24; Papers: 35; Citation: 7222   highest-cited paper: Amortized Efficiency of List Update and Paging Rules (1985) at Commun. ACM(Cited By 1540) Homepage: http://www.cs.cmu.edu/~sleator/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;

26 Ming Li (Professor, University of Waterloo)
	H-index: 43; Papers: 256; Citation: 6820   highest-cited paper: PatternHunter: faster and more sensitive homology search (2002) at Bioinformatics(Cited By 432) Homepage: http://www.cs.uwaterloo.ca/~mli/
Expertise: Communication Complexity / Lower Bounds;   Data Compression / Arithmetic Coding;   Gene Expression Analysis / Data Clustering;   Approximation Algorithms / Perfect Graphs;   Automata Theory / Slender Languages;   Grid Computing;

27 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;

28 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;

29 Edith Cohen (Algorithms Research Department at AT&T Research )
	H-index: 30; Papers: 75; Citation: 6534   highest-cited paper: Search and replication in unstructured peer-to-peer networks (2002) at ICS(Cited By 1526) Homepage: http://www.research.att.com/~edith/
Expertise: Communication Complexity / Lower Bounds;   Wireless network / End-to-end Routing Behavior;   Approximation Algorithms / Perfect Graphs;   Dynamic Networks / Extended Abstract;

30 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;

31 Eli Upfal ( professor , Brown University)
	H-index: 44; Papers: 129; Citation: 6412   highest-cited paper: Balanced allocations (extended abstract) (1994) at STOC(Cited By 409) Homepage: http://www.cs.brown.edu/people/eli/
Expertise: Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   Approximation Algorithms / Perfect Graphs;   Parallel Algorithms / Wormhole Networks;

32 Joseph Naor
	H-index: 40; Papers: 155; Citation: 6233   highest-cited paper: Small-Bias Probability Spaces: Efficient Constructions and Applications (1993) at SIAM J. Comput.(Cited By 455) Homepage: http://www.citidel.org/?op=getobj&identifier=people.P149286
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   ATM Networks;   Combinatorial optimization problem / Linear Programming;

33 Joseph S. B. Mitchell (Professor , State University of New York at Stony Brook )
	H-index: 41; Papers: 198; Citation: 6192   highest-cited paper: Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs (1998) at IEEE Trans. Vis. Comput. Graph.(Cited By 602) Homepage: http://www.ams.sunysb.edu/~jsbm
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Interactive Visualization / Computer graphics;   Communication Complexity / Lower Bounds;

34 Samir Khuller (Professor , Algorithms and Theory Group at Maryland )
	H-index: 38; Papers: 164; Citation: 6177   highest-cited paper: Approximation Algorithms for Connected Dominating Sets (1998) at Algorithmica(Cited By 620) Homepage: http://www.cs.umd.edu/~samir/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   ATM Networks;   Neural Networks / Agile Software Development Teams;

35 Nimrod Megiddo
	H-index: 34; Papers: 91; Citation: 6106   highest-cited paper: Linear-Time Algorithms for Linear Programming in R^3 and Related Problems (1982) at FOCS(Cited By 560) Homepage: http://theory.stanford.edu/~megiddo/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Machine Learning;

36 Philippe Flajolet
	H-index: 41; Papers: 119; Citation: 6099   highest-cited paper: Singularity Analysis of Generating Functions (1990) at SIAM J. Discrete Math.(Cited By 629) Homepage: http://algo.inria.fr/flajolet/
Expertise: Automata Theory / Slender Languages;   Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Finite Sets / New Designs;   Parallel Algorithm / Optimal Edge Search;   Random graph / Independence number;

37 Shimon Even (Chair in Computer Science, Computer Science Department Technion - Israel Institute of Technology )
	H-index: 31; Papers: 79; Citation: 6093   highest-cited paper: A Randomized Protocol for Signing Contracts (1985) at Commun. ACM(Cited By 773) Homepage: http://www.cs.technion.ac.il/~even/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   Signature Schemes / Authenticated Key Exchange Secure;   Finite Languages / Database Queries;   Computer / Systems;

38 Michael T. Goodrich (Director, Department of Computer Science University of California )
	H-index: 42; Papers: 226; Citation: 5759   highest-cited paper: External-Memory Graph Algorithms (1995) at SODA(Cited By 287) Homepage: http://www.ics.uci.edu/~goodrich/
Expertise: Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Security Views / New Denial;

39 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;

40 Michel X. Goemans (Member , MIT Department of Mathematics Cambridge )
	H-index: 34; Papers: 79; Citation: 5658   highest-cited paper: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming (1995) at J. ACM(Cited By 1478) Homepage: http://math.mit.edu/~goemans/
Expertise: Combinatorial optimization problem / Linear Programming;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Random graph / Independence number;   ATM Networks;

41 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;

42 Baruch Schieber ( manager , Theory of Computation group IBM T.J. Watson Research Center )
	H-index: 38; Papers: 121; Citation: 5383   highest-cited paper: On Finding Lowest Common Ancestors: Simplification and Parallelization (1988) at AWOC(Cited By 427) Homepage: http://researchweb.watson.ibm.com/people/s/sbar
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;   Convex Polygons / Planar Arrangements;   Parallel Algorithms / Wormhole Networks;

43 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;

44 Anand Rajaraman (Asst Professor , Computer Science Department Stanford University)
	H-index: 17; Papers: 29; Citation: 5313   highest-cited paper: Implementing Data Cubes Efficiently (1996) at SIGMOD Conference(Cited By 1273) Homepage: http://infolab.stanford.edu/~anand/
Expertise: XML Data;   Finite Languages / Database Queries;   Database Systems;   Approximation Algorithms / Perfect Graphs;   Learning Search Control Rules / Explanation-based Approach;

45 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;

46 David B. Shmoys (Professor )
	H-index: 28; Papers: 75; Citation: 5172   highest-cited paper: Approximation Algorithms for Scheduling Unrelated Parallel Machines (1990) at Math. Program.(Cited By 440) Homepage: http://www.cs.cornell.edu/annual_report/99-00/Shmoys.htm
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Combinatorial optimization problem / Linear Programming;   Dynamic Networks / Extended Abstract;

47 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;

48 Bruce M. Maggs (Professor, Computer Science Department Electrical and Computer Engineering Department )
	H-index: 34; Papers: 86; Citation: 5039   highest-cited paper: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems (2003) at INFOCOM(Cited By 526) Homepage: http://www.cs.cmu.edu/~bmm/
Expertise: Communication Complexity / Lower Bounds;   Wireless network / End-to-end Routing Behavior;   Dynamic Networks / Extended Abstract;   Approximation Algorithms / Perfect Graphs;

49 Gary L. Miller (Professor, School of Computer Science Carnegie Mellon University)
	H-index: 38; Papers: 97; Citation: 5019   highest-cited paper: Riemann's Hypothesis and Tests for Primality (1976) at J. Comput. Syst. Sci.(Cited By 673) Homepage: http://www.cs.cmu.edu/afs/cs.cmu.edu/user/glmiller/public/www/home.html
Expertise: Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;   Approximation Algorithms / Perfect Graphs;

50 Tao Jiang (Professor, Department of Computer Science and Engineering University of California - Riverside)
	H-index: 39; Papers: 171; Citation: 4852   highest-cited paper: On the Complexity of Multiple Sequence Alignment (1994) at Journal of Computational Biology(Cited By 490) Homepage: http://www.cs.ucr.edu/~jiang/
Expertise: Data Compression / Arithmetic Coding;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Automata Theory / Slender Languages;   Gene Expression Analysis / Data Clustering;