Остановите войну!
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 33 matches
- 2017
- Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. CPM 2017: 25:1-25:15 - Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. CPM 2017: 26:1-26:14 - Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM 2017: 22:1-22:18 - Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Solutions on MultiSets. CPM 2017: 31:1-31:14 - Djamal Belazzougui, Fabio Cunial:
Representing the Suffix Tree with the CDAWG. CPM 2017: 7:1-7:13 - Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz:
Lempel-Ziv Compression in a Sliding Window. CPM 2017: 15:1-15:11 - Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM 2017: 16:1-16:17 - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. CPM 2017: 6:1-6:11 - Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Palindromic Length in Linear Time. CPM 2017: 23:1-23:12 - Karl Bringmann, Philip Wellnitz:
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CPM 2017: 12:1-12:14 - Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM 2017: 27:1-27:17 - Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM 2017: 29:1-29:12 - Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The Longest Filled Common Subsequence Problem. CPM 2017: 14:1-14:13 - Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. CPM 2017: 19:1-19:9 - Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Parameterized Strings. CPM 2017: 8:1-8:13 - Philippe Duchon, Cyril Nicaud, Carine Pivoteau:
Gapped Pattern Statistics. CPM 2017: 21:1-21:12 - Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. CPM 2017: 10:1-10:14 - Travis Gagie, Meng He, Gonzalo Navarro:
Path Queries on Functions. CPM 2017: 5:1-5:15 - Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - Tomohiro I:
Longest Common Extensions with Recompression. CPM 2017: 18:1-18:15 - Artur Jez:
Recompression of SLPs. CPM 2017: 2:1-2:1 - Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM 2017: 11:1-11:17 - Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS Computation via RLE. CPM 2017: 20:1-20:12 - Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus Problem. CPM 2017: 28:1-28:18 - Giovanni Manzini:
Wheeler Graphs: Variations on a Theme by Burrows and Wheeler. CPM 2017: 1:1-1:1 - Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM 2017: 24:1-24:11 - Marcin Mucha:
Shortest Superstring. CPM 2017: 3:1-3:1 - Gonzalo Navarro:
Document Listing on Repetitive Collections with Guaranteed Performance. CPM 2017: 4:1-4:13 - Giulio Ermanno Pibiri, Rossano Venturini:
Dynamic Elias-Fano Representation. CPM 2017: 30:1-30:14 - Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CPM 2017: 17:1-17:10
skipping 3 more matches
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-24 06:18 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