- Home
- Best Scientists - Computer Science
- Anupam Gupta

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
59
Citations
11,137
233
World Ranking
2292
National Ranking
1231

- Computer network
- Combinatorics
- Algorithm

Anupam Gupta mainly investigates Combinatorics, Approximation algorithm, Discrete mathematics, Mathematical optimization and Algorithm. His work in the fields of Binary logarithm overlaps with other areas such as Monotone polygon. He has included themes like Computational complexity theory, Wireless sensor network, Minimax approximation algorithm, Probabilistic logic and Optimization problem in his Approximation algorithm study.

His work deals with themes such as Embedding and Greedy algorithm, which intersect with Discrete mathematics. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Network planning and design, CURE data clustering algorithm and Cluster analysis. His Algorithm study incorporates themes from Submodular set function, Open problem and Theoretical computer science.

- An elementary proof of a theorem of Johnson and Lindenstrauss (719 citations)
- Near-optimal sensor placements: maximizing information while minimizing communication cost (418 citations)
- Bounded geometries, fractals, and low-distortion embeddings (410 citations)

Anupam Gupta mostly deals with Combinatorics, Approximation algorithm, Discrete mathematics, Mathematical optimization and Algorithm. His research integrates issues of Embedding, Bounded function and Metric space in his study of Combinatorics. His Embedding research is multidisciplinary, incorporating elements of Distortion and Euclidean space.

His work in Approximation algorithm addresses issues such as Steiner tree problem, which are connected to fields such as Covering problems and Combinatorial optimization. His biological study spans a wide range of topics, including Linear programming relaxation and Metric. The Mathematical optimization study combines topics in areas such as Scheduling, Graph and Competitive analysis.

- Combinatorics (45.45%)
- Approximation algorithm (37.66%)
- Discrete mathematics (27.60%)

- Combinatorics (45.45%)
- Algorithm (15.91%)
- Competitive analysis (11.04%)

Combinatorics, Algorithm, Competitive analysis, Mathematical optimization and Online algorithm are his primary areas of study. His Combinatorics research includes themes of Bounded function and Metric space. His work on Randomized algorithm as part of his general Algorithm study is frequently connected to Corruption, thereby bridging the divide between different branches of science.

His studies in Competitive analysis integrate themes in fields like Binary logarithm and Submodular set function. Anupam Gupta studies Approximation algorithm which is a part of Mathematical optimization. His studies deal with areas such as Constraint, Markov chain and Cache as well as Approximation algorithm.

- Better Algorithms for Stochastic Bandits with Adversarial Corruptions (36 citations)
- Scale Steerable Filters for Locally Scale-Invariant Convolutional Neural Networks. (18 citations)
- Chasing convex bodies with linear competitive ratio (15 citations)

- Computer network
- Algorithm
- Statistics

His primary areas of investigation include Combinatorics, Algorithm, Competitive analysis, Online algorithm and Treewidth. His research integrates issues of Bounded function, Metric space and Cluster analysis in his study of Combinatorics. Anupam Gupta has researched Bounded function in several fields, including Vertex, Induced subgraph, Graph partition, Approximation algorithm and Minimax approximation algorithm.

His studies in Algorithm integrate themes in fields like Adversarial system, Regret, Convolutional neural network and Scale invariance. His study in Competitive analysis is interdisciplinary in nature, drawing from both Tree and Matching. His Treewidth research includes elements of Submodular set function, Set cover problem and Linear programming relaxation.

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.

An elementary proof of a theorem of Johnson and Lindenstrauss

Sanjoy Dasgupta;Anupam Gupta.

Random Structures and Algorithms **(2003)**

1058 Citations

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

Andreas Krause;Carlos Guestrin;Anupam Gupta;Jon Kleinberg.

information processing in sensor networks **(2006)**

567 Citations

Bounded geometries, fractals, and low-distortion embeddings

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

foundations of computer science **(2003)**

462 Citations

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

Anupam Gupta;Jon Kleinberg;Amit Kumar;Rajeev Rastogi.

symposium on the theory of computing **(2001)**

385 Citations

Robust Submodular Observation Selection

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

Journal of Machine Learning Research **(2008)**

294 Citations

Privately Releasing Conjunctions and the Statistical Query Barrier

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

SIAM Journal on Computing **(2013)**

284 Citations

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

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

Algorithmica **(2012)**

278 Citations

Cuts, Trees and ℓ 1 -Embeddings of Graphs*

Anupam Gupta;Alistair Sinclair;Ilan Newman;Yuri Rabinovich.

foundations of computer science **(1999)**

250 Citations

Simpler and better approximation algorithms for network design

Anupam Gupta;Amit Kumar;Tim Roughgarden.

symposium on the theory of computing **(2003)**

219 Citations

Boosted sampling: approximation algorithms for stochastic optimization

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

symposium on the theory of computing **(2004)**

205 Citations

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

Contact us

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:

Carnegie Mellon University

Apple (United States)

University of Michigan–Ann Arbor

Technion – Israel Institute of Technology

University of Pennsylvania

University of Illinois at Urbana-Champaign

University of Pittsburgh

Sapienza University of Rome

VMware

University of California, Berkeley

French Institute for Research in Computer Science and Automation - INRIA

Oracle (United States)

Xi'an Jiaotong University

University of California, Davis

Wuhan University of Technology

Inland Norway University of Applied Sciences

National Museum of Natural History

Friedrich-Loeffler-Institut

Royal Tropical Institute

Kyoto University

Saint Louis University

Centre national de la recherche scientifique, CNRS

University of South Florida

University of Amsterdam

Temple University

Utrecht University

Something went wrong. Please try again later.