The following pages link to Giovanni Manzini (Q205200):
Displaying 50 items.
- Design and analysis of periodic multiple seeds (Q393900) (← links)
- Better spaced seeds using quadratic residues (Q394336) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- Radix sort on the hypercube (Q1178199) (← links)
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects (Q1267710) (← links)
- Lyapunov exponent versus expansivity and sensitivity in cellular automata (Q1271176) (← links)
- (Q1300221) (redirect page) (← links)
- Finding exact solutions to the bandwidth minimization problem (Q1300222) (← links)
- Attractors of linear cellular automata (Q1307699) (← links)
- Sparse matrix computations on the hypercube and related networks (Q1328088) (← links)
- Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results (Q1329416) (← links)
- Algebraic techniques in communication complexity (Q1350289) (← links)
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates (Q1383440) (← links)
- On computing the entropy of cellular automata. (Q1401183) (← links)
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\) (Q1575952) (← links)
- Block sorting-based transformations on words: beyond the magic BWT (Q1622940) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- XBWT tricks (Q1796830) (← links)
- Minimal residual algorithm and matrix-vector information (Q1816693) (← links)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) (Q1874655) (← links)
- Engineering a lightweight suffix array construction algorithm (Q1882475) (← links)
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) (Q1960524) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Compressed spaced suffix arrays (Q2363990) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Efficient construction of a complete index for pan-genomics read alignment (Q2415261) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Inversion of circulant matrices over $\mathbf{Z}_m$ (Q2719071) (← links)
- (Q2768305) (← links)
- Compressed representations of sequences and full-text indexes (Q2944557) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- An analysis of the Burrows—Wheeler transform (Q3196619) (← links)
- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited (Q3506910) (← links)
- Space-Conscious Compression (Q3525569) (← links)
- Boosting textual compression in optimal linear time (Q3546295) (← links)
- Indexing compressed text (Q3546296) (← links)
- Lightweight Data Indexing and Compression in External Memory (Q3557061) (← links)
- The Myriad Virtues of Wavelet Trees (Q3613790) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Succinct Representations of Trees (Q3651530) (← links)
- (Q3836539) (← links)
- (Q4218157) (← links)
- (Q4219041) (← links)
- (Q4219049) (← links)
- (Q4252346) (← links)
