Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Gerth Stølting Brodal and Konstantinos Mampentzidis. Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{stltingbrodal_et_al:LIPIcs.ESA.2017.21, author = {St{\o}lting Brodal, Gerth and Mampentzidis, Konstantinos}, title = {{Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.21}, URN = {urn:nbn:de:0030-drops-78820}, doi = {10.4230/LIPIcs.ESA.2017.21}, annote = {Keywords: Phylogenetic tree, tree comparison, triplet distance, cache oblivious algorithm} }
Published in: Dagstuhl Seminar Proceedings, Volume 5391, Algebraic and Numerical Algorithms and Computer-assisted Proofs (2006)
Bruno Buchberger, Christian Jansson, Shin'ichi Oishi, Michael Plum, and Siegfried M. Rump. 05391 Executive Summary – Numerical and Algebraic Algorithms and Computer-assisted Proofs. In Algebraic and Numerical Algorithms and Computer-assisted Proofs. Dagstuhl Seminar Proceedings, Volume 5391, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{buchberger_et_al:DagSemProc.05391.2, author = {Buchberger, Bruno and Jansson, Christian and Oishi, Shin'ichi and Plum, Michael and Rump, Siegfried M.}, title = {{05391 Executive Summary – Numerical and Algebraic Algorithms and Computer-assisted Proofs}}, booktitle = {Algebraic and Numerical Algorithms and Computer-assisted Proofs}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5391}, editor = {Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05391.2}, URN = {urn:nbn:de:0030-drops-4549}, doi = {10.4230/DagSemProc.05391.2}, annote = {Keywords: Self-validating methods, computer algebra, computer-assisted proofs, real number algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 5391, Algebraic and Numerical Algorithms and Computer-assisted Proofs (2006)
Christian Jansson. Rigorous Results in Combinatorial Optimization. In Algebraic and Numerical Algorithms and Computer-assisted Proofs. Dagstuhl Seminar Proceedings, Volume 5391, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{jansson:DagSemProc.05391.7, author = {Jansson, Christian}, title = {{Rigorous Results in Combinatorial Optimization}}, booktitle = {Algebraic and Numerical Algorithms and Computer-assisted Proofs}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5391}, editor = {Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05391.7}, URN = {urn:nbn:de:0030-drops-4467}, doi = {10.4230/DagSemProc.05391.7}, annote = {Keywords: Combinatorial Optimization, Semidefinite Programming, Ill-posed Problems, Verification Methods} }
Feedback for Dagstuhl Publishing