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. 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
{"_id":"FwtwaC9zmMuhXb23M","bibbaseid":"nekrich-adynamicstabbingmaxdatastructurewithsublogarithmicquerytime-2011","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/2fffe0b1a70a2f1a97a5d554d5ae9f079/dblp","booktitle":"ISAAC","crossref":"conf/isaac/2011","editor":[{"propositions":[],"lastnames":["Asano"],"firstnames":["Takao"],"suffixes":[]},{"propositions":[],"lastnames":["Nakano"],"firstnames":["Shin-Ichi"],"suffixes":[]},{"propositions":[],"lastnames":["Okamoto"],"firstnames":["Yoshio"],"suffixes":[]},{"propositions":[],"lastnames":["Watanabe"],"firstnames":["Osamu"],"suffixes":[]}],"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","bibtex":"@inproceedings{conf/isaac/Nekrich11,\n added-at = {2018-11-02T00:00:00.000+0100},\n author = {Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2fffe0b1a70a2f1a97a5d554d5ae9f079/dblp},\n booktitle = {ISAAC},\n crossref = {conf/isaac/2011},\n editor = {Asano, Takao and Nakano, Shin-Ichi and Okamoto, Yoshio and Watanabe, Osamu},\n ee = {https://doi.org/10.1007/978-3-642-25591-5_19},\n interhash = {be63bb65bdb67f767d158d9efd25cb54},\n intrahash = {fffe0b1a70a2f1a97a5d554d5ae9f079},\n isbn = {978-3-642-25590-8},\n keywords = {dblp},\n pages = {170-179},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T12:57:19.000+0200},\n title = {A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.},\n url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2011.html#Nekrich11},\n volume = 7074,\n year = 2011\n}\n\n","author_short":["Nekrich, Y."],"editor_short":["Asano, T.","Nakano, S.","Okamoto, Y.","Watanabe, O."],"key":"conf/isaac/Nekrich11","id":"conf/isaac/Nekrich11","bibbaseid":"nekrich-adynamicstabbingmaxdatastructurewithsublogarithmicquerytime-2011","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-642-25591-5_19","Paper":"http://dblp.uni-trier.de/db/conf/isaac/isaac2011.html#Nekrich11"},"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.157Z","downloads":0,"keywords":["dblp"],"search_terms":["dynamic","stabbing","max","data","structure","sub","logarithmic","query","time","nekrich"],"title":"A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.","year":2011,"dataSources":["f7XsgZohqQ3Rphbct"]}