Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISCC
/
Paper
On Finding maximally redundant trees in strictly linear time.
Gbor Enyedi
,
Gbor Rtvri
,
Andrs Csszr
Venue
C
ISCC
Year
2009
Proceedings
ISCC
DBLP record
conf/iscc/EnyediRC09 ↗
Browse the full
ISCC paper archive
.