{"id":"https://openalex.org/W2983076835","doi":"https://doi.org/10.1145/3357713.3384258","title":"Rounding dynamic matchings against an adaptive adversary","display_name":"Rounding dynamic matchings against an adaptive adversary","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W2983076835","doi":"https://doi.org/10.1145/3357713.3384258","mag":"2983076835"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384258","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384258","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033052575","display_name":"David Wajc","orcid":"https://orcid.org/0000-0003-1896-2948"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David Wajc","raw_affiliation_strings":["Carnegie Mellon University, USA","Carnegie -Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie -Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033052575"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.3372,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.3936991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"207"},"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.9994999766349792,"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.9994999766349792,"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/T10237","display_name":"Cryptography and Data Security","score":0.9958999752998352,"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/T12288","display_name":"Optimization and Search Problems","score":0.9894999861717224,"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/rounding","display_name":"Rounding","score":0.7896081209182739},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6891568899154663},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6630886197090149},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6107156276702881},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5376002192497253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5127485990524292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.500723123550415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41075098514556885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3649625778198242},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36003321409225464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33832409977912903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08559870719909668}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7896081209182739},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6891568899154663},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6630886197090149},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6107156276702881},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5376002192497253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5127485990524292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.500723123550415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41075098514556885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3649625778198242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36003321409225464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33832409977912903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08559870719909668},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3357713.3384258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384258","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1911.05545","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.05545","pdf_url":"https://arxiv.org/pdf/1911.05545","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2983076835","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1911.05545","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1911.05545","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1911.05545","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384258","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G142137482","display_name":"CAREER: A Theory of Error Correction for Interactive Communication","funder_award_id":"1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2547690212","display_name":null,"funder_award_id":"CCF-1910588, CCF-1814603, CCF-1750808, CCF-1618280, CCF-1527110","funder_id":"https://openalex.org/F4320315254","funder_display_name":"Innovative Research Group Project of the National Natural Science Foundation of China"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5454242832","display_name":"CCF-BSF: AF: Small: Coding for Distributed Computing","funder_award_id":"1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G99399730","display_name":"AF: Small: Distributed Optimization Beyond Worst Case Topologies","funder_award_id":"1910588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"},{"id":"https://openalex.org/F4320315254","display_name":"Innovative Research Group Project of the National Natural Science Foundation of China","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2983076835.pdf","grobid_xml":"https://content.openalex.org/works/W2983076835.grobid-xml"},"referenced_works_count":85,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1582032289","https://openalex.org/W1639030016","https://openalex.org/W1934874173","https://openalex.org/W1966695467","https://openalex.org/W1984416451","https://openalex.org/W1992869351","https://openalex.org/W2003813631","https://openalex.org/W2009695707","https://openalex.org/W2010151376","https://openalex.org/W2031592993","https://openalex.org/W2039303552","https://openalex.org/W2045430818","https://openalex.org/W2063860324","https://openalex.org/W2065295938","https://openalex.org/W2096413587","https://openalex.org/W2117595194","https://openalex.org/W2122205547","https://openalex.org/W2133476289","https://openalex.org/W2146343385","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2157529519","https://openalex.org/W2226187912","https://openalex.org/W2244920958","https://openalex.org/W2261727491","https://openalex.org/W2275325805","https://openalex.org/W2341465683","https://openalex.org/W2360215740","https://openalex.org/W2395489635","https://openalex.org/W2418286382","https://openalex.org/W2492999734","https://openalex.org/W2546514055","https://openalex.org/W2550458906","https://openalex.org/W2568420557","https://openalex.org/W2569455249","https://openalex.org/W2570014581","https://openalex.org/W2571471359","https://openalex.org/W2617896681","https://openalex.org/W2748968962","https://openalex.org/W2768300210","https://openalex.org/W2768321248","https://openalex.org/W2772608424","https://openalex.org/W2777690836","https://openalex.org/W2782624220","https://openalex.org/W2788015272","https://openalex.org/W2792298309","https://openalex.org/W2809141942","https://openalex.org/W2892998653","https://openalex.org/W2900273937","https://openalex.org/W2902629052","https://openalex.org/W2944892467","https://openalex.org/W2949936571","https://openalex.org/W2949942995","https://openalex.org/W2950039944","https://openalex.org/W2952708184","https://openalex.org/W2962761621","https://openalex.org/W2963123599","https://openalex.org/W2963307370","https://openalex.org/W2963365235","https://openalex.org/W2963562941","https://openalex.org/W2963947965","https://openalex.org/W2964007887","https://openalex.org/W2964193429","https://openalex.org/W2971415725","https://openalex.org/W2971658570","https://openalex.org/W2972193181","https://openalex.org/W2990730306","https://openalex.org/W2996765263","https://openalex.org/W2998265589","https://openalex.org/W3083570594","https://openalex.org/W3099044340","https://openalex.org/W3099608475","https://openalex.org/W3100080045","https://openalex.org/W3101090353","https://openalex.org/W3103340610","https://openalex.org/W3127776752","https://openalex.org/W4229488000","https://openalex.org/W4231005436","https://openalex.org/W4235789583","https://openalex.org/W4250173201","https://openalex.org/W4250448245","https://openalex.org/W6649888732","https://openalex.org/W6658214496","https://openalex.org/W6746524276"],"related_works":["https://openalex.org/W3035470141","https://openalex.org/W2770134246","https://openalex.org/W3132472994","https://openalex.org/W3209599230","https://openalex.org/W1871674993","https://openalex.org/W3168557774","https://openalex.org/W134115560","https://openalex.org/W3083827796","https://openalex.org/W2762990162","https://openalex.org/W2797802770","https://openalex.org/W2913890173","https://openalex.org/W3179089435","https://openalex.org/W2001949479","https://openalex.org/W3002868299","https://openalex.org/W2949846835","https://openalex.org/W1604332079","https://openalex.org/W2914837010","https://openalex.org/W3183908104","https://openalex.org/W2736305340","https://openalex.org/W2147264036"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,13,55,71],"new":[3],"dynamic":[4,26,37,60],"matching":[5,28,38],"sparsification":[6],"scheme.":[7],"From":[8],"this":[9,52],"scheme":[10],"we":[11,33],"derive":[12],"framework":[14],"for":[15,51,66],"dynamically":[16],"rounding":[17],"fractional":[18,27],"matchings":[19],"against":[20,42,62,113],"adaptive":[21,43,63,114],"adversaries.":[22,44,115],"Plugging":[23],"in":[24,88],"known":[25,109],"algorithms":[29,39,50,61,87],"into":[30],"our":[31],"framework,":[32],"obtain":[34],"numerous":[35],"randomized":[36,49],"which":[40],"work":[41],"In":[45],"contrast,":[46],"all":[47],"previous":[48],"problem":[53],"assumed":[54],"weaker,":[56],"oblivious,":[57],"adversary.":[58],"Our":[59],"adversaries":[64],"include,":[65],"any":[67],"constant":[68,75],"\u0454":[69],">0,":[70],"(2+\u0454)-approximate":[72],"algorithm":[73],"with":[74,91],"update":[76,81,94,102],"time":[77,103],"or":[78],"polylog":[79],"worst-case":[80],"time,":[82],"as":[83,85],"well":[84],"(2\u2212\u03b4)-approximate":[86],"bipartite":[89],"graphs":[90],"arbitrarily-small":[92],"polynomial":[93],"time.":[95],"All":[96],"these":[97],"results":[98],"achieve":[99],"polynomially":[100],"better":[101],"to":[104,110],"approximation":[105],"trade-offs":[106],"than":[107],"previously":[108],"be":[111],"achievable":[112]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}