default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCostas Busch
- > Home > Persons > Costas Busch
Publications
- 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)- 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) - [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 - 2021
- [j46]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. Theory Comput. Syst. 65(2): 296-322 (2021) - 2020
- [c81]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Dynamic Scheduling in Distributed Transactional Memory. IPDPS 2020: 874-883 - 2019
- [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 - 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) - [c70]Shishir Rai, Gokarna Sharma, Costas Busch, Maurice Herlihy:
Load Balanced Distributed Directories. SSS 2018: 221-238 - 2017
- [c67]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. SPAA 2017: 173-182 - 2015
- [c57]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Impossibility Results for Distributed Transactional Memory. PODC 2015: 207-215 - 2014
- [c51]Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Scheduling Multiple Objects in Distributed Transactional Memory. DISC 2014: 538-539 - 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) - 2001
- [c14]Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Routing without flow control. SPAA 2001: 11-20 - 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 - 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
- [c6]Costas Busch, Maurice Herlihy:
A Survey on Counting Networks. WDAS 1998: 13-20
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-09-26 01:55 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:
