{"id":"https://openalex.org/W4282006258","doi":"https://doi.org/10.1145/3519935.3520039","title":"Deterministic (1+ <i>\ud835\udf00</i> )-approximate maximum matching with poly(1/ <i>\ud835\udf00</i> ) passes in the semi-streaming model and beyond","display_name":"Deterministic (1+ <i>\ud835\udf00</i> )-approximate maximum matching with poly(1/ <i>\ud835\udf00</i> ) passes in the semi-streaming model and beyond","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4282006258","doi":"https://doi.org/10.1145/3519935.3520039"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520039","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520039","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520039","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011857597","display_name":"Manuela Fischer","orcid":"https://orcid.org/0000-0002-0125-8957"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Manuela Fischer","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["University of California at Davis, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064067007","display_name":"Jara Uitto","orcid":"https://orcid.org/0000-0002-5179-5056"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jara Uitto","raw_affiliation_strings":["Aalto University, Finland"],"affiliations":[{"raw_affiliation_string":"Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011857597"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.6596,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85603636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"248","last_page":"260"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"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.785210132598877},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6172093749046326},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5923348069190979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5815525650978088},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5008840560913086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4952189028263092},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4816364347934723},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4744373857975006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4335261285305023},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.42410123348236084},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.4173656404018402},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41488611698150635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32450711727142334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14722618460655212},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1051064133644104},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07170790433883667}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.785210132598877},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6172093749046326},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5923348069190979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5815525650978088},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5008840560913086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4952189028263092},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4816364347934723},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4744373857975006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4335261285305023},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.42410123348236084},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.4173656404018402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41488611698150635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32450711727142334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14722618460655212},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1051064133644104},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07170790433883667}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3519935.3520039","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520039","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520039","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/557168","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/557168","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/117182","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/1dbd100e-b944-4835-95e1-a444c68d50d2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.3929/ethz-b-000557168","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000557168","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1145/3519935.3520039","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3520039","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3520039","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1814920686","display_name":null,"funder_award_id":"334238","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"},{"id":"https://openalex.org/G8394205703","display_name":"Massively Parallel Algorithms for Large-Scale Graph Problems","funder_award_id":"334238","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4282006258.pdf","grobid_xml":"https://content.openalex.org/works/W4282006258.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1498807656","https://openalex.org/W1983266860","https://openalex.org/W1995484833","https://openalex.org/W2009070933","https://openalex.org/W2016289973","https://openalex.org/W2047281923","https://openalex.org/W2079669094","https://openalex.org/W2157523155","https://openalex.org/W2157529519","https://openalex.org/W2275325805","https://openalex.org/W2327315803","https://openalex.org/W2762990162","https://openalex.org/W2781827254","https://openalex.org/W2788362138","https://openalex.org/W2889287172","https://openalex.org/W2889345925","https://openalex.org/W2928570649","https://openalex.org/W2963298291","https://openalex.org/W2988480584","https://openalex.org/W3001104546","https://openalex.org/W3100080045","https://openalex.org/W3101104511","https://openalex.org/W3165922329","https://openalex.org/W3181145973","https://openalex.org/W4205734203","https://openalex.org/W4206353945","https://openalex.org/W4206587147","https://openalex.org/W4229488000","https://openalex.org/W4229720786","https://openalex.org/W4233756358","https://openalex.org/W4234540089","https://openalex.org/W4246633356","https://openalex.org/W4285518354"],"related_works":["https://openalex.org/W2997750571","https://openalex.org/W2991208421","https://openalex.org/W3004355975","https://openalex.org/W4307416302","https://openalex.org/W4313227037","https://openalex.org/W339301305","https://openalex.org/W2913308506","https://openalex.org/W2958647165","https://openalex.org/W4288280883","https://openalex.org/W2565109825"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,85],"deterministic":[3,49,70],"(1+\u03b5)-approximate":[4],"maximum":[5],"matching":[6],"algorithm":[7,31,39,50,76],"in":[8,11,25,63],"poly(1/\u03b5)":[9],"passes":[10],"the":[12,16,22,26,35,41,47,54,68,88,99],"semi-streaming":[13],"model,":[14],"solving":[15],"long-standing":[17],"open":[18],"problem":[19],"of":[20,90],"breaking":[21],"exponential":[23],"barrier":[24],"dependence":[27,86],"on":[28,34,87,98],"1/\u03b5.":[29],"Our":[30,93],"exponentially":[32],"improves":[33],"well-known":[36],"randomized":[37],"(1/\u03b5)O(1/\u03b5)-pass":[38],"from":[40],"seminal":[42],"work":[43,66],"by":[44,51,77],"McGregor":[45],"[APPROX05],":[46],"recent":[48],"Tirodkar":[52],"with":[53],"same":[55],"pass":[56],"complexity":[57],"[FSTTCS18].":[58],"Up":[59],"to":[60],"polynomial":[61],"factors":[62],"1/\u03b5,":[64],"our":[65],"matches":[67],"state-of-the-art":[69],"(logn":[71],"/":[72],"loglogn)":[73],"\u00b7":[74],"(1/\u03b5)-pass":[75],"Ahn":[78],"and":[79],"Guha":[80],"[TOPC18],":[81],"that":[82],"is":[83],"allowed":[84],"number":[89],"nodes":[91],"n.":[92],"result":[94],"also":[95],"makes":[96],"progress":[97],"Open":[100],"Problem":[101],"60":[102],"at":[103],"sublinear.info.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":8}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}