{"id":"https://openalex.org/W4285195015","doi":"https://doi.org/10.1007/978-3-031-09574-0_12","title":"The Fast Algorithm for\u00a0Online k-server Problem on\u00a0Trees","display_name":"The Fast Algorithm for\u00a0Online k-server Problem on\u00a0Trees","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285195015","doi":"https://doi.org/10.1007/978-3-031-09574-0_12"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-09574-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-09574-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032918115","display_name":"Kamil Khadiev","orcid":"https://orcid.org/0000-0002-5151-9908"},"institutions":[{"id":"https://openalex.org/I21203515","display_name":"Kazan Federal University","ror":"https://ror.org/05256ym39","country_code":"RU","type":"education","lineage":["https://openalex.org/I21203515"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Kamil Khadiev","raw_affiliation_strings":["Kazan Federal University, Kazan, Russia"],"raw_orcid":"https://orcid.org/0000-0002-5151-9908","affiliations":[{"raw_affiliation_string":"Kazan Federal University, Kazan, Russia","institution_ids":["https://openalex.org/I21203515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060769680","display_name":"Maxim Yagafarov","orcid":null},"institutions":[{"id":"https://openalex.org/I21203515","display_name":"Kazan Federal University","ror":"https://ror.org/05256ym39","country_code":"RU","type":"education","lineage":["https://openalex.org/I21203515"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Maxim Yagafarov","raw_affiliation_strings":["Kazan Federal University, Kazan, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kazan Federal University, Kazan, Russia","institution_ids":["https://openalex.org/I21203515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032918115"],"corresponding_institution_ids":["https://openalex.org/I21203515"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2696,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.38306225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"190","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7745910882949829},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7219134569168091},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5960474014282227},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5901814699172974},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5782660841941833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5467568039894104},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5178197026252747},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4504859149456024},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42818135023117065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3929552137851715},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2642536163330078},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1826113760471344},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18148791790008545},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11825671792030334}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7745910882949829},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7219134569168091},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5960474014282227},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5901814699172974},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5782660841941833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5467568039894104},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5178197026252747},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4504859149456024},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42818135023117065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3929552137851715},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2642536163330078},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1826113760471344},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18148791790008545},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11825671792030334},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-09574-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-09574-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485839371","https://openalex.org/W1978382073","https://openalex.org/W1995654985","https://openalex.org/W2008747785","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2041645394","https://openalex.org/W2069121074","https://openalex.org/W2069758085","https://openalex.org/W2086989193","https://openalex.org/W2092901467","https://openalex.org/W2098610490","https://openalex.org/W2113184918","https://openalex.org/W2113692056","https://openalex.org/W2137120608","https://openalex.org/W2341403126","https://openalex.org/W2626350546","https://openalex.org/W2781651079","https://openalex.org/W2885088151","https://openalex.org/W2910965761","https://openalex.org/W2958790543","https://openalex.org/W3024879097","https://openalex.org/W3048896498","https://openalex.org/W3111245937","https://openalex.org/W4205755886","https://openalex.org/W4245807026","https://openalex.org/W4246219036","https://openalex.org/W4283580379"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2086365412","https://openalex.org/W2567853751"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}