![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 995 matches
- 2024
- Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Minimizing the Minimizers via Alphabet Reordering. CPM 2024: 28:1-28:13 - Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Connecting de Bruijn Graphs. CPM 2024: 6:1-6:16 - Bartlomiej Dudek, Pawel Gawrychowski:
Online Context-Free Recognition in OMv Time. CPM 2024: 13:1-13:9 - Meng He, Kaiyu Wu:
Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval Graphs. CPM 2024: 17:1-17:18 - Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. CPM 2024: 1:1-1:15 - Amihood Amir, Michael Itzhaki:
Reconstructing General Matching Graphs. CPM 2024: 2:1-2:15 - Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski:
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM 2024: 3:1-3:20 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya:
Internal Pattern Matching in Small Space and Applications. CPM 2024: 4:1-4:20 - Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CPM 2024: 5:1-5:15 - 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. CPM 2024: 7:1-7:15 - Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz:
Tight Bounds for Compressing Substring Samples. CPM 2024: 9:1-9:14 - Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. CPM 2024: 8:1-8:14 - Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus:
Hairpin Completion Distance Lower Bound. CPM 2024: 11:1-11:16 - Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur:
Searching 2D-Strings for Matching Frames. CPM 2024: 10:1-10:19 - Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Yuri Pirola:
Solving the Minimal Positional Substring Cover Problem in Sublinear Space. CPM 2024: 12:1-12:16 - Dana Fisman, Ilay Tzarfati:
When Is the Normalized Edit Distance over Non-Uniform Weights a Metric? CPM 2024: 14:1-14:17 - Daniel Gabric, Joe Sawada:
Efficient Construction of Long Orientable Sequences. CPM 2024: 15:1-15:12 - Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel:
Exploiting New Properties of String Net Frequency for Efficient Computation. CPM 2024: 16:1-16:16 - Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. CPM 2024: 18:1-18:16 - Dmitry Kosolobov:
Simplified Tight Bounds for Monotone Minimal Perfect Hashing. CPM 2024: 19:1-19:13 - Dmitry Kosolobov, Nikita Sivukhin:
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. CPM 2024: 20:1-20:18 - Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
BAT-LZ out of hell. CPM 2024: 21:1-21:17 - Florin Manea, Jonas Richardsen, Markus L. Schmid:
Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. CPM 2024: 22:1-22:17 - Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi:
The Rational Construction of a Wheeler DFA. CPM 2024: 23:1-23:15 - Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest Cover After Edit. CPM 2024: 24:1-24:15 - Ian Pratt-Hartmann:
Walking on Words. CPM 2024: 25:1-25:17 - Yoshifumi Sakai:
A Data Structure for the Maximum-Sum Segment Problem with Offsets. CPM 2024: 26:1-26:15 - Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura:
Finding Diverse Strings and Longest Common Subsequences in a Graph. CPM 2024: 27:1-27:19 - Front Matter, Table of Contents, Preface, Conference Organization. CPM 2024: 0:i-0:xiv
- 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 [contents]
skipping 965 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-21 10:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint