Costas Busch

Gokarna Sharma, Costas Busch: An Analysis Framework for Distributed Hierarchical Directories. ICDCN 2013: 378-392

Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads. Algorithmica 63(1-2): 296-322 (2012)

Gokarna Sharma, Costas Busch: Window-based greedy contention management for transactional memory: theory and practice. Distributed Computing 25(3): 225-248 (2012)

Srinivasagopalan Srivathsan, Costas Busch, S. S. Iyengar: An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs. IEEE Trans. Computers 61(5): 700-712 (2012)

Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos: Approximating Congestion + Dilation in Networks via "Quality of Routing" Games. IEEE Trans. Computers 61(9): 1270-1283 (2012)

Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan: An Efficient Transformation for the Klee's Measure Problem in the Streaming Model. CCCG 2012: 83-88

Costas Busch, Rajgopal Kannan: Stretch in Bottleneck Games. COCOON 2012: 592-603

Gokarna Sharma, Costas Busch: Towards Load Balanced Distributed Transactional Memory. Euro-Par 2012: 403-414

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan: Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS 2012: 81-90

Gokarna Sharma, Costas Busch, Srinivasagopalan Srivathsan: Distributed Transactional Memory for General Networks. IPDPS 2012: 1045-1056

Gokarna Sharma, Costas Busch: Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories. DISC 2012: 415-416

Costas Busch, Rajgopal Kannan, Alfred Samman: Bottleneck Routing Games on Grids. GAMENETS 2011: 294-307

Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos: Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games. GAMENETS 2011: 308-320

Gokarna Sharma, Costas Busch: On the Performance of Window-Based Contention Managers for Transactional Memory. IPDPS Workshops 2011: 559-568

Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Oblivious Buy-at-Bulk in Planar Graphs. WALCOM 2011: 33-44

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan: Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. CoRR abs/1111.4766 (2011)

Costas Busch, Marios Mavronicolas: An efficient counting network. Theor. Comput. Sci. 411(34-36): 3001-3030 (2010)

Costas Busch, Srikanta Tirthapura: Concurrent counting is harder than queuing. Theor. Comput. Sci. 411(43): 3823-3833 (2010)

Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads. OPODIS 2010: 348-363

Costas Busch, Malik Magdon-Ismail: Optimal Oblivious Routing in Hole-Free Networks. QSHINE 2010: 421-437

Rajgopal Kannan, Costas Busch: Bottleneck Congestion Games with Logarithmic Price of Anarchy. SAGT 2010: 222-233

Gokarna Sharma, Brett Estrade, Costas Busch: Window-Based Greedy Contention Management for Transactional Memory. DISC 2010: 64-78

Gokarna Sharma, Brett Estrade, Costas Busch: Window-Based Greedy Contention Management for Transactional Memory. CoRR abs/1002.4182 (2010)

Rajgopal Kannan, Costas Busch: Bottleneck Routing Games with Low Price of Anarchy. CoRR abs/1003.4307 (2010)

Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems. CoRR abs/1004.0351 (2010)

Gokarna Sharma, Costas Busch, Srikanta Tirthapura: A Streaming Approximation Algorithm for Klee's Measure Problem. CoRR abs/1004.1569 (2010)

Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads. CoRR abs/1009.0056 (2010)

Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Oblivious Buy-at-Bulk in Planar Graphs. CoRR abs/1010.0401 (2010)

Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos: Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy. CoRR abs/1010.4812 (2010)

Costas Busch, Malik Magdon-Ismail: Atomic routing games on maximum congestion. Theor. Comput. Sci. 410(36): 3337-3347 (2009)

Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. ALGOSENSORS 2009: 151-152

Rajgopal Kannan, Shuangqing Wei, Costas Busch, Athanasios V. Vasilakos: Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel. PerCom Workshops 2009: 1-6

Rajgopal Kannan, Costas Busch: The Impact of Exponential Utility Costs in Bottleneck Routing Games. CoRR abs/0911.4150 (2009)

Bojian Xu, Srikanta Tirthapura, Costas Busch: Sketching asynchronous data streams over sliding windows. Distributed Computing 20(5): 359-374 (2008)

Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener: Contention-free MAC protocols for asynchronous wireless sensor networks. Distributed Computing 21(1): 23-42 (2008)

Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IEEE Trans. Computers 57(5): 660-671 (2008)

Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos: Quality of routing congestion games in wireless sensor networks. WICON 2008: 71

Costas Busch: Direct Routing Algorithms. Encyclopedia of Algorithms 2008

Costas Busch, Rajgopal Kannan: Bicretieria Optimization in Routing Games. CoRR abs/0801.4851 (2008)

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distrib. Comput. 67(11): 1168-1186 (2007)

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007)

Costas Busch, Ryan LaFortune, Srikanta Tirthapura: Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70

Costas Busch, Srikanta Tirthapura: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. STACS 2007: 465-476

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006)

James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer: Eight Open Problems in Distributed Computing. Bulletin of the EATCS 90: 109-126 (2006)

Costas Busch, Malik Magdon-Ismail: Atomic Routing Games on Maximum Congestion. AAIM 2006: 79-91

Srikanta Tirthapura, Costas Busch: Concurrent counting is harder than queuing. IPDPS 2006

Srikanta Tirthapura, Bojian Xu, Costas Busch: Sketching asynchronous streams over a sliding window. PODC 2006: 82-91

Costas Busch, Marios Mavronicolas, Paul G. Spirakis: An Application of the Monotone Linearizability Lemma. Bulletin of the EATCS 85: 70-80 (2005)

Costas Busch, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail: Hardness Results for Cake Cutting. Bulletin of the EATCS 86: 85-106 (2005)

Costas Busch, Srikanta Tirthapura: Analysis of Link Reversal Routing Algorithms. SIAM J. Comput. 35(2): 305-326 (2005)

Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005)

Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail: Efficient Bufferless Routing on Leveled Networks. Euro-Par 2005: 931-940

Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IPDPS 2005

Costas Busch, Malik Magdon-Ismail, Jing Xi: Oblivious routing on geometric networks. SPAA 2005: 316-324

Costas Busch: Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. Theory Comput. Syst. 37(3): 371-396 (2004)

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. ESA 2004: 134-145

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer: Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Routing. WAOA 2004: 239-252

Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener: Contention-Free MAC Protocols for Wireless Sensor Networks. DISC 2004: 245-259

Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72

Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura: Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219

Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy: Cake-Cutting Is Not a Piece of Cake. STACS 2003: 596-607

Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002)

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002)

Costas Busch: Õ(congestion + dilation) hot-potato routing on leveled networks. SPAA 2002: 20-29

Costas Busch, Maurice Herlihy, Roger Wattenhofer: Routing without flow control. SPAA 2001: 11-20

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. Chicago J. Theor. Comput. Sci. 2000 (2000)

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the EATCS 71: 114-132 (2000)

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582

Costas Busch, Maurice Herlihy, Roger Wattenhofer: Randomized greedy hot-potato routing. SODA 2000: 458-466

Costas Busch, Maurice Herlihy, Roger Wattenhofer: Hard-Potato routing. STOC 2000: 278-285

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61

Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403

Costas Busch, Marios Mavronicolas: An Efficient Counting Network. IPPS/SPDP 1998: 380-384

Costas Busch, Maurice Herlihy: A Survey on Counting Networks. WDAS 1998: 13-20

Costas Busch, Marios Mavronicolas: Impossibility Results for Weak Threshold Networks. Inf. Process. Lett. 63(2): 85-90 (1997)

Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. J. ACM 43(5): 794-839 (1996)

Costas Busch, Marios Mavronicolas: The Strength of Counting Networks (Abstract). PODC 1996: 311

Costas Busch, Marios Mavronicolas: A Logarithmic Depth Counting Network (Abstract). PODC 1995: 274

Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. PODC 1994: 206-215

Costas Busch, Nikos Hardavellas, Marios Mavronicolas: Contention in Counting Networks. PODC 1994: 404