Simone Faro - RankMe

126 papers A 3B 9C 12Misc 28Journal 53Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Extending Qutes: a practical high-level language for quantum computing. Comput. J. Simone Faro, Francesco Pio Marino, Gabriele Messina
2026	J	`jnl`	Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation. IEEE Access Simone Faro, Thierry Lecroq, Francesco Pio Marino
2026	J	`jnl`	Quantum algorithms for longest common and palindromic substrings in the circuit model. Theor. Comput. Sci. Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2026	J	`jnl`	Reversible Lifetime Semantics for Quantum Programs. CoRR Simone Faro, Francesco Pio Marino, Gabriele Messina
2025	J	`jnl`	Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism. CoRR Simone Faro, Arianna Pavone, Caterina Viola
2025	A	`conf`	Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing. HPDC Simone Faro, Francesco Pio Marino, Gabriele Messina
2025	J	`jnl`	Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing. CoRR Simone Faro, Francesco Pio Marino, Gabriele Messina
2025	A	`conf`	Scaling Grover's Search for Large Solution Spaces. HPDC Simone Faro, Francesco Pio Marino
2024	—	`conf`	A New Directly Accessible Compression Scheme. ICTCS Simone Faro, Domenico Cantone
2024	Misc	`conf`	Beyond Horspool: A Comparative Analysis in Sampled Matching. PSC Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto
2024	B	`conf`	Efficient Exact Online String Matching Through Linked Weak Factors. SEA Matthew N. Palmer, Simone Faro, Stefano Scafiti
2024	—	`conf`	Families of Constant-Depth Quantum Circuits for Rotations and Permutations. ICTCS Simone Faro, Arianna Pavone, Caterina Viola
2024	—	`conf`	Improving Sampled Matching through Character Context Sampling. ICTCS Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti
2024	—	`conf`	Practical Implementation of a Quantum String Matching Algorithm. QUASAR@HPDC Francesco Pio Marino, Simone Faro, Antonio Scardace
2024	—	`conf`	Quantum Circuit Based Longest Common Substring. ICTCS Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2024	—	`conf`	Quantum Circuits for Fixed Matching Substring Problems. SAI (3) Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2024	C	`conf`	Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC Simone Faro, Arianna Pavone, Caterina Viola
2024	Misc	`conf`	Refining SFDC Compression Scheme with Block Text Segmentation. PSC Simone Faro, Alfio Spoto
2024	Misc	`conf`	The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. FUN Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace
2023	J	`jnl`	Compact suffix automata representations for searching long patterns. Theor. Comput. Sci. Simone Faro, Stefano Scafiti
2023	J	`jnl`	Efficient Online String Matching through Linked Weak Factors. CoRR Matthew N. Palmer, Simone Faro, Stefano Scafiti
2023	J	`jnl`	Improved characters distance sampling for online and offline text searching. Theor. Comput. Sci. Simone Faro, Francesco Pio Marino, Arianna Pavone
2023	J	`jnl`	Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. CoRR Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2023	J	`jnl`	On the Longest Common Cartesian Substring Problem. Comput. J. Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti
2023	J	`jnl`	Quantum Circuits for Fixed Substring Matching Problems. CoRR Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2023	C	`conf`	Quantum String Matching Unfolded and Extended. RC Domenico Cantone, Simone Faro, Arianna Pavone
2023	J	`jnl`	The Many Qualities of a New Directly Accessible Compression Scheme. CoRR Domenico Cantone, Simone Faro
2022	J	`jnl`	A weak approach to suffix automata simulation for exact and approximate string matching. Theor. Comput. Sci. Simone Faro, Stefano Scafiti
2021	C	`conf`	Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. CIAA Simone Faro, Stefano Scafiti
2021	—	`conf`	Enhancing Characters Distance Text Sampling by Condensed Alphabets. ICTCS Simone Faro, Francesco Pio Marino, Arianna Pavone
2021	J	`jnl`	Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
2021	—	`conf`	Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. ICTCS Simone Faro, Stefano Scafiti
2021	J	`jnl`	Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR Domenico Cantone, Simone Faro, Arianna Pavone
2021	—	`conf`	The Range Automaton: An Efficient Approach to Text-Searching. WORDS Simone Faro, Stefano Scafiti
2021	Misc	`conf`	Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. PSC Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace
2020	B	`ed.`	18th International Symposium on Experimental Algorithms, SEA 2020, Catania, Italy, June 16-18, 2020 SEA Simone Faro, Domenico Cantone
2020	—	`conf`	Bit-Layers Text Encoding for Efficient Text Processing. SOFSEM (Doctoral Student Research Forum) Domenico Cantone, Simone Faro, Stefano Scafiti
2020	J	`jnl`	Efficient Online String Matching Based on Characters Distance Text Sampling. Algorithmica Simone Faro, Francesco Pio Marino, Arianna Pavone
2020	B	`conf`	Fast Multiple Pattern Cartesian Tree Matching. WALCOM Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
2020	Misc	`conf`	Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. PSC Simone Faro, Thierry Lecroq, Kunsoo Park
2020	—	`conf`	Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. SOFSEM (Doctoral Student Research Forum) Simone Faro, Francesco Pio Marino, Stefano Scafiti
2020	Misc	`conf`	Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. PSC Simone Faro, Francesco Pio Marino
2020	C	`conf`	Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. WABI Domenico Cantone, Simone Faro, Arianna Pavone
2020	—	`conf`	Shape-Preserving Pattern Matching. ICTCS Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2020	J	`jnl`	The order-preserving pattern matching problem in practice. Discret. Appl. Math. Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2019	—	`conf`	Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. IWBBIO (1) Simone Faro, Arianna Pavone
2019	J	`jnl`	Efficient Online String Matching Based on Characters Distance Text Sampling. CoRR Simone Faro, Arianna Pavone, Francesco Pio Marino
2019	C	`conf`	Fast Cartesian Tree Matching. SPIRE Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
2019	J	`jnl`	Fast Cartesian Tree Matching. CoRR Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park
2019	J	`jnl`	Fast Multiple Pattern Cartesian Tree Matching. CoRR Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
2019	—	`conf`	Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. IWBBIO (1) Simone Faro, Arianna Pavone
2019	J	`jnl`	Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. ACM J. Exp. Algorithmics Domenico Cantone, Simone Faro, Arianna Pavone
2018	J	`jnl`	An Efficient Skip-Search Approach to Swap Matching. Comput. J. Simone Faro, Arianna Pavone
2018	J	`jnl`	Flexible and Efficient Algorithms for Abelian Matching in Strings. CoRR Simone Faro, Arianna Pavone
2018	J	`jnl`	Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR Domenico Cantone, Simone Faro, Arianna Pavone
2018	J	`jnl`	Verifiable pattern matching on outsourced texts. J. Discrete Algorithms Dario Catalano, Mario Di Raimondo, Simone Faro
2017	J	`jnl`	Engineering order-preserving pattern matching with SIMD parallelism. Softw. Pract. Exp. Tamanna Chhabra, Simone Faro, M. Oguzhan Külekci, Jorma Tarhio
2017	Misc	`conf`	Speeding Up String Matching by Weak Factor Recognition. PSC Domenico Cantone, Simone Faro, Arianna Pavone
2017	J	`jnl`	Speeding Up String Matching by Weak Factor Recognition. CoRR Domenico Cantone, Simone Faro, Arianna Pavone
2016	C	`conf`	A Very Fast String Matching Algorithm Based on Condensed Alphabets. AAIM Simone Faro
2016	C	`conf`	Efficient Algorithms for the Order Preserving Pattern Matching Problem. AAIM Simone Faro, M. Oguzhan Külekci
2016	—	`conf`	Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. AlCoB Simone Faro
2016	J	`jnl`	Exact Online String Matching Bibliography. CoRR Simone Faro
2016	Misc	`conf`	The String Matching Algorithms Research Tool. PSC Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio
2016	Misc	`conf`	Verifiable Pattern Matching on Outsourced Texts. SCN Dario Catalano, Mario Di Raimondo, Simone Faro
2015	Misc	`conf`	An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. PSC Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2015	J	`jnl`	Efficient Algorithms for the Order Preserving Pattern Matching Problem. CoRR Simone Faro, M. Oguzhan Külekci
2015	—	`conf`	Nucleotide Sequence Alignment and Compression via Shortest Unique Substring. IWBBIO (2) Boran Adas, Ersin Bayraktar, Simone Faro, Ibraheem Elsayed Moustafa, M. Oguzhan Külekci
2015	J	`jnl`	Prior Polarity Lexical Resources for the Italian Language. CoRR Valeria Borzì, Simone Faro, Arianna Pavone, Sabrina Sansone
2015	Misc	`conf`	Refined Tagging of Complex Verbal Phrases for the Italian Language. PSC Simone Faro, Arianna Pavone
2014	Misc	`conf`	Automatic Extraction of Semantic Relations by Using Web Statistical Information. ICCS Valeria Borzì, Simone Faro, Arianna Pavone
2014	Misc	`conf`	Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. PSC Domenico Cantone, Simone Faro
2014	J	`jnl`	Fast and flexible packed string matching. J. Discrete Algorithms Simone Faro, M. Oguzhan Külekci
2014	J	`jnl`	Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs. J. Discrete Algorithms Domenico Cantone, Simone Faro
2014	J	`jnl`	Improved and self-tuned occurrence heuristics. J. Discrete Algorithms Domenico Cantone, Simone Faro
2014	J	`jnl`	Text searching allowing for inversions and translocations of factors. Discret. Appl. Math. Domenico Cantone, Simone Faro, Emanuele Giaquinta
2013	J	`jnl`	Efficient string-matching allowing for non-overlapping inversions. Theor. Comput. Sci. Domenico Cantone, Salvatore Cristofaro, Simone Faro
2013	A	`conf`	Fast Packed String Matching for Short Patterns. ALENEX Simone Faro, M. Oguzhan Külekci
2013	Misc	`conf`	Improved and Self-Tuned Occurrence Heuristics. PSC Domenico Cantone, Simone Faro
2013	Misc	`conf`	Swap Matching in Strings by Simulating Reactive Automata. PSC Simone Faro
2013	J	`jnl`	The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. Simone Faro, Thierry Lecroq
2013	Misc	`conf`	Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. PSC Simone Faro, M. Oguzhan Külekci
2012	C	`conf`	A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA Simone Faro, Thierry Lecroq
2012	B	`conf`	A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA Simone Faro, Thierry Lecroq
2012	J	`jnl`	A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. Domenico Cantone, Simone Faro, Emanuele Giaquinta
2012	J	`jnl`	Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. Int. J. Found. Comput. Sci. Domenico Cantone, Simone Faro, Emanuele Giaquinta
2012	C	`conf`	Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE Simone Faro, M. Oguzhan Külekci
2012	J	`jnl`	Fast Packed String Matching for Short Patterns CoRR Simone Faro, M. Oguzhan Külekci
2012	C	`conf`	Fast searching in biological sequences using multiple hash functions. BIBE Simone Faro, Thierry Lecroq
2012	J	`jnl`	On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. J. Discrete Algorithms Domenico Cantone, Simone Faro, Emanuele Giaquinta
2012	J	`jnl`	Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
2011	Misc	`conf`	2001-2010: Ten Years of Exact String Matching Algorithms. PSC Simone Faro, Thierry Lecroq
2011	B	`conf`	Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. CPM Domenico Cantone, Salvatore Cristofaro, Simone Faro
2011	J	`jnl`	String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. Szymon Grabowski, Simone Faro, Emanuele Giaquinta
2010	B	`conf`	A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. CPM Domenico Cantone, Simone Faro, Emanuele Giaquinta
2010	Misc	`conf`	A Space-Efficient Implementation of the Good-Suffix Heuristic. PSC Domenico Cantone, Salvatore Cristofaro, Simone Faro
2010	B	`conf`	Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. SOFSEM Simone Faro, Elisa Pappalardo
2010	Misc	`conf`	Approximate String Matching Allowing for Inversions and Translocations. PSC Domenico Cantone, Simone Faro, Emanuele Giaquinta
2010	Misc	`conf`	Bit-(Parallelism) FUN Domenico Cantone, Simone Faro, Emanuele Giaquinta
2010	J	`jnl`	On Tuning the Bad-Character Rule: the Worst-Character Rule CoRR Domenico Cantone, Simone Faro
2010	J	`jnl`	String Matching with Inversions and Translocations in Linear Average Time (Most of the Time) CoRR Szymon Grabowski, Simone Faro, Emanuele Giaquinta
2010	J	`jnl`	The Exact String Matching Problem: a Comprehensive Experimental Evaluation CoRR Simone Faro, Thierry Lecroq
2009	C	`conf`	A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA Matteo Campanelli, Domenico Cantone, Simone Faro
2009	Misc	`conf`	Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. PSC Domenico Cantone, Simone Faro, Emanuele Giaquinta
2009	Misc	`conf`	An Efficient Algorithm for Approximate Pattern Matching with Swaps. PSC Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
2009	B	`conf`	An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM Simone Faro, Thierry Lecroq
2009	J	`jnl`	Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. Simone Faro, Thierry Lecroq
2009	J	`jnl`	New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval. Int. J. Found. Comput. Sci. Domenico Cantone, Salvatore Cristofaro, Simone Faro
2009	B	`conf`	Pattern Matching with Swaps for Short Patterns in Linear Time. SOFSEM Domenico Cantone, Simone Faro
2008	J	`jnl`	Efficient Pattern Matching on Binary Strings CoRR Simone Faro, Thierry Lecroq
2008	Misc	`conf`	Efficient Variants of the Backward-Oracle-Matching Algorithm. PSC Simone Faro, Thierry Lecroq
2008	—	`conf`	Finite State Models for the Generation of Large Corpora of Natural Language Texts. FSMNLP Domenico Cantone, Salvatore Cristofaro, Simone Faro, Emanuele Giaquinta
2008	Misc	`conf`	New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. PSC Domenico Cantone, Salvatore Cristofaro, Simone Faro
2008	J	`jnl`	On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences. Int. J. Found. Comput. Sci. Domenico Cantone, Salvatore Cristofaro, Simone Faro
2006	J	`jnl`	A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. Int. J. Found. Comput. Sci. Domenico Cantone, Simone Faro
2006	Misc	`conf`	On some combinatorial problems concerning the harmonic structure of musical chord sequences. PSC Domenico Cantone, Salvatore Cristofaro, Simone Faro
2005	Misc	`conf`	A space efficient bit-parallel algorithm for the multiple string matching problem. PSC Domenico Cantone, Simone Faro
2005	—	`conf`	An Efficient Algorithm for alpha-Approximate Matching with WEA Domenico Cantone, Salvatore Cristofaro, Simone Faro
2005	J	`jnl`	Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb. Domenico Cantone, Simone Faro
2005	—	`conf`	On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences. ISMIR Domenico Cantone, Salvatore Cristofaro, Simone Faro
2005	—	`conf`	Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences. ISMIR Domenico Cantone, Salvatore Cristofaro, Simone Faro
2004	Misc	`conf`	Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. PSC Domenico Cantone, Salvatore Cristofaro, Simone Faro
2004	C	`conf`	Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. CTW Domenico Cantone, Simone Faro
2004	J	`jnl`	Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. Electron. Notes Discret. Math. Domenico Cantone, Simone Faro
2003	—	`conf`	Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. WEA Domenico Cantone, Simone Faro
2003	Misc	`conf`	Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. PSC Domenico Cantone, Simone Faro