Остановите войну!
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
- 2020
- Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance Between Fully-Labelled Trees. CPM 2020: 6:1-6:16 - Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance. CPM 2020: 7:1-7:14 - Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan:
FM-Index Reveals the Reverse Suffix Array. CPM 2020: 13:1-13:14 - Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. CPM 2020: 3:1-3:13 - Djamal Belazzougui, Gregory Kucherov:
Efficient Tree-Structured Categorical Retrieval. CPM 2020: 4:1-4:11 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CPM 2020: 8:1-8:15 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes:
Dynamic String Alignment. CPM 2020: 9:1-9:13 - Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba:
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM 2020: 10:1-10:12 - Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. CPM 2020: 11:1-11:15 - Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM 2020: 12:1-12:11 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
On Indeterminate Strings Matching. CPM 2020: 14:1-14:14 - Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM 2020: 15:1-15:15 - Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020: 16:1-16:15 - Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14 - Thore Husfeldt:
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). CPM 2020: 1:1-1:1 - Aleksander Kedzierski, Jakub Radoszewski:
k-Approximate Quasiperiodicity under Hamming and Edit Distance. CPM 2020: 18:1-18:15 - Evangelos Kipouridis, Kostas Tsichlas:
Longest Common Subsequence on Weighted Sequences. CPM 2020: 19:1-19:15 - Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM 2020: 20:1-20:14 - Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara:
In-Place Bijective Burrows-Wheeler Transforms. CPM 2020: 21:1-21:15 - Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. CPM 2020: 22:1-22:15 - Veli Mäkinen, Kristoffer Sahlin:
Chaining with Overlaps Revisited. CPM 2020: 25:1-25:12 - Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita:
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM 2020: 23:1-23:13 - J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CPM 2020: 24:1-24:15 - Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM 2020: 26:1-26:14 - Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus:
Time-Space Tradeoffs for Finding a Long Common Substring. CPM 2020: 5:1-5:14 - Julian Pape-Lange:
On Extensions of Maximal Repeats in Compressed Strings. CPM 2020: 27:1-27:13 - Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CPM 2020: 28:1-28:13 - Przemyslaw Uznanski:
Approximating Text-To-Pattern Distance via Dimensionality Reduction. CPM 2020: 29:1-29:11 - Front Matter, Table of Contents, Preface, Conference Organization. CPM 2020: 0:1-0:16
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-25 02:45 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