"Cache Oblivious Algorithms for Computing the Triplet Distance between Trees."

Gerth Stølting Brodal, Konstantinos Mampentzidis (2021)

> Home

Details and statistics

DOI: 10.1145/3433651

access: closed

type: Journal Article

metadata version: 2022-06-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/BrodalM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/BrodalM21
Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. ACM J. Exp. Algorithmics 26: 1.2:1-1.2:44 (2021)

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.