Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.
Yakov Nekrich
Venue
B
ISAAC
Year
2011
Proceedings
ISAAC
DBLP record
conf/isaac/Nekrich11 ↗
Browse the full
ISAAC paper archive
.