Остановите войну!
for scientists:
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 31 matches
- 2022
- Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length- k Substrings. CPM 2022: 16:1-16:17 - Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Making de Bruijn Graphs Eulerian. CPM 2022: 12:1-12:18 - Nicola Rizzo, Veli Mäkinen:
Indexable Elastic Founder Graphs of Minimum Height. CPM 2022: 19:1-19:19 - Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CPM 2022: 27:1-27:17 - Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane:
Bi-Directional r-Indexes. CPM 2022: 11:1-11:14 - Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. CPM 2022: 13:1-13:23 - Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau:
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. CPM 2022: 6:1-6:11 - Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17 - Laurent Bulteau, Philippe Gambette, Olga Seminck:
Reordering a Tree According to an Order on Its Leaves. CPM 2022: 24:1-24:15 - Davide Cenzato, Zsuzsanna Lipták:
A Theoretical and Experimental Analysis of BWT Variants for String Collections. CPM 2022: 25:1-25:18 - Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Palindromic Substring in Sublinear Time. CPM 2022: 20:1-20:9 - Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CPM 2022: 18:1-18:15 - Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM 2022: 22:1-22:15 - Diego Díaz-Domínguez, Gonzalo Navarro:
Efficient Construction of the BWT for Repetitive Text Using String Compression. CPM 2022: 29:1-29:18 - Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. CPM 2022: 17:1-17:17 - Takehiro Ito:
Invitation to Combinatorial Reconfiguration (Invited Talk). CPM 2022: 1:1-1:1 - Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. CPM 2022: 28:1-28:21 - Vincent Jugé:
Reduction Ratio of the IS-Algorithm: Worst and Random Cases. CPM 2022: 8:1-8:23 - Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
Beyond the Longest Letter-Duplicated Subsequence Problem. CPM 2022: 7:1-7:12 - Avivit Levy, Ely Porat, B. Riva Shalom:
Partial Permutations Comparison, Maintenance and Applications. CPM 2022: 10:1-10:17 - John M. Machacek:
Mechanical Proving with Walnut for Squares and Cubes in Partial Words. CPM 2022: 5:1-5:11 - Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM 2022: 26:1-26:17 - Abhinav Nellore, Rachel A. Ward:
Arbitrary-Length Analogs to de Bruijn Sequences. CPM 2022: 9:1-9:20 - Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CPM 2022: 14:1-14:18 - Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Rectangular Tile Covers of 2D-Strings. CPM 2022: 23:1-23:14 - Jeffrey O. Shallit:
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). CPM 2022: 2:1-2:3 - Sharma V. Thankachan:
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk). CPM 2022: 3:1-3:3 - Front Matter, Table of Contents, Preface, Conference Organization. CPM 2022: 0:1-0:18
skipping 1 more match
loading more results
failed to load more results, please try again later
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-05-27 08:25 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