{"id":"https://openalex.org/W2737112087","doi":"https://doi.org/10.1145/3087556.3087601","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2737112087","doi":"https://doi.org/10.1145/3087556.3087601","mag":"2737112087"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th 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/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049873439","display_name":"Mahsa Derakhshan","orcid":"https://orcid.org/0000-0002-8147-0113"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahsa Derakhshan","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047480720","display_name":"Hossein Esfandiari","orcid":"https://orcid.org/0000-0001-8130-6631"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hossein Esfandiari","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038951879","display_name":"Elif Tan","orcid":"https://orcid.org/0000-0002-8381-8750"},"institutions":[{"id":"https://openalex.org/I149218525","display_name":"Ankara University","ror":"https://ror.org/01wntqw50","country_code":"TR","type":"education","lineage":["https://openalex.org/I149218525"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Elif Tan","raw_affiliation_strings":["Ankara University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Ankara University, Ankara, Turkey","institution_ids":["https://openalex.org/I149218525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017417730","display_name":"Hadi Yami","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hadi Yami","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5025934584"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.5898,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8501825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"136"},"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.9997000098228455,"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.9997000098228455,"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/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9983999729156494,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7900158166885376},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7131860256195068},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7112918496131897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7059028148651123},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6269359588623047},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.53817218542099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4995424747467041},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.49901461601257324},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4905771315097809},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.44015035033226013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3328374922275543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2158069610595703},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1512433886528015},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11762586236000061},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.0933389663696289}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7900158166885376},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7131860256195068},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7112918496131897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7059028148651123},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6269359588623047},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.53817218542099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4995424747467041},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.49901461601257324},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4905771315097809},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.44015035033226013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3328374922275543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2158069610595703},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1512433886528015},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11762586236000061},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0933389663696289},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087556.3087601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM 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":14,"referenced_works":["https://openalex.org/W1514707655","https://openalex.org/W1617753329","https://openalex.org/W1892864924","https://openalex.org/W1966695467","https://openalex.org/W1967311985","https://openalex.org/W2003813631","https://openalex.org/W2078020203","https://openalex.org/W2107600509","https://openalex.org/W2153977620","https://openalex.org/W2272441262","https://openalex.org/W2295466155","https://openalex.org/W4229914019","https://openalex.org/W4234540089","https://openalex.org/W4239886656"],"related_works":["https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2054458431","https://openalex.org/W2077309407","https://openalex.org/W2184969544","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W2561454982","https://openalex.org/W4295762832","https://openalex.org/W2080136900"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,104],"consider":[4],"the":[5,20,53,60,80,88,94,112,127],"maximum":[6,21,81,114],"matching":[7,22,82,115],"problem":[8],"in":[9,23,38,83,91,116],"large":[10],"bipartite":[11],"graphs.":[12],"We":[13,69],"present":[14],"a":[15,24,28,75],"new":[16],"algorithm":[17,34,54,73,99],"that":[18,71],"finds":[19,111],"few":[25],"iterations":[26],"of":[27,52,66,93,96,126],"novel":[29],"edge":[30],"sampling":[31,122],"technique.":[32],"This":[33],"can":[35],"be":[36],"implemented":[37],"big":[39],"data":[40],"settings":[41],"such":[42],"as":[43],"streaming":[44],"setting":[45],"and":[46,110],"MapReduce":[47,64],"setting,":[48],"where":[49],"each":[50],"iteration":[51],"maps":[55],"to":[56,79,118],"one":[57,63],"pass":[58],"over":[59],"stream,":[61],"or":[62],"round":[65],"computation,":[67],"respectively.":[68],"prove":[70],"our":[72],"provides":[74],"1-\\eps":[76],"approximate":[77],"solution":[78],"1/\\eps":[84],"rounds":[85,120],"which":[86],"improves":[87],"prior":[89],"work":[90],"terms":[92],"number":[95],"passes/rounds.":[97],"Our":[98],"works":[100],"even":[101],"better":[102],"when":[103],"run":[105],"it":[106],"on":[107],"real":[108],"datasets":[109],"exact":[113],"4":[117],"8":[119],"while":[121],"only":[123],"about":[124],"%1":[125],"total":[128],"edges.":[129]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-07-31T00:00:00"}