{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:06:03Z","timestamp":1743141963815,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031095733"},{"type":"electronic","value":"9783031095740"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_12","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"190-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Fast Algorithm for\u00a0Online k-server Problem on\u00a0Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5151-9908","authenticated-orcid":false,"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Yagafarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-98355-4_9","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"F Ablayev","year":"2018","unstructured":"Ablayev, F., Ablayev, M., Khadiev, K., Vasiliev, A.: Classical and quantum computations with restricted memory. In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 129\u2013155. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98355-4_9"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.tcs.2019.08.011","volume":"806","author":"AR Ahmed","year":"2020","unstructured":"Ahmed, A.R., Rahman, M.S., Kobourov, S.: Online facility assignment. Theoret. Comput. Sci. 806, 455\u2013467 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-19647-3_3","volume-title":"Frontiers in Algorithmics","author":"T Akagi","year":"2015","unstructured":"Akagi, T., Nakano, S.: On r-gatherings on the line. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 25\u201332. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19647-3_3"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Baliga, G.R., Shende, A.M.: On space bounded server algorithms. In: Proceedings of ICCI 1993: 5th International Conference on Computing and Information, pp. 77\u201381. IEEE (1993)","DOI":"10.1109\/ICCI.1993.315400"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 267\u2013276. IEEE (2011)","DOI":"10.1109\/FOCS.2011.63"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2783434","volume":"62","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM (JACM) 62(5), 1\u201349 (2015)","journal-title":"J. ACM (JACM)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-02927-1_15","volume-title":"Automata, Languages and Programming","author":"L Becchetti","year":"2009","unstructured":"Becchetti, L., Koutsoupias, E.: Competitive analysis of aggregate max in windowed streaming. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 156\u2013170. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_15"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221\u2013242 (1993)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1142\/S0129054115500239","volume":"26","author":"J Boyar","year":"2015","unstructured":"Boyar, J., Larsen, K.S., Maiti, A.: The frequent items problem in online streaming under various performance measures. Int. J. Found. Comput. Sci. 26(4), 413\u2013439 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Larmore, L.L.: An optimal on-line algorithm for k servers on trees. SIAM J. Comput. 20(1), 144\u2013148 (1991)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill, New York (2001)"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.jda.2005.12.006","volume":"4","author":"M Flammini","year":"2006","unstructured":"Flammini, M., Navarra, A., Nicosia, G.: Efficient offline algorithms for the bicriteria k-server problem and online applications. J. Discret. Algorithms 4(3), 414\u2013432 (2006)","journal-title":"J. Discret. Algorithms"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2014.09.011","volume":"562","author":"Y Giannakopoulos","year":"2015","unstructured":"Giannakopoulos, Y., Koutsoupias, E.: Competitive analysis of maintaining frequent items of a stream. Theoret. Comput. Sci. 562, 23\u201332 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"key":"12_CR17","unstructured":"Kapralov, R., Khadiev, K., Mokut, J., Shen, Y., Yagafarov, M.: Fast classical and quantum algorithms for online k-server problem on trees. In: CEUR Workshop Proceedings, vol. 3072, pp. 287\u2013301 (2022)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. In: 27th Annual Symposium on FOCS, 1986, pp. 244\u2013254. IEEE (1986)","DOI":"10.1109\/SFCS.1986.14"},{"key":"12_CR19","unstructured":"Khadiev, K.: Quantum request-answer game with buffer model for online algorithms. Application for the most frequent keyword problem. In: CEUR Workshop Proceedings, vol. 2850, pp. 16\u201327 (2021)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-030-54997-8_27","volume-title":"Formal Methods. FM 2019 International Workshops","author":"K Khadiev","year":"2020","unstructured":"Khadiev, K., Khadieva, A.: Two-way quantum and classical automata with advice for online minimization problems. In: Sekerinski, E., et al. (eds.) FM 2019. LNCS, vol. 12233, pp. 428\u2013442. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54997-8_27"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10773-019-04209-1","volume":"60","author":"K Khadiev","year":"2019","unstructured":"Khadiev, K., Khadieva, A.: Quantum online streaming algorithms with logarithmic memory. Int. J. Theor. Phys. 60(2), 608\u2013616 (2019). https:\/\/doi.org\/10.1007\/s10773-019-04209-1","journal-title":"Int. J. Theor. Phys."},{"issue":"9","key":"12_CR22","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1134\/S1995080218090421","volume":"39","author":"K Khadiev","year":"2018","unstructured":"Khadiev, K., Khadieva, A., Mannapov, I.: Quantum online algorithms with respect to space and advice complexity. Lobachevskii J. Math. 39(9), 1210\u20131220 (2018)","journal-title":"Lobachevskii J. Math."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.3390\/math10010143","volume":"10","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., Khadieva, A.: Quantum and classical log-bounded automata for the online disjointness problem. Mathematics 10(1), 143 (2022). https:\/\/doi.org\/10.3390\/math10010143","journal-title":"Mathematics"},{"key":"12_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.02.026","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., et al.: Two-way and one-way quantum and classical automata with advice for online minimization problems. Theoret. Comput. Sci. (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.02.026","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR25","unstructured":"Khadiev, K., Yagafarov, M.: A fast algorithm for online k-servers problem on trees. arXiv preprint arXiv:2006.00605 (2020)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Lin, D.: Quantum online algorithms for a model of the request-answer game with a buffer. Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 162(3), 367\u2013382 (2020)","DOI":"10.26907\/2541-7746.2020.3.367-382"},{"key":"12_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation: Determinism, Randomization, Advice","author":"D Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation: Determinism, Randomization, Advice. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"key":"12_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72547-5","volume-title":"Guide to Competitive Programming","author":"A Laaksonen","year":"2020","unstructured":"Laaksonen, A.: Guide to Competitive Programming. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-319-72547-5"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","volume":"21","author":"T Rudec","year":"2013","unstructured":"Rudec, T., Baumgartner, A., Manger, R.: A fast work function algorithm for solving the k-server problem. CEJOR 21(1), 187\u2013205 (2013)","journal-title":"CEJOR"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"3","key":"12_CR31","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T17:16:52Z","timestamp":1727457412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}