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

501

Alain Tapp

(professor)

H-index: 11; Papers: 19; Citation: 803
highest-cited paper: Quantum Counting (1998) at ICALP(Cited By 161)
Homepage: http://www.iro.umontreal.ca/~tappa/

Expertise: Signature Schemes / Authenticated Key Exchange Secure; Communication Complexity / Lower Bounds;

509

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;

511

V. Vinay

H-index: 11; Papers: 26; Citation: 566
highest-cited paper: Clustering in Large Graphs and Matrices (1999) at SODA(Cited By 157)
Homepage:

Expertise: Communication Complexity / Lower Bounds;

512

Andrej Bogdanov

(* Andrej Bogdanov: On the relation between worst-case and average-case complexity for NP. Ph. D. Thesis, University of California, Berkeley, 2005)

H-index: 11; Papers: 20; Citation: 560
highest-cited paper: On Worst-Case to Average-Case Reductions for NP Problems (2006) at SIAM J. Comput.(Cited By 82)
Homepage: http://www.math.ias.edu/~adib/publications.html

Expertise: Communication Complexity / Lower Bounds;

522

Jun Tarui

(Department of Information and Communication Eng University of Electro-Communications )

H-index: 11; Papers: 27; Citation: 439
highest-cited paper: On ACC (1994) at Computational Complexity(Cited By 127)
Homepage: http://www.jtlab.ice.uec.ac.jp/~tarui/

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

524

Lap Chi Lau

(Assistant Professor, Computer Science and Enginnering Chinese University of Hong Kong)

H-index: 11; Papers: 22; Citation: 430
highest-cited paper: On achieving optimal throughput with network coding (2005) at INFOCOM(Cited By 86)
Homepage: http://www.cse.cuhk.edu.hk/~chi/

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

527

N. V. Vinodchandran

(Associate Professor , Dept. of Comp. Sci. & Engg. University of Nebraska-Lincoln)

H-index: 11; Papers: 47; Citation: 416
highest-cited paper: Derandomizing Arthur-Merlin Games using Hitting Sets (2005) at Computational Complexity(Cited By 84)
Homepage: http://www.cse.unl.edu/~vinod/

Expertise: Communication Complexity / Lower Bounds; Automata Theory / Slender Languages; Machine Learning; ATM Networks;

528

Wayne Goddard

(Associate Professor, School of Computing Clemson University )

H-index: 11; Papers: 65; Citation: 406
highest-cited paper: Optimal Randomized Algorithms for Local Sorting and Set-Maxima (1990) at STOC(Cited By 38)
Homepage: http://www.cs.clemson.edu/~goddard/

Expertise: Random graph / Independence number; Communication Complexity / Lower Bounds;

530

Kenneth W. Regan

(Associate Professor, Department of Computer Science and Engineering University at Buffalo, The State University of New York)

H-index: 11; Papers: 40; Citation: 373
highest-cited paper: Pseudorandom Generators, Measure Theory, and Natural Proofs (1995) at FOCS(Cited By 53)
Homepage: http://www.cse.buffalo.edu/~regan/

Expertise: Communication Complexity / Lower Bounds; Automata Theory / Slender Languages;

531

Hubie Chen

(Departament de Tecnologies de la Informaci? i les Comunicacions Universitat Pompeu Fabra )

H-index: 11; Papers: 56; Citation: 366
highest-cited paper: Formal Models of Heavy-Tailed Behavior in Combinatorial Search (2001) at CP(Cited By 46)
Homepage: http://www.tecn.upf.es/~hchen/

Expertise: Constraint Programming / Combinatorial Search Problems; Communication Complexity / Lower Bounds;

533

Philipp Woelfel

(Assistant Professor , University of Calgary Department of Computer Science )

H-index: 11; Papers: 38; Citation: 351
highest-cited paper: Almost random graphs with simple hash functions (2003) at STOC(Cited By 36)
Homepage: http://pages.cpsc.ucalgary.ca/~woelfel/

Expertise: Communication Complexity / Lower Bounds; Dynamic Networks / Extended Abstract;

535

Amin Coja-Oghlan

(visiting researcher Privatdozent , Department of Mathematical Sciences Carnegie Mellon University Pittsburgh Computer Science Department Humboldt-Universit?t zu Berlin)

H-index: 11; Papers: 52; Citation: 344
highest-cited paper: A spectral heuristic for bisecting random graphs (2006) at Random Struct. Algorithms(Cited By 25)
Homepage: http://web.mac.com/aminco/iWeb/Amin%20Coja-Oghlan/Start.html

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

536

Parikshit Gopalan

(Postdoctoral Researcher , Computer Science &Engineering University of Washington )

H-index: 11; Papers: 40; Citation: 341
highest-cited paper: New Results for Learning Noisy Parities and Halfspaces (2006) at FOCS(Cited By 55)
Homepage: http://www.cs.washington.edu/homes/parik/

Expertise: Communication Complexity / Lower Bounds;

537

Richard Chang

(Associate Professor, Department of Computer Science & Electrical Engineering University of Maryland Baltimore County )

H-index: 11; Papers: 15; Citation: 337
highest-cited paper: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection (1996) at SIAM J. Comput.(Cited By 70)
Homepage: http://www.cs.umbc.edu/~chang/

Expertise: Communication Complexity / Lower Bounds;

541

Pinyan Lu

(Tsinghua University)

H-index: 11; Papers: 32; Citation: 274
highest-cited paper: Holographic algorithms: from art to science (2007) at STOC(Cited By 33)
Homepage: http://itcs.tsinghua.edu.cn/students/LuPY/index.html

Expertise: Communication Complexity / Lower Bounds;

545

Linyuan Lu

(Assistant Professor, Department of Mathematics University of South Carolina)

H-index: 10; Papers: 22; Citation: 1561
highest-cited paper: A random graph model for massive graphs (2000) at STOC(Cited By 574)
Homepage: http://www.math.sc.edu/~lu/

Expertise: Communication Complexity / Lower Bounds; Random graph / Independence number; Finite Sets / New Designs;

Experts ranked by H-index.

Which ranks do you think most useful