A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time

Yakov Nekrich. A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. In Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe, editors, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Volume 7074 of Lecture Notes in Computer Science, pages 170-179, Springer, 2011. [doi]

Abstract

Abstract is missing.