PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kothari, Anshul"

Author of the publication

copydeleteadd this publication to your clipboard
Server Allocation Algorithms for Tiered Systems.

, , , , , and . Algorithmica, 48 (2): 129-146 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Kothari, Anshul
add a person with the name Kothari, Anshul
 

Other publications of authors with the same name

Interval Subset Sum and Uniform-Price Auction Clearing., , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 608-620. Springer, (2005)Bandwidth-Constrained Allocation in Grid Computing., , and . WADS, volume 2748 of Lecture Notes in Computer Science, page 67-78. Springer, (2003)Server Allocation Algorithms for Tiered Systems., , , , , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 632-643. Springer, (2005)Server Allocation Algorithms for Tiered Systems., , , , , and . Algorithmica, 48 (2): 129-146 (2007)Congestion Games, Load Balancing, and Price of Anarchy., , , and . CAAN, volume 3405 of Lecture Notes in Computer Science, page 13-27. Springer, (2004)Approximately-strategyproof and tractable multiunit auctions., , and . Decis. Support Syst., 39 (1): 105-121 (2005)Range Addressable Network: A P2P Cache Architecture for Data Ranges., , , and . Peer-to-Peer Computing, page 14-22. IEEE Computer Society, (2003)Bandwidth-Constrained Allocation in Grid Computing., , and . Algorithmica, 52 (4): 487-501 (2008)Approximately-strategyproof and tractable multi-unit auctions., , and . EC, page 166-175. ACM, (2003)Solving combinatorial exchanges: optimality via a few partial bids., , and . EC, page 236-237. ACM, (2003)