|
This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl. |  |
?>
?>
Firstname: | Costas |
Surname: | Busch |
Email: | busch@csc.lsu.edu |
Institute: | |
Homepage: | |
Is RU1 member: | NO |
|
|
|
[RACTI-RU1-2013-42] Kannan, Rajgopal, Busch, Costas and Spirakis, Paul, The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs, in: CoRR, 2013. |
|
|
[RACTI-RU1-2006-77] Busch, Costas, Magdon-Ismail, Malik, Mavronicolas, Marios and Spirakis, Paul, Direct Routing: Algorithms and Complexity, in: Algorithmica, volume 45, number 1, pages 45-68, 2006. [DOI] |
|
|
[RACTI-RU1-2005-48] Busch, Costas, Mavronicolas, Marios and Spirakis, Paul, The cost of concurrent, low-contention Read&Modify&Write, in: Theoretical Computer Science (TCS), volume 333, number 3, pages 373-400, ISSN 0304-3975, 2005. [DOI] |
|
[RACTI-RU1-2005-44] Busch, Costas, Mavronicolas, Marios and Spirakis, Paul, An Application of the Monotone Linearizability Lemma, in: Bulletin of the EATCS, volume 85, pages 70-80, 2005. |
|
|
[RACTI-RU1-2004-8] Busch, Costas, Magdon-Ismail, Malik, Mavronicolas, Marios and Spirakis, Paul, Direct Routing: Algorithms and Complexity, in: ESA 2004, pages 134-145, 2004. |
|
|
[RACTI-RU1-2003-16] Busch, Costas, Mavronicolas, Marios and Spirakis, Paul, The Cost of Concurrent, Low-Contention Read-Modify-Write, in: Colloquium on Structural Information and Communication Complexity, pages 57-72, 2003. |
|
|
|