{"id":"https://openalex.org/W1965765215","doi":"https://doi.org/10.1137/s0097539793250767","title":"Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds","display_name":"Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W1965765215","doi":"https://doi.org/10.1137/s0097539793250767","mag":"1965765215"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793250767","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250767","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alessandro Panconesi","raw_affiliation_strings":["Freie Universit\u00e4t Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.057,"has_fulltext":false,"cited_by_count":278,"citation_normalized_percentile":{"value":0.90381088,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"26","issue":"2","first_page":"350","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9972000122070312,"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/chernoff-bound","display_name":"Chernoff bound","score":0.8151203989982605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.654956579208374},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.6467579007148743},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5826422572135925},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.559186577796936},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5452821850776672},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5168483853340149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5013136863708496},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5006828308105469},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.47724270820617676},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.431062787771225},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4224485754966736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3443838357925415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2677032947540283},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17761126160621643},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1417628526687622}],"concepts":[{"id":"https://openalex.org/C14539891","wikidata":"https://www.wikidata.org/wiki/Q1070305","display_name":"Chernoff bound","level":2,"score":0.8151203989982605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.654956579208374},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.6467579007148743},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5826422572135925},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.559186577796936},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5452821850776672},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5168483853340149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5013136863708496},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5006828308105469},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.47724270820617676},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.431062787771225},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4224485754966736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3443838357925415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2677032947540283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17761126160621643},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1417628526687622},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539793250767","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793250767","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/99392","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/99392","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"},{"id":"pmh:oai:ecommons.cornell.edu:1813/6127","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/6127","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"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":"technical report"},{"id":"pmh:oai:iris.uniroma1.it:11573/41434","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/41434","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1507391007","https://openalex.org/W1564095107","https://openalex.org/W1977066974","https://openalex.org/W1977820641","https://openalex.org/W1982513108","https://openalex.org/W2002272911","https://openalex.org/W2042587503","https://openalex.org/W2054910423","https://openalex.org/W2057128446","https://openalex.org/W2063844956","https://openalex.org/W2068871408","https://openalex.org/W2089828587","https://openalex.org/W2103012681","https://openalex.org/W2118288908","https://openalex.org/W2152453230","https://openalex.org/W2158219072","https://openalex.org/W2799004609","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W151506147","https://openalex.org/W4311345810","https://openalex.org/W4294957130","https://openalex.org/W4291316360","https://openalex.org/W2793500002","https://openalex.org/W2046652778","https://openalex.org/W4229960859","https://openalex.org/W4297911588","https://openalex.org/W4385455827","https://openalex.org/W3169197204"],"abstract_inverted_index":{"Certain":[0],"types":[1,166],"of":[2,36,44,89,110,125,167,181],"routing,":[3],"scheduling,":[4],"and":[5,21,51,184],"resource-allocation":[6],"problems":[7],"in":[8,30,80,140],"a":[9,28,45,100],"distributed":[10,33],"setting":[11],"can":[12],"be":[13],"modeled":[14],"as":[15],"edge-coloring":[16],"problems.":[17],"We":[18,175],"present":[19],"fast":[20],"simple":[22,101],"randomized":[23],"algorithms":[24,39],"for":[25,72,117],"edge":[26,42],"coloring":[27,43],"graph":[29,46],"the":[31,87,93,108,122,161],"synchronous":[32],"point-to-point":[34],"model":[35],"computation.":[37],"Our":[38,158],"compute":[40],"an":[41],"G":[47],"with":[48,55,65],"n":[49],"nodes":[50],"maximum":[52],"degree":[53],"$\\Delta$":[54],"at":[56],"most":[57],"$1.6":[58],"\\Delta":[59,95],"+":[60],"O(\\log^{1+":[61],"\\delta}":[62],"n)$":[63],"colors":[64,90],"high":[66],"probability":[67],"(arbitrarily":[68],"close":[69],"to":[70,103,164],"1)":[71],"any":[73],"fixed":[74],"$\\delta":[75],">":[76],"0$;":[77],"they":[78,145],"run":[79],"polylogarithmic":[81],"time.":[82],"The":[83,129],"upper":[84,119],"bound":[85],"on":[86,121],"number":[88],"improves":[91],"upon":[92],"$(2":[94],"-":[96],"1)$-coloring":[97],"achievable":[98],"by":[99],"reduction":[102],"vertex":[104],"coloring.":[105],"To":[106],"analyze":[107],"performance":[109],"our":[111],"algorithms,":[112],"we":[113],"introduce":[114],"new":[115],"techniques":[116],"proving":[118],"bounds":[120,131,163],"tail":[123,142],"probabilities":[124],"certain":[126,150,165],"random":[127,151,168],"variables.":[128],"Chernoff--Hoeffding":[130,162],"are":[132,136,171,180],"fundamental":[133],"tools":[134],"that":[135,177],"used":[137],"very":[138],"frequently":[139],"estimating":[141],"probabilities.":[143],"However,":[144],"assume":[146],"stochastic":[147],"independence":[148],"among":[149],"variables,":[152],"which":[153,170],"may":[154],"not":[155,172],"always":[156],"hold.":[157],"results":[159,179],"extend":[160],"variables":[169],"stochastically":[173],"independent.":[174],"believe":[176],"these":[178],"independent":[182],"interest":[183],"merit":[185],"further":[186],"study.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":19}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}