5papers

author D. Cantone

[32]  D. Cantone and S. Faro. Fast-Search: a new efficient variant of the Boyer-Moore string matching algorithm. WEA 2003, Lecture Notes in Computer Science, vol.2647, pp.247--267, Springer-Verlag, Berlin, (2003).
[36]  D. Cantone and S. Faro. Searching for a substring with constant extra-space complexity. Proc. of Third International Conference on Fun with algorithms, pp.118--131, (2004).
[37]  D. Cantone and S. Faro. Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb., vol.10, n.5/6, pp.589--608, (2005).
[57]  D. Cantone and S. Faro and E. Giaquinta. A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol.6129, pp.288--298, Springer-Verlag, Berlin, (2010).
[58]  D. Cantone and S. Faro and E. Giaquinta. Bit-Parallelism^2: Getting to the Next Level of Parallelism. Fun with Algorithms, Lecture Notes in Computer Science, vol.6099, pp.166--177, Springer-Verlag, Berlin, (2010).