@inproceedings{conf/isaac/Nekrich09,
  added-at = {2018-11-02T00:00:00.000+0100},
  author = {Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2b1c3ed55e51e27f010e11e56e126310e/dblp},
  booktitle = {ISAAC},
  crossref = {conf/isaac/2009},
  editor = {Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar H.},
  ee = {https://doi.org/10.1007/978-3-642-10631-6_20},
  interhash = {c9ae71e896b9c496263a59e8aa60ee2f},
  intrahash = {b1c3ed55e51e27f010e11e56e126310e},
  isbn = {978-3-642-10630-9},
  keywords = {dblp},
  pages = {183-192},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T12:56:36.000+0200},
  title = {Data Structures for Approximate Orthogonal Range Counting.},
  url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#Nekrich09},
  volume = 5878,
  year = 2009
}

{"_id":"hxCzqBstGj8s7K89Z","bibbaseid":"nekrich-datastructuresforapproximateorthogonalrangecounting-2009","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Nekrich, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2018-11-02T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2b1c3ed55e51e27f010e11e56e126310e/dblp","booktitle":"ISAAC","crossref":"conf/isaac/2009","editor":[{"propositions":[],"lastnames":["Dong"],"firstnames":["Yingfei"],"suffixes":[]},{"propositions":[],"lastnames":["Du"],"firstnames":["Ding-Zhu"],"suffixes":[]},{"propositions":[],"lastnames":["Ibarra"],"firstnames":["Oscar","H."],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-642-10631-6_20","interhash":"c9ae71e896b9c496263a59e8aa60ee2f","intrahash":"b1c3ed55e51e27f010e11e56e126310e","isbn":"978-3-642-10630-9","keywords":"dblp","pages":"183-192","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T12:56:36.000+0200","title":"Data Structures for Approximate Orthogonal Range Counting.","url":"http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#Nekrich09","volume":"5878","year":"2009","bibtex":"@inproceedings{conf/isaac/Nekrich09,\n added-at = {2018-11-02T00:00:00.000+0100},\n author = {Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2b1c3ed55e51e27f010e11e56e126310e/dblp},\n booktitle = {ISAAC},\n crossref = {conf/isaac/2009},\n editor = {Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar H.},\n ee = {https://doi.org/10.1007/978-3-642-10631-6_20},\n interhash = {c9ae71e896b9c496263a59e8aa60ee2f},\n intrahash = {b1c3ed55e51e27f010e11e56e126310e},\n isbn = {978-3-642-10630-9},\n keywords = {dblp},\n pages = {183-192},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T12:56:36.000+0200},\n title = {Data Structures for Approximate Orthogonal Range Counting.},\n url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#Nekrich09},\n volume = 5878,\n year = 2009\n}\n\n","author_short":["Nekrich, Y."],"editor_short":["Dong, Y.","Du, D.","Ibarra, O. H."],"key":"conf/isaac/Nekrich09","id":"conf/isaac/Nekrich09","bibbaseid":"nekrich-datastructuresforapproximateorthogonalrangecounting-2009","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-642-10631-6_20","Paper":"http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#Nekrich09"},"keyword":["dblp"],"metadata":{"authorlinks":{"nekrich, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.bibsonomy.org%2Fbib%2Fauthor%2Fyakov%20nekrich%3Fitems=1000&msg=embed"}},"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:01.029Z","downloads":0,"keywords":["dblp"],"search_terms":["data","structures","approximate","orthogonal","range","counting","nekrich"],"title":"Data Structures for Approximate Orthogonal Range Counting.","year":2009,"dataSources":["f7XsgZohqQ3Rphbct"]}