The following pages link to Simone Faro (Q390884):
Displaying 43 items.
- Efficient string-matching allowing for non-overlapping inversions (Q390885) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- Improved and self-tuned occurrence heuristics (Q405578) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- Fast multiple pattern Cartesian tree matching (Q782168) (← links)
- Verifiable pattern matching on outsourced texts (Q1757465) (← links)
- String matching with inversions and translocations in linear average time (most of the time) (Q1944938) (← links)
- Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677) (← links)
- The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- The order-preserving pattern matching problem in practice (Q2295620) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)
- The exact online string matching problem (Q2875102) (← links)
- PATTERN MATCHING WITH SWAPS IN PRACTICE (Q2909198) (← links)
- ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS (Q2909199) (← links)
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702) (← links)
- Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions (Q3011868) (← links)
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM (Q3421840) (← links)
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133) (← links)
- ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES (Q3532143) (← links)
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach (Q3575255) (← links)
- Pattern Matching with Swaps for Short Patterns in Linear Time (Q3599078) (← links)
- Pattern Matching for Control Chart Monitoring (Q3618237) (← links)
- A New Algorithm for Efficient Pattern Matching with Swaps (Q3651549) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL (Q3655539) (← links)
- (Q4426344) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- Fast Packed String Matching for Short Patterns (Q5232452) (← links)
- (Q5446121) (← links)
- Experimental and Efficient Algorithms (Q5710042) (← links)
- Sequence searching allowing for non-overlapping adjacent unbalanced translocations (Q6487655) (← links)
- Fast Cartesian tree matching (Q6536248) (← links)
- Quantum path parallelism: a circuit-based approach to text searching (Q6636089) (← links)
