Simone Faro
- Artificial Intelligence top 5%
- Hardware and Architecture top 5%
- Molecular Biology
- Computational Theory and Mathematics top 10%
- Information Systems
- Co-authors
- Thierry LecroqDomenico CantoneSzymon GrabowskiJorma TarhioKunsoo ParkGeonmo GuMatteo Campanelli
- Topics
- Algorithms and Data Compression (41 papers)Network Packet Processing and Optimization (25 papers)semigroups and automata theory (15 papers)
In The Last Decade
Simone Faro
44 papers receiving 253 citations
Peers
Comparison fields: 5 of 28
- Artificial Intelligence 243
- Hardware and Architecture 149
- Molecular Biology 107
- Computational Theory and Mathematics 58
- Information Systems 38
Countries citing papers authored by Simone Faro
This map shows the geographic impact of Simone Faro's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Simone Faro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Simone Faro more than expected).
Fields of papers citing papers by Simone Faro
This network shows the impact of papers produced by Simone Faro. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Simone Faro. The network helps show where Simone Faro may publish in the future.
Co-authorship network of co-authors of Simone Faro
This figure shows the co-authorship network connecting the top 25 collaborators of Simone Faro. A scholar is included among the top collaborators of Simone Faro based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Simone Faro. Simone Faro is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | Refined Tagging of Complex Verbal Phrases for the Italian Language. | 1 |
| 3 | An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem | 3 |
| 4 | Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata. | 0 |
| 5 | 9 | |
| 6 | 3 | |
| 7 | Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. | 1 |
| 8 | Improved and Self-Tuned Occurrence Heuristics. | 1 |
| 9 | Swap Matching in Strings by Simulating Reactive Automata. | 1 |
| 10 | 1 | |
| 11 | 2 | |
| 12 | 11 | |
| 13 | 12 | |
| 14 | 5 | |
| 15 | Approximate String Matching Allowing for Inversions and Translocations. | 8 |
| 16 | An Efficient Algorithm for Approximate Pattern Matching with Swaps. | 1 |
| 17 | New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences. | 1 |
| 18 | A space efficient bit-parallel algorithm for the multiple string matching problem. | 1 |
| 19 | 3 | |
| 20 | Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. | 5 |
About Simone Faro
Simone Faro is a scholar working on Hardware and Architecture, Artificial Intelligence and Computational Theory and Mathematics, having authored 46 papers that have together received 270 indexed citations. Recurring topics across this work include Algorithms and Data Compression (41 papers), Network Packet Processing and Optimization (25 papers) and semigroups and automata theory (15 papers). The work is most often cited by research in Hardware and Architecture (149 citations), Artificial Intelligence (243 citations) and Computational Theory and Mathematics (58 citations). Simone Faro has collaborated with scholars based in Italy, France and Türkiye. Frequent co-authors include Thierry Lecroq, Domenico Cantone, Szymon Grabowski, Jorma Tarhio, Kunsoo Park, Geonmo Gu and Matteo Campanelli. Their work appears in journals such as ACM Computing Surveys, Theoretical Computer Science and The Computer Journal.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.