{"id":"https://openalex.org/W2068667363","doi":"https://doi.org/10.1145/1582716.1582766","title":"Brief announcement","display_name":"Brief announcement","publication_year":2009,"publication_date":"2009-08-10","ids":{"openalex":"https://openalex.org/W2068667363","doi":"https://doi.org/10.1145/1582716.1582766","mag":"2068667363"},"language":"en","primary_location":{"id":"doi:10.1145/1582716.1582766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582716.1582766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM symposium on Principles of distributed computing","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/A5012368916","display_name":"Alex Kipnis","orcid":null},"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":"Alex Kipnis","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016261142","display_name":"Boaz Patt-Shamir","orcid":"https://orcid.org/0000-0001-8398-8218"},"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":"Boaz Patt-Shamir","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012368916"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12558345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"282","last_page":"283"},"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.9987000226974487,"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.9987000226974487,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7965265512466431},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7155664563179016},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6980034708976746},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6847380995750427},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6555259823799133},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5231372714042664},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5092908143997192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5054030418395996},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49730780720710754},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.490479439496994},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4899222254753113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.467459499835968},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4655761122703552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44837555289268494},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2120659351348877},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14269572496414185}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7965265512466431},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7155664563179016},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6980034708976746},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6847380995750427},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6555259823799133},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5231372714042664},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5092908143997192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5054030418395996},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49730780720710754},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.490479439496994},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4899222254753113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.467459499835968},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4655761122703552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44837555289268494},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2120659351348877},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14269572496414185},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1582716.1582766","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582716.1582766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Gender equality","id":"https://metadata.un.org/sdg/5","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W85190113","https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W1984090926","https://openalex.org/W1998137177","https://openalex.org/W2015819397","https://openalex.org/W2030863680","https://openalex.org/W2032607682","https://openalex.org/W2068115726","https://openalex.org/W2079931475","https://openalex.org/W2091887239","https://openalex.org/W2140097968"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2392835431","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W1639030016","https://openalex.org/W2551103479","https://openalex.org/W4380875778","https://openalex.org/W119245487"],"abstract_inverted_index":{"In":[0,53],"the":[1,5,22,54,64,91,101,114,119,127,148],"stable":[2,44,71,92],"marriage":[3,93],"problem,":[4],"communication":[6,65,98],"graph":[7],"is":[8,28,42,113,141,174,191],"undirected":[9],"and":[10,12],"bipartite,":[11],"each":[13,34,61],"node":[14],"ranks":[15],"its":[16],"neighbors.":[17],"Given":[18],"a":[19,24,70,139,182],"matching":[20,41],"of":[21,26,107,116,150],"nodes,":[23],"pair":[25,140],"nodes":[27,57,117],"called":[29,43,142],"blocking":[30,51,132],"if":[31,45,76,126,144],"they":[32,68,145],"prefer":[33],"other":[35],"to":[36,170,177],"their":[37,151],"assigned":[38],"match.":[39],"A":[40],"it":[46],"does":[47],"not":[48],"induce":[49],"any":[50,86],"pair.":[52],"distributed":[55,87,184],"model,":[56],"exchange":[58],"messages":[59,77],"in":[60,100,118],"round":[62],"over":[63],"links,":[66],"until":[67],"find":[69],"matching.":[72],"We":[73,134,179],"show":[74],"that":[75,89],"may":[78,129],"contain":[79,130],"at":[80],"most":[81],"B":[82],"bits":[83],"each,":[84],"then":[85],"algorithm":[88,185],"solves":[90],"problem":[94],"requires":[95],"\u03a9(\u221an/Blog":[96],"n)":[97],"rounds":[99],"worst":[102],"case,":[103],"even":[104,125],"for":[105,159,186],"graphs":[106],"diameter":[108],"\u0398(log":[109],"n),":[110],"where":[111,138,172],"n":[112],"number":[115],"graph.":[120],"The":[121],"lower":[122,167],"bound":[123,168],"holds":[124],"output":[128],"O(\u221an)":[131],"pairs.":[133],"also":[135,180],"consider":[136],"\u03b5-stability,":[137],"\u03b5-blocking":[143],"can":[146],"improve":[147],"quality":[149],"match":[152],"by":[153],"more":[154],"than":[155],"an":[156],"\u03b5":[157,163,173],"fraction,":[158],"some":[160],"0":[161],"\u2264":[162,164],"1.":[165],"Our":[166],"extends":[169],"\u03b5-stability":[171,187],"arbitrarily":[175],"close":[176],"1/2.":[178],"present":[181],"simple":[183],"whose":[188],"time":[189],"complexity":[190],"O(n/\u03b5).":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}