{"id":"https://openalex.org/W2963998331","doi":"https://doi.org/10.1145/3210377.3210397","title":"Dynamic Representations of Sparse Distributed Networks","display_name":"Dynamic Representations of Sparse Distributed Networks","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2963998331","doi":"https://doi.org/10.1145/3210377.3210397","mag":"2963998331"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210397","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"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":true,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shay Solomon","raw_affiliation_strings":["IBM Research, T. J. Watson Research Center, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research, T. J. Watson Research Center, New York, NY, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006699796"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.8078,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76774348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.996399998664856,"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/T11478","display_name":"Caching and Content Delivery","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8028539419174194},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5824049711227417},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5398954153060913},{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.5325663685798645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.505129873752594},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.43699201941490173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39617085456848145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32462918758392334},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.19791394472122192},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1088910698890686}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8028539419174194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5824049711227417},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5398954153060913},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.5325663685798645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.505129873752594},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.43699201941490173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39617085456848145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32462918758392334},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.19791394472122192},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1088910698890686},{"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":"doi:10.1145/3210377.3210397","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1501843896","https://openalex.org/W1568961751","https://openalex.org/W1607971719","https://openalex.org/W1992776880","https://openalex.org/W2017492483","https://openalex.org/W2018963243","https://openalex.org/W2022155283","https://openalex.org/W2030863680","https://openalex.org/W2038973759","https://openalex.org/W2041955583","https://openalex.org/W2133476289","https://openalex.org/W2138623498","https://openalex.org/W2141105412","https://openalex.org/W2149067844","https://openalex.org/W2156678048","https://openalex.org/W2182065913","https://openalex.org/W2223308607","https://openalex.org/W2268832653","https://openalex.org/W2296210868","https://openalex.org/W2534944111","https://openalex.org/W2788028333","https://openalex.org/W2963645943","https://openalex.org/W4205300528"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1973112719","https://openalex.org/W2018626253","https://openalex.org/W3013789389","https://openalex.org/W4298370844","https://openalex.org/W2507346374","https://openalex.org/W3149732382","https://openalex.org/W2066364084","https://openalex.org/W2168920762","https://openalex.org/W4287901740"],"abstract_inverted_index":{"In":[0],"1999,":[1],"Brodal":[2],"and":[3,165,230,275],"Fagerberg":[4],"(BF)":[5],"gave":[6],"an":[7,61,113,167,257,280,328],"algorithm":[8,39,88,142,248,313],"for":[9,22,68,303,314],"maintaining":[10,315],"a":[11,16,23,64,76,232,310,316],"low":[12],"outdegree":[13,53,114,225,234,289],"orientation":[14,62],"of":[15,78,85,94,115,148,161,171,180,202,245,256,266],"dynamic":[17,24,79,312],"uniformly":[18,69,324],"sparse":[19,70,325],"graph.":[20],"Specifically,":[21],"graph":[25,56,80],"on":[26,291],"n":[27],"-vertices,":[28],"with":[29,319],"arboricity":[30,195],"bounded":[31,57,152,192],"by":[32,58,153,193],"\u03b1":[33],"at":[34,124,155,189],"all":[35,105,149,156],"times,":[36,157],"the":[37,51,55,86,90,95,118,125,140,146,172,177,185,194,199,203,208,223,228,241,246,264,292,300,332],"BF":[38,87,102,141,247,301],"supports":[40],"edge":[41,99,258],"updates":[42],"in":[43,54,130,183,263,323,334],"$O(\u0142og":[44],"n)$":[45],"amortized":[46],"update":[47,321],"time,":[48],"while":[49],"keeping":[50],"maximum":[52,96,209],"$O(\u03b1)$.":[59],"Such":[60],"provides":[63,176],"basic":[65],"data":[66],"structure":[67],"graphs,":[71],"which":[72,184,284],"found":[73],"applications":[74],"to":[75,107,138,143,227,239],"plethora":[77],"algorithms.":[81],"A":[82],"significant":[83,243],"weakness":[84,244],"is":[89,191,197,215,295],"possible":[91],"temporary":[92,224],"blowup":[93,226],"outdegree,":[97],"following":[98],"insertions.":[100],"Although":[101],"eventually":[103],"reduces":[104],"outdegrees":[106,147],"$O(\u03b1)$,":[108],"some":[109,304],"vertices":[110,150,190],"may":[111,221,260],"reach":[112],"$\u00d8mega(n)$":[116],"during":[117],"process,":[119],"hence":[120],"local":[121,186,217,282,311],"memory":[122,187,218],"usage":[123,188],"vertices--an":[126],"important":[127],"quality":[128],"measure":[129],"distributed":[131,169,181],"systems--cannot":[132],"be":[133],"bounded.":[134],"We":[135,278],"show":[136],"how":[137],"modify":[139],"guarantee":[144,287],"that":[145,268],"are":[151,269],"$O(\u03b1)$":[154],"without":[158],"hurting":[159],"any":[160,288],"its":[162,250],"other":[163],"properties,":[164],"present":[166],"efficient":[168,298],"implementation":[170],"modified":[173],"algorithm.":[174],"This":[175,236],"first":[178],"representation":[179],"networks":[182],"(which":[196],"essentially":[198],"average":[200],"degree":[201],"densest":[204],"subgraph)":[205],"rather":[206],"than":[207],"degree.":[210],"For":[211,306],"settings":[212],"where":[213],"there":[214],"no":[216],"constraints,":[219],"one":[220],"take":[222],"extreme":[229],"allow":[231],"permanent":[233],"blowup.":[235],"allows":[237],"us":[238],"address":[240],"second":[242],"--":[249],"inherently":[251],"global":[252],"nature:":[253],"An":[254],"insertion":[255],"$(u,v)$":[259],"trigger":[261],"changes":[262],"orientations":[265],"edges":[267],"arbitrarily":[270],"far":[271],"away":[272],"from":[273],"u":[274],"v":[276],".":[277],"suggest":[279],"alternative":[281],"scheme,":[283],"does":[285],"not":[286],"bound":[290],"vertices,":[293],"yet":[294],"just":[296],"as":[297,299],"scheme":[302],"applications.":[305],"example,":[307],"we":[308],"obtain":[309],"maximal":[317],"matching":[318],"sub-logarithmic":[320],"time":[322],"networks,":[326],"providing":[327],"exponential":[329],"improvement":[330],"over":[331],"state-of-the-art":[333],"this":[335],"context.":[336]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}