Experts ranked by H-index.

1 Oded Goldreich (Faculty member, The Weizmann Institute of Science )
	H-index: 77; Papers: 269; Citation: 23921   highest-cited paper: Foundations of Cryptography - A Primer (2005) at Foundations and Trends in Theoretical Computer Science(Cited By 19) Homepage: http://www.wisdom.weizmann.ac.il/~oded/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

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

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

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 Moni Naor (Professorial Chair, Dept. Computer Science and Applied Mathematics Weizmann Institute of Science)
	H-index: 69; Papers: 192; Citation: 22283   highest-cited paper: Nonmalleable Cryptography (2000) at SIAM J. Comput.(Cited By 1001) Homepage: http://www.wisdom.weizmann.ac.il/~naor/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;   Dynamic Networks / Extended Abstract;   Binary code / Error detection;

6 Amir Pnueli (Faculty of Mathematics and Computer Science, Faculty of Mathematics and Computer Science The Weizmann Institute of Science)
	H-index: 68; Papers: 247; Citation: 17792   highest-cited paper: The Temporal Logic of Programs (1977) at FOCS(Cited By 2529) Homepage: http://www.wisdom.weizmann.ac.il/~amir/
Expertise: Model Checking / Hybrid Systems;   Logic Programs / Algebraic Semantics;   Communication Complexity / Lower Bounds;

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

8 Nancy A. Lynch (Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) by Nancy A. Lynch (Hardcover - April 1997))
	H-index: 65; Papers: 251; Citation: 19652   highest-cited paper: Impossibility of Distributed Consensus with One Faulty Process (1985) at J. ACM(Cited By 2866) Homepage: http://people.csail.mit.edu/lynch
Expertise: Dynamic Networks / Extended Abstract;   Finite Languages / Database Queries;   Model Checking / Hybrid Systems;   Communication Complexity / Lower Bounds;   Logic Programs / Algebraic Semantics;   Optimal control;

9 Daphne Koller (Professor, Computer Science Department Stanford University )
	H-index: 63; Papers: 157; Citation: 14660   highest-cited paper: Toward Optimal Feature Selection (1996) at ICML(Cited By 838) Homepage: http://ai.stanford.edu/~koller/bio.html
Expertise: Bayesian Networks;   Learning Search Control Rules / Explanation-based Approach;   Machine Learning;   Communication Complexity / Lower Bounds;   Data Compression / Arithmetic Coding;   Object Recognition / Two-View Motion Estimation;

10 Avi Wigderson (Professor, School of Mathematics, Institute for Advanced Study, Princeton)
	H-index: 63; Papers: 242; Citation: 13460   highest-cited paper: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (1988) at STOC(Cited By 1111) Homepage: http://www.math.ias.edu/~avi/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

11 Noam Nisan (School of Computer Science and Engineering Hebrew University )
	H-index: 60; Papers: 122; Citation: 10620   highest-cited paper: Algorithmic Mechanism Design (Extended Abstract) (1999) at STOC(Cited By 899) Homepage: http://www.cs.huji.ac.il/~noam/
Expertise: Communication Complexity / Lower Bounds;   Mechanism design / Learning Stochastic Finite Automata;   Computer science;

12 Mihir Bellare (Professor, Department of Computer Science and Engineering at the University of California, San Diego)
	H-index: 59; Papers: 131; Citation: 17361   highest-cited paper: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols (1993) at ACM Conference on Computer and Communications Security(Cited By 2440) Homepage: http://www-cse.ucsd.edu/~mihir/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;

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

14 Adi Shamir (Professor of Applied Mathematics )
	H-index: 56; Papers: 144; Citation: 26520   highest-cited paper: How to Share a Secret (1979) at Commun. ACM(Cited By 4969) Homepage: http://www.wisdom.weizmann.ac.il/math/profile/scientists/shamir-profile.html
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;

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

16 Robert E. Schapire (Princeton University Department of Computer Science )
	H-index: 55; Papers: 104; Citation: 30532   highest-cited paper: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997) at J. Comput. Syst. Sci.(Cited By -1) Homepage: http://www.cs.princeton.edu/~schapire/
Expertise: Machine Learning;   Communication Complexity / Lower Bounds;   Expression data / Microarray experiment;   Information Retrieval / Probabilistic Indexing;

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

18 David Harel (The William Sussman Professorial Chair, Dept. of Computer Science and Applied Mathematics The Weizmann Institute of Science)
	H-index: 54; Papers: 187; Citation: 17021   highest-cited paper: Dynamic logic. (2001) at SIGACT News(Cited By 1580) Homepage: http://www.wisdom.weizmann.ac.il/~harel/
Expertise: Model Checking / Hybrid Systems;   Visual Language;   Finite Languages / Database Queries;   Logic Programs / Algebraic Semantics;   Communication Complexity / Lower Bounds;   Automata Theory / Slender Languages;

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

20 Silvio Micali (Faculty, Computer Science MIT)
	H-index: 53; Papers: 109; Citation: 18246   highest-cited paper: Probabilistic Encryption (1984) at J. Comput. Syst. Sci.(Cited By 4) Homepage: http://www.csail.mit.edu/biographies/PI/bioprint.php?PeopleID=36
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;

21 David Haussler (Professor, Bioinformatics and computational biology )
	H-index: 53; Papers: 117; Citation: 14852   highest-cited paper: What Size Net Gives Valid Generalization? (1988) at NIPS(Cited By 1301) Homepage: http://www.cse.ucsc.edu/~haussler/
Expertise: Data Compression / Arithmetic Coding;   Machine Learning;   Communication Complexity / Lower Bounds;   Expression data / Microarray experiment;

22 Danny Dolev (Professor of Computer Science, Computer Science School of Engineering and Computer Science The Hebrew University of Jerusalem )
	H-index: 51; Papers: 196; Citation: 13444   highest-cited paper: On the security of public key protocols (1983) at IEEE Transactions on Information Theory(Cited By 2080) Homepage: http://www.cs.huji.ac.il/~dolev/
Expertise: Dynamic Networks / Extended Abstract;   Communication Complexity / Lower Bounds;   Wireless Networks / Algorithmic Complexity;

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

24 Michael J. Kearns (Professor , Professor of Computer and Information Science University of Pennsylvania )
	H-index: 49; Papers: 101; Citation: 9297   highest-cited paper: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (1989) at STOC(Cited By 524) Homepage: http://www.cis.upenn.edu/~mkearns/
Expertise: Machine Learning;   Communication Complexity / Lower Bounds;   Learning Search Control Rules / Explanation-based Approach;

25 George Varghese (Professor, Department of Computer Science University of California, San Diego)
	H-index: 48; Papers: 113; Citation: 12184   highest-cited paper: Efficient fair queueing using deficit round-robin (1996) at IEEE/ACM Trans. Netw.(Cited By 1433) Homepage: http://www-cse.ucsd.edu/~varghese/
Expertise: Wireless network / End-to-end Routing Behavior;   Dynamic Networks / Extended Abstract;   File System / Software Systems;   Instruction Cache Organizations / Branch Prediction;   Communication Complexity / Lower Bounds;

26 Ran Canetti (Researcher , Cryptography Research Group IBM T.J. Watson Research Center )
	H-index: 48; Papers: 97; Citation: 12131   highest-cited paper: Keying Hash Functions for Message Authentication (1996) at CRYPTO(Cited By 845) Homepage: http://theory.csail.mit.edu/~canetti/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Security Views / New Denial;   Dynamic Networks / Extended Abstract;

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

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

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

31 Russell Impagliazzo (professor , Department of Computer Science and Engineering computational complexity theory)
	H-index: 44; Papers: 127; Citation: 6913   highest-cited paper: A Pseudorandom Generator from any One-way Function (1999) at SIAM J. Comput.(Cited By 639) Homepage: http://www-cse.ucsd.edu/~russell/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

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

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

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

35 Eva Tardos (Professor, Department of Computer Science)
	H-index: 42; Papers: 97; Citation: 8818   highest-cited paper: How bad is selfish routing? (2002) at J. ACM(Cited By 887) Homepage: http://www.cs.cornell.edu/home/eva/eva.html
Expertise: Communication Complexity / Lower Bounds;   Combinatorial optimization problem / Linear Programming;   Mechanism design / Learning Stochastic Finite Automata;   Random graph / Independence number;

36 Marc Snir (Professor, Hebrew University of Jerusalem)
	H-index: 42; Papers: 89; Citation: 7016   highest-cited paper: The NYU Ultracomputer - Designing an MIMD Shared Memory Parallel Computer (1983) at IEEE Trans. Computers(Cited By 622) Homepage: http://www.cs.uiuc.edu/directory/directory.php?name=snir
Expertise: Dynamic Networks / Extended Abstract;   Communication Complexity / Lower Bounds;   Parallel Algorithms / Wormhole Networks;   Instruction Cache Organizations / Branch Prediction;

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

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 H. T. Kung (Professor, Harvard)
	H-index: 41; Papers: 94; Citation: 9868   highest-cited paper: Why Systolic Architectures? (1982) at IEEE Computer(Cited By 1726) Homepage: http://www.eecs.harvard.edu/~htk/index.html
Expertise: Communication Complexity / Lower Bounds;   Instruction Cache Organizations / Branch Prediction;   Error function / Runge-Kutta integration;   ATM Networks;   Database Systems;

40 Hugo Krawczyk
	H-index: 41; Papers: 64; Citation: 8870   highest-cited paper: Keying Hash Functions for Message Authentication (1996) at CRYPTO(Cited By 845) Homepage: http://www.amazon.com/s?ie=UTF8&search-type=ss&index=books&field-author=Hugo%20Krawczyk&page=1
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;

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

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

43 Johan Hastad (professor in computer science , computer science in the theoretical computer science group at CSC)
	H-index: 40; Papers: 109; Citation: 9687   highest-cited paper: Some optimal inapproximability results (2001) at J. ACM(Cited By 958) Homepage: http://www.nada.kth.se/~johanh/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

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

45 Aravind Srinivasan (Professor, University of Maryland, College Park)
	H-index: 40; Papers: 128; Citation: 4186   highest-cited paper: Resilient multicast using overlays (2006) at IEEE/ACM Trans. Netw.(Cited By 206) Homepage: http://www.cs.umd.edu/~srin/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Parallel Algorithm / Optimal Edge Search;   ATM Networks;

46 Joe Kilian (Computer Science Department Rutgers University )
	H-index: 39; Papers: 84; Citation: 9825   highest-cited paper: Secure spread spectrum watermarking for multimedia (1997) at IEEE Transactions on Image Processing(Cited By 3841) Homepage: http://www.cs.rutgers.edu/~jkilian/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;   Machine Learning;

48 Nathan Linial (Professor , School of Computer Science and Engineering The Hebrew University of Jerusalem )
	H-index: 39; Papers: 133; Citation: 6859   highest-cited paper: The Geometry of Graphs and Some of its Algorithmic Applications (1995) at Combinatorica(Cited By 568) Homepage: http://www.cs.huji.ac.il/~nati/
Expertise: Communication Complexity / Lower Bounds;   Random graph / Independence number;   Finite Sets / New Designs;   Convex Polygons / Planar Arrangements;   DNA sequence / ENZYME database;   Data Compression / Arithmetic Coding;

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

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;