{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:18Z","timestamp":1725550638521},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_10","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"79-90","source":"Crossref","is-referenced-by-count":14,"title":["Rank-Sensitive Data Structures"],"prefix":"10.1007","author":[{"given":"Iwona","family":"Bialynicka-Birula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","volume":"63","author":"M. Ajtai","year":"1984","unstructured":"Ajtai, M., Fredman, M., Koml\u00f2s, J.: Hash functions for priority queues. Information and Control\u00a063(3), 217\u2013225 (1984)","journal-title":"Information and Control"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L. Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM Journal on Computing\u00a032, 1488\u20131508 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR3","volume-title":"Modern Information Retrieval","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1999)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwartzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Computer and System Sciences\u00a038(1), 86\u2013124 (1989)","journal-title":"J. Computer and System Sciences"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. J. ACM\u00a046, 236\u2013280 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0196-6774(03)00044-0","volume":"48","author":"A. Fiat","year":"2003","unstructured":"Fiat, A., Kaplan, H.: Making data structures confluently persistent. J. Algorithms\u00a048(1), 16\u201358 (2003)","journal-title":"J. Algorithms"},{"key":"10_CR9","series-title":"Department of Computer Science","volume-title":"Class notes CSC 2429F: Dynamic data structures","author":"F.E. Fich","year":"2003","unstructured":"Fich, F.E.: Class notes CSC 2429F: Dynamic data structures. Department of Computer Science. University of Toronto, Canada (2003)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/inco.1993.1030","volume":"104","author":"G.N. Frederickson","year":"1993","unstructured":"Frederickson, G.N.: An optimal algorithm for selection in a min-heap. Inf.\u00a0Comput.\u00a0104(2), 197\u2013214 (1993)","journal-title":"Inf.\u00a0Comput."},{"issue":"3","key":"10_CR11","first-page":"533","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS\u00a048(3), 533\u2013551 (1994)","journal-title":"JCSS"},{"doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984, Washington, D.C, pp. 135\u2013143 (1984)","key":"10_CR12","DOI":"10.1145\/800057.808675"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"10_CR14","volume-title":"Computer Graphics with OpenGL","author":"D. Hearn","year":"2003","unstructured":"Hearn, D., Baker, M.: Computer Graphics with OpenGL. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/780542.780635","volume-title":"STOC 2003","author":"H. Kaplan","year":"2003","unstructured":"Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: STOC 2003, pp. 639\u2013648. ACM Press, New York (2003)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-44472-6_9","volume-title":"Current Issues in Databases and Information Systems","author":"N. Kitsios","year":"2000","unstructured":"Kitsios, N., Makris, C., Sioutas, S., Tsakalidis, A., Tsaknakis, J., Vassiliadis, B.: 2-D spatial indexing scheme in optimal time. In: Masunaga, Y., Thalheim, B., \u0160tuller, J., Pokorn\u00fd, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol.\u00a01884, p. 107. Springer, Heidelberg (2000)"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R. Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Transactions on Information Systems\u00a019(2), 131\u2013160 (2001)","journal-title":"ACM Transactions on Information Systems"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM Journal on Computing\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Mortensen, C.W.: Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In: SODA 2003, pp. 618\u2013627 (2003)","key":"10_CR20"},{"unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 657\u2013666 (2002)","key":"10_CR21"},{"issue":"6","key":"10_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"W. Myrvold","year":"2001","unstructured":"Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters\u00a079(6), 281\u2013284 (2001)","journal-title":"Information Processing Letters"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156. Springer, Heidelberg (1983)"},{"unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Tech. rep, Stanford University, Stanford, CA (1998)","key":"10_CR24"},{"unstructured":"Raman, R.: Eliminating amortization: on data structures with guaranteed response time. PhD thesis, Rochester, NY, USA (1993)","key":"10_CR25"},{"key":"10_CR26","first-page":"699","volume-title":"Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","author":"M. Thorup","year":"2003","unstructured":"Thorup, M.: On AC0 implementations of fusion trees and atomic heaps. In: Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), January 12\u201314, pp. 699\u2013707. ACM Press, New York (2003)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"10_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Communications of the ACM\u00a023(4), 229\u2013239 (1980)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Conference Record, IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","key":"10_CR30","DOI":"10.1109\/SWAT.1973.13"},{"key":"10_CR31","volume-title":"Managing gigabytes: Compressing and indexing documents and images","author":"H. Witten Ian","year":"1999","unstructured":"Ian Witten, H., Moffat, A., Bell, T.C.: Managing gigabytes: Compressing and indexing documents and images. Morgan Kaufmann Pubs. Inc., San Francisco (1999)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:50Z","timestamp":1619505770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11575832_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}