Computing the agreement of trees with bounded degrees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Computing the agreement of trees with bounded degrees. / Farach, Martin; Przytycka, T.M.; Thorup, Mikkel.
Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, 1995. p. 381-393.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Farach, M, Przytycka, TM & Thorup, M 1995, Computing the agreement of trees with bounded degrees. in Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, pp. 381-393.
APA
Farach, M., Przytycka, T. M., & Thorup, M. (1995). Computing the agreement of trees with bounded degrees. In Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979 (pp. 381-393). Springer.
Vancouver
Farach M, Przytycka TM, Thorup M. Computing the agreement of trees with bounded degrees. In Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer. 1995. p. 381-393
Author
Bibtex
@inproceedings{ad24768074cc11dbbee902004c4f4f50,
title = "Computing the agreement of trees with bounded degrees",
author = "Martin Farach and T.M. Przytycka and Mikkel Thorup",
year = "1995",
language = "English",
pages = "381--393",
booktitle = "Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979",
publisher = "Springer",
address = "Switzerland",
}
RIS
TY - GEN
T1 - Computing the agreement of trees with bounded degrees
AU - Farach, Martin
AU - Przytycka, T.M.
AU - Thorup, Mikkel
PY - 1995
Y1 - 1995
M3 - Article in proceedings
SP - 381
EP - 393
BT - Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979
PB - Springer
ER -
ID: 235527