World's Best Scientists 2026 revealed!
Piotr Indyk

Piotr Indyk

D-Index & Metrics

Computer Science

D-Index
90
Citations
45910
World Ranking
598
National Ranking
323

Piotr Indyk publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Piotr Indyk sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 305 publications — 75th percentile

75% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Piotr Indyk D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Piotr Indyk sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 90 D-Index — 96th percentile

96% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 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

Piotr Indyk is affiliated with MIT in the United States and has contributed extensively to the field of computer science, with a focus on several subfields and topics.

Their primary fields of study include:

  • Computer Science

Within this broad area, they have specialized in subfields such as:

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Computational Mechanics
  • Management Science and Operations Research
  • Computer Networks and Communications

Key topics of their work cover:

  • Machine Learning and Algorithms
  • Sparse and Compressive Sensing Techniques
  • Domain Adaptation and Few-Shot Learning
  • Imbalanced Data Classification Techniques
  • Data Management and Algorithms
  • Stochastic Gradient Optimization Techniques
  • Computational Geometry and Mesh Generation

Recent papers authored or coauthored by Piotr Indyk include:

  • Targeted Supervised Contrastive Learning for Long-Tailed Recognition, 2022, 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
  • Targeted Supervised Contrastive Learning for Long-Tailed Recognition, 2021, arXiv (Cornell University)
  • Learning-based Support Estimation in Sublinear Time, 2021, arXiv (Cornell University)
  • Addressing Feature Suppression in Unsupervised Visual Representations, 2023, 2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)
  • Optimal (Euclidean) Metric Compression, 2022, SIAM Journal on Computing

Frequent coauthors of Piotr Indyk are:

  • Sandeep Silwal
  • Tal Wagner
  • Shyam Narayanan
  • Ronitt Rubinfeld
  • Tianhong Li

Publication venues where their work has been featured include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
  • 2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)
  • SIAM Journal on Computing

Over the course of their career, they have received several distinctions including:

  • ACM Fellow (2015) for contributions to high-dimensional geometric computing, streaming/sketching algorithms, and the Sparse Fourier Transform
  • ACM Paris Kanellakis Theory and Practice Award (2012) with collaborators for work on Locality-Sensitive Hashing impacting multiple computer science fields
  • Fellow of Alfred P. Sloan Foundation (2003)

Best Publications

  • Approximate nearest neighbors: towards removing the curse of dimensionality

    Piotr Indyk;Rajeev Motwani

  • Similarity Search in High Dimensions via Hashing

    Aristides Gionis;Piotr Indyk;Rajeev Motwani

  • Locality-sensitive hashing scheme based on p-stable distributions

    Mayur Datar;Nicole Immorlica;Piotr Indyk;Vahab S. Mirrokni

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

    Alexandr Andoni;Piotr Indyk

  • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

    Alexandr Andoni;Piotr Indyk

  • Maintaining Stream Statistics over Sliding Windows

    Mayur Datar;Aristides Gionis;Piotr Indyk;Rajeev Motwani

  • Enhanced hypertext categorization using hyperlinks

    Soumen Chakrabarti;Byron Dom;Piotr Indyk

  • Stable distributions, pseudorandom generators, embeddings, and data stream computation

    Piotr Indyk

  • Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

    Sariel Har-Peled;Piotr Indyk;Rajeev Motwani

  • Locality-Sensitive Hashing Using Stable Distributions

    Gregory Shakhnarovich;Trevor Darrell;Piotr Indyk

  • Finding interesting associations without support pruning

    E. Cohen;M. Datar;S. Fujiwara;A. Gionis

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

    Gregory Shakhnarovich;Piotr Indyk;Trevor Darrell

  • Approximate clustering via core-sets

    Mihai Bādoiu;Sariel Har-Peled;Piotr Indyk

  • Combining geometry and combinatorics: A unified approach to sparse signal recovery

    R. Berinde;A.C. Gilbert;P. Indyk;H. Karloff

  • Simple and practical algorithm for sparse fourier transform

    Haitham Hassanieh;Piotr Indyk;Dina Katabi;Eric Price

  • Sparse Recovery Using Sparse Matrices

    Anna Gilbert;Piotr Indyk

  • Algorithmic applications of low-distortion geometric embeddings

    P. Indyk

  • Practical and optimal LSH for angular distance

    Alexandr Andoni;Piotr Indyk;Thijs Laarhoven;Ilya Razenshteyn

  • Maintaining stream statistics over sliding windows: (extended abstract)

    Mayur Datar;Aristides Gionis;Piotr Indyk;Rajeev Motwani

  • Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

    D. Aingworth;C. Chekuri;P. Indyk;R. Motwani

  • Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)

    Gregory Shakhnarovich;Trevor Darrell;Piotr Indyk

Frequent Co-Authors

Alexandr Andoni
Alexandr Andoni Columbia University
David P. Woodruff
David P. Woodruff Carnegie Mellon University
Rajeev Motwani
Rajeev Motwani Stanford University
Trevor Darrell
Trevor Darrell University of California, Berkeley
Gregory Shakhnarovich
Gregory Shakhnarovich Toyota Technological Institute at Chicago
Sariel Har-Peled
Sariel Har-Peled University of Illinois at Urbana-Champaign
Aristides Gionis
Aristides Gionis Royal Institute of Technology

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring alternative educational pathways to studying Computer Science in the USA can open up flexible and affordable options. For those seeking a fast track to the workforce or wanting to build foundational knowledge, an accelerated online associates degree may be ideal. These programs can often be completed in as little as six months, helping you quickly gain valuable skills.

If you're interested in the business side of technology or tech management, consider pursuing the cheapest online business management degree programs. These degrees provide important leadership and organizational skills that complement technical expertise. Cost-conscious learners will also benefit from learning about the cheapest online colleges, which offer bachelor’s degrees in a range of disciplines, including technology and data science.

For those with a strong interest in engineering, several online engineering degree programs offer a flexible way to achieve your goals. These programs may lead to careers in software engineering, hardware development, or specialized fields like robotics and cybersecurity—closely related to computer science. By exploring these online degree pathways, you can tailor your education to fit your budget, schedule, and career ambitions.

Best Scientists Citing Piotr Indyk

Trending Scientists

Recently Published Articles