{"id":"https://openalex.org/W7163896161","doi":"https://doi.org/10.4230/lipics.cpm.2026.36","title":"Set Parameterized Matching via Multi-Layer Hashing","display_name":"Set Parameterized Matching via Multi-Layer Hashing","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163896161","doi":"https://doi.org/10.4230/lipics.cpm.2026.36"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25962","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.36/LIPIcs.CPM.2026.36.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.36/LIPIcs.CPM.2026.36.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012404981","display_name":"Moshe Lewenstein","orcid":"https://orcid.org/0000-0002-8272-244X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lewenstein, Moshe","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":"https://orcid.org/0000-0002-8272-244X","affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5135230459","display_name":"Ely Porat","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Porat, Ely","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":"https://orcid.org/0000-0001-6912-5766","affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.94557633,"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.7742999792098999,"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.7742999792098999,"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.07440000027418137,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.05079999938607216,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8795999884605408},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7504000067710876},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.6273000240325928},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6223999857902527},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5874999761581421},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5320000052452087},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5184000134468079},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5026000142097473},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.427700012922287}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8795999884605408},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7504000067710876},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.6273000240325928},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6223999857902527},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5874999761581421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5478000044822693},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5320000052452087},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5184000134468079},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47040000557899475},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.427700012922287},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.3880000114440918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38350000977516174},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.37070000171661377},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35249999165534973},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.35089999437332153},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.3337000012397766},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.32269999384880066},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2863999903202057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2619999945163727}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25962","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.36/LIPIcs.CPM.2026.36.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.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.36","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:25962","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.36/LIPIcs.CPM.2026.36.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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.4357888102531433}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163896161.pdf","grobid_xml":"https://content.openalex.org/works/W7163896161.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,78],"study":[1],"the":[2,10,27,62,73,95,101,118,122,128,135],"set":[3,23,38],"parameterized":[4,12,24,48],"matching":[5,13],"problem,":[6,129],"a":[7,37,43,53,80,107],"generalization":[8],"of":[9,39,75,120,127,138,140],"classical":[11],"problem":[14,71],"introduced":[15,69],"by":[16],"Baker":[17],"[Baker,":[18],"1993;":[19],"Baker,":[20],"1997].":[21],"In":[22],"matching,":[25,132],"both":[26],"pattern":[28,102,144],"and":[29,98,133],"text":[30,96,141],"are":[31],"sequences":[32],"where":[33,92],"each":[34],"position":[35],"contains":[36],"characters":[40],"rather":[41],"than":[42],"single":[44],"character.":[45],"Two":[46],"set-strings":[47],"match":[49],"if":[50],"there":[51],"exists":[52],"bijection":[54],"between":[55],"their":[56],"alphabets":[57],"that":[58,116],"maps":[59],"one":[60],"to":[61],"other":[63],"set-wise.":[64],"Boussidan":[65],"[Aaron":[66],"Boussidan,":[67],"2025]":[68],"this":[70],"for":[72],"case":[74],"equal-length":[76],"set-strings.":[77],"present":[79],"randomized":[81],"algorithm":[82],"running":[83],"in":[84,125],"O(N":[85],"+":[86],"M)":[87],"time":[88],"with":[89],"high":[90],"probability,":[91],"N":[93],"is":[94,100],"size":[97,123],"M":[99],"size.":[103],"Our":[104],"approach":[105],"employs":[106],"novel":[108],"three-layer":[109],"hashing":[110],"scheme":[111],"based":[112],"on":[113],"Karp-Rabin":[114],"fingerprinting":[115],"addresses":[117],"challenges":[119],"(1)":[121],"blowup":[124],"representations":[126],"(2)":[130],"set-to-set":[131],"(3)":[134],"dynamic":[136],"nature":[137],"encodings":[139],"substrings":[142],"during":[143],"scanning.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}