Experts ranked by Total Citation Number.

The number of citations of all publications by an expert. 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
1234567891011...
1 C. Papadimitriou (Professor, Computer Science Division University of California at Berkeley)
H-index: 95; Papers: 353; Citation: 38525  
Homepage: http://www.cs.berkeley.edu/~christos/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Finite Languages / Database Queries  
2 R. Tarjan (American computer scientist, Department of Computer Science Princeton University )
H-index: 75; Papers: 263; Citation: 30806  
Homepage: http://en.wikipedia.org/wiki/Robert_Tarjan
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Convex Polygons / Planar Arrangements  
3 D. Karger (Member, Computer Science and Artificial Intelligence Laboratory in the EECS department at MIT)
H-index: 66; Papers: 188; Citation: 27639  
Homepage: http://people.csail.mit.edu/karger/
Expertise: Wireless network / End-to-end Routing Behavior   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Semantic Web / Ontology Alignment  
4 Richard M. Karp (Professor, Department of Electrical Engineering and Computer Science University of California at Berkeley)
H-index: 62; Papers: 203; Citation: 24498  
Homepage: http://www.cs.berkeley.edu/~karp/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding  
5 Rajeev Motwani (Professor and Director of Graduate Studies, Stanford University)
H-index: 70; Papers: 192; Citation: 22315  
Homepage: http://theory.stanford.edu/~rajeev/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   XML Data   Convex Polygons / Planar Arrangements  
6 Mihalis Yannakakis (Professor of Computer Science, Department of Computer Science Columbia University)
H-index: 73; Papers: 206; Citation: 19240  
Homepage: http://www.cs.columbia.edu/~mihalis/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Model Checking / Hybrid Systems   Finite Languages / Database Queries  
7 Prabhakar Raghavan (Head, Yahoo! Labs)
H-index: 59; Papers: 179; Citation: 17909  
Homepage: http://theory.stanford.edu/~pragh/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   XML Data   Web Mining   Convex Polygons / Planar Arrangements  
8 Ravi Kumar (Research staff member, Yahoo! Research )
H-index: 50; Papers: 187; Citation: 15301  
Homepage: http://research.yahoo.com/Ravi_Kumar/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Data mining   XML Data   Web Mining  
9 N. Alon (Professor, Tel Aviv University)
H-index: 63; Papers: 454; Citation: 13896  
Homepage: http://www.math.tau.ac.il/~nogaa/
Expertise: Communication Complexity / Lower Bounds   Random graph / Independence number   Approximation Algorithms / Perfect Graphs   Finite Sets / New Designs   Convex Polygons / Planar Arrangements   Binary code / Error detection  
10 Moti Yung (Research Scientist, Columbia University)
H-index: 56; Papers: 393; Citation: 13228  
Homepage: http://www.cs.columbia.edu/~moti/
Expertise: Communication Complexity / Lower Bounds   ATM Networks   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract   Signature Schemes / Authenticated Key Exchange Secure  
11 Avrim Blum (Professor, Department of Computer Science Carnegie Mellon University)
H-index: 57; Papers: 159; Citation: 12680  
Homepage: http://www.cs.cmu.edu/~avrim/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Machine Learning  
12 Andrew Tomkins (Google Research)
H-index: 39; Papers: 90; Citation: 12652  
Homepage: http://www.tomkinshome.com/andrew/
Expertise: Approximation Algorithms / Perfect Graphs   Data mining   XML Data   Web Mining  
13 David S. Johnson
H-index: 29; Papers: 36; Citation: 11770  
Expertise: Approximation Algorithms / Perfect Graphs  
14 Sudipto Guha (Department of Computer and Information Science University of Pennsylvania)
H-index: 37; Papers: 128; Citation: 11656  
Homepage: http://www.cis.upenn.edu/~sudipto/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   XML Data  
15 Jeffrey Vitter (Provost and Executive Vice Chancellor, The University of Kansas)
H-index: 55; Papers: 249; Citation: 11285  
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding   XML Data   Convex Polygons / Planar Arrangements  
16 F. T. Leighton (professor, Massachusetts Institute of Technology)
H-index: 38; Papers: 157; Citation: 11050  
Homepage: http://en.wikipedia.org/wiki/F._Thomson_Leighton
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
17 Phillip B. Gibbons (Principal Research Scientist, Intel Labs Pittsburgh )
H-index: 48; Papers: 137; Citation: 11029  
Homepage: http://pittsburgh.intel-research.net/people/gibbons/
Expertise: Sensor Networks / Outdoor wireless   Approximation Algorithms / Perfect Graphs   XML Data   Dynamic Networks / Extended Abstract  
18 Donald E. Knuth (Professor Emeritus of The Art of Computer Programming at Stanford University, Stanford University)
H-index: 36; Papers: 108; Citation: 10825  
Homepage: http://www-cs-faculty.stanford.edu/~uno/
Expertise: Parallel Algorithm / Optimal Edge Search   Approximation Algorithms / Perfect Graphs   Finite Sets / New Designs   Computer / Systems   Database Systems / Programming Languages  
19 Ming Li (Professor, David R. Cheriton School of Computer Science University of Waterloo )
H-index: 41; Papers: 334; Citation: 10568  
Homepage: http://www.cs.uwaterloo.ca/~mli/
Expertise: Gene Expression Analysis / Data Clustering   Communication Complexity / Lower Bounds   Search Technology / News Brief   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages   Data Compression / Arithmetic Coding  
20 Michael Mitzenmacher (Professor, Computer Science Division of Engineering and Applied Sciences Harvard University)
H-index: 42; Papers: 177; Citation: 10525  
Homepage: http://www.eecs.harvard.edu/~michaelm/
Expertise: Communication Complexity / Lower Bounds   Channel state information / Universal coding   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding   Dynamic Networks / Extended Abstract  
21 Jon L. Bentley (Bell Laboratories)
H-index: 27; Papers: 95; Citation: 10370  
Homepage: http://www.biblio.com/author_biographies/10024204/Jon_Louis_Bentley.html
Expertise: Communication Complexity / Lower Bounds   Error function / Runge-Kutta integration   Approximation Algorithms / Perfect Graphs   Computer / Systems  
22 D. Eppstein (professor, University of California, Irvine.)
H-index: 52; Papers: 367; Citation: 10349  
Homepage: http://www.ics.uci.edu/~eppstein/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Convex Polygons / Planar Arrangements  
23 Amos Fiat (professor, School of Computer Science Tel Aviv University)
H-index: 43; Papers: 127; Citation: 10256  
Homepage: http://www.math.tau.ac.il/~fiat/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Signature Schemes / Authenticated Key Exchange Secure  
24 David S. Johnson (Head, Algorithms and Optimization Department AT&T Labs - Research)
H-index: 34; Papers: 74; Citation: 10156  
Homepage: http://www.research.att.com/~dsj/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
25 Kurt Mehlhorn (Professor, Max-Planck-Institut für Informatik)
H-index: 52; Papers: 319; Citation: 9874  
Homepage: http://www.mpi-sb.mpg.de/~mehlhorn/
Expertise: Communication Complexity / Lower Bounds   Parallel Algorithm / Optimal Edge Search   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages   Convex Polygons / Planar Arrangements   Database Systems / Programming Languages  
26 Andrew V. Goldberg (Microsoft Research )
H-index: 42; Papers: 97; Citation: 9744  
Homepage: http://www.avglab.com/andrew/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Dynamic Networks / Extended Abstract  
27 S. Muthukrishnan (Professor, Rutgers University)
H-index: 50; Papers: 264; Citation: 9707  
Homepage: http://www.cs.rutgers.edu/~muthu/
Expertise: Communication Complexity / Lower Bounds   Wireless Networks / Algorithmic Complexity   Expression data / Microarray experiment   Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding   XML Data  
28 S. Suri (Professor, University of California)
H-index: 52; Papers: 209; Citation: 9411  
Homepage: http://www.cs.ucsb.edu/~suri/
Expertise: Wireless network / End-to-end Routing Behavior   Communication Complexity / Lower Bounds   Sensor Networks / Outdoor wireless   ATM Networks   Approximation Algorithms / Perfect Graphs   Convex Polygons / Planar Arrangements  
29 M. S. Paterson (Department of Computer Science University of Warwick)
H-index: 33; Papers: 138; Citation: 9388  
Homepage: http://www.dcs.warwick.ac.uk/~msp/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages   Finite Sets / New Designs   Convex Polygons / Planar Arrangements  
30 C. E. Leiserson (Professor of Computer Science and Engineering, Computer Science and Artificial Intelligence Laboratory MIT)
H-index: 33; Papers: 90; Citation: 9322  
Homepage: http://people.csail.mit.edu/cel/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract   Parallel Algorithms / Wormhole Networks  
31 V. V. Vazirani (Professor, College of Computing Georgia Institute of Technology )
H-index: 40; Papers: 143; Citation: 9161  
Homepage: http://www.cc.gatech.edu/~vazirani/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
32 Hans Bodlaender (Parameterized and Exact Computation)
H-index: 47; Papers: 226; Citation: 8983  
Homepage: http://people.cs.uu.nl/hansb
Expertise: Approximation Algorithms / Perfect Graphs   Convex Polygons / Planar Arrangements  
33 Roger Wattenhofer (Professor, Information Technology and Electrical Engineering Department, ETH Zurich, Switzerland)
H-index: 47; Papers: 205; Citation: 8590  
Homepage: http://www.dcg.ethz.ch/members/roger.html
Expertise: Sensor Networks / Outdoor wireless   ATM Networks   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
34 Piotr Indyk (Professor, Theory of Computation Group Computer Science and Artificial Intelligence Lab)
H-index: 41; Papers: 139; Citation: 8572  
Homepage: http://people.csail.mit.edu/indyk/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   XML Data   Convex Polygons / Planar Arrangements  
35 Edith Cohen (Researcher, Algorithms Research Department at AT&T Research)
H-index: 33; Papers: 88; Citation: 8371  
Homepage: http://www.research.att.com/~edith/
Expertise: Wireless network / End-to-end Routing Behavior   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
36 Daniel Dominic Sleator (Professor, Department of Computer Science Carnegie Mellon University)
H-index: 20; Papers: 36; Citation: 8087  
Homepage: http://www.cs.cmu.edu/~sleator/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
37 Yishay Mansour (Professor, School of Computer Science Tel Aviv University)
H-index: 47; Papers: 243; Citation: 7951  
Homepage: http://www.math.tau.ac.il/~mansour/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract   Machine Learning  
38 Gonzalo Navarro (Full Professor, Department of Computer Science (DCC), Faculty of Physical and Mathematical Sciences, University of Chile.)
H-index: 44; Papers: 243; Citation: 7863  
Homepage: http://www.dcc.uchile.cl/~gnavarro/
Expertise: Approximation Algorithms / Perfect Graphs   Data Compression / Arithmetic Coding  
39 David Peleg (Professor, The Norman D. Cohen Professorial Chair of Computer Sciences Department of Computer Science and Applied Mathematics)
H-index: 48; Papers: 304; Citation: 7781  
Homepage: http://www.wisdom.weizmann.ac.il/~peleg/
Expertise: Communication Complexity / Lower Bounds   Random graph / Independence number   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
40 Baruch Awerbuch (Professor)
H-index: 53; Papers: 181; Citation: 7769  
Homepage: http://www.cs.jhu.edu/~baruch/
Expertise: Communication Complexity / Lower Bounds   Sensor Networks / Outdoor wireless   ATM Networks   Approximation Algorithms / Perfect Graphs   Dynamic Networks / Extended Abstract  
41 Soumen Chakrabarti (Associate Professor , Computer Science and Engineering Indian Institute of Technology Bombay )
H-index: 34; Papers: 87; Citation: 7336  
Homepage: http://www.cse.iitb.ac.in/soumen/
Expertise: Approximation Algorithms / Perfect Graphs   Data mining   XML Data   Web Mining   Machine Learning  
42 Nimrod Megiddo (IBM Almaden Research Center)
H-index: 34; Papers: 90; Citation: 7310  
Homepage: http://theory.stanford.edu/~megiddo/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming   Convex Polygons / Planar Arrangements   Machine Learning  
43 Zvi Galil (Professor, Columbia University)
H-index: 51; Papers: 177; Citation: 7270  
Homepage: http://www.cs.columbia.edu/~galil/
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Automata Theory / Slender Languages  
44 Ricardo A. Baeza-Yates (VP of Research, Yahoo! Research labs at Barcelona)
H-index: 44; Papers: 286; Citation: 7258  
Homepage: http://www.dcc.uchile.cl/~rbaeza/
Expertise: Parallel Algorithm / Optimal Edge Search   Approximation Algorithms / Perfect Graphs   Information Retrieval / Probabilistic Indexing   Data Compression / Arithmetic Coding   Web Mining   Database Systems  
45 Joseph S. B. Mitchell (Professor, State University of New York at Stony Brook)
H-index: 48; Papers: 221; Citation: 7147  
Homepage: http://www.ams.sunysb.edu/~jsbm
Expertise: Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Interactive Visualization / Computer graphics   Convex Polygons / Planar Arrangements  
46 T. Milo (Professor, School of Computer Science Tel Aviv University)
H-index: 39; Papers: 140; Citation: 7058  
Homepage: http://www.math.tau.ac.il/~milo/
Expertise: Approximation Algorithms / Perfect Graphs   Finite Languages / Database Queries   XML Data   Database Systems   Interactive Visualization / Computer graphics  
47 Anna Karlin (Professor, Department of Computer Science & Engineering University of Washington )
H-index: 38; Papers: 83; Citation: 6902  
Homepage: http://www.cs.washington.edu/homes/karlin/
Expertise: Mechanism design / Learning Stochastic Finite Automata   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs   Instruction Cache Organizations / Branch Prediction   File System / Software Systems  
48 Joseph Naor
H-index: 41; Papers: 179; Citation: 6882  
Expertise: Communication Complexity / Lower Bounds   ATM Networks   Approximation Algorithms / Perfect Graphs   Combinatorial optimization problem / Linear Programming  
49 M. Thorup (Professor, University of Copenhagen AT&T Labs--Research, Shannon Laboratory)
H-index: 44; Papers: 158; Citation: 6827  
Homepage: http://www.diku.dk/~mthorup/
Expertise: Wireless network / End-to-end Routing Behavior   Communication Complexity / Lower Bounds   Approximation Algorithms / Perfect Graphs  
50 Sajal Das (Professor, Department of Computer Science and Engineering University Texas at Arlington)
H-index: 42; Papers: 463; Citation: 6704  
Homepage: http://ranger.uta.edu/~das/
Expertise: Approximation Algorithms / Perfect Graphs   Wireless Networks / Priority Scheduling   Parallel Applications / Average-Case Performance Analysis   Adaptive Mobile Applications / Pervasive Computing Systems   ATM network / Ethernet performance   Parallel Algorithms / Wormhole Networks  
Give us feedbacks: feedback@arnetminer.org.
1234567891011...