{"id":"https://openalex.org/W7154958068","doi":"https://doi.org/10.48550/arxiv.2604.15601","title":"The Communication Complexity of Pattern Matching with Edits Revisited","display_name":"The Communication Complexity of Pattern Matching with Edits Revisited","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7154958068","doi":"https://doi.org/10.48550/arxiv.2604.15601"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15601","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15601","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15601","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086467798","display_name":"Tomasz Kociumaka","orcid":"https://orcid.org/0000-0002-2477-1702"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kociumaka, Tomasz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134035945","display_name":"Jakob Nogler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nogler, Jakob","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030374322","display_name":"Philip Wellnitz","orcid":"https://orcid.org/0000-0002-6482-8478"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wellnitz, Philip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9532999992370605,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9532999992370605,"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/T12029","display_name":"DNA and Biological Computing","score":0.012900000438094139,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.006899999920278788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6233000159263611},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6071000099182129},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6007000207901001},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5893999934196472},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5849000215530396},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5753999948501587},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5609999895095825},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.550599992275238}],"concepts":[{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6233000159263611},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6071000099182129},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6007000207901001},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5893999934196472},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5849000215530396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5767999887466431},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5753999948501587},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5609999895095825},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5304999947547913},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47380000352859497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47110000252723694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46880000829696655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4505000114440918},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36959999799728394},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35359999537467957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15601","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15601","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.15601","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15601","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,175],"the":[1,28,33,65,79,90,97,180,185,195,215,228,233,241],"decades-old":[2],"Pattern":[3,60,132,235],"Matching":[4,61,133,236],"with":[5,62,134,237],"Edits":[6,63],"problem,":[7,80],"given":[8,72],"a":[9,15,22,162,204],"length-$n$":[10],"string":[11,17],"$T$":[12,45],"(the":[13,19,26],"text),":[14],"length-$m$":[16],"$P$":[18,37,50,172],"pattern),":[20],"and":[21,122,183],"positive":[23],"integer":[24],"$k$":[25],"threshold),":[27],"task":[29],"is":[30,51,64],"to":[31,49,83,160,188],"list":[32],"$k$-error":[34,169],"occurrences":[35],"of":[36,44,59,68,78,101,165,171,209,243],"in":[38,173,240],"$T$,":[39],"that":[40,70,86,94,114,157,220],"is,":[41],"all":[42],"fragments":[43],"whose":[46],"edit":[47,216],"distance":[48],"at":[52],"most":[53],"$k$.":[54],"The":[55],"one-way":[56],"communication":[57,229],"complexity":[58,230],"minimum":[66],"number":[67],"bits":[69,119,128],"Alice,":[71],"an":[73,141,149],"instance":[74],"$(P,":[75],"T,":[76],"k)$":[77],"must":[81],"send":[82],"Bob":[84,87],"so":[85],"can":[88],"reconstruct":[89],"answer":[91],"solely":[92],"from":[93],"message.":[95],"For":[96],"natural":[98],"parameter":[99],"regime":[100],"$0":[102],"<":[103,105,107],"k":[104,117,125,152,191,212],"m":[106,154],"n/2$,":[108],"our":[109,144],"recent":[110,145],"work":[111,146],"[STOC'24]":[112,147],"yields":[113],"$\u03a9(n/m":[115,210],"\\cdot":[116,124,151,190,211],"\\log(m/k))$":[118],"are":[120,129],"necessary":[121],"$O(n/m":[123,150,189],"\\log^2":[126],"m)$":[127],"sufficient":[130],"for":[131,138,167,198,214,232],"Edits.":[135],"More":[136],"generally,":[137],"strings":[139],"over":[140],"alphabet":[142],"$\u03a3$,":[143],"gives":[148],"\\log":[153],"\\log(m|\u03a3|))$-bit":[155],"encoding":[156,186,224],"allows":[158],"one":[159],"recover":[161],"shortest":[163],"sequence":[164,217],"edits":[166],"every":[168],"occurrence":[170],"$T$.":[174],"this":[176],"work,":[177],"we":[178,221],"revisit":[179],"original":[181],"proof":[182],"improve":[184],"size":[187,225],"\\log(m|\u03a3|/k))$,":[192],"which":[193],"matches":[194,227],"lower":[196,207],"bound":[197,208],"constant-sized":[199],"alphabets.":[200],"We":[201],"further":[202],"establish":[203],"new":[205],"tight":[206],"\\log(m|\u03a3|/k))$":[213],"reporting":[218],"variant":[219],"solve.":[222],"Our":[223],"also":[226],"established":[231],"simpler":[234],"Mismatches":[238],"problem":[239],"context":[242],"streaming":[244],"algorithms":[245],"[Clifford,":[246],"Kociumaka,":[247],"Porat;":[248],"SODA'19].":[249]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-21T00:00:00"}