Simone Faro

From MaRDI portal
Revision as of 08:05, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:390884

Available identifiers

zbMath Open faro.simoneMaRDI QIDQ390884

List of research outcomes





PublicationDate of PublicationType
Quantum path parallelism: a circuit-based approach to text searching2024-11-12Paper
Fast Cartesian tree matching2024-04-19Paper
Quantum string matching unfolded and extended2024-01-11Paper
Compact suffix automata representations for searching long patterns2023-04-20Paper
Sequence searching allowing for non-overlapping adjacent unbalanced translocations2023-02-07Paper
Improved characters distance sampling for online and offline text searching2023-02-01Paper
A weak approach to suffix automata simulation for exact and approximate string matching2022-09-27Paper
The Range Automaton: an efficient approach to text-searching2022-05-20Paper
Efficient string matching based on a two-step simulation of the suffix automaton2022-03-22Paper
Fast algorithms for single and multiple pattern Cartesian tree matching2020-12-15Paper
Efficient online string matching based on characters distance text sampling2020-10-21Paper
Fast multiple pattern Cartesian tree matching2020-07-22Paper
The order-preserving pattern matching problem in practice2020-02-14Paper
Fast Packed String Matching for Short Patterns2019-09-12Paper
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition2019-03-27Paper
Verifiable pattern matching on outsourced texts2019-01-04Paper
A Very Fast String Matching Algorithm Based on Condensed Alphabets2016-11-09Paper
Efficient Algorithms for the Order Preserving Pattern Matching Problem2016-11-09Paper
Verifiable Pattern Matching on Outsourced Texts2016-10-21Paper
Text searching allowing for inversions and translocations of factors2015-09-22Paper
Fast and flexible packed string matching2014-09-05Paper
Improved and self-tuned occurrence heuristics2014-09-05Paper
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs2014-08-13Paper
The exact online string matching problem2014-08-13Paper
Efficient string-matching allowing for non-overlapping inversions2014-01-09Paper
String matching with inversions and translocations in linear average time (most of the time)2013-03-28Paper
A Fast Suffix Automata Based Algorithm for Exact Online String Matching2012-09-20Paper
PATTERN MATCHING WITH SWAPS IN PRACTICE2012-08-30Paper
ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS2012-08-30Paper
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach2012-05-24Paper
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns2012-05-11Paper
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions2011-06-29Paper
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach2010-07-26Paper
EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM2010-01-08Paper
NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL2010-01-08Paper
A New Algorithm for Efficient Pattern Matching with Swaps2009-12-11Paper
Pattern Matching for Control Chart Monitoring2009-03-31Paper
Pattern Matching with Swaps for Short Patterns in Linear Time2009-02-03Paper
ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES2008-11-03Paper
https://portal.mardi4nfdi.de/entity/Q54461212008-03-06Paper
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm2007-05-29Paper
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM2007-02-08Paper
Experimental and Efficient Algorithms2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44263442003-09-16Paper

Research outcomes over time

This page was built for person: Simone Faro