default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 28
Volume 28, September 2014
- Maxime Crochemore, Jacqueline W. Daykin
, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 1. 1 - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Suffix array and Lyndon factorization of a text. 2-8 - Bastien Cazaux, Eric Rivals:
Reverse engineering of compact suffix trees and links: A novel algorithm. 9-22 - Michael Hirsch, Shmuel Tomi Klein, Yair Toaff:
Layouts for improved hierarchical parallel computations. 23-30 - Joe Sawada, Aaron Williams, Dennis Wong:
The lexicographically smallest universal cycle for binary strings with minimum specified weight. 31-40 - Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A subquadratic algorithm for minimum palindromic factorization. 41-48 - Ibrahim Chegrane, Djamal Belazzougui:
Simple, compact and robust approximate string dictionary. 49-60 - Simone Faro, M. Oguzhan Külekci:
Fast and flexible packed string matching. 61-72 - Domenico Cantone, Simone Faro:
Improved and self-tuned occurrence heuristics. 73-84
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-12-04 22:09 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:
