Experts ranked by Total Citation Number.

501 G. Nigel Martin
	H-index: 3; Papers: 4; Citation: 662   highest-cited paper: Probabilistic Counting Algorithms for Data Base Applications (1985) at J. Comput. Syst. Sci.(Cited By 569)
Expertise: Mass Storage System / Data Base Management Systems;   Communication Complexity / Lower Bounds;

502 Funda Ergun (Assistant Professor, EECS Department Case Western Reserve University)
	H-index: 14; Papers: 29; Citation: 661   highest-cited paper: Spot-Checkers (2000) at J. Comput. Syst. Sci.(Cited By 99) Homepage: http://vorlon.case.edu/~afe/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;

503 Ian Parberry (Professor, Department of Computer Science & Engineering College of Engineering University of North Texas)
	H-index: 15; Papers: 55; Citation: 661   highest-cited paper: Parallel Computation with Threshold Functions (1988) at J. Comput. Syst. Sci.(Cited By 107) Homepage: http://www.eng.unt.edu/ian/
Expertise: Communication Complexity / Lower Bounds;   Finite Languages / Database Queries;   Parallel Algorithm / Optimal Edge Search;   Game Design / Pervasive Gaming Applications;   Parallel Algorithms / Wormhole Networks;   Machine Learning;

505 Arpita Ghosh
	H-index: 8; Papers: 21; Citation: 659   highest-cited paper: Randomized gossip algorithms (2006) at IEEE Transactions on Information Theory(Cited By 321)
Expertise: Mechanism design / Learning Stochastic Finite Automata;   Web Mining;   Communication Complexity / Lower Bounds;   ATM Networks;

506 Sean Hallgren (Department of Computer Science and Engineering)
	H-index: 10; Papers: 17; Citation: 659   highest-cited paper: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (2007) at J. ACM(Cited By 135) Homepage: http://www.cse.psu.edu/~hallgren/
Expertise: Communication Complexity / Lower Bounds;

507 Ravindran Kannan (Professor, Computer Science Department)
	H-index: 11; Papers: 14; Citation: 652   highest-cited paper: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix (1979) at SIAM J. Comput.(Cited By 254) Homepage: http://cs-www.cs.yale.edu/homes/kannan/home.html
Expertise: Communication Complexity / Lower Bounds;

508 John M. Hitchcock
	H-index: 15; Papers: 53; Citation: 652   highest-cited paper: Effective Strong Dimension in Algorithmic Information and Computational Complexity (2007) at SIAM J. Comput.(Cited By 70) Homepage: no homepage
Expertise: Communication Complexity / Lower Bounds;

509 H. Venkateswaran (Associate Professor , College of Computing Georgia Institute of Technology )
	H-index: 12; Papers: 27; Citation: 651   highest-cited paper: Properties that Characterize LOGCFL (1991) at J. Comput. Syst. Sci.(Cited By -1) Homepage: http://www.cc.gatech.edu/~venkat
Expertise: Communication Complexity / Lower Bounds;   Parallel Algorithms / Wormhole Networks;   Computing Systems / Fault-Tolerant Real-Time;

510 Kamal Jain (Microsoft Corporation, Redmond, WA )
	H-index: 6; Papers: 6; Citation: 651   highest-cited paper: Polynomial time algorithms for multicast network code construction (2005) at IEEE Transactions on Information Theory(Cited By 363)
Expertise: Communication Complexity / Lower Bounds;   Channel state information / Universal coding;   Binary code / Error detection;

511 Yael Gertner (» Department History)
	H-index: 8; Papers: 8; Citation: 647   highest-cited paper: Protecting Data Privacy in Private Information Retrieval Schemes (2000) at J. Comput. Syst. Sci.(Cited By 217) Homepage: http://www.psych.uiuc.edu/people/showprofile.php?id=267
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

512 Christoph Durr (Charg?? de recherche au CNRS)
	H-index: 13; Papers: 46; Citation: 647   highest-cited paper: A Quantum Algorithm for Finding the Minimum (1996) at CoRR(Cited By 105) Homepage: http://www.lix.polytechnique.fr/~durr/
Expertise: Wireless Networks / Algorithmic Complexity;   Approximation Algorithms / Perfect Graphs;   Automata Theory / Slender Languages;   Communication Complexity / Lower Bounds;   Scheduling problem / Search algorithm;

513 Jon Feldman (Senior Research Scientist, Google)
	H-index: 15; Papers: 31; Citation: 646   highest-cited paper: Using linear programming to Decode Binary linear codes (2005) at IEEE Transactions on Information Theory(Cited By 182) Homepage: http://people.csail.mit.edu/jonfeld/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;

514 Armin Haken
	H-index: 2; Papers: 3; Citation: 644   highest-cited paper: The Intractability of Resolution (1985) at Theor. Comput. Sci.(Cited By -1)
Expertise: Communication Complexity / Lower Bounds;

515 Toshiya Itoh
	H-index: 8; Papers: 35; Citation: 644   highest-cited paper: A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases (1988) at Inf. Comput.(Cited By 355)
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Wideband Systems / Channel Estimation;

516 Sanjeev Arora
	H-index: 7; Papers: 13; Citation: 644   highest-cited paper: Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems (1997) at FOCS(Cited By 167) Homepage:
Expertise: Communication Complexity / Lower Bounds;

517 Rohit Khandekar
	H-index: 11; Papers: 39; Citation: 643   highest-cited paper: Local search heuristic for k-median and facility location problems (2001) at STOC(Cited By 304) Homepage: http://www.cse.iitd.ernet.in/~rohitk/
Expertise: Dynamic Networks / Extended Abstract;   Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Interactive Visualization / Computer graphics;

518 Iordanis Kerenidis (Computer Science Division, University of California,)
	H-index: 10; Papers: 23; Citation: 643   highest-cited paper: Exponential lower bound for 2-query locally decodable codes via a quantum argument (2004) at J. Comput. Syst. Sci.(Cited By 108) Homepage: http://www.cs.berkeley.edu/~jkeren/res.html
Expertise: Communication Complexity / Lower Bounds;

519 Hartmut Klauck (Emmy Noether Group for Quantum Computing)
	H-index: 15; Papers: 37; Citation: 643   highest-cited paper: Lower Bounds for Quantum Communication Complexity (2007) at SIAM J. Comput.(Cited By 58) Homepage: http://www.thi.informatik.uni-frankfurt.de/~klauck/
Expertise: Communication Complexity / Lower Bounds;   Automata Theory / Slender Languages;

520 Elitza N. Maneva (Professor, Universitat Politècnica de Catalunya (UPC) Departament de Llenguatges i Sistemes Informàtics (LSI))
	H-index: 11; Papers: 16; Citation: 643   highest-cited paper: On a network creation game (2003) at PODC(Cited By 245) Homepage: http://www.lsi.upc.edu/~maneva/
Expertise: Wireless Networks / Algorithmic Complexity;   Communication Complexity / Lower Bounds;

521 Arne Andersson (Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden )
	H-index: 9; Papers: 13; Citation: 640   highest-cited paper: Sorting in Linear Time? (1998) at J. Comput. Syst. Sci.(Cited By 163)
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

522 Maria-Florina Balcan
	H-index: 14; Papers: 29; Citation: 638   highest-cited paper: Agnostic active learning (2009) at J. Comput. Syst. Sci.(Cited By 78) Homepage: http://www.cs.cmu.edu/~ninamf/
Expertise: Machine Learning;   Communication Complexity / Lower Bounds;

523 Sameet Agarwal
	H-index: 3; Papers: 4; Citation: 635   highest-cited paper: On the Computation of Multidimensional Aggregates (1996) at VLDB(Cited By 604)
Expertise: Communication Complexity / Lower Bounds;   XML Data;

524 Rafael Pass (Assistant Professor, Department of Computer Science Cornell University)
	H-index: 13; Papers: 38; Citation: 634   highest-cited paper: Universally Composable Protocols with Relaxed Set-Up Assumptions (2004) at FOCS(Cited By 72) Homepage: http://www.cs.cornell.edu/~rafael/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

525 Wm. A. Brinsfield
	H-index: 1; Papers: 1; Citation: 634   highest-cited paper: On the Composition of Parallel Program Schemata (1971) at FOCS(Cited By 640)
Expertise: Communication Complexity / Lower Bounds;

526 Anil Kamath (Theory division, Computer Science Department.)
	H-index: 8; Papers: 8; Citation: 634   highest-cited paper: Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture (1995) at Random Struct. Algorithms(Cited By 162) Homepage: http://theory.stanford.edu/people/kamath/home.html
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

527 Eyal Even-Dar ( Institute for Research in Cognitive Science )
	H-index: 13; Papers: 33; Citation: 627   highest-cited paper: Convergence Time to Nash Equilibria (2003) at ICALP(Cited By 117) Homepage: http://www.seas.upenn.edu/~evendar/
Expertise: Machine Learning;   Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;

528 Bruno Codenotti (Research Director, Istituto di Informatica e Telematica Consiglio Nazionale delle Ricerche)
	H-index: 12; Papers: 57; Citation: 625   highest-cited paper: UbiCrawler: a scalable fully distributed Web crawler (2004) at Softw., Pract. Exper.(Cited By 167) Homepage: http://www.imc.pi.cnr.it/~codenotti/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Parallel Algorithm / Optimal Edge Search;   Nonlinear problem / Average complexity;

529 Lawrence Snyder
	H-index: 11; Papers: 28; Citation: 623   highest-cited paper: Introduction to the Configurable, Highly Parallel Computer (1982) at IEEE Computer(Cited By 307) Homepage:
Expertise: Parallel Algorithms / Wormhole Networks;   Communication Complexity / Lower Bounds;

530 Chi-Jen Lu (Associate Research Fellow, Institute of Information Science)
	H-index: 12; Papers: 39; Citation: 617   highest-cited paper: A linear-time component-labeling algorithm using contour tracing technique (2004) at Computer Vision and Image Understanding(Cited By 147) Homepage: http://www.iis.sinica.edu.tw/~cjlu/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;   Approximation Algorithms / Perfect Graphs;

531 Gerard M. Baudet
	H-index: 5; Papers: 6; Citation: 616   highest-cited paper: Asynchronous Iterative Methods for Multiprocessors (1978) at J. ACM(Cited By 388)
Expertise: Logic Networks / Fault Simulation;   Communication Complexity / Lower Bounds;   Error function / Runge-Kutta integration;

532 Anna Gal (Associate Professor, Department of Computer Sciences University of Texas)
	H-index: 14; Papers: 36; Citation: 615   highest-cited paper: Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates (1991) at FOCS(Cited By 0) Homepage: http://www.cs.utexas.edu/~panni/
Expertise: Communication Complexity / Lower Bounds;

533 Bartosz Przydatek (Google in Zurich.)
	H-index: 7; Papers: 11; Citation: 614   highest-cited paper: SIA: secure information aggregation in sensor networks (2003) at SenSys(Cited By 466) Homepage: http://www.crypto.ethz.ch/~przydatek/
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Security Views / New Denial;

534 Valerie King (Professor, Department of Computer Science University of Victoria)
	H-index: 12; Papers: 27; Citation: 613   highest-cited paper: Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation (1999) at J. ACM(Cited By 0) Homepage: http://www.cs.uvic.ca/~val/
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Dynamic Networks / Extended Abstract;   Wireless Networks / Priority Scheduling;

535 Jens Gramm (Theoretische Informatik Universit?0?1t T??bingen)
	H-index: 16; Papers: 36; Citation: 611   highest-cited paper: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT (2003) at Discrete Applied Mathematics(Cited By 82) Homepage: http://www-fs.informatik.uni-tuebingen.de/~gramm/
Expertise: Approximation Algorithms / Perfect Graphs;   Data Compression / Arithmetic Coding;   Communication Complexity / Lower Bounds;

536 Chris Peikert
	H-index: 15; Papers: 25; Citation: 610   highest-cited paper: Trapdoors for hard lattices and new cryptographic constructions (2008) at STOC(Cited By 92) Homepage: http://theory.lcs.mit.edu/~cpeikert/
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;

537 Stephen A. Cook
	H-index: 7; Papers: 7; Citation: 610   highest-cited paper: Log Depth Circuits for Division and Related Problems (1986) at SIAM J. Comput.(Cited By 231) Homepage:
Expertise: Communication Complexity / Lower Bounds;

538 Dennis M. Healy Jr (Professor, The Norbert Wiener Center is part of the College of Computer, Mathematical, and Physical Sciences.)
	H-index: 6; Papers: 15; Citation: 606   highest-cited paper: Wavelet transform domain filters: a spatially selective noise filtration technique (1994) at IEEE Transactions on Image Processing(Cited By 446) Homepage: http://www.norbertwiener.umd.edu/About/personal_pages/Dennis_Healy.html
Expertise: Wavelet image coding / Video compression;   Communication Complexity / Lower Bounds;   Image Registration / MR Images;

539 Marcus Peinado (Microsoft )
	H-index: 12; Papers: 26; Citation: 602   highest-cited paper: A Trusted Open Platform (2003) at IEEE Computer(Cited By 166) Homepage: http://cs-people.bu.edu/mpe/
Expertise: Approximation Algorithms / Perfect Graphs;   Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;   Robust Watermarking Scheme / Copyright Protection;   File System / Software Systems;

540 Andrew McGregor (Andrew McGregor PhD Student)
	H-index: 12; Papers: 26; Citation: 597   highest-cited paper: On graph problems in a semi-streaming model (2005) at Theor. Comput. Sci.(Cited By 77) Homepage: http://www.seas.upenn.edu/~andrewm/
Expertise: Communication Complexity / Lower Bounds;   Wireless Networks / Algorithmic Complexity;   Approximation Algorithms / Perfect Graphs;   XML Data;

541 Naomi Nishimura (Associate Professor, School of Computer Science University of Waterloo )
	H-index: 16; Papers: 39; Citation: 596   highest-cited paper: Finding Largest Subtrees and Smallest Supertrees (1998) at Algorithmica(Cited By 48) Homepage: http://www.cs.uwaterloo.ca/~nishi/
Expertise: Approximation Algorithms / Perfect Graphs;   Communication Complexity / Lower Bounds;   Convex Polygons / Planar Arrangements;

542 Dominic Mayers (Princeton University Department of Computer Science)
	H-index: 8; Papers: 9; Citation: 596   highest-cited paper: Unconditional security in quantum cryptography (2001) at J. ACM(Cited By 341) Homepage: http://dimacs.rutgers.edu/People/Postdocs/Mayers.html
Expertise: Signature Schemes / Authenticated Key Exchange Secure;   Communication Complexity / Lower Bounds;

543 Jiazhen Cai
	H-index: 8; Papers: 12; Citation: 594   highest-cited paper: Geometric constraint solver (1995) at Computer-Aided Design(Cited By 300)
Expertise: Random graph / Independence number;   Functional Programming / Binding-Time Analysis;   Surface interpolation / Geometric modeling;   Communication Complexity / Lower Bounds;

544 Muthuramakrishnan Venkitasubramaniam
	H-index: 4; Papers: 12; Citation: 593   highest-cited paper: L-diversity: Privacy beyond k-anonymity (2007) at TKDD(Cited By 630)
Expertise: Communication Complexity / Lower Bounds;   Signature Schemes / Authenticated Key Exchange Secure;   XML Data;

545 Daniela Pucci de Farias (Assistant Professor, Mechanical Engineering Affiliated with LIDS and ORC.)
	H-index: 7; Papers: 12; Citation: 591   highest-cited paper: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming (2004) at Math. Oper. Res.(Cited By 276) Homepage: http://www.mit.edu/~pucci/
Expertise: Machine Learning;   Communication Complexity / Lower Bounds;

546 Detlef Sieling (Fachbereich Informatik Universit?0?1t Dortmund)
	H-index: 12; Papers: 35; Citation: 590   highest-cited paper: Graph Driven BDDs - A New Data Structure for Boolean Functions (1995) at Theor. Comput. Sci.(Cited By -1) Homepage: http://ls2-www.cs.uni-dortmund.de/~sieling/
Expertise: Communication Complexity / Lower Bounds;

547 Erik Vee
	H-index: 15; Papers: 25; Citation: 588   highest-cited paper: Comparing and Aggregating Rankings with Ties (2004) at PODS(Cited By 87) Homepage:
Expertise: Communication Complexity / Lower Bounds;   Mechanism design / Learning Stochastic Finite Automata;   Approximation Algorithms / Perfect Graphs;   XML Data;

548 Christino Tamon (Clarkson University)
	H-index: 13; Papers: 25; Citation: 587   highest-cited paper: Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract) (1994) at COLT(Cited By 0) Homepage: http://www.clarkson.edu/cs/faculty/tamon.html
Expertise: Communication Complexity / Lower Bounds;

549 Don Johnson (People, Places & Things Telegram & Gazette/Sunday Telegram | Monday May 1 | 2 sources World shakers listedNEW YORK- World shakers listed orge Clooney and Reese Witherspoon and German Chancellor Angela Merkel are among the newsmakers on Time magazine's list of 100 people who shape our world. Comment?)
	H-index: 5; Papers: 8; Citation: 580   highest-cited paper: Key Agreement Protocols and Their Security Analysis (1997) at IMA Int. Conf.(Cited By 311) Homepage: http://www.topix.net/who/don-johnson
Expertise: Finite Languages / Database Queries;   Parallel Algorithms / Wormhole Networks;   Communication Complexity / Lower Bounds;   Dynamic Networks / Extended Abstract;

550 Mihai Patrascu (PhD student , MIT)
	H-index: 16; Papers: 46; Citation: 579   highest-cited paper: Time-space trade-offs for predecessor search (2006) at STOC(Cited By 49) Homepage: http://web.mit.edu/~mip/www/numbers.html
Expertise: Communication Complexity / Lower Bounds;   Approximation Algorithms / Perfect Graphs;   Convex Polygons / Planar Arrangements;