MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Cole, Richard
Hariharan, Ramesh
dblp
dblp
Editor(s):
BibTeX cite key*:
Cole-Hariharan96
Title, Booktitle
Title*:
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Booktitle*:
7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Georgia, USA
Language:
English
Event Date*
(no longer used):
January, 28-30
Organization:
Event Start Date:
24 November 2020
Event End Date:
24 November 2020
Publisher
Name*:
acm
URL:
Address*:
New York
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
323-332
Year*:
1996
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
experts only
Appearance:
MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{Cole-Hariharan96,
AUTHOR = {Cole, Richard and Hariharan, Ramesh},
TITLE = {An O(n log n) algorithm for the maximum agreement subtree problem for binary trees},
BOOKTITLE = {7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)},
PUBLISHER = {acm},
YEAR = {1996},
PAGES = {323--332},
ADDRESS = {Georgia, USA},
}


Entry last modified by Evelyn Haak, 03/02/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Evelyn Haak
Created
06/27/1997 09:58:20 AM
Revision
0.



Editor
Evelyn Haak



Edit Date
27/06/97 10:01:53