![](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 conf/isaac/PengT04
@inproceedings{DBLP:conf/isaac/PengT04, author = {Zeshan Peng and Hing{-}Fung Ting}, editor = {Rudolf Fleischer and Gerhard Trippen}, title = {An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees}, booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC} 2004, Hong Kong, China, December 20-22, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3341}, pages = {754--765}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30551-4\_65}, doi = {10.1007/978-3-540-30551-4\_65}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PengT04.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.