default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th CPM 2024: Fukuoka, Japan
- Shunsuke Inenaga
, Simon J. Puglisi:
35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27, 2024, Fukuoka, Japan. LIPIcs 296, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-326-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. 1:1-1:15 - Amihood Amir, Michael Itzhaki:
Reconstructing General Matching Graphs. 2:1-2:15 - Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski:
Maintaining the Size of LZ77 on Semi-Dynamic Strings. 3:1-3:20 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Internal Pattern Matching in Small Space and Applications. 4:1-4:20 - Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. 5:1-5:15 - Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Connecting de Bruijn Graphs. 6:1-6:16 - Gianmarco Bertola, Anthony J. Cox, Veronica Guerrini, Giovanna Rosone:
A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering Problem. 7:1-7:15 - Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. 8:1-8:14 - Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz:
Tight Bounds for Compressing Substring Samples. 9:1-9:14 - Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. 10:1-10:19 - Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus:
Hairpin Completion Distance Lower Bound. 11:1-11:16 - Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Yuri Pirola:
Solving the Minimal Positional Substring Cover Problem in Sublinear Space. 12:1-12:16 - Bartlomiej Dudek, Pawel Gawrychowski:
Online Context-Free Recognition in OMv Time. 13:1-13:9 - Dana Fisman, Ilay Tzarfati:
When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? 14:1-14:17 - Daniel Gabric, Joe Sawada:
Efficient Construction of Long Orientable Sequences. 15:1-15:12 - Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel:
Exploiting New Properties of String Net Frequency for Efficient Computation. 16:1-16:16 - Meng He, Kaiyu Wu:
Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. 17:1-17:18 - Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. 18:1-18:16 - Dmitry Kosolobov:
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. 19:1-19:13 - Dmitry Kosolobov, Nikita Sivukhin:
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. 20:1-20:18 - Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
BAT-LZ out of hell. 21:1-21:17 - Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. 22:1-22:17 - Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi:
The Rational Construction of a Wheeler DFA. 23:1-23:15 - Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest Cover After Edit. 24:1-24:15 - Ian Pratt-Hartmann:
Walking on Words. 25:1-25:17 - Yoshifumi Sakai:
A Data Structure for the Maximum-Sum Segment Problem with Offsets. 26:1-26:15 - Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. 27:1-27:19 - Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Minimizing the Minimizers via Alphabet Reordering. 28:1-28:13
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-11-02 20:54 CET 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:
