%0 Conference Paper %1 conf/esa/BrodalM17 %A Brodal, Gerth Stølting %A Mampentzidis, Konstantinos %B ESA %D 2017 %E Pruhs, Kirk %E Sohler, Christian %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 21:1-21:14 %T Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. %U http://dblp.uni-trier.de/db/conf/esa/esa2017.html#BrodalM17 %V 87 %@ 978-3-95977-049-1

@inproceedings{conf/esa/BrodalM17, added-at = {2019-10-19T00:00:00.000+0200}, author = {Brodal, Gerth Stølting and Mampentzidis, Konstantinos}, biburl = {https://www.bibsonomy.org/bibtex/2de75bc6fab531ee28fb86ef531e7d439/dblp}, booktitle = {ESA}, crossref = {conf/esa/2017}, editor = {Pruhs, Kirk and Sohler, Christian}, ee = {https://doi.org/10.4230/LIPIcs.ESA.2017.21}, interhash = {8a08d447810ea7f9db7ecbe4b91d1c06}, intrahash = {de75bc6fab531ee28fb86ef531e7d439}, isbn = {978-3-95977-049-1}, keywords = {dblp}, pages = {21:1-21:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:44:38.000+0100}, title = {Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa2017.html#BrodalM17}, volume = 87, year = 2017 }