Остановите войну!
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 32 matches
- 2023
- Jarno N. Alanko, Elena Biagi, Simon J. Puglisi:
Longest Common Prefix Arrays for Succinct k-Spectra. SPIRE 2023: 1-13 - Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On Suffix Tree Detection. SPIRE 2023: 14-27 - Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE 2023: 28-34 - Diego Arroyuelo, Adrián Gómez-Brandón, Gonzalo Navarro:
Evaluating Regular Path Queries on Compressed Adjacency Matrices. SPIRE 2023: 35-48 - Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: An Approach Using Swaps. SPIRE 2023: 49-61 - Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. SPIRE 2023: 62-74 - Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru:
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. SPIRE 2023: 75-88 - Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi:
Data Structures for SMEM-Finding in the PBWT. SPIRE 2023: 89-101 - Lorenzo Carfagna, Giovanni Manzini:
Compressibility Measures for Two-Dimensional Data. SPIRE 2023: 102-113 - Adam Cicherski, Norbert Dojer:
From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models. SPIRE 2023: 114-128 - Alessio Conte, Roberto Grossi, Davide Rucci:
CAGE: Cache-Aware Graphlet Enumeration. SPIRE 2023: 129-142 - Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE 2023: 143-156 - Diego Díaz-Domínguez, Leena Salmela:
Computing All-vs-All MEMs in Grammar-Compressed Text. SPIRE 2023: 157-170 - Jonas Ellert:
Sublinear Time Lempel-Ziv (LZ77) Factorization. SPIRE 2023: 171-187 - Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen:
New Advances in Rightmost Lempel-Ziv. SPIRE 2023: 188-202 - Paolo Ferragina, Mariagiovanna Rotundo, Giorgio Vinciguerra:
Engineering a Textbook Approach to Index Massive String Dictionaries. SPIRE 2023: 203-217 - Éric Fusy, Gregory Kucherov:
Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study. SPIRE 2023: 218-232 - Travis Gagie, Meng He, Michael St Denis:
Dynamic Compact Planar Embeddings. SPIRE 2023: 233-245 - Travis Gagie, Sana Kashgouli, Gonzalo Navarro:
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings. SPIRE 2023: 246-252 - Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. SPIRE 2023: 253-259 - Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Non-overlapping Indexing in BWT-Runs Bounded Space. SPIRE 2023: 260-270 - Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Parameterized Pattern Matching in Sublinear Space. SPIRE 2023: 271-283 - Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga:
Largest Repetition Factorization of Fibonacci Words. SPIRE 2023: 284-296 - Lukasz Kondraciuk:
String Covers of a Tree Revisited. SPIRE 2023: 297-309 - Benjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José R. Paramá, Tirso V. Rodeiro:
Compacting Massive Public Transport Data. SPIRE 2023: 310-322 - Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams:
Constant Time and Space Updates for the Sigma-Tau Problem. SPIRE 2023: 323-330 - Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE 2023: 331-344 - Solon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides:
Frequency-Constrained Substring Complexity. SPIRE 2023: 345-352 - Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Chaining of Maximal Exact Matches in Graphs. SPIRE 2023: 353-366 - Lusheng Wang, Binhai Zhu:
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. SPIRE 2023: 367-380
skipping 2 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-06-15 23:06 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