{"id":"https://openalex.org/W2045732032","doi":"https://doi.org/10.1145/2450142.2450143","title":"Paging and list update under bijective analysis","display_name":"Paging and list update under bijective analysis","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2045732032","doi":"https://doi.org/10.1145/2450142.2450143","mag":"2045732032"},"language":"en","primary_location":{"id":"doi:10.1145/2450142.2450143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2450142.2450143","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","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/A5107303715","display_name":"Spyros Angelopoulos","orcid":"https://orcid.org/0000-0001-9819-9158"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Spyros Angelopoulos","raw_affiliation_strings":["CNRS and Universit\u00e9 Pierre et Marie Curie, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS and Universit\u00e9 Pierre et Marie Curie, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017685495","display_name":"Pascal Schweitzer","orcid":"https://orcid.org/0009-0001-3585-8213"},"institutions":[{"id":"https://openalex.org/I4210145752","display_name":"Industrial Research Institute of Ishikawa","ror":"https://ror.org/03yr4aq68","country_code":"JP","type":"other","lineage":["https://openalex.org/I4210145752"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Pascal Schweitzer","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Ishikawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Ishikawa, Japan","institution_ids":["https://openalex.org/I4210145752"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3773,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.66912066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"60","issue":"2","first_page":"1","last_page":"18"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9745000004768372,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.897944986820221},{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.8694215416908264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.741977334022522},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7302064895629883},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.7084596157073975},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5861997008323669},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46022090315818787},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35940080881118774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2585711181163788},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1712493896484375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16829460859298706},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16536226868629456}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.897944986820221},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.8694215416908264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.741977334022522},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7302064895629883},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.7084596157073975},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5861997008323669},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46022090315818787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35940080881118774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2585711181163788},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1712493896484375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16829460859298706},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16536226868629456},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2450142.2450143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2450142.2450143","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01185285v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01185285","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2013, 60 (2), pp.7. ⟨10.1145/2450142.2450143⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1490670856","https://openalex.org/W1529928007","https://openalex.org/W1552828154","https://openalex.org/W1581815840","https://openalex.org/W1598422951","https://openalex.org/W1608453593","https://openalex.org/W1797843619","https://openalex.org/W1995038282","https://openalex.org/W2001755298","https://openalex.org/W2003185949","https://openalex.org/W2011670396","https://openalex.org/W2016153661","https://openalex.org/W2029728897","https://openalex.org/W2033855099","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2044156187","https://openalex.org/W2047034252","https://openalex.org/W2058399410","https://openalex.org/W2062382196","https://openalex.org/W2065021581","https://openalex.org/W2065354456","https://openalex.org/W2075354456","https://openalex.org/W2114313475","https://openalex.org/W2124919631","https://openalex.org/W2126103966","https://openalex.org/W2138719999","https://openalex.org/W2142098074","https://openalex.org/W2148693377","https://openalex.org/W2159472851","https://openalex.org/W2161488606","https://openalex.org/W2163724134","https://openalex.org/W2166440417","https://openalex.org/W2257449051","https://openalex.org/W2282546565","https://openalex.org/W2468711194","https://openalex.org/W2561675875","https://openalex.org/W2751601659","https://openalex.org/W2914415689","https://openalex.org/W2950194461","https://openalex.org/W3104025736","https://openalex.org/W3125910951","https://openalex.org/W3136960240","https://openalex.org/W3138855735","https://openalex.org/W3197565351","https://openalex.org/W4235336266","https://openalex.org/W4389615669","https://openalex.org/W6633003778","https://openalex.org/W6657951020","https://openalex.org/W6665107348"],"related_works":["https://openalex.org/W1481323420","https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1998843748","https://openalex.org/W1623410360","https://openalex.org/W2617423316","https://openalex.org/W2168823865","https://openalex.org/W1602169857","https://openalex.org/W1979064639"],"abstract_inverted_index":{"It":[0],"has":[1],"long":[2],"been":[3,108],"known":[4],"that":[5,31,154,193,228,243],"for":[6,202],"the":[7,33,67,74,92,111,139,161,173,198,254],"paging":[8,203],"problem":[9],"in":[10,52,66,71,110,118,244],"its":[11,60],"standard":[12],"form,":[13],"competitive":[14,35,94,99],"analysis":[15,124,143,217,230],"cannot":[16],"adequately":[17],"distinguish":[18],"algorithms":[19,30,166,201],"based":[20,156,214],"on":[21,157,167,215],"their":[22],"performance:":[23],"there":[24],"exists":[25],"a":[26,178,232,245],"vast":[27],"class":[28],"of":[29,49,59,98,116,141,160,169,172,181,183],"achieve":[32],"same":[34,93,174],"ratio,":[36],"ranging":[37],"from":[38,223],"extremely":[39],"naive":[40],"and":[41,57,80,83,125,195,204,221,249],"inefficient":[42],"strategies":[43,48],"(such":[44,54],"as":[45,55,101,103,253],"Flush-When-Full),":[46],"to":[47,186,209],"excellent":[50],"performance":[51,105],"practice":[53],"Least-Recently-Used":[56,194],"some":[58],"variants).":[61],"A":[62],"similar":[63],"situation":[64],"arises":[65],"list":[68,87,205],"update":[69,88],"problem:":[70],"particular,":[72],"under":[73,138],"cost":[75],"formulation":[76],"studied":[77],"by":[78,164],"Mart\u00ednez":[79],"Roura":[81],"[2000]":[82,85],"Munro":[84],"every":[86],"algorithm":[89],"has,":[90],"asymptotically,":[91],"ratio.":[95],"Several":[96],"refinements":[97],"analysis,":[100],"well":[102],"alternative":[104],"measures":[106,213],"have":[107,218],"introduced":[109],"literature,":[112],"with":[113,177],"varying":[114],"degrees":[115],"success":[117],"narrowing":[119],"this":[120,129,210],"disconnect":[121],"between":[122],"theoretical":[123],"empirical":[126],"evaluation.":[127],"In":[128],"article,":[130],"we":[131,191,241],"study":[132],"these":[133],"two":[134,165],"fundamental":[135],"online":[136],"problems":[137],"framework":[140],"bijective":[142,229],"[Angelopoulos":[144],"et":[145,188],"al.":[146,189],"2007,":[147],"2008].":[148],"This":[149],"is":[150,155,231],"an":[151],"intuitive":[152],"technique":[153],"pairwise":[158],"comparison":[159],"costs":[162],"incurred":[163],"sets":[168],"request":[170],"sequences":[171],"size.":[175],"Coupled":[176],"well-established":[179],"model":[180],"locality":[182],"reference":[184],"due":[185],"Albers":[187],"[2005],":[190],"show":[192],"Move-to-Front":[196],"are":[197],"unique":[199],"optimal":[200],"update,":[206],"respectively.":[207],"Prior":[208],"work,":[211],"only":[212],"average-cost":[216,239],"separated":[219],"LRU":[220,248],"MTF":[222,250],"all":[224],"other":[225],"algorithms.":[226,257],"Given":[227],"fairly":[233],"stringent":[234],"measure":[235],"(and":[236],"also":[237],"subsumes":[238],"analysis),":[240],"prove":[242],"strong":[246],"sense":[247],"stand":[251],"out":[252],"best":[255],"(deterministic)":[256]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}