A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. Nekrich, Y. In Asano, T., Nakano, S., Okamoto, Y., & Watanabe, O., editors, ISAAC, volume 7074, of Lecture Notes in Computer Science, pages 170-179, 2011. Springer.
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. [link]Link  A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. [link]Paper  bibtex   
@inproceedings{conf/isaac/Nekrich11,
  added-at = {2018-11-02T00:00:00.000+0100},
  author = {Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2fffe0b1a70a2f1a97a5d554d5ae9f079/dblp},
  booktitle = {ISAAC},
  crossref = {conf/isaac/2011},
  editor = {Asano, Takao and Nakano, Shin-Ichi and Okamoto, Yoshio and Watanabe, Osamu},
  ee = {https://doi.org/10.1007/978-3-642-25591-5_19},
  interhash = {be63bb65bdb67f767d158d9efd25cb54},
  intrahash = {fffe0b1a70a2f1a97a5d554d5ae9f079},
  isbn = {978-3-642-25590-8},
  keywords = {dblp},
  pages = {170-179},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T12:57:19.000+0200},
  title = {A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.},
  url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2011.html#Nekrich11},
  volume = 7074,
  year = 2011
}

Downloads: 0