A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. Nekrich, Y. CoRR, 2011.
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   
@article{journals/corr/abs-1109-3890,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/28adf30c11a78a310ddeadf234dcb5b75/dblp},
  ee = {http://arxiv.org/abs/1109.3890},
  interhash = {be63bb65bdb67f767d158d9efd25cb54},
  intrahash = {8adf30c11a78a310ddeadf234dcb5b75},
  journal = {CoRR},
  keywords = {dblp},
  timestamp = {2018-08-14T13:02:17.000+0200},
  title = {A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-3890},
  volume = {abs/1109.3890},
  year = 2011
}

Downloads: 0