10papers

author S. Faro

[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).
[49]  S. Faro and T. Lecroq. Efficient Variants of the Backward-Oracle-Matching Algorithm. Proceedings of the Prague Stringology Conference 2008, pp.146--160, Czech Technical University in Prague, Czech Republic, (2008).
[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).
[61]  S. Faro and M. O. Kulekci. Fast Multiple String Matching Using Streaming SIMD Extensions Technology. String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Lecture Notes in Computer Science, n.7608, pp.217--228, Springer-Verlag, Berlin, (2012).
[62]  S. Faro and T. Lecroq. A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. Experimental Algorithms - 11th International Symposium, SEA 2012, Lecture Notes in Computer Science, n.7276, pp.172--183, Springer-Verlag, Berlin, (2012).
[63]  S. Faro and T. Lecroq. A Fast Suffix Automata Based Algorithm for Exact Online String Matching. Implementation and Application of Automata - 17th International Conference, CIAA 2012, Lecture Notes in Computer Science, n.7381, pp.149--158, Springer-Verlag, Berlin, (2012).
[65]  S. Faro and M. O. Kulekci. Fast Packed String Matching for Short Patterns. Meeting on Algorithm Engineering and Experiments, ALENEX 2013, (2013).