{"id":"https://openalex.org/W2107600509","doi":"https://doi.org/10.1145/2755573.2755586","title":"Access to Data and Number of Iterations","display_name":"Access to Data and Number of Iterations","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2107600509","doi":"https://doi.org/10.1145/2755573.2755586","mag":"2107600509"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755586","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM 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/A5068326243","display_name":"Kook Jin Ahn","orcid":"https://orcid.org/0000-0001-6081-7360"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kook Jin Ahn","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068326243"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":4.9072,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.95591143,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"202","last_page":"211"},"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.9998000264167786,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9111663103103638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7176897525787354},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5461772680282593},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5052669644355774},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4203662872314453},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3776536285877228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3644329309463501},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31452882289886475},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23533692955970764}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9111663103103638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7176897525787354},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5461772680282593},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5052669644355774},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4203662872314453},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3776536285877228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3644329309463501},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31452882289886475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23533692955970764}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2755586","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.75,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1514707655","https://openalex.org/W1564876084","https://openalex.org/W1592346261","https://openalex.org/W1595640791","https://openalex.org/W1641959094","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/W2016384870","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/W2169713291","https://openalex.org/W2294394364","https://openalex.org/W2570637728","https://openalex.org/W2594297742","https://openalex.org/W2964056228","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W2018828772","https://openalex.org/W90906771","https://openalex.org/W2529185025","https://openalex.org/W2939566708","https://openalex.org/W2052708136","https://openalex.org/W4289097813","https://openalex.org/W3082028334","https://openalex.org/W2809723425","https://openalex.org/W3173121711","https://openalex.org/W4312648365"],"abstract_inverted_index":{"In":[0,67],"this":[1],"paper":[2],"we":[3],"consider":[4],"graph":[5,95],"algorithms":[6,58],"in":[7,18,27,44,49,51],"models":[8],"of":[9,30,54,76,82,90],"computation":[10],"where":[11],"the":[12,21,28,34,52],"space":[13,89],"usage":[14],"(random":[15],"accessible":[16],"storage,":[17],"addition":[19],"to":[20,36],"read":[22],"only":[23],"input)":[24],"is":[25,39],"sublinear":[26,64],"number":[29],"edges":[31],"m":[32,100],"and":[33,48,87,99],"access":[35],"input":[37],"data":[38],"constrained.":[40],"These":[41],"questions":[42],"arises":[43],"many":[45],"natural":[46],"settings,":[47],"particular":[50],"analysis":[53],"MapReduce":[55],"or":[56],"similar":[57],"that":[59],"model":[60],"constrained":[61],"parallelism":[62],"with":[63,96],"central":[65,91],"processing.":[66],"SPAA":[68],"2011,":[69],"Lattanzi":[70],"etal.":[71],"provided":[72],"a":[73,94],"O(1)":[74],"approximation":[75],"maximum":[77],"matching":[78],"using":[79],"O(p)":[80],"rounds":[81],"iterative":[83],"filtering":[84],"via":[85],"mapreduce":[86],"O(n1+1/p)":[88],"processing":[92],"for":[93],"n":[97],"nodes":[98],"edges.":[101]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}