| 2025 | OPODIS | Byzantine-Tolerant Phase Clock. | Costas Busch, Pawel Garncarek, Dariusz R. Kowalski |
| 2025 | SSS | Near-Optimal Stability for Distributed Transaction Processing in Blockchain Sharding. | Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski |
| 2025 | SSS | A Poly-log Approximation for Transaction Scheduling in Fog-Cloud Computing and Beyond. | Ramesh Adhikari, Costas Busch, Pavan Poudel |
| 2024 | SPAA | Stable Blockchain Sharding under Adversarial Transaction Generation. | Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski |
| 2024 | SPAA | Sparse Spanners with Small Distance and Congestion Stretches. | Costas Busch, Dariusz R. Kowalski, Peter Robinson |
| 2024 | SIROCCO | Locally Balanced Allocations Under Strong Byzantine Influence. | Costas Busch, Pawel Garncarek, Dariusz R. Kowalski |
| 2023 | CIAC | Stable Scheduling in Transactional Memory. | Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel |
| 2023 | FOCS | One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. | Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman |
| 2023 | SIROCCO | Lockless Blockchain Sharding with Multiversion Control. | Ramesh Adhikari, Costas Busch |
| 2022 | SSS | Flexible Scheduling of Transactional Memory on Trees. | Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma |
| 2019 | DSN | Consistent BFT Performance for Blockchains. | Mohammad M. Jalalzai, Costas Busch, Golden G. Richard III |
| 2019 | ICBC | An Experimental Evaluation of BFT Protocols for Blockchains. | Mohammad M. Jalalzai, Golden G. Richard III, Costas Busch |
| 2018 | ICDCN | The Complete Visibility Problem for Fat Robots with Lights. | Gokarna Sharma, Rusul Alsaedi, Costas Busch, Supratik Mukhopadhyay |
| 2018 | ICRA | How to Make Fat Autonomous Robots See all Others Fast? | Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay |
| 2018 | SSS | Load Balanced Distributed Directories. | Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy |
| 2017 | SPAA | Fast Scheduling in Distributed Transactional Memory. | Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma |
| 2017 | SPAA | Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time. | Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay |
| 2016 | GLOBECOM | Novel Fast User-Placement Ushering Algorithms for Indoor Femtocell Networks. | Limeng Pu, Hsiao-Chun Wu, Chiapin Wang, Shih-Hau Fang, Supratik Mukhopadhyay, Costas Busch |
| 2016 | PDP | Transactional Memory Scheduling Using Machine Learning Techniques. | Basem Assiri, Costas Busch |
| 2016 | SSS | Complete Visibility for Robots with Lights in O(1) Time. | Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai |
| 2015 | Algosensors | Mutual Visibility with an Optimal Number of Colors. | Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay |
| 2015 | IROS | Tight analysis of a collisionless robot gathering algorithm. | Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay, Charles Malveaux |
| 2015 | PODC | Impossibility Results for Distributed Transactional Memory. | Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma |
| 2014 | DCOSS | Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks. | Gokarna Sharma, Costas Busch |
| 2013 | Algosensors | Optimal Nearest Neighbor Queries in Sensor Networks. | Gokarna Sharma, Costas Busch |
| 2013 | ICDCN | An Analysis Framework for Distributed Hierarchical Directories. | Gokarna Sharma, Costas Busch |
| 2012 | COCOON | Stretch in Bottleneck Games. | Costas Busch, Rajgopal Kannan |
| 2012 | EuroPar | Towards Load Balanced Distributed Transactional Memory. | Gokarna Sharma, Costas Busch |
| 2012 | FOCS | Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. | Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan |
| 2011 | WALCOM | Oblivious Buy-at-Bulk in Planar Graphs. | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
| 2010 | OPODIS | A Competitive Analysis for Balanced Transactional Memory Workloads. | Gokarna Sharma, Costas Busch |
| 2010 | Qshine | Optimal Oblivious Routing in Hole-Free Networks. | Costas Busch, Malik Magdon-Ismail |
| 2010 | SAGT | Bottleneck Congestion Games with Logarithmic Price of Anarchy. | Rajgopal Kannan, Costas Busch |
| 2009 | Algosensors | Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
| 2009 | PERCOM | Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel. | Rajgopal Kannan, Shuangqing Wei, Costas Busch, Athanasios V. Vasilakos |
| 2007 | PODC | Improved sparse covers for graphs excluding a fixed minor. | Costas Busch, Ryan LaFortune, Srikanta Tirthapura |
| 2007 | STACS | A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. | Costas Busch, Srikanta Tirthapura |
| 2006 | AAIM | Atomic Routing Games on Maximum Congestion. | Costas Busch, Malik Magdon-Ismail |
| 2006 | PODC | Sketching asynchronous streams over a sliding window. | Srikanta Tirthapura, Bojian Xu, Costas Busch |
| 2005 | EuroPar | Efficient Bufferless Routing on Leveled Networks. | Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail |
| 2005 | SPAA | Oblivious routing on geometric networks. | Costas Busch, Malik Magdon-Ismail, Jing Xi |
| 2004 | ESA | Direct Routing: Algorithms and Complexity. | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis |
| 2004 | EuroPar | Near-Optimal Hot-Potato Routing on Trees. | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer |
| 2004 | WAOA | Universal Bufferless Routing. | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas |
| 2003 | STACS | Cake-Cutting Is Not a Piece of Cake. | Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy |
| 2003 | SPAA | Analysis of link reversal routing algorithms for mobile ad hoc networks. | Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura |
| 2003 | SIROCCO | The Cost of Concurrent, Low-Contention Read-Modify-Write. | Costas Busch, Marios Mavronicolas, Paul G. Spirakis |
| 2002 | SPAA | (congestion + dilation) hot-potato routing on leveled networks. | Costas Busch |
| 2001 | SPAA | Routing without flow control. | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
| 2000 | EuroPar | A Combinatorial Characterization of Properties Preserved by Antitokens. | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
| 2000 | SODA | Randomized greedy hot-potato routing. | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
| 2000 | STOC | Hard-Potato routing. | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
| 1999 | STACS | Supporting Increment and Decrement Operations in Balancing Networks. | William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou |
| 1999 | SPAA | Sorting and Counting Networks of Small Depth and Arbitrary Width. | Costas Busch, Maurice Herlihy |
| 1999 | SIROCCO | Threshold Counters with Increments and Decrements. | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
| 1996 | PODC | The Strength of Counting Networks (Abstract). | Costas Busch, Marios Mavronicolas |
| 1995 | PODC | A Logarithmic Depth Counting Network (Abstract). | Costas Busch, Marios Mavronicolas |
| 1994 | PODC | Contention in Counting Networks. | Costas Busch, Nikos Hardavellas, Marios Mavronicolas |
| 1994 | PODC | A Combinatorial Treatment of Balancing Networks. | Costas Busch, Marios Mavronicolas |