World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
63
Citations
12906
World Ranking
2800
National Ranking
1383

Anupam Gupta 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 Anupam Gupta 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: 268 publications — 67th percentile

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

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

Anupam Gupta 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 Anupam Gupta 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: 63 D-Index — 81st percentile

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

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

Overview

Anupam Gupta is affiliated with Carnegie Mellon University in the United States. Their primary research area is Computer Science, with 113 publications contributing to this field.

Gupta's work spans several subfields, including:

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

The scientist's research covers multiple main topics, such as:

  • Optimization and Search Problems
  • Complexity and Algorithms in Graphs
  • Scheduling and Optimization Algorithms
  • Auction Theory and Applications
  • Facility Location and Emergency Management
  • Optimization and Packing Problems
  • Advanced Bandit Algorithms Research

Anupam Gupta has published in a variety of journals and venues, with the most frequent being:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Mathematical Programming
  • SIAM Journal on Computing
  • Indian Journal of Physical Medicine and Rehabilitation

They have co-authored several papers with the following collaborators:

  • Amit Kumar
  • Euiwoong Lee
  • Jason Li
  • Sahil Singla
  • Viswanath Nagarajan

Among the notable recent papers authored or co-authored by Anupam Gupta are:

  • "Fair algorithms for selecting citizens' assemblies", 2021, published in Nature
  • "Exact Exponential Algorithms for Clustering Problems", 2022, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Robust Algorithms for the Secretary Problem", 2020, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Chasing Convex Bodies with Linear Competitive Ratio", 2021, published in Journal of the ACM
  • "Stochastic Load Balancing on Unrelated Machines", 2020, published in Mathematics of Operations Research

Anupam Gupta has contributed to book publications, including one with Springer Science+Business Media titled "Integer Programming and Combinatorial Optimization" published in 2022.

Best Publications

  • An elementary proof of a theorem of Johnson and Lindenstrauss

    Sanjoy Dasgupta;Anupam Gupta

  • Near-optimal sensor placements: maximizing information while minimizing communication cost

    Andreas Krause;Carlos Guestrin;Anupam Gupta;Jon Kleinberg

  • Bounded geometries, fractals, and low-distortion embeddings

    A. Gupta;R. Krauthgamer;J.R. Lee

  • Provisioning a virtual private network: a network design problem for multicommodity flow

    Anupam Gupta;Jon Kleinberg;Amit Kumar;Rajeev Rastogi

  • Robust Submodular Observation Selection

    Andreas Krause;H. Brendan McMahan;Carlos Guestrin;Anupam Gupta

  • When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

    Nikhil Bansal;Anupam Gupta;Jian Li;Julián Mestre

  • Privately Releasing Conjunctions and the Statistical Query Barrier

    Anupam Gupta;Moritz Hardt;Aaron Roth;Jonathan R. Ullman

  • Cuts, Trees and ℓ 1 -Embeddings of Graphs*

    Anupam Gupta;Alistair Sinclair;Ilan Newman;Yuri Rabinovich

  • Simpler and better approximation algorithms for network design

    Anupam Gupta;Amit Kumar;Tim Roughgarden

  • Constrained non-monotone submodular maximization: offline and secretary algorithms

    Anupam Gupta;Aaron Roth;Grant Schoenebeck;Kunal Talwar

  • Boosted sampling: approximation algorithms for stochastic optimization

    Anupam Gupta;Martin Pál;R. Ravi;Amitabh Sinha

  • Approximation Algorithms for the Unsplittable Flow Problem

    Amit Chakrabarti;Chandra Chekuri;Anupam Gupta;Amit Kumar

  • Iterative constructions and private data release

    Anupam Gupta;Aaron Roth;Jonathan Ullman

  • Differentially private combinatorial optimization

    Anupam Gupta;Katrina Ligett;Frank McSherry;Aaron Roth

  • On Hierarchical Routing in Doubling Metrics

    T.-H. Hubert Chan;Anupam Gupta;Bruce M. Maggs;Shuheng Zhou

  • Approximate clustering without the approximation

    Maria-Florina Balcan;Avrim Blum;Anupam Gupta

  • Cuts, trees and l/sub 1/-embeddings of graphs

    A. Gupta;I. Newman;Y. Rabinovich;A. Sinclair

  • Vertex Sparsifiers: New Results from Old Techniques

    Matthias Englert;Anupam Gupta;Robert Krauthgamer;Harald Räcke

  • Discovering pathways by orienting edges in protein interaction networks

    Anthony Gitter;Judith Klein-Seetharaman;Anupam Gupta;Ziv Bar-Joseph

  • Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

    Shuchi Chawla;Anupam Gupta;Harald Räcke

  • Better Algorithms for Stochastic Bandits with Adversarial Corruptions

    Anupam Gupta;Tomer Koren;Kunal Talwar

Frequent Co-Authors

R. Ravi
R. Ravi Carnegie Mellon University
Kunal Talwar
Kunal Talwar Apple (United States)
Nikhil Bansal
Nikhil Bansal University of Michigan–Ann Arbor
Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Aaron Roth
Aaron Roth University of Pennsylvania
Chandra Chekuri
Chandra Chekuri University of Illinois at Urbana-Champaign
Kirk Pruhs
Kirk Pruhs University of Pittsburgh
Niv Buchbinder
Niv Buchbinder Tel Aviv University
Carlos Guestrin
Carlos Guestrin Stanford University
Robert Krauthgamer
Robert Krauthgamer Weizmann Institute of Science

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

As the demand for tech professionals grows, there are more flexible ways to advance your education in Computer Science. Many students consider fastest online master's degree programs so they can quickly gain advanced skills and compete for top positions.

Understanding which master's degree is most in demand in usa can help guide your choice of specialization. Data science, cybersecurity, and software engineering master's programs are especially valued by employers.

For those just starting out, an associates degree online offers a flexible and cost-effective entry point into the tech field. These programs often provide foundational skills needed for entry-level roles or further study.

Affordability is also an important factor. Many students look for cheap online degrees fast options that fit their budget and timeline without sacrificing quality.

By exploring these online pathways, you can tailor your education to your goals and quickly set yourself up for success in the ever-evolving tech industry.

Best Scientists Citing Anupam Gupta

Trending Scientists

Recently Published Articles