×

Found 1,511 Documents (Results 1–100)

Parity permutation pattern matching. (English) Zbl 07770307

Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 384-395 (2023).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Pattern matching in encrypted stream from inner product encryption. (English) Zbl 07770275

Boldyreva, Alexandra (ed.) et al., Public-key cryptography – PKC 2023. 26th IACR international conference on practice and theory of public-key cryptography, Atlanta, GA, USA, May 7–10, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13940, 774-801 (2023).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Dynamic suffix array with polylogarithmic queries and updates. (English) Zbl 07774446

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 1657-1670 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Pattern matching under DTW distance. (English) Zbl 1525.68205

Arroyuelo, Diego (ed.) et al., String processing and information retrieval. 29th international symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13617, 315-330 (2022).
MSC:  68W32 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantum time complexity and algorithms for pattern matching on labeled graphs. (English) Zbl 1525.68063

Arroyuelo, Diego (ed.) et al., String processing and information retrieval. 29th international symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13617, 303-314 (2022).
MSC:  68Q12 68R10
PDFBibTeX XMLCite
Full Text: DOI

Matching patterns with variables under edit distance. (English) Zbl 1525.68204

Arroyuelo, Diego (ed.) et al., String processing and information retrieval. 29th international symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13617, 275-289 (2022).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. (English) Zbl 1525.68207

Arroyuelo, Diego (ed.) et al., String processing and information retrieval. 29th international symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13617, 24-37 (2022).
MSC:  68W32 68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Image keypoint matching using graph neural networks. (English) Zbl 07616733

Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 2. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1016, 441-451 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of approximate pattern matching on de Bruijn graphs. (English) Zbl 1494.92086

Pe’er, Itsik (ed.), Research in computational molecular biology. 26th annual international conference, RECOMB 2022, San Diego, CA, USA, May 22–25, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13278, 263-278 (2022).
MSC:  92D20 92C15 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Long paths make pattern-counting hard, and deep trees make it Harder. (English) Zbl 07803600

Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 22, 17 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Inverse suffix array queries for 2-dimensional pattern matching in near-compact space. (English) Zbl 07788633

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 60, 14 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Griddings of permutations and hardness of pattern matching. (English) Zbl 07724238

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 65, 22 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Matching patterns with variables under Hamming distance. (English) Zbl 07724221

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 48, 24 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Document retrieval hacks. (English) Zbl 07700594

Coudert, David (ed.) et al., 19th international symposium on experimental algorithms, SEA 2021, Nice, France, June 7–9, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 190, Article 12, 12 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Efficient algorithms for counting gapped palindromes. (English) Zbl 07696009

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 23, 13 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI

An invertible transform for efficient string matching in labeled digraphs. (English) Zbl 07696006

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 20, 14 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

A fast and small subsampled \(r\)-index. (English) Zbl 07695999

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 13, 16 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

The \(k\)-mappability problem revisited. (English) Zbl 07695991

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 5, 20 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

On-line pattern matching on \(D\)-texts (Invited Talk). (English) Zbl 07695989

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 3, 2 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI

Public key encryption with flexible pattern matching. (English) Zbl 1514.94048

Tibouchi, Mehdi (ed.) et al., Advances in cryptology – ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6–10, 2021. Proceedings. Part IV. Cham: Springer. Lect. Notes Comput. Sci. 13093, 342-370 (2021).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Nonlinear pattern matching in rule-based modeling languages. (English) Zbl 1491.92067

Cinquemani, Eugenio (ed.) et al., Computational methods in systems biology. 19th international conference, CMSB 2021, Bordeaux, France, September 22–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12881, 198-214 (2021).
MSC:  92C42 92C40 92-08
PDFBibTeX XMLCite
Full Text: DOI

A set automaton to locate all pattern matches in a term. (English) Zbl 07500638

Cerone, Antonio (ed.) et al., Theoretical aspects of computing – ICTAC 2021. 18th international colloquium, virtual event, Nur-Sultan, Kazakhstan, September 8–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12819, 67-85 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. (English) Zbl 1490.68151

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 608-622 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Geometric pattern matching reduces to \(k\)-SUM. (English) Zbl 07765390

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 32, 9 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

\(L_p\) pattern matching in a stream. (English) Zbl 07758337

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 35, 23 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

A quantitative understanding of pattern matching. (English) Zbl 07756108

Bezem, Marc (ed.) et al., 25th international conference on types for proofs and programs. TYPES 2019, June 11–14, 2019, Oslo, Norway. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 175, Article 3, 36 p. (2020).
MSC:  03B70 68N30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Privacy-preserving pattern matching on encrypted data. (English) Zbl 1511.94057

Moriai, Shiho (ed.) et al., Advances in cryptology – ASIACRYPT 2020. 26th international conference on the theory and application of cryptology and information security, Daejeon, South Korea, December 7–11, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12492, 191-220 (2020).
MSC:  94A60 68P25 68T10
PDFBibTeX XMLCite
Full Text: DOI

Fine-grained complexity of regular expression pattern matching and membership. (English) Zbl 07651219

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 80, 20 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating text-to-pattern distance via dimensionality reduction. (English) Zbl 07651120

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 29, 11 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

The streaming \(k\)-mismatch problem: tradeoffs between space and total time. (English) Zbl 07651106

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 15, 15 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Detecting \(k\)-(Sub-)cadences and equidistant subsequence occurrences. (English) Zbl 07651103

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 12, 11 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting distinct patterns in internal dictionary matching. (English) Zbl 07651099

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 8, 15 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient tree-structured categorical retrieval. (English) Zbl 07651095

Gørtz, Inge Li (ed.) et al., 31st annual symposium on combinatorial pattern matching, CPM 2020, Copenhagen, Denmark, June 17–19, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 161, Article 4, 11 p. (2020).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hidden words statistics for large patterns. (English) Zbl 07651056

Drmota, Michael (ed.) et al., 31st international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2020, Klagenfurt, Austria (virtual conference), June 15–19, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 159, Article 17, 15 p. (2020).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI

The complexity of the approximate multiple pattern matching problem for random strings. (English) Zbl 07651042

Drmota, Michael (ed.) et al., 31st international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2020, Klagenfurt, Austria (virtual conference), June 15–19, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 159, Article 3, 15 p. (2020).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI

Generalised pattern matching revisited. (English) Zbl 07650903

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 18, 18 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

String indexing with compressed patterns. (English) Zbl 07650895

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 10, 13 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Internal quasiperiod queries. (English) Zbl 1511.68100

Boucher, Christina (ed.) et al., String processing and information retrieval. 27th international symposium, SPIRE 2020, Orlando, FL, USA, October 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12303, 60-75 (2020).
MSC:  68P05 68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

A complexity dichotomy for permutation pattern matching on grid classes. (English) Zbl 07559423

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 52, 18 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Learning specifications for labelled patterns. (English) Zbl 07317091

Bertrand, Nathalie (ed.) et al., Formal modeling and analysis of timed systems. 18th international conference, FORMATS 2020, Vienna, Austria, September 1–3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12288, 76-93 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI HAL

Pure pattern calculus à la de Bruijn. (English) Zbl 07313967

Nalon, Cláudia (ed.) et al., Proceedings of the 15th international workshop on logical and semantic frameworks, with applications, LSFA 2020, virtual workshop, August 27–28, 2020. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 351, 95-113 (2020).
MSC:  68N18 03B40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating text-to-pattern Hamming distances. (English) Zbl 07298277

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 643-656 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software