S. Suri

Publications
Influence

eBay in the Sky: strategy-proof wireless spectrum auctions

X. Zhou, S. Gandhi, S. Suri, H. Zheng
Computer Science
MobiCom '08
14 September 2008

We propose VERITAS, a truthful and computationally-efficient spectrum auction to support an eBay-like dynamic spectrum market. Expand

Fast and scalable layer four switching

Venkatachary Srinivasan, G. Varghese, S. Suri, M. Waldvogel
Computer Science
SIGCOMM '98
1 October 1998

In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Expand

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

J. Hershberger, S. Suri
Mathematics, Computer Science
SIAM J. Comput.
1 August 1999

We propose an optimal-time algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Expand

Medians and beyond: new aggregation techniques for sensor networks

Nisheeth Shrivastava, C. Buragohain, D. Agrawal, S. Suri
Computer Science
SenSys
16 August 2004

We propose a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks and demonstrate its accuracy, scalability and low resource utilization. Expand

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

T. Sandholm, S. Suri, A. Gilpin, D. Levine
Mathematics, Computer Science
Manag. Sci.
1 March 2005

Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is inapproximable. Expand

Detecting and resolving packet filter conflicts

H. Adiseshu, S. Suri, Guru M. Parulkar
Computer Science
Proceedings IEEE INFOCOM . Conference on Computer…
26 March 2000

This paper describes the problem and presents innovative solutions based on a geometric transformation of the problem. Expand

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions

T. Sandholm, S. Suri, A. Gilpin, D. Levine
Mathematics, Computer Science
IJCAI
4 August 2001

Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete. Expand

Label placement by maximum independent set in rectangles

P. Agarwal, M. V. Kreveld, S. Suri
Computer Science, Mathematics
CCCG
1 December 1998

We investigate the problem of computing a large non-intersecting subset in a set of n arbitrary axis-parallel rectangles in the plane. Expand

Vickrey prices and shortest paths: what is an edge worth?

J. Hershberger, S. Suri
Computer Science
Proceedings IEEE International Conference on…
14 October 2001

We solve a shortest path problem that is motivated by recent interest in pricing networks or other computational resources, which in turn is prompted by the prominent role the Internet has come to play in our lives. Expand

Power aware routing for sensor databases

C. Buragohain, D. Agrawal, S. Suri
Computer Science
Proceedings IEEE 24th Annual Joint Conference of…
29 December 2004

In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. Expand

Recommended Authors