{"id":"https://openalex.org/W2033156334","doi":"https://doi.org/10.1145/2339123.2339126","title":"A Primal-Dual Randomized Algorithm for Weighted Paging","display_name":"A Primal-Dual Randomized Algorithm for Weighted Paging","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W2033156334","doi":"https://doi.org/10.1145/2339123.2339126","mag":"2033156334"},"language":"en","primary_location":{"id":"doi:10.1145/2339123.2339126","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339123.2339126","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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Open University of Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":6.317,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.96655131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"59","issue":"4","first_page":"1","last_page":"24"},"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/T11182","display_name":"Auction Theory and Applications","score":0.974399983882904,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9573000073432922,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.8718835115432739},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.7564831972122192},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7485332489013672},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6902814507484436},{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.6892518997192383},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6875355243682861},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.60834139585495},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5216274857521057},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5051091313362122},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.49734261631965637},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48209336400032043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4786304533481598},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34493136405944824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17724040150642395},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17172297835350037}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8718835115432739},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.7564831972122192},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7485332489013672},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6902814507484436},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.6892518997192383},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6875355243682861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60834139585495},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5216274857521057},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5051091313362122},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.49734261631965637},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48209336400032043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4786304533481598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34493136405944824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17724040150642395},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17172297835350037},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/2339123.2339126","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339123.2339126","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:pure.tue.nl:openaire_cris_publications/a589e2dd-6ee4-4c14-a0dc-ef5758272735","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a589e2dd-6ee4-4c14-a0dc-ef5758272735","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Buchbinder, N & Naor, J 2012, 'A primal-dual randomized algorithm for weighted paging', Journal of the ACM, vol. 59, no. 4, 19, pp. 1-24. https://doi.org/10.1145/2339123.2339126","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:694902","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=694902","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:739473","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=739473","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0004-5411","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.9082","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.9082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.technion.ac.il/~nivb/papers/weighted-paging.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.3442","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.3442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homes.cs.washington.edu/~jrl/seffi.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:694902","is_oa":false,"landing_page_url":"http://repository.tue.nl/694902","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:739473","is_oa":false,"landing_page_url":"http://repository.tue.nl/739473","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0004-5411","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/208d2e43-e2dc-4fa6-bc47-5ec129621ae5","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/208d2e43-e2dc-4fa6-bc47-5ec129621ae5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07, Providence RI, USA, October 20-23, 2007), 507 - 517","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a589e2dd-6ee4-4c14-a0dc-ef5758272735","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/a589e2dd-6ee4-4c14-a0dc-ef5758272735","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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, 59(4):19, 1 - 24. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G990861464","display_name":null,"funder_award_id":"954/11","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W158123262","https://openalex.org/W1496647032","https://openalex.org/W1552828154","https://openalex.org/W1686038249","https://openalex.org/W1860570137","https://openalex.org/W1923724101","https://openalex.org/W1974264551","https://openalex.org/W1984290406","https://openalex.org/W1996540180","https://openalex.org/W1998843748","https://openalex.org/W2003902046","https://openalex.org/W2025180076","https://openalex.org/W2025874591","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2043344147","https://openalex.org/W2044156187","https://openalex.org/W2051233655","https://openalex.org/W2054033098","https://openalex.org/W2060427246","https://openalex.org/W2069121074","https://openalex.org/W2069255833","https://openalex.org/W2082099352","https://openalex.org/W2082859480","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W2114538202","https://openalex.org/W2120096103","https://openalex.org/W2137909125","https://openalex.org/W2142339200","https://openalex.org/W2150238960","https://openalex.org/W2150495379","https://openalex.org/W2157650361","https://openalex.org/W2161029651","https://openalex.org/W2170981586","https://openalex.org/W2952036964","https://openalex.org/W3103476680","https://openalex.org/W4206478994","https://openalex.org/W4251310455","https://openalex.org/W6633003778"],"related_works":["https://openalex.org/W2617423316","https://openalex.org/W1481323420","https://openalex.org/W1998843748","https://openalex.org/W4316652420","https://openalex.org/W4310884475","https://openalex.org/W2168823865","https://openalex.org/W2033156334","https://openalex.org/W4390439624","https://openalex.org/W2180461869","https://openalex.org/W4372272740"],"abstract_inverted_index":{"We":[0,24,123,163],"study":[1],"the":[2,6,22,40,45,58,63,86,89,92,151,159,176],"weighted":[3,184],"version":[4,87],"of":[5,88],"classic":[7],"online":[8,32,83,93,136,149,167],"paging":[9],"problem":[10,90,180],"where":[11,37,91],"there":[12],"is":[13,39,44,101,117],"a":[14,26,120,142,155,183],"weight":[15],"(cost)":[16],"for":[17,34,62,85,175],"fetching":[18],"each":[19],"page":[20],"into":[21],"cache.":[23],"design":[25,72],"randomized":[27,47,143,169],"O":[28,74,127,170],"(log":[29,128,171],"k":[30,38,50,76,78,98,113,129],")-competitive":[31,51,130,173],"algorithm":[33,52,84,94,132,144,174],"this":[35],"problem,":[36,64],"cache":[41,96,109,161],"size.":[42],"This":[43],"first":[46,124],"o":[48],"(":[49],"and":[53,99],"its":[54],"competitive":[55],"ratio":[56],"matches":[57],"known":[59],"lower":[60],"bound":[61],"up":[65],"to":[66,103,154],"constant":[67],"factors.":[68],"More":[69],"generally,":[70],"we":[71,140],"an":[73,104,126,135,148,166],"(log(":[75],"/(":[77],"\u2212":[79],"h":[80,111],"+":[81],"1)))-competitive":[82],"has":[95],"size":[97,110],"it":[100],"compared":[102],"optimal":[105],"offline":[106],"solution":[107,116,153],"with":[108],"\u2264":[112],".":[114],"Our":[115],"based":[118,133],"on":[119,134,158,182,187],"two-step":[121],"approach.":[122,138],"obtain":[125,141],"fractional":[131,152],"primal-dual":[137,168],"Next,":[139],"by":[145],"rounding":[146],"in":[147],"manner":[150],"probability":[156],"distribution":[157],"possible":[160],"states.":[162],"also":[164],"give":[165],"N":[172,188],"Metrical":[177],"Task":[178],"System":[179],"(MTS)":[181],"star":[185],"metric":[186],"leaves.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}