{"id":"https://openalex.org/W2781827254","doi":"https://doi.org/10.1145/3154855","title":"Access to Data and Number of Iterations","display_name":"Access to Data and Number of Iterations","publication_year":2017,"publication_date":"2017-12-31","ids":{"openalex":"https://openalex.org/W2781827254","doi":"https://doi.org/10.1145/3154855","mag":"2781827254"},"language":"en","primary_location":{"id":"doi:10.1145/3154855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3154855","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3154855","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3154855","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068326243","display_name":"Kook Jin Ahn","orcid":"https://orcid.org/0000-0001-6081-7360"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kook Jin Ahn","raw_affiliation_strings":["University of Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["University of Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068326243"],"corresponding_institution_ids":["https://openalex.org/I36788626"],"apc_list":null,"apc_paid":null,"fwci":2.1524,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89272585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"4","issue":"4","first_page":"1","last_page":"40"},"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.9998999834060669,"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.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/sublinear-function","display_name":"Sublinear function","score":0.8375247120857239},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.7996390461921692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7446608543395996},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5407779812812805},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5117628574371338},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45326635241508484},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.44095373153686523},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43022966384887695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3785824775695801},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37617993354797363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23441123962402344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22850030660629272},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.13619452714920044}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8375247120857239},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.7996390461921692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7446608543395996},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5407779812812805},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5117628574371338},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45326635241508484},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.44095373153686523},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43022966384887695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3785824775695801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37617993354797363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23441123962402344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22850030660629272},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.13619452714920044},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3154855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3154855","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3154855","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3154855","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3154855","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3154855","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1504674814","display_name":"AF: Small: Optimization Algorithms for Multi-Armed Bandit Problems","funder_award_id":"1117216","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7002994955","display_name":null,"funder_award_id":"1117216 and 1546151","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7382487697","display_name":"BIGDATA: F: Graph Sketching and Optimization Problems","funder_award_id":"1546151","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2781827254.pdf","grobid_xml":"https://content.openalex.org/works/W2781827254.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1514707655","https://openalex.org/W1564876084","https://openalex.org/W1592346261","https://openalex.org/W1595640791","https://openalex.org/W1962291245","https://openalex.org/W1964773853","https://openalex.org/W1967311985","https://openalex.org/W1996575062","https://openalex.org/W1997010704","https://openalex.org/W2000904706","https://openalex.org/W2019040312","https://openalex.org/W2037576616","https://openalex.org/W2043428092","https://openalex.org/W2048382523","https://openalex.org/W2051540665","https://openalex.org/W2053924317","https://openalex.org/W2063241141","https://openalex.org/W2083432171","https://openalex.org/W2089559088","https://openalex.org/W2093825590","https://openalex.org/W2107805020","https://openalex.org/W2123805664","https://openalex.org/W2126077878","https://openalex.org/W2134422938","https://openalex.org/W2135730283","https://openalex.org/W2145593504","https://openalex.org/W2150865801","https://openalex.org/W2153977620","https://openalex.org/W2165753192","https://openalex.org/W2167732364","https://openalex.org/W2395429576","https://openalex.org/W2570637728","https://openalex.org/W2912472068","https://openalex.org/W2952664231","https://openalex.org/W2964056228","https://openalex.org/W2988480584","https://openalex.org/W3121437753"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W4385317418","https://openalex.org/W2948826707","https://openalex.org/W4378760001"],"abstract_inverted_index":{"In":[0],"this":[1,80],"article,":[2],"we":[3,88],"consider":[4],"graph":[5],"algorithms":[6,141],"in":[7,18,26,42,47,49,79,161,183,189],"models":[8],"of":[9,29,52,100,113,150,165,170,180,194],"computation":[10],"where":[11],"the":[12,21,27,33,50,101,191,195],"space":[13],"usage":[14],"(random":[15],"accessible":[16],"storage,":[17],"addition":[19],"to":[20,35,126],"read-only":[22],"input)":[23],"is":[24,37,152],"sublinear":[25,69],"number":[28],"edges":[30],"m":[31],"and":[32,46,115,138,157],"access":[34],"input":[36],"constrained.":[38],"These":[39],"questions":[40],"arise":[41],"many":[43],"natural":[44],"settings,":[45],"particular":[48,184],"analysis":[51],"streaming":[53,166],"algorithms,":[54,58],"MapReduce":[55],"or":[56,59,167],"similar":[57],"message":[60],"passing":[61],"distributed":[62],"computing":[63,95],"that":[64,106,176],"model":[65],"constrained":[66],"parallelism":[67],"with":[68,129],"central":[70],"processing.":[71],"We":[72],"focus":[73],"on":[74,143],"weighted":[75,102],"nonbipartite":[76,103],"maximum":[77,104],"matching":[78,105],"article.":[81],"For":[82],"any":[83],"constant":[84],"p":[85,110,120],">":[86],"1,":[87],"provide":[89],"an":[90],"iterative":[91],"sampling-based":[92],"algorithm":[93],"for":[94],"a":[96,162,181],"(1":[97],"\u2212":[98],"\u03b5)-approximation":[99],"uses":[107],"O":[108,116],"(":[109,117],"/\u03b5)":[111],"rounds":[112,169],"sampling,":[114],"n":[118],"1+1/":[119],")":[121],"space.":[122],"The":[123,172],"results":[124],"extend":[125],"b":[127],"-Matching":[128],"small":[130],"changes.":[131],"This":[132],"article":[133,173],"combines":[134],"adaptive":[135,192],"sketching":[136],"literature":[137],"fast":[139],"primal-dual":[140],"based":[142],"relaxed":[144],"Dantzig-Wolfe":[145],"decision":[146],"procedures.":[147],"Each":[148],"round":[149,164],"sampling":[151],"implemented":[153],"through":[154],"linear":[155,178],"sketches":[156],"can":[158],"be":[159],"executed":[160],"single":[163],"two":[168],"MapReduce.":[171],"also":[174],"proves":[175],"nonstandard":[177],"relaxations":[179],"problem,":[182],"penalty-based":[185],"formulations,":[186],"are":[187],"helpful":[188],"reducing":[190],"dependence":[193],"iterations.":[196]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}