default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th CPM 2025: Milan, Italy
- Paola Bonizzoni
, Veli Mäkinen:
36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, June 17-19, 2025, Milan, Italy. LIPIcs 331, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-369-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Riccardo Dondi, Alexandru Popa:
Representing Paths in Digraphs. 1:1-1:15 - Yoshifumi Sakai:
Linear-Space LCS Enumeration for Two Strings. 2:1-2:14 - Gonzalo Navarro, Alejandro Pacheco:
Counting on General Run-Length Grammars. 3:1-3:17 - Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Length Constraints Is Undecidable. 4:1-4:23 - Itai Boneh, Shay Golan:
Covers in Optimal Space. 5:1-5:15 - Shay Golan, Matan Kraus:
String Problems in the Congested Clique Model. 6:1-6:23 - Paolo Ferragina, Filippo Lari:
FL-RMQ: A Learned Approach to Range Minimum Queries. 7:1-7:23 - Cyril Nicaud, Carine Pivoteau, Stéphane Vialette:
Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. 8:1-8:17 - Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara:
Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time. 9:1-9:16 - Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
A Family of Partial Cubes with Minimal Fibonacci Dimension. 10:1-10:16 - Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
On Palindromic Periodicities. 11:1-11:14 - Wiktor Zuba, Oded Lachish, Solon P. Pissis:
Shortest Undirected Paths in de Bruijn Graphs. 12:1-12:13 - Nikita Gaevoy, Boris Zolotov, Alexander Tiskin:
Doubly-Periodic String Comparison. 13:1-13:19 - Jonas Ellert, Pawel Gawrychowski, Tatiana Starikovskaya:
Minimal Generators in Optimal Time. 14:1-14:19 - Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Encoding Co-Lex Orders of Finite-State Automata in Linear Space. 15:1-15:17 - Peaker Guo, Kaisei Kishi:
Net Occurrences in Fibonacci and Thue-Morse Words. 16:1-16:22 - Hideo Bannai, Tomohiro I, Yuto Nakashima:
On the Compressiveness of the Burrows-Wheeler Transform. 17:1-17:15 - Nicola Cotumaccio:
Improved Circular Dictionary Matching. 18:1-18:17 - Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
The Trie Measure, Revisited. 19:1-19:20 - Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow:
Text Indexing for Simple Regular Expressions. 20:1-20:16 - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Compressed Dictionary Matching on Run-Length Encoded Strings. 21:1-21:16 - Bowie Liu, Dennis Wong, Chan-Tong Lam, Sio Kei Im:
Generating a Cyclic 2-Gray Code for Lucas Words in Constant Amortized Time. 22:1-22:18 - Takuya Mieno, Shunsuke Inenaga:
Space-Efficient Online Computation of String Net Occurrences. 23:1-23:13 - Waseem Akram, Takuya Mieno:
Sorted Consecutive Occurrence Queries in Substrings. 24:1-24:15 - Seungbum Jo, Srinivasa Rao Satti:
Encodings for Range Minimum Queries over Bounded Alphabets. 25:1-25:13 - Eric M. Osterkamp, Dominik Köppl:
Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It. 26:1-26:17 - Philip Bille, Inge Li Gørtz, Simon R. Tarnow:
Succinct Data Structures for Segments. 27:1-27:14 - Solon P. Pissis, Jakub Radoszewski, Wiktor Zuba:
Faster Approximate Elastic-Degenerate String Matching - Part A. 28:1-28:19 - Pawel Gawrychowski, Adam Górkiewicz, Pola Marciniak, Solon P. Pissis, Karol Pokorski:
Faster Approximate Elastic-Degenerate String Matching - Part B. 29:1-29:21
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-27 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
