Proving Correctness for Balancing Networks. - Costas Busch; Marios Mavronicolas (Parallel Processing of Discrete Optimization Problems, 1994)

Contention in Counting Networks. - Costas Busch; Nikos Hardavellas; Marios Mavronicolas (PODC, 1994)

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

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

A Combinatorial Treatment of Balancing Networks. - Costas Busch; Marios Mavronicolas (J. ACM, 1996)

Impossibility Results for Weak Threshold Networks. - Costas Busch; Marios Mavronicolas (Inf. Process. Lett., 1997)

A Survey on Counting Networks. - Costas Busch; Maurice Herlihy (WDAS, 1998)

Sorting and Counting Networks of Small Depth and Arbitrary Width. - Costas Busch; Maurice Herlihy (SPAA, 1999)

Randomized greedy hot-potato routing. - Costas Busch; Maurice Herlihy; Roger Wattenhofer (SODA, 2000)

Hard-Potato routing. - Costas Busch; Maurice Herlihy; Roger Wattenhofer (STOC, 2000)

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

A Combinatorial Characterization of Properties Preserved by Antitokens. - Costas Busch; Neophytos Demetriou; Maurice Herlihy; Marios Mavronicolas (Bull. EATCS, 2000)

A Study on Distributed Structures. - Costas Busch (2000)

Routing without flow control. - Costas Busch; Maurice Herlihy; Roger Wattenhofer (SPAA, 2001)

Sorting and Counting Networks of Arbitrary Width and Small Depth. - Costas Busch; Maurice Herlihy (Theory Comput. Syst., 2002)

Threshold counters with increments and decrements. - Costas Busch; Neophytos Demetriou; Maurice Herlihy; Marios Mavronicolas (Theor. Comput. Sci., 2002)

Analysis of link reversal routing algorithms for mobile ad hoc networks. - Costas Busch; Srikanth Surapaneni; Srikanta Tirthapura (SPAA, 2003)

Cake-Cutting Is Not a Piece of Cake. - Malik Magdon-Ismail; Costas Busch; Mukkai S. Krishnamoorthy (STACS, 2003)

Near-Optimal Hot-Potato Routing on Trees. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas; Roger Wattenhofer (Euro-Par, 2004)

Universal Bufferless Routing. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (WAOA, 2004)

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

Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. - Costas Busch (Theory Comput. Syst., 2004)

Efficient Bufferless Routing on Leveled Networks. - Costas Busch; Shailesh Kelkar; Malik Magdon-Ismail (Euro-Par, 2005)

Oblivious routing on geometric networks. - Costas Busch; Malik Magdon-Ismail; Jing Xi (SPAA, 2005)

Hardness Results for Cake Cutting. - Costas Busch; Mukkai S. Krishnamoorthy; Malik Magdon-Ismail (Bull. EATCS, 2005)

An Application of the Monotone Linearizability Lemma. - Costas Busch; Marios Mavronicolas; Paul G. Spirakis (Bull. EATCS, 2005)

Analysis of Link Reversal Routing Algorithms. - Costas Busch; Srikanta Tirthapura (SIAM J. Comput., 2005)

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

Sketching asynchronous streams over a sliding window. - Srikanta Tirthapura; Bojian Xu; Costas Busch (PODC, 2006)

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

Eight Open Problems in Distributed Computing. - James Aspnes; Costas Busch; Shlomi Dolev; Panagiota Fatourou; Chryssis Georgiou; Alexander A. Shvartsman; Paul G. Spirakis; Roger Wattenhofer (Bull. EATCS, 2006)

Improved sparse covers for graphs excluding a fixed minor. - Costas Busch; Ryan LaFortune; Srikanta Tirthapura (PODC, 2007)

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. - Costas Busch; Srikanta Tirthapura (STACS, 2007)

Efficient bufferless packet switching on trees and leveled networks. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (J. Parallel Distributed Comput., 2007)

Universal Bufferless Packet Switching. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (SIAM J. Comput., 2007)

Quality of routing congestion games in wireless sensor networks. - Costas Busch; Rajgopal Kannan; Athanasios V. Vasilakos (WICON, 2008)

Bicretieria Optimization in Routing Games - Costas Busch; Rajgopal Kannan (CoRR, 2008)

Contention-free MAC protocols for asynchronous wireless sensor networks. - Costas Busch; Malik Magdon-Ismail; Fikret Sivrikaya; Bülent Yener (Distributed Comput., 2008)

Sketching asynchronous data streams over sliding windows. - Bojian Xu; Srikanta Tirthapura; Costas Busch (Distributed Comput., 2008)

Optimal Oblivious Path Selection on the Mesh. - Costas Busch; Malik Magdon-Ismail; Jing Xi (IEEE Trans. Computers, 2008)

Direct Routing Algorithms. - Costas Busch (Encyclopedia of Algorithms, 2008)

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

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

The Impact of Exponential Utility Costs in Bottleneck Routing Games - Rajgopal Kannan; Costas Busch (CoRR, 2009)

Atomic routing games on maximum congestion. - Costas Busch; Malik Magdon-Ismail (Theor. Comput. Sci., 2009)

Optimal Oblivious Routing in Hole-Free Networks. - Costas Busch; Malik Magdon-Ismail (QSHINE, 2010)

Bottleneck Congestion Games with Logarithmic Price of Anarchy. - Rajgopal Kannan; Costas Busch (SAGT, 2010)

Window-Based Greedy Contention Management for Transactional Memory. - Gokarna Sharma; Brett Estrade; Costas Busch (DISC, 2010)

Bottleneck Routing Games with Low Price of Anarchy - Rajgopal Kannan; Costas Busch (CoRR, 2010)

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

Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy - Rajgopal Kannan; Costas Busch; Athanasios V. Vasilakos (CoRR, 2010)

An efficient counting network. - Costas Busch; Marios Mavronicolas (Theor. Comput. Sci., 2010)

Concurrent counting is harder than queuing. - Costas Busch; Srikanta Tirthapura (Theor. Comput. Sci., 2010)

Bottleneck Routing Games on Grids. - Costas Busch; Rajgopal Kannan; Alfred Samman (GAMENETS, 2011)

Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games. - Rajgopal Kannan; Costas Busch; Athanasios V. Vasilakos (GAMENETS, 2011)

On the Performance of Window-Based Contention Managers for Transactional Memory. - Gokarna Sharma; Costas Busch (IPDPS Workshops, 2011)

Oblivious Buy-at-Bulk in Planar Graphs. - Srinivasagopalan Srivathsan; Costas Busch; S. Sitharama Iyengar (WALCOM, 2011)

Oblivious Routing for Sensor Network Topologies. - Costas Busch; Malik Magdon-Ismail; Jing Xi (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

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

Stretch in Bottleneck Games. - Costas Busch; Rajgopal Kannan (COCOON, 2012)

Towards Load Balanced Distributed Transactional Memory. - Gokarna Sharma; Costas Busch (Euro-Par, 2012)

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

Distributed Transactional Memory for General Networks. - Gokarna Sharma; Costas Busch; Srinivasagopalan Srivathsan (IPDPS, 2012)

Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories. - Gokarna Sharma; Costas Busch (DISC, 2012)

A Competitive Analysis for Balanced Transactional Memory Workloads. - Gokarna Sharma; Costas Busch (Algorithmica, 2012)

Window-based greedy contention management for transactional memory: theory and practice. - Gokarna Sharma; Costas Busch (Distributed Comput., 2012)

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

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

The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs. - Rajgopal Kannan; Costas Busch; Paul G. Spirakis (CoRR, 2013)

A Note on Online Steiner Tree Problems. - Gokarna Sharma; Costas Busch (CCCG, 2014)

Work-Efficient Load Balancing. - Gokarna Sharma; Suresh Rai; Costas Busch; Jerry L. Trahan; Ramachandran Vaidyanathan (ICPP Workshops, 2014)

Concurrent, parallel garbage collection in linear time. - Steven R. Brandt; Hari Krishnan; Gokarna Sharma; Costas Busch (ISMM, 2014)

Scheduling Multiple Objects in Distributed Transactional Memory. - Costas Busch; Maurice Herlihy; Miroslav Popovic; Gokarna Sharma (DISC, 2014)

Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. - Costas Busch; Ryan LaFortune; Srikanta Tirthapura (Algorithmica, 2014)

Distributed transactional memory for general networks. - Gokarna Sharma; Costas Busch (Distributed Comput., 2014)

Transactional memory: models and algorithms. - Gokarna Sharma; Costas Busch (SIGACT News, 2014)

Mutual Visibility with an Optimal Number of Colors. - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay (ALGOSENSORS, 2015)

Bounds on Mutual Visibility Algorithms. - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay (CCCG, 2015)

Logarithmic-Time Complete Visibility for Robots with Lights. - Ramachandran Vaidyanathan; Costas Busch; Jerry L. Trahan; Gokarna Sharma; Suresh Rai (IPDPS, 2015)

Impossibility Results for Distributed Transactional Memory. - Costas Busch; Maurice Herlihy; Miroslav Popovic; Gokarna Sharma (PODC, 2015)

An Analysis Framework for Distributed Hierarchical Directories. - Gokarna Sharma; Costas Busch (Algorithmica, 2015)

Efficient transformations for Klee's measure problem in the streaming model. - Gokarna Sharma; Costas Busch; Ramachandran Vaidyanathan; Suresh Rai; Jerry L. Trahan (Comput. Geom., 2015)

Near-Optimal Location Tracking Using Sensor Networks. - Gokarna Sharma; Hari Krishnan; Costas Busch; Steven R. Brandt (Int. J. Netw. Comput., 2015)

A load balanced directory for distributed shared memory objects. - Gokarna Sharma; Costas Busch (J. Parallel Distributed Comput., 2015)

Distributed Queuing in Dynamic Networks. - Gokarna Sharma; Costas Busch (Parallel Process. Lett., 2015)

Optimal nearest neighbor queries in sensor networks. - Gokarna Sharma; Costas Busch (Theor. Comput. Sci., 2015)

Novel Fast User-Placement Ushering Algorithms for Indoor Femtocell Networks. - Limeng Pu; Hsiao-Chun Wu; Chiapin Wang; Shih-Hau Fang; Supratik Mukhopadhyay; Costas Busch (GLOBECOM, 2016)

Approximately Opaque Multi-version Permissive Transactional Memory. - Basem Assiri; Costas Busch (ICPP Workshops, 2016)

Transactional Memory Scheduling Using Machine Learning Techniques. - Basem Assiri; Costas Busch (PDP, 2016)

Complete Visibility for Robots with Lights in O(1) Time. - Gokarna Sharma; Ramachandran Vaidyanathan; Jerry L. Trahan; Costas Busch; Suresh Rai (SSS, 2016)

Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks. - Gokarna Sharma; Costas Busch (ACM Trans. Sens. Networks, 2016)

Direct Routing Algorithms. - Costas Busch (Encyclopedia of Algorithms, 2016)

Approximate Count and Queue Objects in Transactional Memory. - Basem Assiri; Costas Busch (IPDPS Workshops, 2017)

O(log N)-Time Complete Visibility for Asynchronous Robots with Lights. - Gokarna Sharma; Ramachandran Vaidyanathan; Jerry L. Trahan; Costas Busch; Suresh Rai (IPDPS, 2017)

Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time. - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay (SPAA, 2017)

The Bursty Steiner Tree Problem. - Gokarna Sharma; Costas Busch (Int. J. Found. Comput. Sci., 2017)

Tight Analysis of a Collisionless Robot Gathering Algorithm. - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay; Charles Malveaux (ACM Trans. Auton. Adapt. Syst., 2017)

The Complete Visibility Problem for Fat Robots with Lights. - Gokarna Sharma; Rusul Alsaedi; Costas Busch; Supratik Mukhopadhyay (ICDCN, 2018)

How to Make Fat Autonomous Robots See all Others Fast? - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay (ICRA, 2018)

Window Based BFT Blockchain Consensus. - Mohammad M. Jalalzai; Costas Busch (iThings/GreenCom/CPSCom/SmartData, 2018)

Distributed garbage collection for general graphs. - Steven R. Brandt; Hari Krishnan; Costas Busch; Gokarna Sharma (ISMM, 2018)

Complete Visibility for Oblivious Robots in 풪(N) Time. - Gokarna Sharma; Costas Busch; Supratik Mukhopadhyay (NETYS, 2018)

Polynomial Time Equilibria in Bottleneck Congestion Games. - Costas Busch; Rajgopal Kannan (EC, 2018)

Time-communication impossibility results for distributed transactional memory. - Costas Busch; Maurice Herlihy; Miroslav Popovic; Gokarna Sharma (Distributed Comput., 2018)

Approximate Consistency in Transactional Memory. - Basem Assiri; Costas Busch (Int. J. Netw. Comput., 2018)

Proteus: A Scalable BFT Consensus Protocol for Blockchains. - Mohammad M. Jalalzai; Costas Busch; Golden G. Richard III (Blockchain, 2019)

Consistent BFT Performance for Blockchains. - Mohammad M. Jalalzai; Costas Busch; Golden G. Richard III (DSN (Supplements), 2019)

An Experimental Evaluation of BFT Protocols for Blockchains. - Mohammad M. Jalalzai; Golden G. Richard III; Costas Busch (ICBC, 2019)

CUDA-DTM: Distributed Transactional Memory for GPU Clusters. - Samuel Irving; Sui Chen; Lu Peng 001; Costas Busch; Maurice Herlihy; Christopher J. Michael 001 (NETYS, 2019)

Balanced Parallel Exploration of Orthogonal Regions. - Wyatt Clements; Costas Busch; Limeng Pu; Daniel Smith; Hsiao-Chun Wu (Algorithms, 2019)

Proteus: A Scalable BFT Consesus Protocol for Blockchains. - Mohammad M. Jalalzai; Costas Busch; Golden G. Richard III (CoRR, 2019)

3D LiDAR and Color Camera Data Fusion. - Yuqi Ding; Jiaming Liu; Jinwei Ye; Weidong Xiang; Hsiao-Chun Wu; Costas Busch (BMSB, 2020)

Innovative Audio Mosaic Technique by Permutations. - Elaine Y.-N. Sun; Hsiao-Chun Wu; Costas Busch; Scott C.-H. Huang; Yen-Cheng Kuan; Jonathan Wu (BMSB, 2020)

Graph representation of random signal and its application for sparse signal detection. - Kun Yan; Hsiao-Chun Wu; Costas Busch; Xiangli Zhang (Digit. Signal Process., 2020)

Novel Fast User-Placement Ushering Algorithms and Performance Analysis for LTE Femtocell Networks. - Limeng Pu; Hsiao-Chun Wu; Chiapin Wang; Shih-Hau Fang; Supratik Mukhopadhyay; Costas Busch (IEEE Trans. Cogn. Commun. Netw., 2020)

Wireless Sensor or Access-Point Deployment Using Coverage-Area Maximization over Visibility Graph. - Venkata Gadiraju; Hsiao-Chun Wu; Costas Busch; Prasanga Neupane; Shih Yu Chang (BMSB, 2021)

Scheduling Problems in Distributed Transactional Memory. - Costas Busch (ECBS, 2021)

BifurKTM: Approximately Consistent Distributed Transactional Memory for GPUs. - Samuel Irving; Lu Peng 001; Costas Busch; Jih-Kwon Peir (PARMA-DITAM@HiPEAC, 2021)

Byzantine-Resilient Population Protocols. - Costas Busch; Dariusz R. Kowalski (CoRR, 2021)

Fast Scheduling in Distributed Transactional Memory. - Costas Busch; Maurice Herlihy; Miroslav Popovic; Gokarna Sharma (Theory Comput. Syst., 2021)

Efficient Recoverable Cryptographic Mosaic Technique by Permutations. - Elaine Y.-N. Sun; Hsiao-Chun Wu; Costas Busch; Scott C.-H. Huang; Yen-Cheng Kuan; Shih Yu Chang (IEEE Trans. Circuits Syst. Video Technol., 2021)

The Paintbrush Coverage Problem. - Scott C.-H. Huang; Elaine Y.-N. Sun; Hsiao-Chun Wu; Costas Busch (IEEE Trans. Mob. Comput., 2021)

Novel Sensor/Access-Point Coverage-Area Maximization for Arbitrary Indoor Polygonal Geometries. - Venkata Gadiraju; Hsiao-Chun Wu; Costas Busch; Prasanga Neupane; Shih Yu Chang; Scott C.-H. Huang (IEEE Wirel. Commun. Lett., 2021)

Dynamic scheduling in distributed transactional memory. - Costas Busch; Maurice Herlihy; Miroslav Popovic; Gokarna Sharma (Distributed Comput., 2022)

Load balanced distributed directories. - Shishir Rai; Gokarna Sharma; Costas Busch; Maurice Herlihy (Inf. Comput., 2022)

The Hermes BFT for Blockchains. - Mohammad M. Jalalzai; Chen Feng 001; Costas Busch; Golden G. Richard III; Jianyu Niu (IEEE Trans. Dependable Secur. Comput., 2022)

Stable Scheduling in Transactional Memory. - Costas Busch; Bogdan S. Chlebus; Dariusz R. Kowalski; Pavan Poudel (CIAC, 2023)

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 (FOCS, 2023)

Lockless Blockchain Sharding with Multiversion Control. - Ramesh Adhikari; Costas Busch (SIROCCO, 2023)

Flexible scheduling of transactional memory on trees. - Costas Busch; Bogdan S. Chlebus; Maurice Herlihy; Miroslav Popovic; Pavan Poudel; Gokarna Sharma (Theor. Comput. Sci., 2023)

Fault-Tolerant Distributed Directories. - Judith Beestermöller; Costas Busch; Roger Wattenhofer (SAND, 2024)

Locally Balanced Allocations Under Strong Byzantine Influence. - Costas Busch; Pawel Garncarek; Dariusz R. Kowalski (SIROCCO, 2024)

Stable Blockchain Sharding under Adversarial Transaction Generation. - Ramesh Adhikari; Costas Busch; Dariusz R. Kowalski (SPAA, 2024)

Sparse Spanners with Small Distance and Congestion Stretches. - Costas Busch; Dariusz R. Kowalski; Peter Robinson 002 (SPAA, 2024)

Fast Transaction Scheduling in Blockchain Sharding. - Ramesh Adhikari; Costas Busch; Miroslav Popovic (CoRR, 2024)

Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas. - Venkata Gadiraju; Hsiao-Chun Wu; Hao-Yu Tsai; Scott C.-H. Huang; Costas Busch; Prasanga Neupane; Guannan Liu; Shih Yu Chang (IEEE Trans. Commun., 2024)