 | 2008 |
|---|
| 11 |       | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing.
Algorithmica 52(4): 487-501 (2008) |
| 2007 |
|---|
| 10 | | Kamalika Chaudhuri,
Anshul Kothari,
Rudi Pendavingh,
Ram Swaminathan,
Robert Endre Tarjan,
Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems.
Algorithmica 48(2): 129-146 (2007) |
| 2005 |
|---|
| 9 | | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Interval Subset Sum and Uniform-Price Auction Clearing.
COCOON 2005: 608-620 |
| 8 | | Kamalika Chaudhuri,
Anshul Kothari,
Rudi Pendavingh,
Ram Swaminathan,
Robert Endre Tarjan,
Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems.
COCOON 2005: 632-643 |
| 7 | | Anshul Kothari,
David C. Parkes,
Subhash Suri:
Approximately-strategyproof and tractable multiunit auctions.
Decision Support Systems 39(1): 105-121 (2005) |
| 2004 |
|---|
| 6 | | Anshul Kothari,
Tuomas Sandholm,
Subhash Suri:
Solving Combinatorial Exchanges: Optimality via a Few Partial Bids.
AAMAS 2004: 1418-1419 |
| 5 | | Anshul Kothari,
Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy.
CAAN 2004: 13-27 |
| 2003 |
|---|
| 4 | | Anshul Kothari,
David C. Parkes,
Subhash Suri:
Approximately-strategyproof and tractable multi-unit auctions.
ACM Conference on Electronic Commerce 2003: 166-175 |
| 3 | | Anshul Kothari,
Tuomas Sandholm,
Subhash Suri:
Solving combinatorial exchanges: optimality via a few partial bids.
ACM Conference on Electronic Commerce 2003: 236-237 |
| 2 | | Anshul Kothari,
Divyakant Agrawal,
Abhishek Gupta,
Subhash Suri:
Range Addressable Network: A P2P Cache Architecture for Data Ranges.
Peer-to-Peer Computing 2003: 14-22 |
| 1 | | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing.
WADS 2003: 67-78 |
