{"id":"https://openalex.org/W2009239786","doi":"https://doi.org/10.5555/313852.314122","title":"Distributed paging for general networks","display_name":"Distributed paging for general networks","alternate_titles":[],"publication_year":1996,"publication_date":"1996-01-28","ids":{"openalex":"https://openalex.org/W2009239786","doi":"https://doi.org/10.5555/313852.314122","mag":"2009239786"},"language":"en","primary_location":{"id":"mag:2009239786","doi":"https://doi.org/10.5555/313852.314122","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda96.html#AwerbuchBF96","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,"listed_in":[],"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":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2009239786"],"child_works_count":0,"type":"conference-paper","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/A5110260801","display_name":"Baruch Awerbuch","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["Johns Hopkins University and Lab. for Computer Science , MIT#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University and Lab. for Computer Science , MIT#TAB#","institution_ids":["https://openalex.org/I145311948","https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111723795","display_name":"Yair Bartal","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yair Bartal","raw_affiliation_strings":["Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038118929","display_name":"Amos Fiat","orcid":"https://orcid.org/0000-0002-5748-9519","observed_orcids":["https://orcid.org/0000-0002-5748-9519"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amos Fiat","raw_affiliation_strings":["Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5748-9519","affiliations":[{"raw_affiliation_string":"Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7241,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.86624204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"574","last_page":"583"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9740999937057495,"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.9740999937057495,"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.0038999998942017555,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.003700000001117587,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/file-allocation","display_name":"file allocation","score":0.640999972820282},{"id":"https://openalex.org/keywords/competitive-algorithms","display_name":"competitive algorithms","score":0.5870000123977661},{"id":"https://openalex.org/keywords/communication-overhead","display_name":"communication overhead","score":0.7429999709129333},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.5789999961853027},{"id":"https://openalex.org/keywords/network-diameter","display_name":"network diameter","score":0.5740000009536743}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9747248888015747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7863382697105408},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5820189714431763},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5507298111915588},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47835367918014526},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4688844382762909},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4163113236427307},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14722320437431335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.111867755651474},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2009239786","doi":"https://doi.org/10.5555/313852.314122","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda96.html#AwerbuchBF96","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,"listed_in":[],"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":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1486124781","https://openalex.org/W1542146080","https://openalex.org/W1562244673","https://openalex.org/W1572397493","https://openalex.org/W1809141069","https://openalex.org/W2003016446","https://openalex.org/W2011670396","https://openalex.org/W2026102701","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2082859480","https://openalex.org/W2099119031","https://openalex.org/W2138816444","https://openalex.org/W2293001982","https://openalex.org/W2396766219"],"related_works":["https://openalex.org/W7096814665","https://openalex.org/W2107144517","https://openalex.org/W2058506754","https://openalex.org/W885600087","https://openalex.org/W7098276240","https://openalex.org/W2047657708","https://openalex.org/W1972442117","https://openalex.org/W2030810980","https://openalex.org/W3103769125","https://openalex.org/W2103345809"],"abstract_inverted_index":{"Distributed":[0],"paging":[1,50,67,87],"deals":[2,33,68],"with":[3,34,69],"the":[4,18,35,48,53,70,74,84,106,113,116],"dynamic":[5],"allocation":[6,37],"of":[7,9,25,76,109,115],"copies":[8],"files":[10],"in":[11,73,96,105],"a":[12,23,77],"distributed":[13,49,66,86],"network":[14,79,110],"as":[15],"to":[16],"minimize":[17],"total":[19,107],"communication":[20],"cost":[21],"over":[22],"sequence":[24],"read":[26],"and":[27,98,112],"write":[28],"requests.":[29],"Most":[30],"previous":[31],"work":[32,64],"file":[36],"problem":[38,51,71],"where":[39],"infinite":[40],"nodal":[41,58],"memory":[42,59],"capacity":[43,60],"is":[44,61,94],"assumed.":[45],"In":[46],"contrast":[47],"makes":[52],"more":[54],"realistic":[55],"assumption":[56],"that":[57],"limited.":[62],"Former":[63],"on":[65],"only":[72],"case":[75],"uniform":[78],"topology.":[80],"This":[81],"paper":[82],"gives":[83],"first":[85],"algorithm":[88,93],"for":[89],"general":[90],"networks.":[91],"The":[92,100],"competitive":[95,101],"storage":[97],"communication.":[99],"ratios":[102],"are":[103],"poly-logarithmic":[104],"number":[108],"nodes":[111],"diameter":[114],"network.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2009239786","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
