{"id":"https://openalex.org/W2052993280","doi":"https://doi.org/10.1137/s0097539792236353","title":"Strongly Competitive Algorithms for Paging with Locality of Reference","display_name":"Strongly Competitive Algorithms for Paging with Locality of Reference","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2052993280","doi":"https://doi.org/10.1137/s0097539792236353","mag":"2052993280"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792236353","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236353","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5067702658","display_name":"Sandy Irani","orcid":"https://orcid.org/0000-0002-0642-9436"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sandy Irani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021838614","display_name":"Anna R. Karlin","orcid":"https://orcid.org/0009-0001-9091-2702"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anna R. Karlin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081838760","display_name":"Steven Phillips","orcid":"https://orcid.org/0000-0002-5694-0670"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steven Phillips","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067702658"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.0366,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.97711639,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"25","issue":"3","first_page":"477","last_page":"497"},"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.939300000667572,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9169999957084656,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.9040290117263794},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7429158091545105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.740001380443573},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.7214958667755127},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5564529895782471},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.517233669757843},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5044764280319214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4614388644695282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44228994846343994},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.23918166756629944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2171521782875061},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09545981884002686}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9040290117263794},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7429158091545105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.740001380443573},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7214958667755127},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5564529895782471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.517233669757843},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5044764280319214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4614388644695282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44228994846343994},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.23918166756629944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2171521782875061},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09545981884002686},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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.1137/s0097539792236353","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236353","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"mag:2052993280","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=139455","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W132090586","https://openalex.org/W197359305","https://openalex.org/W1987225815","https://openalex.org/W2011670396","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2068651594","https://openalex.org/W2069162168","https://openalex.org/W2076610035","https://openalex.org/W2082099352","https://openalex.org/W2082859480","https://openalex.org/W2088257029","https://openalex.org/W2112209757","https://openalex.org/W2124516381","https://openalex.org/W2164155474","https://openalex.org/W3197565351"],"related_works":["https://openalex.org/W2069162168","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W1987225815","https://openalex.org/W2295016450","https://openalex.org/W2083392624","https://openalex.org/W2178699190","https://openalex.org/W2042789015","https://openalex.org/W2011670396","https://openalex.org/W2082859480","https://openalex.org/W2068714069","https://openalex.org/W2048720850","https://openalex.org/W2073713788","https://openalex.org/W2088257029","https://openalex.org/W2082099352","https://openalex.org/W2076610035","https://openalex.org/W1552828154","https://openalex.org/W2159112912","https://openalex.org/W2044156187","https://openalex.org/W1495743741"],"abstract_inverted_index":{"What":[0],"is":[1,94,108,130],"the":[2,12,28,36,100,119,142],"best":[3],"paging":[4,33],"algorithm":[5,128],"if":[6],"one":[7],"has":[8],"partial":[9,21],"information":[10],"about":[11],"possible":[13],"sequences":[14,144],"of":[15,30,52,54,80,99,118,141,145],"page":[16,43],"requests?":[17],"We":[18,62,104],"give":[19],"a":[20,50,96,115,139],"answer":[22],"to":[23,49],"this":[24],"question":[25],"by":[26,57],"presenting":[27],"analysis":[29],"strongly":[31,111,131],"competitive":[32,132],"algorithms":[34,66],"in":[35,109],"access":[37,60,69,123],"graph":[38,61],"model.":[39],"This":[40],"model":[41,138],"restricts":[42],"requests":[44],"so":[45],"that":[46,92,106,129,137],"they":[47],"conform":[48],"notion":[51],"locality":[53],"reference":[55],"given":[56],"an":[58,86,127],"arbitrary":[59],"first":[63],"consider":[64],"optimal":[65,101],"for":[67],"undirected":[68],"graphs.":[70],"Borodin":[71],"et":[72],"al.":[73],"[Proc.":[74],"23rd":[75],"ACM":[76],"Symposium":[77],"on":[78,133],"Theory":[79],"Computing,":[81],"1991,":[82],"pp.":[83],"249\u2013259]":[84],"define":[85],"algorithm,":[87],"called":[88],"FAR,":[89],"and":[90],"prove":[91,105],"it":[93],"within":[95,114],"logarithmic":[97],"factor":[98,117],"online":[102],"algorithm.":[103],"FAR":[107],"fact":[110],"competitive,":[112],"i.e,":[113],"constant":[116],"optimum.":[120],"For":[121],"directed":[122],"graphs,":[124],"we":[125],"present":[126],"structured":[134,146],"program":[135],"graphs\u2014graphs":[136],"subset":[140],"request":[143],"programs.":[147]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}