Predecessor Queries in Constant Time?. Karpinski, M. & Nekrich, Y. In Brodal, G. S. & Leonardi, S., editors, ESA, volume 3669, of Lecture Notes in Computer Science, pages 238-248, 2005. Springer.
Predecessor Queries in Constant Time?. [link]Link  Predecessor Queries in Constant Time?. [link]Paper  bibtex   
@inproceedings{conf/esa/KarpinskiN05,
  added-at = {2017-05-26T00:00:00.000+0200},
  author = {Karpinski, Marek and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2a01c837e802459a7bf0c219219c12006/dblp},
  booktitle = {ESA},
  crossref = {conf/esa/2005},
  editor = {Brodal, Gerth Stølting and Leonardi, Stefano},
  ee = {https://doi.org/10.1007/11561071_23},
  interhash = {05072a6fc706f3967140c77b9ec9ee40},
  intrahash = {a01c837e802459a7bf0c219219c12006},
  isbn = {3-540-29118-0},
  keywords = {dblp},
  pages = {238-248},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2024-04-09T13:33:57.000+0200},
  title = {Predecessor Queries in Constant Time?.},
  url = {http://dblp.uni-trier.de/db/conf/esa/esa2005.html#KarpinskiN05},
  volume = 3669,
  year = 2005
}

Downloads: 0