乐胖代购免代理版

{"id":"https://openalex.org/W3013722846","doi":"https://doi.org/10.4230/lipics.opodis.2019.35","title":"Massively Parallel Approximate Distance Sketches.","display_name":"Massively Parallel Approximate Distance Sketches.","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3013722846","doi":"https://doi.org/10.4230/lipics.opodis.2019.35","mag":"3013722846"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.4230/LIPIcs.OPODIS.2019.35","pdf_url":null,"source":{"id":"https://openalex.org/S4306419773","display_name":"International Conference on Principles of Distributed Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"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},"type":"article","type_crossref":"proceedings-article","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/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"funder","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University, Baltimore, United States"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, United States","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"funder","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yasamin Nazari","raw_affiliation_strings":["Johns Hopkins University, Baltimore, United States"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, United States","institution_ids":["https://openalex.org/I145311948"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.855,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.810402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997,"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.9997,"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.9978,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9961,"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/constant","display_name":"Constant (computer programming)","score":0.46734244},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.41503546}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74236625},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6522652},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5968832},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4687835},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46734244},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.44853336},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43985873},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43869454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42619053},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.41503546},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41421235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38400647},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3223414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22065699},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20564154},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.4230/LIPIcs.OPODIS.2019.35","pdf_url":null,"source":{"id":"https://openalex.org/S4306419773","display_name":"International Conference on Principles of Distributed Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"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}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3152529346","https://openalex.org/W3043093646","https://openalex.org/W2999068266","https://openalex.org/W2982781920","https://openalex.org/W2924926522","https://openalex.org/W2804416765","https://openalex.org/W2776111721","https://openalex.org/W2727493172","https://openalex.org/W2400182687","https://openalex.org/W2305299305","https://openalex.org/W2284316579","https://openalex.org/W2268320119","https://openalex.org/W2217243206","https://openalex.org/W2201539200","https://openalex.org/W2171339242","https://openalex.org/W2081843224","https://openalex.org/W2025718141","https://openalex.org/W1581307531","https://openalex.org/W1540917933","https://openalex.org/W1532914766"],"abstract_inverted_index":{"Data":[0],"structures":[1,120],"that":[2,81,98,106,116],"allow":[3],"efficient":[4,58],"distance":[5,9,85,100,136],"estimation":[6],"(distance":[7],"oracles,":[8],"sketches,":[10],"etc.)":[11],"have":[12],"been":[13],"extensively":[14],"studied,":[15],"and":[16,24,49,95,147],"are":[17,69,138],"particularly":[18],"well":[19],"studied":[20],"in":[21,35,60,125,171],"centralized":[22],"models":[23,27,41],"classical":[25],"distributed":[26,43],"such":[28,155],"as":[29,156],"CONGEST.":[30],"We":[31,56],"initiate":[32],"their":[33],"study":[34],"newer":[36],"(and":[37],"arguably":[38],"more":[39],"realistic)":[40],"of":[42,62,93,142,145],"computation:":[44],"the":[45,50,112,143,157,172],"Congested":[46],"Clique":[47],"model":[48],"Massively":[51],"Parallel":[52],"Computation":[53],"(MPC)":[54],"model.":[55],"provide":[57],"constructions":[59],"both":[61],"these":[63],"models,":[64],"but":[65,87,105],"our":[66],"core":[67],"results":[68],"for":[70,162,168],"MPC.":[71,126],"In":[72,127],"MPC":[73,140,175],"we":[74,114,132],"give":[75],"two":[76],"main":[77],"results:":[78],"an":[79,96,139],"algorithm":[80,97,161],"constructs":[82,99],"stretch/space":[83],"optimal":[84],"sketches":[86,101,137],"takes":[88,108],"a":[89],"(small)":[90],"polynomial":[91],"number":[92],"rounds,":[94],"with":[102],"worse":[103],"stretch":[104],"only":[107],"polylogarithmic":[109,159],"rounds.":[110],"\r\nAlong":[111],"way,":[113],"show":[115],"other":[117],"useful":[118],"combinatorial":[119],"can":[121],"also":[122],"be":[123],"computed":[124],"particular,":[128],"one":[129],"key":[130],"component":[131],"use":[133],"to":[134],"construct":[135],"construction":[141],"hopsets":[144],"[Elkin":[146],"Neiman,":[148],"2016].":[149],"This":[150],"result":[151],"has":[152],"additional":[153],"applications":[154],"first":[158],"time":[160],"constant":[163],"approximate":[164],"single-source":[165],"shortest":[166],"paths":[167],"weighted":[169],"graphs":[170],"low":[173],"memory":[174],"setting.":[176]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3013722846","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-04-16T20:38:30.210902","created_date":"2020-04-03"}