{"id":"https://openalex.org/W7098347478","doi":null,"title":"Competitive Analysis of Paging: A Survey","display_name":"Competitive Analysis of Paging: A Survey","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W7098347478"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.7336","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~irani/Online/paging.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5067702658","display_name":"Sandy Irani","orcid":"https://orcid.org/0000-0002-0642-9436","observed_orcids":["https://orcid.org/0000-0002-0642-9436"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sandy Irani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5067702658"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50091743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"competitive analysis","score":0.7829999923706055},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.8970000147819519},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.9729999899864197},{"id":"https://openalex.org/keywords/tight-bounds","display_name":"tight bounds","score":0.7630000114440918},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.7039999961853027},{"id":"https://openalex.org/keywords/deterministic-algorithms","display_name":"deterministic algorithms","score":0.9580000042915344},{"id":"https://openalex.org/keywords/memory-management","display_name":"memory management","score":0.6779999732971191}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9837999939918518},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9506999850273132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6367999911308289},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.616599977016449},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C58546491","wikidata":"https://www.wikidata.org/wiki/Q1150207","display_name":"Competitive advantage","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3434000015258789},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C3018824978","wikidata":"https://www.wikidata.org/wiki/Q2894891","display_name":"Error analysis","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21969999372959137}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.7336","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~irani/Online/paging.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2521765794","https://openalex.org/W2069162168","https://openalex.org/W2168823865","https://openalex.org/W1602169857","https://openalex.org/W2047515262","https://openalex.org/W2893209269","https://openalex.org/W6980986215","https://openalex.org/W7096606683","https://openalex.org/W7097651692","https://openalex.org/W2280997549"],"abstract_inverted_index":{".":[0],"This":[1,90],"paper":[2],"is":[3,91],"a":[4,84,98,111],"survey":[5],"of":[6,9,38,75,102,125,131,134,142,155],"competitive":[7,19,40,61,153],"analysis":[8,62,154],"paging.":[10],"We":[11,29],"present":[12],"proofs":[13],"showing":[14],"tight":[15],"bounds":[16],"for":[17],"the":[18,39,43,48,55,94,126,129,132,139,148,152,158],"ratio":[20,41],"achievable":[21],"by":[22],"any":[23],"deterministic":[24],"or":[25],"randomized":[26],"online":[27,56,135,156],"algorithm.":[28],"then":[30],"go":[31],"on":[32],"to":[33,54,59,93,109],"discuss":[34],"variations":[35,53],"and":[36,42,77,80,107,144],"refinements":[37],"insights":[44],"they":[45],"give":[46],"into":[47],"paging":[49,57,69,119,159],"problem.":[50],"Finally,":[51],"we":[52],"problem":[58,70,86,114,120],"which":[60,146],"has":[63,71,81,104,121],"been":[64,123],"applied.":[65],"1":[66],"Introduction":[67],"The":[68,118],"inspired":[72],"several":[73],"decades":[74],"theoretical":[76],"applied":[78],"research":[79],"now":[82],"become":[83],"classical":[85],"in":[87,115,128,151],"computer":[88],"science.":[89],"due":[92],"fact":[95],"that":[96],"managing":[97],"two":[99],"level":[100],"store":[101],"memory":[103],"long":[105],"been,":[106],"continues":[108],"be,":[110],"fundamentally":[112],"important":[113],"computing":[116],"systems.":[117],"also":[122],"one":[124],"cornerstones":[127],"development":[130],"area":[133],"algorithms.":[136],"Starting":[137],"with":[138],"seminal":[140],"work":[141],"Sleator":[143],"Tarjan":[145],"initiated":[147],"recent":[149],"interest":[150],"algorithms,":[157],"probl...":[160]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-27T00:00:00"}