Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An efficient transactional memory algorithm for computing minimum spanning ..."

Seunghwa Kang, David A. Bader (2009)

> Home

Details and statistics

DOI: 10.1145/1504176.1504182

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-12

- view
  authority control:
- export record
  dblp key:
  - conf/ppopp/KangB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppopp/KangB09
Seunghwa Kang, David A. Bader:
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. PPoPP 2009: 15-24

a service of

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.