![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record journals/siamcomp/ColeFHPT00
@article{DBLP:journals/siamcomp/ColeFHPT00, author = {Richard Cole and Martin Farach{-}Colton and Ramesh Hariharan and Teresa M. Przytycka and Mikkel Thorup}, title = {An \emph{O}(\emph{n}log \emph{n}) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees}, journal = {{SIAM} J. Comput.}, volume = {30}, number = {5}, pages = {1385--1404}, year = {2000}, url = {https://doi.org/10.1137/S0097539796313477}, doi = {10.1137/S0097539796313477}, timestamp = {Fri, 09 Apr 2021 18:31:52 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ColeFHPT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.