%0 Journal Article %1 journals/jea/BrodalM21 %A Brodal, Gerth Stølting %A Mampentzidis, Konstantinos %D 2021 %J ACM J. Exp. Algorithmics %K dblp %P 1.2:1-1.2:44 %T Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. %U http://dblp.uni-trier.de/db/journals/jea/jea26.html#BrodalM21 %V 26

@article{journals/jea/BrodalM21, added-at = {2022-06-13T00:00:00.000+0200}, author = {Brodal, Gerth Stølting and Mampentzidis, Konstantinos}, biburl = {https://www.bibsonomy.org/bibtex/22f0c98440bb4b769837d44d4ecbc0f67/dblp}, ee = {https://doi.org/10.1145/3433651}, interhash = {45eb29cf2304a2774d745f2b9c9336a2}, intrahash = {2f0c98440bb4b769837d44d4ecbc0f67}, journal = {ACM J. Exp. Algorithmics}, keywords = {dblp}, pages = {1.2:1-1.2:44}, timestamp = {2024-04-08T19:47:44.000+0200}, title = {Cache Oblivious Algorithms for Computing the Triplet Distance between Trees.}, url = {http://dblp.uni-trier.de/db/journals/jea/jea26.html#BrodalM21}, volume = 26, year = 2021 }