default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCostas Busch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Venkata Gadiraju, Hsiao-Chun Wu
, Hao-Yu Tsai, Scott C.-H. Huang, Costas Busch, Prasanga Neupane, Guannan Liu, Shih Yu Chang:
Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas. IEEE Trans. Commun. 72(9): 5924-5940 (2024)- [c94]Judith Beestermöller, Costas Busch, Roger Wattenhofer:
Fault-Tolerant Distributed Directories. SAND 2024: 5:1-5:20 - [c93]Costas Busch, Pawel Garncarek, Dariusz R. Kowalski:
Locally Balanced Allocations Under Strong Byzantine Influence. SIROCCO 2024: 262-280 - [c92]Costas Busch, Dariusz R. Kowalski, Peter Robinson:
Sparse Spanners with Small Distance and Congestion Stretches. SPAA 2024: 383-393 - [c91]Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski:
Stable Blockchain Sharding under Adversarial Transaction Generation. SPAA 2024: 451-461 - [i20]Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski:
Stable Blockchain Sharding under Adversarial Transaction Generation. CoRR abs/2404.04438 (2024) - [i19]Ramesh Adhikari, Costas Busch, Miroslav Popovic:
Fast Transaction Scheduling in Blockchain Sharding. CoRR abs/2405.15015 (2024) - 2023
- [j50]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible scheduling of transactional memory on trees. Theor. Comput. Sci. 978: 114184 (2023) - [c90]Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CIAC 2023: 172-186 - [c89]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. FOCS 2023: 60-76 - [c88]Ramesh Adhikari, Costas Busch:
Lockless Blockchain Sharding with Multiversion Control. SIROCCO 2023: 112-131 - [i18]Ramesh Adhikari, Costas Busch:
Lockless Blockchain Sharding with Multiversion Control. CoRR abs/2303.17105 (2023) - [i17]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. CoRR abs/2308.01199 (2023) - 2022
- [j49]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Dynamic scheduling in distributed transactional memory. Distributed Comput. 35(1): 19-36 (2022) - [j48]Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy:
Load balanced distributed directories. Inf. Comput. 285(Part): 104700 (2022) - [j47]Mohammad M. Jalalzai, Chen Feng, Costas Busch, Golden G. Richard III, Jianyu Niu:
The Hermes BFT for Blockchains. IEEE Trans. Dependable Secur. Comput. 19(6): 3971-3986 (2022) - [c87]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible Scheduling of Transactional Memory on Trees. SSS 2022: 146-163 - [i16]Judith Beestermöller, Costas Busch, Roger Wattenhofer:
Fault-Tolerant Distributed Directories. CoRR abs/2207.09940 (2022) - [i15]Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CoRR abs/2208.07359 (2022) - 2021
- [j46]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. Theory Comput. Syst. 65(2): 296-322 (2021) - [j45]Elaine Y.-N. Sun, Hsiao-Chun Wu, Costas Busch, Scott C.-H. Huang, Yen-Cheng Kuan, Shih Yu Chang:
Efficient Recoverable Cryptographic Mosaic Technique by Permutations. IEEE Trans. Circuits Syst. Video Technol. 31(1): 112-125 (2021) - [j44]Scott C.-H. Huang, Elaine Y.-N. Sun, Hsiao-Chun Wu, Costas Busch:
The Paintbrush Coverage Problem. IEEE Trans. Mob. Comput. 20(11): 3239-3250 (2021) - [j43]Venkata Gadiraju, Hsiao-Chun Wu, Costas Busch, Prasanga Neupane, Shih Yu Chang, Scott C.-H. Huang:
Novel Sensor/Access-Point Coverage-Area Maximization for Arbitrary Indoor Polygonal Geometries. IEEE Wirel. Commun. Lett. 10(12): 2767-2771 (2021) - [c86]Venkata Gadiraju, Hsiao-Chun Wu, Costas Busch, Prasanga Neupane, Shih Yu Chang:
Wireless Sensor or Access-Point Deployment Using Coverage-Area Maximization over Visibility Graph. BMSB 2021: 1-7 - [c85]Costas Busch:
Scheduling Problems in Distributed Transactional Memory. ECBS 2021: 2:1-2:2 - [c84]Samuel Irving, Lu Peng, Costas Busch, Jih-Kwon Peir:
BifurKTM: Approximately Consistent Distributed Transactional Memory for GPUs. PARMA-DITAM@HiPEAC 2021: 2:1-2:15 - [i14]Costas Busch, Dariusz R. Kowalski:
Byzantine-Resilient Population Protocols. CoRR abs/2105.07123 (2021) - 2020
- [j42]Kun Yan, Hsiao-Chun Wu, Costas Busch, Xiangli Zhang:
Graph representation of random signal and its application for sparse signal detection. Digit. Signal Process. 96 (2020) - [j41]Limeng Pu, Hsiao-Chun Wu, Chiapin Wang, Shih-Hau Fang, Supratik Mukhopadhyay, Costas Busch:
Novel Fast User-Placement Ushering Algorithms and Performance Analysis for LTE Femtocell Networks. IEEE Trans. Cogn. Commun. Netw. 6(1): 381-393 (2020) - [c83]Yuqi Ding, Jiaming Liu, Jinwei Ye, Weidong Xiang, Hsiao-Chun Wu, Costas Busch:
3D LiDAR and Color Camera Data Fusion. BMSB 2020: 1-4 - [c82]Elaine Y.-N. Sun, Hsiao-Chun Wu, Costas Busch, Scott C.-H. Huang, Yen-Cheng Kuan, Jonathan Wu:
Innovative Audio Mosaic Technique by Permutations. BMSB 2020: 1-5 - [c81]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Dynamic Scheduling in Distributed Transactional Memory. IPDPS 2020: 874-883 - [i13]Mohammad M. Jalalzai, Chen Feng, Costas Busch, Golden G. Richard III, Jianyu Niu:
The Hermes BFT for Blockchains. CoRR abs/2007.00186 (2020)
2010 – 2019
- 2019
- [j40]Wyatt Clements, Costas Busch, Limeng Pu, Daniel Smith, Hsiao-Chun Wu:
Balanced Parallel Exploration of Orthogonal Regions. Algorithms 12(5): 104 (2019) - [c80]Mohammad M. Jalalzai, Costas Busch, Golden G. Richard III:
Proteus: A Scalable BFT Consensus Protocol for Blockchains. Blockchain 2019: 308-313 - [c79]Mohammad M. Jalalzai, Costas Busch, Golden G. Richard III:
Consistent BFT Performance for Blockchains. DSN (Supplements) 2019: 17-18 - [c78]Mohammad M. Jalalzai, Golden G. Richard III, Costas Busch:
An Experimental Evaluation of BFT Protocols for Blockchains. ICBC 2019: 34-48 - [c77]Samuel Irving, Sui Chen, Lu Peng, Costas Busch, Maurice Herlihy, Christopher J. Michael:
CUDA-DTM: Distributed Transactional Memory for GPU Clusters. NETYS 2019: 183-199 - [i12]Mohammad M. Jalalzai, Costas Busch, Golden G. Richard III:
Proteus: A Scalable BFT Consesus Protocol for Blockchains. CoRR abs/1903.04134 (2019) - [i11]Mohammad M. Jalalzai, Costas Busch:
Window Based BFT Blockchain Consensus. CoRR abs/1906.04381 (2019) - 2018
- [j39]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Time-communication impossibility results for distributed transactional memory. Distributed Comput. 31(6): 471-487 (2018) - [j38]Basem Assiri, Costas Busch:
Approximate Consistency in Transactional Memory. Int. J. Netw. Comput. 8(1): 93-123 (2018) - [c76]Gokarna Sharma, Rusul Alsaedi, Costas Busch, Supratik Mukhopadhyay:
The Complete Visibility Problem for Fat Robots with Lights. ICDCN 2018: 21:1-21:4 - [c75]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
How to Make Fat Autonomous Robots See all Others Fast? ICRA 2018: 1-9 - [c74]Mohammad M. Jalalzai, Costas Busch:
Window Based BFT Blockchain Consensus. iThings/GreenCom/CPSCom/SmartData 2018: 971-979 - [c73]Steven R. Brandt, Hari Krishnan, Costas Busch, Gokarna Sharma:
Distributed garbage collection for general graphs. ISMM 2018: 29-44 - [c72]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Complete Visibility for Oblivious Robots in 풪(N) Time. NETYS 2018: 67-84 - [c71]Costas Busch, Rajgopal Kannan:
Polynomial Time Equilibria in Bottleneck Congestion Games. EC 2018: 393-409 - [c70]Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy:
Load Balanced Distributed Directories. SSS 2018: 221-238 - 2017
- [j37]Gokarna Sharma, Costas Busch:
The Bursty Steiner Tree Problem. Int. J. Found. Comput. Sci. 28(7): 869-888 (2017) - [j36]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay, Charles Malveaux:
Tight Analysis of a Collisionless Robot Gathering Algorithm. ACM Trans. Auton. Adapt. Syst. 12(1): 3:1-3:20 (2017) - [c69]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai:
O(log N)-Time Complete Visibility for Asynchronous Robots with Lights. IPDPS 2017: 513-522 - [c68]Basem Assiri, Costas Busch:
Approximate Count and Queue Objects in Transactional Memory. IPDPS Workshops 2017: 894-903 - [c67]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. SPAA 2017: 173-182 - [c66]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time. SPAA 2017: 325-327 - 2016
- [j35]Gokarna Sharma, Costas Busch:
Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks. ACM Trans. Sens. Networks 12(1): 4:1-4:29 (2016) - [c65]Limeng Pu, Hsiao-Chun Wu, Chiapin Wang, Shih-Hau Fang, Supratik Mukhopadhyay, Costas Busch:
Novel Fast User-Placement Ushering Algorithms for Indoor Femtocell Networks. GLOBECOM 2016: 1-6 - [c64]Basem Assiri, Costas Busch:
Approximately Opaque Multi-version Permissive Transactional Memory. ICPP Workshops 2016: 393-402 - [c63]Basem Assiri, Costas Busch:
Transactional Memory Scheduling Using Machine Learning Techniques. PDP 2016: 718-725 - [c62]Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai:
Complete Visibility for Robots with Lights in O(1) Time. SSS 2016: 327-345 - [r2]Costas Busch:
Direct Routing Algorithms. Encyclopedia of Algorithms 2016: 549-553 - 2015
- [j34]Gokarna Sharma, Costas Busch:
An Analysis Framework for Distributed Hierarchical Directories. Algorithmica 71(2): 377-408 (2015) - [j33]Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan:
Efficient transformations for Klee's measure problem in the streaming model. Comput. Geom. 48(9): 688-702 (2015) - [j32]Gokarna Sharma, Hari Krishnan, Costas Busch, Steven R. Brandt:
Near-Optimal Location Tracking Using Sensor Networks. Int. J. Netw. Comput. 5(1): 122-158 (2015) - [j31]Gokarna Sharma, Costas Busch:
A load balanced directory for distributed shared memory objects. J. Parallel Distributed Comput. 78: 6-24 (2015) - [j30]Gokarna Sharma, Costas Busch:
Distributed Queuing in Dynamic Networks. Parallel Process. Lett. 25(2): 1550005:1-1550005:17 (2015) - [j29]Gokarna Sharma, Costas Busch:
Optimal nearest neighbor queries in sensor networks. Theor. Comput. Sci. 608: 146-165 (2015) - [c61]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Mutual Visibility with an Optimal Number of Colors. ALGOSENSORS 2015: 196-210 - [c60]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Bounds on Mutual Visibility Algorithms. CCCG 2015 - [c59]Ramachandran Vaidyanathan, Costas Busch, Jerry L. Trahan, Gokarna Sharma, Suresh Rai:
Logarithmic-Time Complete Visibility for Robots with Lights. IPDPS 2015: 375-384 - [c58]Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay, Charles Malveaux:
Tight analysis of a collisionless robot gathering algorithm. IROS 2015: 5189-5194 - [c57]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Impossibility Results for Distributed Transactional Memory. PODC 2015: 207-215 - 2014
- [j28]Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. Algorithmica 69(3): 658-684 (2014) - [j27]Gokarna Sharma, Costas Busch:
Distributed transactional memory for general networks. Distributed Comput. 27(5): 329-362 (2014) - [j26]Gokarna Sharma, Costas Busch:
Transactional memory: models and algorithms. SIGACT News 45(2): 74-103 (2014) - [c56]Gokarna Sharma, Costas Busch:
A Note on Online Steiner Tree Problems. CCCG 2014 - [c55]Gokarna Sharma, Costas Busch:
Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks. DCOSS 2014: 201-208 - [c54]Gokarna Sharma, Suresh Rai, Costas Busch, Jerry L. Trahan, Ramachandran Vaidyanathan:
Work-Efficient Load Balancing. ICPP Workshops 2014: 27-36 - [c53]Gokarna Sharma, Hari Krishnan, Costas Busch, Steven R. Brandt:
Near-Optimal Location Tracking Using Sensor Networks. IPDPS Workshops 2014: 737-746 - [c52]Steven R. Brandt, Hari Krishnan, Gokarna Sharma, Costas Busch:
Concurrent, parallel garbage collection in linear time. ISMM 2014: 47-58 - [c51]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Scheduling Multiple Objects in Distributed Transactional Memory. DISC 2014: 538-539 - 2013
- [c50]Gokarna Sharma, Costas Busch:
Optimal Nearest Neighbor Queries in Sensor Networks. ALGOSENSORS 2013: 260-277 - [c49]Gokarna Sharma, Costas Busch:
An Analysis Framework for Distributed Hierarchical Directories. ICDCN 2013: 378-392 - [c48]Gokarna Sharma, Costas Busch:
Distributed Queuing in Dynamic Networks. FOMC 2013: 1-19 - [i10]Rajgopal Kannan, Costas Busch, Paul G. Spirakis:
The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs. CoRR abs/1308.4101 (2013) - 2012
- [j25]Gokarna Sharma, Costas Busch:
A Competitive Analysis for Balanced Transactional Memory Workloads. Algorithmica 63(1-2): 296-322 (2012) - [j24]Gokarna Sharma, Costas Busch:
Window-based greedy contention management for transactional memory: theory and practice. Distributed Comput. 25(3): 225-248 (2012) - [j23]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) - [j22]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) - [c47]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 - [c46]Costas Busch, Rajgopal Kannan:
Stretch in Bottleneck Games. COCOON 2012: 592-603 - [c45]Gokarna Sharma, Costas Busch:
Towards Load Balanced Distributed Transactional Memory. Euro-Par 2012: 403-414 - [c44]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 - [c43]Gokarna Sharma, Costas Busch, Srinivasagopalan Srivathsan:
Distributed Transactional Memory for General Networks. IPDPS 2012: 1045-1056 - [c42]Gokarna Sharma, Costas Busch:
Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories. DISC 2012: 415-416 - 2011
- [c41]Costas Busch, Rajgopal Kannan, Alfred Samman:
Bottleneck Routing Games on Grids. GAMENETS 2011: 294-307 - [c40]Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos:
Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games. GAMENETS 2011: 308-320 - [c39]Gokarna Sharma, Costas Busch:
On the Performance of Window-Based Contention Managers for Transactional Memory. IPDPS Workshops 2011: 559-568 - [c38]Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
Oblivious Buy-at-Bulk in Planar Graphs. WALCOM 2011: 33-44 - [p1]Costas Busch, Malik Magdon-Ismail, Jing Xi:
Oblivious Routing for Sensor Network Topologies. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 381-406 - [i9]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) - 2010
- [j21]Costas Busch, Marios Mavronicolas:
An efficient counting network. Theor. Comput. Sci. 411(34-36): 3001-3030 (2010) - [j20]Costas Busch, Srikanta Tirthapura:
Concurrent counting is harder than queuing. Theor. Comput. Sci. 411(43): 3823-3833 (2010) - [c37]Gokarna Sharma, Costas Busch:
A Competitive Analysis for Balanced Transactional Memory Workloads. OPODIS 2010: 348-363 - [c36]Costas Busch, Malik Magdon-Ismail:
Optimal Oblivious Routing in Hole-Free Networks. QSHINE 2010: 421-437 - [c35]Rajgopal Kannan, Costas Busch:
Bottleneck Congestion Games with Logarithmic Price of Anarchy. SAGT 2010: 222-233 - [c34]Gokarna Sharma, Brett Estrade, Costas Busch:
Window-Based Greedy Contention Management for Transactional Memory. DISC 2010: 64-78 - [i8]Gokarna Sharma, Brett Estrade, Costas Busch:
Window-Based Greedy Contention Management for Transactional Memory. CoRR abs/1002.4182 (2010) - [i7]Rajgopal Kannan, Costas Busch:
Bottleneck Routing Games with Low Price of Anarchy. CoRR abs/1003.4307 (2010) - [i6]Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems. CoRR abs/1004.0351 (2010) - [i5]Gokarna Sharma, Costas Busch:
A Competitive Analysis for Balanced Transactional Memory Workloads. CoRR abs/1009.0056 (2010) - [i4]Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
Oblivious Buy-at-Bulk in Planar Graphs. CoRR abs/1010.0401 (2010) - [i3]Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos:
Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy. CoRR abs/1010.4812 (2010)
2000 – 2009
- 2009
- [j19]Costas Busch, Malik Magdon-Ismail:
Atomic routing games on maximum congestion. Theor. Comput. Sci. 410(36): 3337-3347 (2009) - [c33]Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. ALGOSENSORS 2009: 151-152 - [c32]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 - [i2]Rajgopal Kannan, Costas Busch:
The Impact of Exponential Utility Costs in Bottleneck Routing Games. CoRR abs/0911.4150 (2009) - 2008
- [j18]Bojian Xu, Srikanta Tirthapura, Costas Busch:
Sketching asynchronous data streams over sliding windows. Distributed Comput. 20(5): 359-374 (2008) - [j17]Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener:
Contention-free MAC protocols for asynchronous wireless sensor networks. Distributed Comput. 21(1): 23-42 (2008) - [j16]Costas Busch, Malik Magdon-Ismail, Jing Xi:
Optimal Oblivious Path Selection on the Mesh. IEEE Trans. Computers 57(5): 660-671 (2008) - [c31]Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos:
Quality of routing congestion games in wireless sensor networks. WICON 2008: 71 - [r1]Costas Busch:
Direct Routing Algorithms. Encyclopedia of Algorithms 2008 - [i1]Costas Busch, Rajgopal Kannan:
Bicretieria Optimization in Routing Games. CoRR abs/0801.4851 (2008) - 2007
- [j15]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distributed Comput. 67(11): 1168-1186 (2007) - [j14]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007) - [c30]Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70 - [c29]Costas Busch, Srikanta Tirthapura:
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. STACS 2007: 465-476 - 2006
- [j13]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006) - [j12]James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer:
Eight Open Problems in Distributed Computing. Bull. EATCS 90: 109-126 (2006) - [c28]Costas Busch, Malik Magdon-Ismail:
Atomic Routing Games on Maximum Congestion. AAIM 2006: 79-91 - [c27]Srikanta Tirthapura, Costas Busch:
Concurrent counting is harder than queuing. IPDPS 2006 - [c26]Srikanta Tirthapura, Bojian Xu, Costas Busch:
Sketching asynchronous streams over a sliding window. PODC 2006: 82-91 - 2005
- [j11]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
An Application of the Monotone Linearizability Lemma. Bull. EATCS 85: 70-80 (2005) - [j10]Costas Busch, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail:
Hardness Results for Cake Cutting. Bull. EATCS 86: 85-106 (2005) - [j9]Costas Busch, Srikanta Tirthapura:
Analysis of Link Reversal Routing Algorithms. SIAM J. Comput. 35(2): 305-326 (2005) - [j8]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005) - [c25]Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail:
Efficient Bufferless Routing on Leveled Networks. Euro-Par 2005: 931-940 - [c24]Costas Busch, Malik Magdon-Ismail, Jing Xi:
Optimal Oblivious Path Selection on the Mesh. IPDPS 2005 - [c23]Costas Busch, Malik Magdon-Ismail, Jing Xi:
Oblivious routing on geometric networks. SPAA 2005: 316-324 - 2004
- [j7]Costas Busch:
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. Theory Comput. Syst. 37(3): 371-396 (2004) - [c22]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. ESA 2004: 134-145 - [c21]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer:
Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827 - [c20]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Universal Bufferless Routing. WAOA 2004: 239-252 - [c19]Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener:
Contention-Free MAC Protocols for Wireless Sensor Networks. DISC 2004: 245-259 - 2003
- [c18]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72 - [c17]Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura:
Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219 - [c16]Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy:
Cake-Cutting Is Not a Piece of Cake. STACS 2003: 596-607 - 2002
- [j6]Costas Busch, Maurice Herlihy:
Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002) - [j5]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002) - [c15]Costas Busch:
Õ(congestion + dilation) hot-potato routing on leveled networks. SPAA 2002: 20-29 - 2001
- [c14]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Routing without flow control. SPAA 2001: 11-20 - 2000
- [b1]Costas Busch:
A Study on Distributed Structures. Brown University, USA, 2000 - [j4]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j3]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
A Combinatorial Characterization of Properties Preserved by Antitokens. Bull. EATCS 71: 114-132 (2000) - [c13]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582 - [c12]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Randomized greedy hot-potato routing. SODA 2000: 458-466 - [c11]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Hard-Potato routing. STOC 2000: 278-285
1990 – 1999
- 1999
- [c10]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61 - [c9]Costas Busch, Maurice Herlihy:
Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73 - [c8]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - 1998
- [c7]Costas Busch, Marios Mavronicolas:
An Efficient Counting Network. IPPS/SPDP 1998: 380-384 - [c6]Costas Busch, Maurice Herlihy:
A Survey on Counting Networks. WDAS 1998: 13-20 - 1997
- [j2]Costas Busch, Marios Mavronicolas:
Impossibility Results for Weak Threshold Networks. Inf. Process. Lett. 63(2): 85-90 (1997) - 1996
- [j1]Costas Busch, Marios Mavronicolas:
A Combinatorial Treatment of Balancing Networks. J. ACM 43(5): 794-839 (1996) - [c5]Costas Busch, Marios Mavronicolas:
The Strength of Counting Networks (Abstract). PODC 1996: 311 - 1995
- [c4]Costas Busch, Marios Mavronicolas:
A Logarithmic Depth Counting Network (Abstract). PODC 1995: 274 - 1994
- [c3]Costas Busch, Marios Mavronicolas:
Proving Correctness for Balancing Networks. Parallel Processing of Discrete Optimization Problems 1994: 1-32 - [c2]Costas Busch, Marios Mavronicolas:
A Combinatorial Treatment of Balancing Networks. PODC 1994: 206-215 - [c1]Costas Busch, Nikos Hardavellas, Marios Mavronicolas:
Contention in Counting Networks. PODC 1994: 404
Coauthor Index
[j50] [j49] [j48] [c87] [j46] [c81] [j39] [c76] [c75] [c73] [c72] [c70] [j37] [j36] [c69] [c67] [c66] [j35] [c62] [j34] [j33] [j32] [j31] [j30] [j29] [c61] [c60] [c59] [c58] [c57] [j27] [j26] [c56] [c55] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [j25] [j24] [c47] [c45] [c43] [c42] [c39] [c37] [c34] [i8] [i5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
