{"id":"https://openalex.org/W7163909669","doi":"https://doi.org/10.4230/lipics.cpm.2026.26","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-01-01","ids":{"openalex":"https://openalex.org/W7163909669","doi":"https://doi.org/10.4230/lipics.cpm.2026.26"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25952","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.26/LIPIcs.CPM.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.26/LIPIcs.CPM.2026.26.pdf","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":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kociumaka, Tomasz","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2477-1702","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135335238","display_name":"Jakob Nogler","orcid":null},"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":"Nogler, Jakob","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0009-0002-7028-2595","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030374322","display_name":"Philip Wellnitz","orcid":"https://orcid.org/0000-0002-6482-8478"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]},{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wellnitz, Philip","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan","The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0002-6482-8478","affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan","institution_ids":["https://openalex.org/I200475212"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94745457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.9466999769210815,"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.9466999769210815,"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/T11567","display_name":"semigroups and automata theory","score":0.011800000444054604,"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/T12029","display_name":"DNA and Biological Computing","score":0.010099999606609344,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6446999907493591},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6061000227928162},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5990999937057495},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5863000154495239},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5856000185012817},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5766000151634216},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5634999871253967},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5430999994277954}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6446999907493591},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6079000234603882},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6061000227928162},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5990999937057495},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5863000154495239},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5856000185012817},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5766000151634216},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5634999871253967},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5430999994277954},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5031999945640564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4794999957084656},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.4641999900341034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44609999656677246},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.44110000133514404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4311000108718872},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42969998717308044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42080000042915344},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41110000014305115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38370001316070557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.35109999775886536},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25952","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.26/LIPIcs.CPM.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cpm.2026.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.26","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25952","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.26/LIPIcs.CPM.2026.26.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163909669.pdf","grobid_xml":"https://content.openalex.org/works/W7163909669.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,52],"decades-old":[1],"Pattern":[2,223],"Matching":[3,224],"with":[4,225],"Edits":[5],"problem,":[6,73],"given":[7,67],"a":[8,14,21,150,193],"length-n":[9],"string":[10,16],"T":[11,42],"(the":[12,18,25],"text),":[13],"length-m":[15],"P":[17,34,47,160],"pattern),":[19],"and":[20,115,171],"positive":[22],"integer":[23],"k":[24,103,110,118,140,179,201],"threshold),":[26],"asks":[27],"to":[28,46,76,148,176],"list":[29],"the":[30,60,72,83,97,168,173,184,204,216,221,229],"k-error":[31,157],"occurrences":[32],"of":[33,41,56,63,71,153,159,198,231],"in":[35,96,161,228],"T,":[36],"that":[37,65,79,87,145],"is,":[38],"all":[39],"fragments":[40],"whose":[43],"edit":[44,205],"distance":[45],"is":[48,59],"at":[49],"most":[50],"k.":[51],"one-way":[53],"communication":[54,217],"complexity":[55,218],"this":[57,125,164],"problem":[58,227],"minimum":[61],"number":[62],"bits":[64,112,121],"Alice,":[66],"an":[68,132,137],"instance":[69],"(P,T,k)":[70],"must":[74],"send":[75],"Bob":[77,80],"so":[78],"can":[81],"reconstruct":[82],"answer":[84],"solely":[85],"from":[86],"message.":[88],"In":[89,163],"recent":[90],"work":[91],"[STOC'24],":[92],"we":[93,135,166,209],"showed":[94],"that,":[95],"natural":[98],"parameter":[99],"regime":[100],"0":[101],"<":[102,104,106],"m":[105,142],"n/2,":[107],"\u03a9(n/m":[108,199],"\u22c5":[109,117,139,178,200],"log(m/k))":[111],"are":[113,122],"necessary":[114],"\ud835\udcaa(n/m":[116,138,177],"log\u00b2":[119],"m)":[120],"sufficient":[123],"for":[124,129,155,187,203,220],"problem.":[126],"More":[127],"generally,":[128],"strings":[130],"over":[131],"alphabet":[133],"\u03a3,":[134],"gave":[136],"log":[141,180],"log(m|\u03a3|))-bit":[143],"encoding":[144,174,212],"allows":[146],"one":[147],"recover":[149],"shortest":[151],"sequence":[152,206],"edits":[154],"every":[156],"occurrence":[158],"T.":[162],"paper,":[165],"revisit":[167],"original":[169],"proof":[170],"improve":[172],"size":[175,213],"(m|\u03a3|/k)),":[181],"which":[182],"matches":[183,215],"lower":[185,196],"bound":[186,197],"constant-sized":[188],"alphabets.":[189],"We":[190],"further":[191],"establish":[192],"new":[194],"tight":[195],"log(m|\u03a3|/k))":[202],"reporting":[207],"variant":[208],"solve.":[210],"Our":[211],"also":[214],"established":[219],"simpler":[222],"Mismatches":[226],"context":[230],"streaming":[232],"algorithms":[233],"[Clifford,":[234],"Kociumaka,":[235],"Porat;":[236],"SODA'19].":[237]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}