- Home
- Top Scientists - Computer Science
- Subhash Suri

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
69
Citations
17,047
200
World Ranking
886
National Ranking
533

2011 - Fellow of the American Association for the Advancement of Science (AAAS)

2010 - ACM Fellow For algorithmic contributions in computational geometry, networks, and computational economics.

2007 - ACM Distinguished Member

- Computer network
- Algorithm
- Artificial intelligence

Algorithm, Combinatorics, Mathematical optimization, Distributed computing and Computer network are his primary areas of study. His work deals with themes such as Piecewise linear function, Probabilistic analysis of algorithms, Floyd–Warshall algorithm, Path and Trajectory, which intersect with Algorithm. His Combinatorics research is multidisciplinary, incorporating elements of Discrete mathematics, Plane and Convex polytope.

His work carried out in the field of Mathematical optimization brings together such families of science as Bidding, Combinatorial auction, Spectrum auction and Auction algorithm. The study incorporates disciplines such as Mobile ad hoc network, Wireless ad hoc network, Wireless sensor network and Communications protocol in addition to Distributed computing. Computer network is closely attributed to Scalability in his study.

- Towards realistic mobility models for mobile ad hoc networks (575 citations)
- Fast and scalable layer four switching (555 citations)
- Packet classification using tuple space search (509 citations)

His primary scientific interests are in Combinatorics, Discrete mathematics, Algorithm, Theoretical computer science and Mathematical optimization. His Combinatorics study incorporates themes from Point, Plane and Polygon. His Polygon research is multidisciplinary, relying on both Visibility and Regular polygon.

His Discrete mathematics research includes themes of Upper and lower bounds and Data structure. His studies in Algorithm integrate themes in fields like Data stream and Wireless sensor network. The concepts of his Mathematical optimization study are interwoven with issues in Auction theory, Convex hull and Combinatorial auction.

- Combinatorics (40.95%)
- Discrete mathematics (18.40%)
- Algorithm (13.06%)

- Combinatorics (40.95%)
- Discrete mathematics (18.40%)
- Point (8.31%)

His primary areas of study are Combinatorics, Discrete mathematics, Point, Plane and Approximation algorithm. His research in Combinatorics intersects with topics in Rectangle, Upper and lower bounds and Regular polygon. His work in Discrete mathematics addresses issues such as Hyperbolic space, which are connected to fields such as Book embedding.

His Point study combines topics in areas such as Probabilistic logic, Art gallery problem, Convex hull and k-nearest neighbors algorithm. His study focuses on the intersection of Plane and fields such as Path with connections in the field of Function. His Approximation algorithm study deals with the bigger picture of Mathematical optimization.

- On the Complexity of Time-Dependent Shortest Paths (54 citations)
- Metric Embedding, Hyperbolic Space, and Social Networks (37 citations)
- Convex Hulls under Uncertainty (28 citations)

- Computer network
- Algorithm
- Operating system

Subhash Suri mainly investigates Combinatorics, Point, Discrete mathematics, Convex hull and Approximation algorithm. His Combinatorics study combines topics from a wide range of disciplines, such as Upper and lower bounds, Pursuit-evasion and k-nearest neighbors algorithm. His research investigates the link between Point and topics such as Computational geometry that cross with problems in Closest pair of points problem, Data structure, Star-shaped polygon, Art gallery problem and Monotone polygon.

The Discrete mathematics study combines topics in areas such as Function, Linear function, Hyperbolic space and Shortest path problem. Approximation algorithm is a subfield of Mathematical optimization that Subhash Suri studies. Subhash Suri focuses mostly in the field of Mathematical optimization, narrowing it down to topics relating to Representation and, in certain cases, Algorithm, Regret, Very large database, Greedy algorithm and Minification.

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.

Fast and scalable layer four switching

V. Srinivasan;G. Varghese;S. Suri;M. Waldvogel.

acm special interest group on data communication **(1998)**

881 Citations

Towards realistic mobility models for mobile ad hoc networks

Amit Jardosh;Elizabeth M. Belding-Royer;Kevin C. Almeroth;Subhash Suri.

acm/ieee international conference on mobile computing and networking **(2003)**

880 Citations

Packet classification using tuple space search

V. Srinivasan;S. Suri;G. Varghese.

acm special interest group on data communication **(1999)**

766 Citations

Medians and beyond: new aggregation techniques for sensor networks

Nisheeth Shrivastava;Chiranjeeb Buragohain;Divyakant Agrawal;Subhash Suri.

international conference on embedded networked sensor systems **(2004)**

622 Citations

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine.

Management Science **(2005)**

477 Citations

A game theoretic framework for incentives in P2P systems

C. Buragohain;D. Agrawal;S. Suri.

international conference on peer-to-peer computing **(2003)**

467 Citations

eBay in the Sky: strategy-proof wireless spectrum auctions

Xia Zhou;Sorabh Gandhi;Subhash Suri;Haitao Zheng.

acm/ieee international conference on mobile computing and networking **(2008)**

466 Citations

Detecting and resolving packet filter conflicts

A. Hari;S. Suri;G. Parulkar.

international conference on computer communications **(2000)**

457 Citations

A General Framework for Wireless Spectrum Auctions

S. Gandhi;C. Buragohain;Lili Cao;Haitao Zheng.

2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks **(2007)**

370 Citations

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

John Hershberger;Subhash Suri.

SIAM Journal on Computing **(1999)**

366 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

Mentor Graphics

Carnegie Mellon University

Duke University

University of California, Los Angeles

University of California, Santa Barbara

Harvard University

Stony Brook University

Scry Analytics

Stanford University

ETH Zurich

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:

Something went wrong. Please try again later.