default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrague Stringology Conference 2014: Prague, Czech Republic
- Jan Holub, Jan Zdárek:
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2014, ISBN 978-80-01-05547-2
Invited Talk
- Frantisek Franek:
On the Number of Distinct Squares. 1-2
Regular Contributions
- Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato:
Fast Regular Expression Matching Based On Dual Glushkov NFA. 3-16 - Tinus Strauss, Derrick G. Kourie, Bruce W. Watson, Loek G. Cleophas:
A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm. 17-29 - Domenico Cantone, Simone Faro:
Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. 30-42 - Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian Covers and Abelian Runs. 43-51 - Haoyue Bai, Frantisek Franek, William F. Smyth:
Two Squares Canonical Factorization. 52-58 - Robert Susik, Szymon Grabowski, Kimmo Fredriksson:
Multiple Pattern Matching Revisited. 59-70 - Branislav Durian, Tamanna Chhabra, Sukhpal Singh Ghuman, Tommi Hirvola, Hannu Peltola, Jorma Tarhio:
Improved Two-Way Bit-parallel Search. 71-83 - Bruce W. Watson, Loek G. Cleophas, Derrick G. Kourie:
Using Correctness-by-Construction to Derive Dead-zone Algorithms. 84-95 - Shmuel Tomi Klein
, Dana Shapira:
Random Access to Fibonacci Codes. 96-109 - Kerttu Pollari-Malmi, Jussi Rautio, Jorma Tarhio:
Speeding up Compressed Matching with SBNDM2. 110-123 - Alexander Tiskin:
Threshold Approximate Matching in Grammar-Compressed Strings. 124-138 - Shmuel Tomi Klein, Dana Shapira:
Metric Preserving Dense SIFT Compression. 139-147 - Bastien Cazaux, Eric Rivals:
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. 148-161 - Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. 162-168 - Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio:
Alternative Algorithms for Lyndon Factorization. 169-178 - Szymon Grabowski, Marcin Raniszewski:
Two Simple Full-Text Indexes Based on the Suffix Array. 179-191 - Peter Leupold:
Reducing Squares in Suffix Arrays. 192-201 - Szymon Grabowski:
New Tabulation and Sparse Dynamic Programming Based Techniques for Sequence Similarity Problems. 202-211
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-05-06 21:43 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:
