{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:53:31Z","timestamp":1648914811243},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,9,26]],"date-time":"2013-09-26T00:00:00Z","timestamp":1380153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00453-013-9838-4","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T18:51:10Z","timestamp":1380135070000},"page":"1007-1020","source":"Crossref","is-referenced-by-count":0,"title":["Data Structures on Event Graphs"],"prefix":"10.1007","volume":"71","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,26]]},"reference":[{"issue":"4","key":"9838_CR1","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1214\/aoap\/1177005280","volume":"3","author":"P. Chassaing","year":"1993","unstructured":"Chassaing, P.: Optimality of move-to-front for self-organizing data structures with locality of references. Ann. Appl. Probab. 3(4), 1219\u20131240 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"9838_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)"},{"issue":"3","key":"9838_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00454-009-9170-6","volume":"42","author":"B. Chazelle","year":"2009","unstructured":"Chazelle, B., Mulzer, W.: Markov incremental constructions. Discrete Comput. Geom. 42(3), 399\u2013420 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9838_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2012.02.015","volume":"434","author":"M. Crochemore","year":"2012","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Tischler, G., Wale, T.: Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434, 23\u201334 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9838_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van\u00a0Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9838_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1976","unstructured":"van\u00a0Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Syst. Theory 10(2), 99\u2013127 (1976)","journal-title":"Math. Syst. Theory"},{"issue":"5","key":"9838_CR7","first-page":"283","volume":"29","author":"G. Hotz","year":"1993","unstructured":"Hotz, G.: Search trees and search graphs for Markov sources. Elektron. Inf.verarb. Kybern. 29(5), 283\u2013292 (1993)","journal-title":"Elektron. Inf.verarb. Kybern."},{"issue":"2","key":"9838_CR8","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01759046","volume":"6","author":"S. Kapoor","year":"1991","unstructured":"Kapoor, S., Reingold, E.M.: Stochastic rearrangement rules for self-organizing data structures. Algorithmica 6(2), 278\u2013291 (1991)","journal-title":"Algorithmica"},{"issue":"3","key":"9838_CR9","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A.R. Karlin","year":"2000","unstructured":"Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput. 30(3), 906\u2013922 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9838_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(81)90016-8","volume":"12","author":"L.K. Konneker","year":"1981","unstructured":"Konneker, L.K., Varol, Y.L.: A note on heuristics for dynamic organization of data structures. Inf. Process. Lett. 12(5), 213\u2013216 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9838_CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.2307\/3213645","volume":"21","author":"K. Lam","year":"1984","unstructured":"Lam, K., Leung, M.Y., Siu, M.K.: Self-organizing files with dependent accesses. J. Appl. Probab. 21(2), 343\u2013359 (1984)","journal-title":"J. Appl. Probab."},{"key":"9838_CR12","volume-title":"Markov Chains and Mixing Times","author":"D.A. Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. Am. Math. Soc., Providence (2009)"},{"key":"9838_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"13","key":"9838_CR14","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1016\/j.ipl.2009.03.003","volume":"109","author":"W. Mulzer","year":"2009","unstructured":"Mulzer, W.: A note on predecessor searching in the pointer machine model. Inf. Process. Lett. 109(13), 726\u2013729 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9838_CR15","doi-asserted-by":"crossref","first-page":"790","DOI":"10.2307\/3215104","volume":"34","author":"R.M. Phatarfod","year":"1997","unstructured":"Phatarfod, R.M., Pryde, A.J., Dyte, D.: On the move-to-front scheme with Markov dependent requests. J. Appl. Probab. 34(3), 790\u2013794 (1997)","journal-title":"J. Appl. Probab."},{"key":"9838_CR16","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/3-540-61440-0_156","volume-title":"Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP)","author":"F. Schulz","year":"1996","unstructured":"Schulz, F., Sch\u00f6mer, E.: Self-organizing data structures with dependent accesses. In: Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 526\u2013537 (1996)"},{"issue":"3","key":"9838_CR17","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0201016","volume":"1","author":"G.S. Shedler","year":"1972","unstructured":"Shedler, G.S., Tung, C.: Locality in page reference strings. SIAM J. Comput. 1(3), 218\u2013241 (1972)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9838_CR18","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1145\/234752.234753","volume":"43","author":"J.S. Vitter","year":"1996","unstructured":"Vitter, J.S., Krishnan, P.: Optimal prefetching via data compression. J. ACM 43(5), 771\u2013793 (1996)","journal-title":"J. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9838-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9838-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9838-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:13Z","timestamp":1559137513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9838-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,26]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9838"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9838-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,26]]}}}