Subhash Suri | Academic Influence

Subhash Suri's AcademicInfluence.com Rankings

Subhash Suri

Computer Science

#2766

World Rank

#2894

Historical Rank

#1161

USA Rank

Database

#4040

World Rank

#4200

Historical Rank

#674

USA Rank

computer-science Degrees

Download Badge

Computer Science

Subhash Suri's Degrees

PhD Computer Science Cornell University
Masters Computer Science Cornell University

Similar Degrees You Can Earn

Why Is Subhash Suri Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Subhash Suri is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.

(See a Problem?)

Subhash Suri's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Towards realistic mobility models for mobile ad hoc networks (2003) (719)
Packet classification using tuple space search (1999) (578)
Medians and beyond: new aggregation techniques for sensor networks (2004) (549)
Fast and scalable layer four switching (1998) (536)
eBay in the Sky: strategy-proof wireless spectrum auctions (2008) (482)
A game theoretic framework for incentives in P2P systems (2003) (339)
An Optimal Algorithm for Euclidean Shortest Paths in the Plane (1999) (326)
Detecting and resolving packet filter conflicts (2000) (294)
Winner determination in combinatorial auction generalizations (2002) (277)
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions (2001) (260)
Vickrey prices and shortest paths: what is an edge worth? (2001) (251)
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions (2005) (248)
Label placement by maximum independent set in rectangles (1998) (234)
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms (2006) (218)
Surface approximation and geometric partitions (1994) (199)
Selfish Load Balancing and Atomic Congestion Games (2004) (187)
A pedestrian approach to ray shooting: shoot a ray, take a walk (1995) (186)
Real-world environment models for mobile network evaluation (2005) (186)
Tracking Multiple Targets Using Binary Proximity Sensors (2007) (185)
Target tracking with binary proximity sensors (2009) (178)
Finding the k shortest simple paths (2007) (178)
Transitions in geometric minimum spanning trees (1992) (166)
BOB: Improved winner determination in combinatorial auctions and generalizations (2003) (163)
Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness (1997) (158)
Finding k Points with Minimum Diameter and Related Problems (1991) (156)
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations (2000) (156)
Designing Least-Cost Nonblocking Broadband Networks (1997) (156)
Space Decomposition Techniques for Fast Layer-4 Switching (1999) (148)
A linear time algorithm with minimum link paths inside a simple polygon (1986) (142)
A lower bound for multicast key distribution (2001) (130)
Fast algorithms for computing the largest empty rectangle (1987) (128)
Multiway range trees: scalable IP lookup with fast updates (2001) (121)
Worst-case optimal algorithms for constructing visibility polygons with holes (1986) (119)
Power aware routing for sensor databases (2004) (118)
Profile-Based Routing: A New Framework for MPLS Traffic Engineering (2001) (116)
Computing the intersection-depth of polyhedra (1993) (115)
Profile-based routing and traffic engineering (2003) (114)
On the Complexity of Time-Dependent Shortest Paths (2011) (110)
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. (2003) (109)
Applications of a semi-dynamic convex hull algorithm (1990) (109)
Approximately-strategyproof and tractable multi-unit auctions (2003) (108)
Finding tailored partitions (1989) (106)
Distributed Navigation Algorithms for Sensor Networks (2005) (98)
Silo, rainbow, and caching token: schemes for scalable, fault tolerant stream caching (2002) (97)
Detecting cuts in sensor networks (2005) (96)
Catching elephants with mice: Sparse sampling for monitoring sensor networks (2009) (88)
Finding minimal convex nested polygons (1985) (85)
Compressing Two-Dimensional Routing Tables (2003) (85)
Separation and approximation of polyhedral objects (1992) (84)
Curvature-Constrained Shortest Paths in a Convex Polygon (2002) (84)
On some link distance problems in a simple polygon (1990) (83)
On the difficulty of some shortest path problems (2003) (81)
Fast packet classification for two-dimensional conflict-free filters (2001) (81)
Computing the link center of a simple polygon (2011) (80)
Selecting distances in the plane (1990) (79)
Market Clearability (2001) (78)
A game-theoretic analysis of wireless access point selection by mobile users (2008) (78)
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (78)
Efficient computation of Euclidean shortest paths in the plane (1993) (77)
Fast firewall implementations for software and hardware-based routers (2001) (76)
Algorithmic issues in modeling motion (2002) (72)
Side constraints and non-price attributes in markets (2006) (72)
Range Counting over Multidimensional Data Streams (2004) (71)
Minimum link paths in polygons and related problems (1987) (71)
GAMPS: compressing multi sensor data by grouping and amplitude scaling (2009) (69)
Metric Embedding, Hyperbolic Space, and Social Networks (2014) (68)
Matrix searching with the shortest path metric (1993) (67)
Online Scheduling with Hard Deadlines (2000) (65)
Can visibility graphs Be represented compactly? (1993) (65)
Query-sensitive ray shooting (1994) (65)
Capturing an evader in polygonal environments with obstacles: The full visibility case (2012) (62)
Offline maintenance of planar configurations (1991) (58)
Routing bandwidth guaranteed paths with restoration in label switched networks (2005) (58)
Fast firewall implementations for software-based and hardware-based routers (2001) (56)
Analysis of a bounding box heuristic for object intersection (1999) (55)
Adaptive sampling for geometric problems over data streams (2004) (54)
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry (2007) (53)
Adaptive Spatial Partitioning for Multidimensional Data Streams (2004) (53)
Practical methods for approximating shortest paths on a convex polytope in R3 (1998) (51)
Morphing Simple Polygons (1994) (50)
Shortest Paths on Polyhedral Surfaces (1985) (50)
Stochastic minimum spanning trees in euclidean spaces (2011) (50)
Kinetic Connectivity for Unit Disks (2000) (49)
Space Efficient Streaming Algorithms for the Maximum Error Histogram (2007) (48)
Space complexity of hierarchical heavy hitters in multi-dimensional data streams (2005) (48)
On the Most Likely Convex Hull of Uncertain Points (2013) (46)
Approximate Isocontours and Spatial Summaries for Sensor Networks (2007) (45)
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (1990) (45)
Memory Efficient Minimum Substring Partitioning (2013) (44)
Contour Approximation in Sensor Networks (2006) (43)
Long non-crossing configurations in the plane (1993) (42)
Separation and approximation of polyhedral surfaces (1991) (42)
Closest pair and the post office problem for stochastic points (2011) (42)
Convex Hulls Under Uncertainty (2014) (42)
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks (2007) (42)
Computing euclidean maximum spanning trees (1988) (41)
Multiple-Target Tracking With Binary Proximity Sensors (2011) (39)
On Klee's measure problem for grounded boxes (2012) (38)
Analyzing bounding boxes for object intersection (1999) (38)
Fast matching algorithms for points on a polygon (1989) (37)
Transitions in geometric minimum spanning trees (extended abstract) (1991) (33)
Optimal link path queries in a simple polygon (1992) (33)
The Centroid of Points with Approximate Weights (1995) (32)
Uncoordinated Load Balancing and Congestion Games in P2P Systems (2004) (32)
Efficient Algorithms for k-Regret Minimizing Sets (2017) (31)
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions (2002) (30)
OPEN PROBLEMS IN DATA STREAMS AND RELATED TOPICS IITK WORKSHOP ON ALGORITHMS FOR DATA STREAMS ’06 (2007) (29)
Maintenance of geometric extrema ∈ (1991) (28)
Counting Targets with Mobile Sensors in an Unknown Environment (2007) (28)
The Steiner Minimal Tree problem in the λ-geometry plane (1996) (27)
A comparative evaluation of space priority strategies in ATM networks (1994) (26)
Efficiently Measuring Bandwidth at All Time Scales (2011) (26)
A near-optimal algorithm for shortest paths among curved obstacles in the plane (2013) (26)
Capture bounds for visibility-based pursuit evasion (2013) (25)
Solving combinatorial exchanges: optimality via a few partial bids (2004) (25)
Practical methods for approximating shortest paths on a convex polytope in R 3 (1995) (25)
Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?" (2002) (25)
Stabbing triangulations by lines in 3D (1995) (24)
Implicitly Searching Convolutions and Computing Depth of Collision (1990) (24)
Simple Robots in Polygonal Environments: A Hierarchy (2008) (24)
Optimal Clearing of Supply/Demand Curves (2002) (24)
Range addressable network: a P2P cache architecture for data ranges (2003) (23)
Range-Max Queries on Uncertain Data (2016) (22)
The all-geodesic furthest neighbor problem for simple polygons (1987) (22)
Target Counting under Minimal Sensing: Complexity and Approximations (2008) (22)
Quantiles on Streams (2009) (21)
Vickrey Pricing in Network Routing: Fast Payment Computation (2007) (21)
Hyperplane separability and convexity of probabilistic point sets (2016) (21)
Reconstructing visibility graphs with simple robots (2009) (20)
Noise-tolerant distribution-free learning of general geometric concepts (1996) (20)
Collision detection in aspect and scale bounded polyhedra (1998) (20)
Logarithmic-time link path queries in a simple polygon (1995) (20)
Kinetic connectivity of rectangles (1999) (19)
Computing Geodesic Furthest Neighbors in Simple Polygons (1989) (19)
Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order (2010) (19)
A Constant Bound for Geometric Permutations of Disjoint Unit Balls (2003) (19)
k-Capture in multiagent pursuit evasion, or the lion and the hyenas (2011) (18)
Dynamically computing the maxima of decomposable functions, with applications (1989) (18)
Conflict-Free Chromatic Art Gallery Coverage (2012) (17)
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (2016) (17)
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries (2014) (17)
Congestion Games, Load Balancing, and Price of Anarchy (2004) (17)
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (2018) (16)
Curvature-constrained shortest paths in a convex polygon (extended abstract) (1998) (16)
Block Crossings in Storyline Visualizations (2016) (15)
Fully Dynamic 2-Edge-Connectivity in Planar Graphs (1992) (15)
Geometric permutations of balls with bounded size disparity (2003) (15)
Rectangular Tiling in Multidimensional Arrays (2000) (15)
Simplified kinetic connectivity for rectangles and hypercubes (2001) (15)
Rectangular tiling in multi-dimensional arrays (1999) (15)
Summarizing spatial data streams using ClusterHulls (2006) (14)
Pursuit Evasion on Polyhedral Surfaces (2013) (14)
Packet filtering in high speed networks (1999) (14)
Convex Hulls and Related Problems in Data Streams (2008) (14)
Leap Forward Virtual Clock: An O(loglogN) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness (1996) (13)
Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles (2012) (13)
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching (2014) (13)
Morphing binary trees (1995) (12)
Geometric k Shortest Paths (2015) (12)
Noise-tolerant distribution-free learning of general geometric concepts (1998) (12)
Shape sensitive geometric permutations (2001) (12)
Binary space partitions for 3D subdivisions (2003) (11)
Computing external farthest neighbors for a simple polygon (2015) (11)
Efficient breakout routing in printed circuit boards (1997) (11)
Profiling over adaptive ranges (2006) (11)
Binary space partitions of orthogonal subdivisions (2004) (11)
On-line Scheduling with Hard Deadlines (Extended Abstract) (1997) (11)
Algorithms for minimum volume enclosing simplex in R3 (2000) (11)
Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI (2017) (10)
Improved Approximation Bounds for the Minimum Constraint Removal Problem (2020) (10)
Bandwidth-Constrained Allocation in Grid Computing (2003) (9)
Data Structures for Two-Edge Connectivity in Planar Graphs (1994) (9)
Packet filter management for layer 4 switching (1999) (9)
Complete Information Pursuit Evasion in Polygonal Environments (2011) (9)
The Union of Probabilistic Boxes: Maintaining the Volume (2011) (9)
Shortest Paths in the Plane with Obstacle Violations (2020) (9)
Fining k points with minimum spanning trees and related problems (1989) (8)
Attribute-based access to distributed data over P2P networks (2007) (8)
Bundled Crossings in Embedded Graphs (2016) (8)
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version) (1989) (7)
Angle Optimization in Target Tracking (2008) (7)
Computing Shortest Paths in the Plane with Removable Obstacles (2018) (7)
Dynamic Geometric Set Cover and Hitting Set (2020) (7)
Interval Subset Sum and Uniform-Price Auction Clearing (2005) (6)
Cluster Hull: A Technique for Summarizing Spatial Data Streams (2006) (6)
Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract) (1997) (6)
Detecting cuts in sensor networks (2008) (6)
Designing Minimum Cost Nonblocking Communication Networks (1996) (6)
Boundary Labeling with Obstacles (2016) (6)
Collision Detection Using Bounding Boxes: Convexity Helps (2000) (6)
Catching elephants with mice: sparse sampling for monitoring sensor networks (2007) (6)
Computing Klee’s Measure of Grounded Boxes (2015) (5)
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods (2013) (5)
Solving combinatorial exchanges: optimality via a few partial bids (2003) (5)
Computing the Longest Diagonal of a Simple Polygon (1990) (5)
A Discrete and Dynamic Version of Klee's Measure Problem (2011) (5)
Design of Nonblocking ATM Networks (1996) (4)
Separating bi-chromatic points by parallel lines (1990) (4)
On geometric matching (1989) (4)
Optimal Flow Aggregation (2000) (4)
Stochastic Minimum Spanning Trees and Related Problems (2011) (4)
Shape sensitive geometric complexity (2000) (3)
Market Clearing with Supply and Demand Curves (2002) (3)
A note on finding a strict saddlepoint (1991) (3)
Selfish Load Balancing and Atomic Congestion Games1 (3)
Chapter 7 A survey of computational geometry (1995) (3)
RCache: design and analysis of scalable fault-tolerant multimedia stream caching schemes (2001) (3)
K-Dominance in Multidimensional Data: Theory and Applications (2020) (3)
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version) (1988) (3)
Formulating and implementing profiling over adaptive ranges (2008) (3)
Finding a Shortest Diagonal of a Simple Polygon in Linear Time (1997) (3)
Simplified Planar Coresets for Data Streams (2008) (3)
Dynamic Geometric Set Cover, Revisited (2021) (3)
Multiagent Pursuit Evasion, or Playing Kabaddi (2010) (3)
Approximating Dominating Set on Intersection Graphs of L-frames (2018) (2)
A Simplified Reservation and State Setup Protocol (1998) (2)
Proceedings of the eighteenth annual symposium on Computational geometry (2002) (2)
Space decomposition for layer 4 switching (1999) (2)
A reeb graph approach to tractography (2015) (2)
Efficient data collection in sensor networks (2006) (2)
Separability and Convexity of Probabilistic Point Sets ∗ (2016) (2)
Memory Efficient De Bruijn Graph Construction (2012) (2)
Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2008) (2)
Containment and Evasion in Stochastic Point Data (2016) (2)
Most Likely Voronoi Diagrams in Higher Dimensions (2016) (2)
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane (2020) (2)
Simple robots with minimal sensing (2007) (1)
Geometric Approaches to Ad Hoc and Sensor Networks: Full Report of the 2006 NSF Workshop (2006) (1)
Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks (2006) (1)
On the Limitations of Combinatorial Visibilities (2009) (1)
Pursuit Evasion on Polyhedral Surfaces (2015) (1)
Fair Covering of Points by Balls (2020) (1)
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (1)
Robot kabaddi (2010) (1)
The Maximum Exposure Problem (2021) (1)
On Multi-Dimensional Team Formation (2019) (1)
Efficient Algorithms for Least Square Piecewise Polynomial Regression (2021) (1)
Shortest Paths in the Plane with Obstacle Violations (2020) (1)
Convex Hulls Under Uncertainty (2016) (1)
Compositional measures of diffusion anisotropy and asymmetry (2018) (1)
On the Complexity of Time-Dependent Shortest Paths (2012) (1)
Erratum to: Conflict-Free Chromatic Art Gallery Coverage (2013) (1)
A Survey of Computational Geometry (2014) (1)
Trackability with Imprecise Localization (2013) (1)
Approximation using LP Rounding (2018) (0)
A P P L I C a T I O N S O F a S E M I -d Y N a M I C (2014) (0)
Sek and S. Suri. Farthest Neighbors, Maximum Spanning Trees and Related Problems In (0)
Angle Optimization in Target Tracking; ; Technical Report; (2008) (0)
Approximate Isocontours andSpatial Summaries forSensorNetworks (2007) (0)
Anonymity-Preserving Space Partitions (2021) (0)
Eﬃcient Algorithms for Least Square Piecewise 1 Polynomial Regression 2 (2022) (0)
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles (2022) (0)
30 POLYGONS (2016) (0)
Guest Editor’s Foreword (2004) (0)
Geometry in Sensor Networks, 09.04. - 13.04.2007 (2007) (0)
Counting Convex k-gons in an Arrangement of Line Segments (2016) (0)
Simple and practical geometric algorithms (1996) (0)
Well-Separated Pair Decomposition (2012) (0)
Design of Nonblocking Atm Networks Design of Nonblocking Atm Networks (1996) (0)
An ETH-Tight Algorithm for Multi-Team Formation (2021) (0)
Session 1: Routing I (2006) (0)
Tradeoffs between Bends and Displacement in Anchored Graph Drawing (2015) (0)
A Space-bounded Learning of Classes with Vc-dim = 1 Proof: Combine Theorem 3 with Corollary 2. 5 Extensions (1997) (0)
Conflict-Free Chromatic Art Gallery Coverage (2013) (0)
Approximation algorithms for problems on networks and streams of data (2012) (0)
Untangling the Braid: Finding Outliers in a Set of Streams (2009) (0)
Epsilon Nets and VC Dimension (2019) (0)
Computational Learning Theory : PAC Model (2015) (0)
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space (2022) (0)
Editors' Foreword (1998) (0)
Link distance query problems in polygons (1991) (0)
Long non-crossing configurations in the plane ( Draft ) (2002) (0)
Equilibria and Selfish Behavior in Peer Matching (2003) (0)
Algorithms and Computation : 7th International Symposium, ISAAC '96 Osaka, Japan, December 16-18, 1996 Proceedings (1996) (0)
Locality Sensitive Hashing (2019) (0)
A Technique for Summarizing Spatial Data Streams (2006) (0)
Erratum to: Conflict-Free Chromatic Art Gallery Coverage (2013) (0)
CS 231 : Final Projects (2018) (0)
Eecient Breakout Routing in Printed Circuit Boards (2007) (0)
Proceedings of the Annual Symposium on Computational Geometry: Foreword (2002) (0)
07151 Abstracts Collection Geometry in Sensor Networks Dagstuhl Seminar (2007) (0)
Performance Comparison of OLSR and Fisheye in Mobile Wireless Sensor Networks (2011) (0)
Paradigms for Summarizing Data in Sensor Networks (2006) (0)
Adaptive Spatial Partitioning for Multidimensional Data Streams1 (0)
Algorithmic issues for resource management in internet-centric computing (2005) (0)
Geometric Computing over Uncertain Data (2012) (0)
Computing Klee’s Measure of Grounded Boxes (2013) (0)
November 29 , 2018 1 Optimization via Local Search (2018) (0)
Capturing an Evader in Polygonal Environments: A Complete Information Game (2011) (0)
Observability of Lattice Graphs (2015) (0)
07151 Abstracts Collection -- Geometry in Sensor Networks (2007) (0)
Approximately-Strategyproof and Tractable Multi-Unit Auctions The made this article openly available. Please share how this access benefits you. Your story matters (2019) (0)
Proceedings of the 7th International Symposium on Algorithms and Computation (1996) (0)
An ETH-tight Algorithm for Multi-Team 1 Formation 2 (2021) (0)
Observability of Lattice Graphs (2015) (0)
09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems (2009) (0)
Voronoi Diagrams (2021) (0)
Geometric synopses for multi-dimensional data streams (2006) (0)

This paper list is powered by the following services:

Other Resources About Subhash Suri

en.wikipedia.org

What Schools Are Affiliated With Subhash Suri?

Subhash Suri is affiliated with the following schools: