A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. Nekrich, Y. CoRR, 2011. 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
{"_id":"FwtwaC9zmMuhXb23M","bibbaseid":"nekrich-adynamicstabbingmaxdatastructurewithsublogarithmicquerytime-2011","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2018-08-13T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"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","bibtex":"@article{journals/corr/abs-1109-3890,\n added-at = {2018-08-13T00:00:00.000+0200},\n author = {Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/28adf30c11a78a310ddeadf234dcb5b75/dblp},\n ee = {http://arxiv.org/abs/1109.3890},\n interhash = {be63bb65bdb67f767d158d9efd25cb54},\n intrahash = {8adf30c11a78a310ddeadf234dcb5b75},\n journal = {CoRR},\n keywords = {dblp},\n timestamp = {2018-08-14T13:02:17.000+0200},\n title = {A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time},\n url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-3890},\n volume = {abs/1109.3890},\n year = 2011\n}\n\n","author_short":["Nekrich, Y."],"key":"journals/corr/abs-1109-3890","id":"journals/corr/abs-1109-3890","bibbaseid":"nekrich-adynamicstabbingmaxdatastructurewithsublogarithmicquerytime-2011","role":"author","urls":{"Link":"http://arxiv.org/abs/1109.3890","Paper":"http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-3890"},"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":"article","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"]}