{"id":"https://openalex.org/W4379135613","doi":"https://doi.org/10.1145/3584372.3588681","title":"Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms","display_name":"Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms","publication_year":2023,"publication_date":"2023-06-02","ids":{"openalex":"https://openalex.org/W4379135613","doi":"https://doi.org/10.1145/3584372.3588681"},"language":"en","primary_location":{"id":"doi:10.1145/3584372.3588681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3584372.3588681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","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/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052956226","display_name":"Prantar Ghosh","orcid":"https://orcid.org/0009-0006-9172-6553"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prantar Ghosh","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058368268","display_name":"Manuel Stoeckl","orcid":"https://orcid.org/0000-0001-8189-0516"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manuel Stoeckl","raw_affiliation_strings":["Dartmouth College, Hanover, NH, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":1.573,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85454002,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"153"},"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.9983999729156494,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9957000017166138,"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/graph-coloring","display_name":"Graph coloring","score":0.8161618113517761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6637197732925415},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5705970525741577},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5506911277770996},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5389758944511414},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.48324522376060486},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4298687279224396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.428202360868454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4043535590171814},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25153011083602905},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.12243649363517761}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.8161618113517761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6637197732925415},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5705970525741577},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5506911277770996},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5389758944511414},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.48324522376060486},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4298687279224396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.428202360868454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4043535590171814},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25153011083602905},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12243649363517761}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3584372.3588681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3584372.3588681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2916453022","display_name":null,"funder_award_id":"CCF-1907738, CCF-2006589, CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4344669250","display_name":"CAREER: Graph Streaming, Communication Games, and the Quest for Optimal Algorithms","funder_award_id":"2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G463163403","display_name":null,"funder_award_id":"CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4877373562","display_name":"AF: Small: Collaborative Research: New Challenges in Graph Stream Algorithms and Related Communication Games","funder_award_id":"1907738","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5212751966","display_name":null,"funder_award_id":"820931","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G5516049770","display_name":null,"funder_award_id":"NSF CAREER Grant CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6134271742","display_name":"AF: CIF: Small: Communication complexity techniques beyond classical information theory","funder_award_id":"2006589","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/G6725804946","display_name":null,"funder_award_id":"CCF-1907738","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/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320310400","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2052207834","https://openalex.org/W2087316231","https://openalex.org/W2119761906","https://openalex.org/W2426237696","https://openalex.org/W2772780650","https://openalex.org/W2914650026","https://openalex.org/W3000828483","https://openalex.org/W3030848490","https://openalex.org/W3031693517","https://openalex.org/W3046763033","https://openalex.org/W3203563530","https://openalex.org/W3215862696","https://openalex.org/W4253069973","https://openalex.org/W4281701057","https://openalex.org/W4316652407","https://openalex.org/W6600222950"],"related_works":["https://openalex.org/W2058681277","https://openalex.org/W2951573806","https://openalex.org/W1996806106","https://openalex.org/W4241266436","https://openalex.org/W2208110155","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2070734629","https://openalex.org/W96431103","https://openalex.org/W2073006754"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,36,81,132],"is":[2,105],"a":[3,29,60,107,123],"fundamental":[4],"problem":[5],"with":[6],"wide":[7],"reaching":[8],"applications":[9],"in":[10,19,32,38,45,64],"various":[11,34],"areas":[12],"including":[13],"ata":[14],"mining":[15],"and":[16,113,133],"databases,":[17],"e.g.,":[18],"parallel":[20],"query":[21],"optimization.":[22],"In":[23],"recent":[24,72],"years,":[25],"there":[26,104],"has":[27],"been":[28],"growing":[30],"interest":[31],"solving":[33],"graph":[35,66],"problems":[37],"the":[39,92,111,117,126,146],"streaming":[40,65],"model.":[41],"The":[42],"initial":[43],"algorithms":[44,82],"this":[46,140],"line":[47,141],"of":[48,70,119,125,142],"work":[49,84,143],"are":[50,96],"all":[51],"crucially":[52],"randomized,":[53],"raising":[54],"natural":[55],"questions":[56],"about":[57],"how":[58],"important":[59],"role":[61],"randomization":[62],"plays":[63],"coloring.":[67,136],"A":[68],"couple":[69],"very":[71],"works":[73],"prove":[74],"that":[75],"deterministic":[76,135],"or":[77],"even":[78],"adversarially":[79],"robust":[80,131],"(that":[83],"on":[85,91],"streams":[86],"whose":[87],"updates":[88],"may":[89],"depend":[90],"algorithm's":[93],"past":[94],"outputs)":[95],"considerably":[97],"weaker":[98],"than":[99],"standard":[100],"randomized":[101],"ones.":[102],"However,":[103],"still":[106],"significant":[108],"gap":[109],"between":[110],"upper":[112],"lower":[114],"bounds":[115],"for":[116,130],"number":[118],"colors":[120],"needed":[121],"(as":[122],"function":[124],"maximum":[127],"degree":[128],"\u0394)":[129],"multipass":[134],"We":[137],"contribute":[138],"to":[139],"by":[144],"proving":[145],"following":[147],"results.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}