Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
An Approximation Algorithm for Binary Searching in Trees.
Eduardo Sany Laber
,
Marco Molinaro
Venue
A*
ICALP
Year
2008
Proceedings
ICALP (1)
DBLP record
conf/icalp/LaberM08 ↗
Browse the full
ICALP paper archive
.