{"id":"https://openalex.org/W4399523561","doi":"https://doi.org/10.1145/3618260.3649607","title":"Communication Lower Bounds for Collision Problems via Density Increment Arguments","display_name":"Communication Lower Bounds for Collision Problems via Density Increment Arguments","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523561","doi":"https://doi.org/10.1145/3618260.3649607"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649607","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 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649607","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075702353","display_name":"Guangxu Yang","orcid":"https://orcid.org/0000-0001-9581-9593"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guangxu Yang","raw_affiliation_strings":["University of Southern California, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0001-9581-9593","affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069650850","display_name":"Jiapeng Zhang","orcid":"https://orcid.org/0000-0002-6410-8649"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiapeng Zhang","raw_affiliation_strings":["University of Southern California, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0002-6410-8649","affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075702353"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":0.3457,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59583657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"630","last_page":"639"},"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.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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.9962999820709229,"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/alice-and-bob","display_name":"Alice and Bob","score":0.7618395090103149},{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.6761341094970703},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6361021399497986},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.621688723564148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.551695704460144},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5215294361114502},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5214711427688599},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5175104141235352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4720279276371002},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41457661986351013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41303202509880066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35524895787239075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30296897888183594}],"concepts":[{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.7618395090103149},{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.6761341094970703},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6361021399497986},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.621688723564148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.551695704460144},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5215294361114502},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5214711427688599},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5175104141235352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4720279276371002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41457661986351013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41303202509880066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35524895787239075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30296897888183594},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649607","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 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649607","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649607","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649607","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 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523561.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W2035627701","https://openalex.org/W2040958198","https://openalex.org/W2048113794","https://openalex.org/W2117679895","https://openalex.org/W2117749206","https://openalex.org/W2220094226","https://openalex.org/W2768202431","https://openalex.org/W2768698559","https://openalex.org/W2969535762","https://openalex.org/W2970326168","https://openalex.org/W3137706500","https://openalex.org/W3186935454","https://openalex.org/W4210631930","https://openalex.org/W4390098214"],"related_works":["https://openalex.org/W1765977934","https://openalex.org/W2066842693","https://openalex.org/W2120222618","https://openalex.org/W4238337057","https://openalex.org/W2315316137","https://openalex.org/W1548585588","https://openalex.org/W2132559993","https://openalex.org/W3134161675","https://openalex.org/W2767455857","https://openalex.org/W3022052004"],"abstract_inverted_index":{"Collision":[0],"problems":[1,4,269,293],"are":[2,270],"important":[3,267],"in":[5,83],"complexity":[6,210,290],"theory":[7],"and":[8,31,36,41,59,68,92,108,136,196,208,216,220,222],"cryptography":[9,207],"with":[10,70,117,294],"diverse":[11],"applications.":[12,89,281],"Previous":[13],"fruitful":[14],"works":[15,27],"have":[16,247,286],"mainly":[17],"focused":[18],"on":[19],"query":[20],"models.":[21],"Driven":[22],"by":[23,28,191,213],"various":[24],"applications,":[25],"several":[26],"Bauer,":[29,214],"Farshim":[30],"Mazaheri":[32,217],"(CRYPTO":[33,218],"2018),":[34],"Itsykson":[35,221],"Riazanov":[37,223],"(CCC":[38,224],"2021),":[39],"G'o'os":[40,195],"Jain":[42,197],"(RANDOM":[43,198],"2022)":[44],"independently":[45],"proposed":[46],"the":[47,54,84,122,155,182],"communication":[48,55,119,178,262,268,289],"version":[49],"of":[50,65,72,80,86,131,133,194,231,239,291],"collision":[51],"problems.":[52],"In":[53,170,282],"setting,":[56],"both":[57],"Alice":[58,91,124],"Bob":[60,93,127,137],"receive":[61],"k":[62,81],"random":[63,129],"subsets":[64],"[N]:":[66],"S1,\u2026,Sk":[67],"T1,\u2026,Tk":[69],"each":[71],"size":[73,134],"roughly":[74],"\u221aN,":[75],"where":[76],"a":[77,97,128,142,192],"typical":[78],"choice":[79],"is":[82,121,141,236],"order":[85],"\u221aN":[87],"for":[88,105],"Then":[90],"aim":[94],"to":[95,126,151,166,206,242,251,259,288,305],"find":[96],"pair":[98],"(x,x\u2032)":[99],"such":[100],"that":[101,113,145,298],"x,x\u2032\u2208":[102],"Si\u2229":[103],"Tj":[104,144],"some":[106,167],"Si":[107],"Tj.":[109],"A":[110],"simple":[111],"protocol":[112],"solves":[114],"this":[115,152,160,171,306],"problem":[116],"O(N1/4)":[118],"bits":[120],"following:":[123],"sends":[125],"subset":[130],"S1":[132],"N1/4":[135],"checks":[138],"if":[139],"there":[140],"set":[143],"has":[146],"more":[147,280],"than":[148],"two":[149],"intersections":[150],"subset.":[153],"All":[154],"papers":[156],"mentioned":[157],"above":[158],"believe":[159,275],"bound":[161,202],"should":[162],"be":[163,230],"tight":[164],"up":[165],"log":[168],"factors.":[169],"paper,":[172],"we":[173],"prove":[174],"an":[175,187,237],"\u03a9(N1/4)":[176],"randomized":[177],"lower":[179,201],"bound,":[180],"affirming":[181],"conjecture":[183],"above.":[184],"Previously,":[185,245],"only":[186],"\u03a9(N1/12)":[188],"was":[189],"known":[190],"work":[193],"2022).":[199],"Our":[200,226],"provides":[203],"direct":[204],"applications":[205,287],"proof":[209,227],"via":[211],"connections":[212],"Farshim,":[215],"2018)":[219],"2021).":[225],"technique":[228],"could":[229,278],"independent":[232],"interest":[233],"as":[234],"it":[235,284],"extension":[238],"simulation":[240],"methods":[241,277,301],"non-lifted":[243],"functions.":[244,273],"simulations":[246],"been":[248],"widely":[249],"applied":[250],"lifted":[252,272],"functions":[253],"(a.k.a":[254],"composed":[255],"functions),":[256],"which":[257],"leads":[258],"beautiful":[260],"query-to-":[261],"lifting":[263],"theorems.":[264],"However,":[265],"many":[266,295,299],"not":[271,303],"We":[274],"our":[276],"give":[279],"particular,":[283],"may":[285],"search":[292],"solutions.":[296],"Note":[297],"existing":[300],"do":[302],"apply":[304],"setting.":[307]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}