{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:40:49Z","timestamp":1725486049762},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540075448"},{"type":"electronic","value":"9783540380764"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-38076-0_28","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:30:01Z","timestamp":1180823401000},"page":"440-452","source":"Crossref","is-referenced-by-count":0,"title":["A New Randomized Data Structure for the 1 1\/2-dimensional Range Query Problem"],"prefix":"10.1007","author":[{"given":"Panayiotis","family":"Bozanis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,25]]},"reference":[{"issue":"7","key":"28_CR1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"29","author":"J. L. Bentley","year":"1980","unstructured":"Bentley J. L., Wood D.: \u201cAn Optimal Worst-Case Algorithm for Reporting Intersections of Rectangles\u201d, IEEE Transactions on Computers, Vol.29, No.7, pp.571\u2013577, 1980.","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg M., van Kreveld M., Overmars M. and Schwarzkopf O.: \u201cComputational Geometry: Algorithms and Applications\u201d, Springer, Berlin, 2000. 440, 441"},{"unstructured":"Bozanis P. and Manolopoulos Y.: \u201cDSL: Accommodating Skip Lists in the SDDS Model\u201d, Proceedings 3rd Workshop on Distributed Data and Structures (WDAS\u20192000), pp.1\u20139, L\u2019Aquila, Italy, July 2000. 443","key":"28_CR3"},{"doi-asserted-by":"crossref","unstructured":"Hanson E. N. and Johnson, T.: \u201cThe Interval Skip List: a Data Structure for Finding all Intervals that Overlap a Point\u201d, Proceedings 2nd Workshop on Algorithms and Data Structures (WADS\u201991), pp.153\u2013164, Ottawa, Canada, August 1991. 440","key":"28_CR4","DOI":"10.1007\/BFb0028258"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston S. and Mehlhorn K.: \u201cA New Representation for Linear Lists\u201d, Acta Informatica, Vol.17, pp.157\u2013184, 1982. 444","journal-title":"Acta Informatica"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. M. McCreight","year":"1985","unstructured":"McCreight E. M.: \u201cPriority Search Trees\u201d, SIAM Journal on Computing, Vol.14, pp.257\u2013276, 1985. 440","journal-title":"SIAM Journal on Computing"},{"key":"28_CR7","volume-title":"Multidimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K.: \u201cData Structures & Algorithms, Vol. 3: Multidimensional Searching and Computational Geometry\u201d, Springer, Berlin, 1984. 440, 441, 442, 451"},{"key":"28_CR8","volume-title":"Computational Geometry: an introduction Through Randomized Algorithms","author":"K. Mulmuley","year":"1994","unstructured":"Mulmuley K.: \u201cComputational Geometry: an introduction Through Randomized Algorithms\u201d, Prentice-Hall, Englewood Cliffs, NJ, 1994. 443, 450"},{"unstructured":"Papadakis T.: \u201cSkip Lists and Probabilistic Analysis of Algorithms\u201d, Ph.D. Thesis, University of Waterloo, May 1993. 442","key":"28_CR9"},{"unstructured":"Pugh W.: \u201cA Skip List CookBook\u201d, Technical Report CS-TR-2286, Department of Computer Science, University of Maryland at College Park, July 1989. 442","key":"28_CR10"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh W.: \u201cSkip Lists: a Probabilistic Alternative to Balanced Trees\u201d, Communications of the ACM, Vol.33, pp.668\u2013676, 1990. 442","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Seidel R. and Aragon C. R.: \u201cRandomized Search Trees\u201d, Algorithmica, Vol.16, pp.464\u2013497, 1996. 443","key":"28_CR12","DOI":"10.1007\/BF01940876"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38076-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:28:12Z","timestamp":1556468892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38076-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540075448","9783540380764"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-38076-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}