{"id":"https://openalex.org/W3214604542","doi":"https://doi.org/10.1145/3519935.3519986","title":"Online edge coloring via tree recurrences and correlation decay","display_name":"Online edge coloring via tree recurrences and correlation decay","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3214604542","doi":"https://doi.org/10.1145/3519935.3519986","mag":"3214604542"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519986","pdf_url":null,"source":null,"license":null,"license_id":null,"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":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/146421","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang P. Liu","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036739756","display_name":"Ashwin Sah","orcid":"https://orcid.org/0000-0003-3438-5175"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashwin Sah","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030299401","display_name":"Mehtaab Sawhney","orcid":"https://orcid.org/0009-0002-3238-7134"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehtaab Sawhney","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076652577","display_name":"Jakub Tarnawski","orcid":"https://orcid.org/0000-0001-6175-5827"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jakub Tarnawski","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5043137436"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.8564,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73437467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"104","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9955000281333923,"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/conjecture","display_name":"Conjecture","score":0.6957187056541443},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5819876790046692},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5678238272666931},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5532830357551575},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.550849437713623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5437511205673218},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5183490514755249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5040144324302673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4614713191986084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45041462779045105},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39549368619918823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3361431360244751},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1614002287387848},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10538464784622192},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09960052371025085}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6957187056541443},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5819876790046692},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5678238272666931},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5532830357551575},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.550849437713623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5437511205673218},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5183490514755249},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5040144324302673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4614713191986084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45041462779045105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39549368619918823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3361431360244751},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1614002287387848},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10538464784622192},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09960052371025085},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3519935.3519986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3519986","pdf_url":null,"source":null,"license":null,"license_id":null,"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:dspace.mit.edu:1721.1/146421","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/146421","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1728703596","https://openalex.org/W1976445742","https://openalex.org/W1986826668","https://openalex.org/W2004724832","https://openalex.org/W2013427304","https://openalex.org/W2078220608","https://openalex.org/W2097823813","https://openalex.org/W2102669784","https://openalex.org/W2113770815","https://openalex.org/W2131951207","https://openalex.org/W2155597422","https://openalex.org/W2162656786","https://openalex.org/W2165076510","https://openalex.org/W2182496581","https://openalex.org/W2183531780","https://openalex.org/W2296003088","https://openalex.org/W2401584318","https://openalex.org/W2777690836","https://openalex.org/W2937256518","https://openalex.org/W2938069350","https://openalex.org/W2949729746","https://openalex.org/W2972193181","https://openalex.org/W3042338675","https://openalex.org/W3102794847","https://openalex.org/W3114381360","https://openalex.org/W3128814395","https://openalex.org/W3180870818","https://openalex.org/W3184791170","https://openalex.org/W4247154108","https://openalex.org/W4247564011"],"related_works":["https://openalex.org/W2380525562","https://openalex.org/W4291316360","https://openalex.org/W2163432100","https://openalex.org/W3169197204","https://openalex.org/W1542397451","https://openalex.org/W4229747356","https://openalex.org/W4311345810","https://openalex.org/W3187209459","https://openalex.org/W2152008865","https://openalex.org/W4296859768"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"online":[3,27],"algorithm":[4,49],"that":[5],"with":[6,20],"high":[7],"probability":[8],"computes":[9],"a":[10,17,55,65],"(e/e\u22121":[11],"+":[12],"o(1))\u0394":[13],"edge":[14,28],"coloring":[15],"on":[16,36,52,58],"graph":[18],"G":[19],"maximum":[21],"degree":[22],"\u0394":[23],"=":[24],"\u03c9(logn)":[25],"under":[26],"arrivals":[29],"against":[30],"oblivious":[31],"adversaries,":[32],"making":[33],"first":[34],"progress":[35],"the":[37],"conjecture":[38],"of":[39],"Bar-Noy,":[40],"Motwani,":[41],"and":[42,62],"Naor":[43],"in":[44],"this":[45],"general":[46],"setting.":[47],"Our":[48],"is":[50],"based":[51,68],"reducing":[53],"to":[54],"matching":[56],"problem":[57],"locally":[59],"treelike":[60],"graphs,":[61],"then":[63],"applying":[64],"tree":[66],"recurrences":[67],"approach":[69],"for":[70],"arguing":[71],"correlation":[72],"decay.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}