default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2008: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2008, ISBN 978-80-01-04145-1
Invited Talk
- Avraham Trakhtman:
The Road Coloring and Cerny Conjecture. 1-12
Contributed Talks
- Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic Burrows-Wheeler Transform. 13-25 - Luigi Cinque, Sergio De Agostino:
Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures. 26-34 - Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine. 35-45 - Shmuel Tomi Klein
, Dana Shapira:
Huffman Coding with Non-Sorted Frequencies. 46-53 - Matthias Gallé, Pierre Peterlongo, François Coste:
In-place Update of Suffix Array while Recoding Words. 54-67 - Jie Lin, Yue Jiang, Donald A. Adjeroh:
The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees and Suffix Arrays. 68-83 - Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Parameterized Suffix Arrays for Binary Strings. 84-94 - William F. Smyth, Shu Wang, Mao Yu:
An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. 95-107 - Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau:
Conservative String Covering of Indeterminate Strings. 108-115 - Sébastien Rebecchi, Jean-Michel Jolion:
On the Uniform Distribution of Strings. 116-125 - Geneviève Paquin:
Infinite Smooth Lyndon Words. 126-139 - Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. 140-145 - Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. 146-160 - Simon J. Puglisi, William F. Smyth, Munina Yusufu:
Fast Optimal Algorithms for Computing All the Repeats in a String. 161-169 - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. 170184 - Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Average Value of Sum of Exponents of Runs in Strings. 185-192 - Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. 193-207 - Manolis Christodoulakis, Gerhard Brey:
Edit Distance with Single-Symbol Combinations and Splits by Manolis. 208-217 - Tinus Strauss, Derrick G. Kourie, Bruce W. Watson:
A Concurrent Specification of an Incremental DFA Minimisation Algorithm. 218-226 - Wikus Coetser, Derrick G. Kourie, Bruce W. Watson:
On Regular Expression Hashing to Reduce FA Size. 227-241
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 2025-11-11 23:04 CET 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:
