Costas Busch

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Bogdan S. Chlebus

> Home > Persons > Costas Busch

Publications

2023
[j50]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BuschCHPPS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BuschCHPPS23
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]
- view
  authority control:
- export record
  dblp key:
  - conf/ciac/BuschCKP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/BuschCKP23
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CIAC 2023: 172-186
2022
[c87]
- view
  authority control:
- export record
  dblp key:
  - conf/sss/BuschCHPPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sss/BuschCHPPS22
Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible Scheduling of Transactional Memory on Trees. SSS 2022: 146-163
[i15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2208-07359
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2208-07359
Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CoRR abs/2208.07359 (2022)

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.