The following pages link to Roberto Grossi (Q294966):
Displaying 50 items.
- Linear-size suffix tries (Q294967) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- (Q582091) (redirect page) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q675052) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- A note on the subtree isomorphism for ordered trees and related problems (Q1182123) (← links)
- Further comments on the subtree isomorphism for ordered trees (Q1183481) (← links)
- On finding common subtrees (Q1208722) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Text sparsification via local maxima. (Q1401406) (← links)
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts (Q1627159) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Finding maximal common subgraphs via time-space efficient reverse search (Q1790989) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Optimal deterministic protocols for mobile robots on a grid (Q1854509) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- Beyond the BEST theorem: fast assessment of Eulerian trails (Q2140495) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- K-plex cover pooling for graph neural networks (Q2238356) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs (Q2294713) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Optimal implicit dictionaries over unbounded universes (Q2432542) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Enumerating Cyclic Orientations of a Graph (Q2798221) (← links)
- Listing Acyclic Orientations of Graphs with Single and Multiple Sources (Q2802950) (← links)
- Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Encodings for Range Selection and Top-k Queries (Q2849345) (← links)
- Constant-Time Word-Size String Matching (Q2904481) (← links)
- Optimal Packed String Matching (Q2911643) (← links)
- Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs (Q2921428) (← links)
- Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing (Q2929702) (← links)
- When indexing equals compression (Q2944533) (← links)
- (Q2978522) (← links)
- A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs (Q2999337) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
