default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24. SPIRE 2017: Palermo, Italy
- Gabriele Fici, Marinella Sciortino, Rossano Venturini:
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. Lecture Notes in Computer Science 10508, Springer 2017, ISBN 978-3-319-67427-8 - Jarno Alanko
, Tuukka Norri:
Greedy Shortest Common Superstring Approximation in Compact Space. 1-13 - Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. 14-26 - Mika Amit, Pawel Gawrychowski:
Distinct Squares in Circular Words. 27-37 - Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman:
LZ78 Compression in Low Main Memory Space. 38-50 - Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. 51-67 - Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova:
On Suffix Tree Breadth. 68-73 - Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Pattern Matching on Elastic-Degenerate Text with Errors. 74-90 - Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen:
Succinct Partial Sums and Fenwick Trees. 91-96 - Philip Bille, Finn Fernstrøm, Inge Li Gørtz:
Tight Bounds for Top Tree Compression. 97-102 - Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá:
Efficient Compression and Indexing of Trajectories. 103-115 - Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies:
Fast Construction of Compressed Web Graphs. 116-128 - Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). 129-143 - Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. 144-160 - Djamal Belazzougui, Fabio Cunial:
Fast Label Extraction in the CDAWG. 161-175 - Lavinia Egidi, Giovanni Manzini:
Lightweight BWT and LCP Merging via the Gap Algorithm. 176-190 - Johannes Fischer, Dominik Köppl:
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. 191-207 - Szymon Grabowski:
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings. 208-213 - Heikki Hyyrö:
Mining Bit-Parallel LCS-length Algorithms. 214-220 - Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa:
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries. 221-233 - Yusaku Kaneta:
Faster Practical Block Compression for Rank/Select Dictionaries. 234-240 - Shmuel T. Klein, Tamar C. Serebro, Dana Shapira:
Optimal Skeleton Huffman Trees. 241-253 - Dmitry Kosolobov, Florin Manea, Dirk Nowotka:
Detecting One-Variable Patterns. 254-270 - Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order Preserving Pattern Matching on Trees and DAGs. 271-277 - Gonzalo Navarro:
A Self-index on Block Trees. 278-289 - Mikhail Rubinchik, Arseny M. Shur:
Counting Palindromes in Substrings. 290-303 - Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. 304-316
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.
last updated on 2024-10-01 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
