 | 2012 |
| 11 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.
Inf. Comput. 213: 3-12 (2012) |
| 10 |  | Matteo Campanelli,
Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Pattern Matching with Swaps in Practice.
Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) |
| 9 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts.
Int. J. Found. Comput. Sci. 23(2): 343-356 (2012) |
| 8 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns.
J. Discrete Algorithms 11: 25-36 (2012) |
| 2011 |
| 7 |  | Szymon Grabowski,
Simone Faro,
Emanuele Giaquinta:
String matching with inversions and translocations in linear average time (most of the time).
Inf. Process. Lett. 111(11): 516-520 (2011) |
| 2010 |
| 6 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach.
CPM 2010: 288-298 |
| 5 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Bit-(Parallelism)2: Getting to the Next Level of Parallelism.
FUN 2010: 166-177 |
| 4 |  | Szymon Grabowski,
Simone Faro,
Emanuele Giaquinta:
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)
CoRR abs/1012.0280: (2010) |
| 2009 |
| 3 |  | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts.
Stringology 2009: 29-39 |
| 2 |  | Matteo Campanelli,
Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
Stringology 2009: 90-104 |
| 2008 |
| 1 |  | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro,
Emanuele Giaquinta:
Finite State Models for the Generation of Large Corpora of Natural Language Texts.
FSMNLP 2008: 175-182 |