Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.
Richard Cole
,
Ramesh Hariharan
Venue
A*
SODA
Year
1996
Proceedings
SODA
DBLP record
conf/soda/ColeH96 ↗
Browse the full
SODA paper archive
.