H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 78 Citations 39,977 202 World Ranking 502 National Ranking 302

Research.com Recognitions

Awards & Achievements

2015 - ACM Fellow For contributions to high-dimensional geometric computing, streaming/sketching algorithms, and the Sparse Fourier Transform.

2012 - ACM Paris Kanellakis Theory and Practice Award With Andrei Broder and Moses S Charikar, for their groundbreaking work on Locality-Sensitive Hashing that has had great impact in many fields of computer science including computer vision, databases, information retrieval, machine learning, and signal processing.

2003 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Statistics

Combinatorics, Discrete mathematics, Algorithm, k-nearest neighbors algorithm and Locality-sensitive hashing are his primary areas of study. His Combinatorics study incorporates themes from Upper and lower bounds and Polynomial. Piotr Indyk has researched Discrete mathematics in several fields, including Matrix and Norm.

Piotr Indyk has included themes like Nearest neighbor search and Curse of dimensionality in his k-nearest neighbors algorithm study. His Nearest neighbor search research integrates issues from Ball tree, Fixed-radius near neighbors and Cover tree. His work on Hopscotch hashing as part of general Locality-sensitive hashing study is frequently connected to Artificial intelligence, Dynamic perfect hashing and Universal hashing, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

His most cited work include:

  • Approximate nearest neighbors: towards removing the curse of dimensionality (3490 citations)
  • Similarity Search in High Dimensions via Hashing (2912 citations)
  • Locality-sensitive hashing scheme based on p-stable distributions (2270 citations)

What are the main themes of his work throughout his whole career to date?

Piotr Indyk mainly focuses on Combinatorics, Discrete mathematics, Algorithm, Nearest neighbor search and Approximation algorithm. His biological study deals with issues like Metric, which deal with fields such as Euclidean distance. In Discrete mathematics, Piotr Indyk works on issues like Embedding, which are connected to Distortion.

His Algorithm study deals with Streaming algorithm intersecting with Data stream. His biological study spans a wide range of topics, including Ball tree, Fixed-radius near neighbors and k-nearest neighbors algorithm. His work in Compressed sensing addresses issues such as Sparse approximation, which are connected to fields such as Sparse matrix.

He most often published in these fields:

  • Combinatorics (43.55%)
  • Discrete mathematics (29.68%)
  • Algorithm (23.23%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (43.55%)
  • Algorithm (23.23%)
  • Nearest neighbor search (11.61%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Combinatorics, Algorithm, Nearest neighbor search, Discrete mathematics and Point. He works on Combinatorics which deals in particular with Binary logarithm. His study in Algorithm is interdisciplinary in nature, drawing from both Measure and Simple.

His work deals with themes such as Data point, Metric space and k-nearest neighbors algorithm, which intersect with Nearest neighbor search. His k-nearest neighbors algorithm research incorporates elements of Nearest-neighbor chain algorithm and Computational problem. In his work, Combinatorial optimization and Element is strongly intertwined with Sequence, which is a subfield of Discrete mathematics.

Between 2015 and 2021, his most popular works were:

  • Fast millimeter wave beam alignment (67 citations)
  • Which Regular Expression Patterns Are Hard to Match (49 citations)
  • Learning-Based Frequency Estimation Algorithms. (43 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Artificial intelligence
  • Statistics

His primary areas of investigation include Combinatorics, Point, Algorithm, Nearest neighbor search and Metric space. His Combinatorics research focuses on Deterministic algorithm in particular. His Point research is multidisciplinary, relying on both Transmitter, Wireless network and Cellular network.

His work on Time complexity as part of general Algorithm research is frequently linked to Scalability, bridging the gap between disciplines. His Nearest neighbor search study combines topics from a wide range of disciplines, such as Range, Discrete geometry and k-nearest neighbors algorithm. The Metric space study combines topics in areas such as Artificial neural network, Graph, Quantization and Theoretical computer science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Approximate nearest neighbors: towards removing the curse of dimensionality

Piotr Indyk;Rajeev Motwani.
symposium on the theory of computing (1998)

4644 Citations

Similarity Search in High Dimensions via Hashing

Aristides Gionis;Piotr Indyk;Rajeev Motwani.
very large data bases (1999)

3829 Citations

Locality-sensitive hashing scheme based on p-stable distributions

Mayur Datar;Nicole Immorlica;Piotr Indyk;Vahab S. Mirrokni.
symposium on computational geometry (2004)

2976 Citations

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

Alexandr Andoni;Piotr Indyk.
foundations of computer science (2006)

2555 Citations

Enhanced hypertext categorization using hyperlinks

Soumen Chakrabarti;Byron Dom;Piotr Indyk.
international conference on management of data (1998)

1161 Citations

Maintaining Stream Statistics over Sliding Windows

Mayur Datar;Aristides Gionis;Piotr Indyk;Rajeev Motwani.
SIAM Journal on Computing (2002)

1078 Citations

Locality-Sensitive Hashing Using Stable Distributions

Gregory Shakhnarovich;Trevor Darrell;Piotr Indyk.
(2006)

689 Citations

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

Sariel Har-Peled;Piotr Indyk;Rajeev Motwani.
Theory of Computing (2012)

611 Citations

Nearest-neighbor methods in learning and vision : theory and practice

Gregory Shakhnarovich;Piotr Indyk;Trevor Darrell.
(2005)

597 Citations

Finding interesting associations without support pruning

E. Cohen;M. Datar;S. Fujiwara;A. Gionis.
IEEE Transactions on Knowledge and Data Engineering (2001)

589 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Piotr Indyk

David P. Woodruff

David P. Woodruff

Carnegie Mellon University

Publications: 121

Graham Cormode

Graham Cormode

University of Warwick

Publications: 77

Ping Li

Ping Li

Baidu (United States)

Publications: 62

Qi Tian

Qi Tian

Huawei Technologies (China)

Publications: 62

Heng Tao Shen

Heng Tao Shen

University of Electronic Science and Technology of China

Publications: 53

Martin J. Strauss

Martin J. Strauss

University of Michigan–Ann Arbor

Publications: 53

Rasmus Pagh

Rasmus Pagh

University of Copenhagen

Publications: 52

Fumin Shen

Fumin Shen

University of Electronic Science and Technology of China

Publications: 51

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 50

Robert Krauthgamer

Robert Krauthgamer

Weizmann Institute of Science

Publications: 47

Andrew McGregor

Andrew McGregor

University of Massachusetts Amherst

Publications: 47

Anna C. Gilbert

Anna C. Gilbert

Yale University

Publications: 46

Venkatesan Guruswami

Venkatesan Guruswami

Carnegie Mellon University

Publications: 45

Charu C. Aggarwal

Charu C. Aggarwal

IBM (United States)

Publications: 41

Philip S. Yu

Philip S. Yu

University of Illinois at Chicago

Publications: 40

Something went wrong. Please try again later.