{"id":"https://openalex.org/W1998843748","doi":"https://doi.org/10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","display_name":"Competitive analysis of randomized paging algorithms","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W1998843748","doi":"https://doi.org/10.1016/s0304-3975(98)00116-9","mag":"1998843748"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00116-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00116-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5021300666","display_name":"Dimitris Achlioptas","orcid":"https://orcid.org/0000-0003-2349-822X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dimitris Achlioptas","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ont., Canada M5S 3G4","University of Toronto, Toronto, Ont., Canada,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont., Canada M5S 3G4","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto, Toronto, Ont., Canada,","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science, University of California, Riverside, CA 92521, USA","University of California, Riverside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Riverside, CA 92521, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008465806","display_name":"John Noga","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Noga","raw_affiliation_strings":["Department of Mathematics, University of California, Riverside, CA 92521, USA","University of California, Riverside"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California, Riverside, CA 92521, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008465806"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":4.6877,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.94908437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"234","issue":"1-2","first_page":"203","last_page":"218"},"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.9775999784469604,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9717000126838684,"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/paging","display_name":"Paging","score":0.9508546590805054},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.9122424125671387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7978647351264954},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6550582647323608},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6096621751785278},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6000727415084839},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5829260349273682},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.49837279319763184},{"id":"https://openalex.org/keywords/demand-paging","display_name":"Demand paging","score":0.49175193905830383},{"id":"https://openalex.org/keywords/page-fault","display_name":"Page fault","score":0.48227933049201965},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.45635536313056946},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.42318984866142273},{"id":"https://openalex.org/keywords/virtual-memory","display_name":"Virtual memory","score":0.33708739280700684},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.3121236562728882},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2881643772125244},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1668585240840912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16572675108909607},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0931810736656189}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9508546590805054},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9122424125671387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7978647351264954},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6550582647323608},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6096621751785278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6000727415084839},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5829260349273682},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.49837279319763184},{"id":"https://openalex.org/C188873839","wikidata":"https://www.wikidata.org/wiki/Q5255045","display_name":"Demand paging","level":5,"score":0.49175193905830383},{"id":"https://openalex.org/C193343404","wikidata":"https://www.wikidata.org/wiki/Q1928607","display_name":"Page fault","level":5,"score":0.48227933049201965},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.45635536313056946},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.42318984866142273},{"id":"https://openalex.org/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.33708739280700684},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.3121236562728882},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2881643772125244},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1668585240840912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16572675108909607},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0931810736656189},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"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":4,"locations":[{"id":"doi:10.1016/s0304-3975(98)00116-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00116-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.4832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/~optas/papers/rand-paging.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.8357","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://131.107.65.21/users/optas/papers/rand-paging.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.8146","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.8146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~marek/pubs/randomized_paging.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1532521488","https://openalex.org/W1572397493","https://openalex.org/W1575141434","https://openalex.org/W1966496924","https://openalex.org/W2031323309","https://openalex.org/W2038661317","https://openalex.org/W2040217797","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2044156187","https://openalex.org/W2052993280","https://openalex.org/W2054033098","https://openalex.org/W2069162168","https://openalex.org/W2069255833","https://openalex.org/W2075784392","https://openalex.org/W2082099352","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2136789019","https://openalex.org/W2159472851","https://openalex.org/W2295016450","https://openalex.org/W2498386205","https://openalex.org/W3197565351","https://openalex.org/W4300576158","https://openalex.org/W6723532536"],"related_works":["https://openalex.org/W2155379745","https://openalex.org/W4241723377","https://openalex.org/W4242544852","https://openalex.org/W4235954812","https://openalex.org/W2357520409","https://openalex.org/W1820333363","https://openalex.org/W1993535731","https://openalex.org/W2010739099","https://openalex.org/W3112386411","https://openalex.org/W2476092018"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":10}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}