The following pages link to Giovanni Manzini (Q205200):
Displaying 37 items.
- Parallel Complexity of Numerically Accurate Linear System Solvers (Q4268855) (← links)
- (Q4381386) (← links)
- (Q4411402) (← links)
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m (Q4572007) (← links)
- Parallel complexity of householder QR factorization (Q4595495) (← links)
- (Q4643887) (← links)
- (Q4699313) (← links)
- (Q4941887) (← links)
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms (Q4943851) (← links)
- On ergodic linear cellular automata over Zm (Q5048943) (← links)
- Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
- A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
- Prefix-Free Parsing for Building Big BWTs (Q5090326) (← links)
- (Q5090335) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- PFP Compressed Suffix Trees (Q5147525) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP (Q5284220) (← links)
- Algorithm Theory - SWAT 2004 (Q5315389) (← links)
- String Processing and Information Retrieval (Q5393950) (← links)
- Spaced Seed Design Using Perfect Rulers (Q5415294) (← links)
- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression (Q5449578) (← links)
- (Q5501323) (← links)
- On the ordering of sparse linear systems (Q5906733) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5916286) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
- On the ordering of sparse linear systems (Q5967079) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- (Q6133881) (← links)
- (Q6187832) (← links)
- Practical Random Access to SLP-Compressed Texts (Q6485940) (← links)
- The landscape of compressibility measures for two-dimensional data (Q6510935) (← links)
- Rpair: rescaling RePair with Rsync (Q6536245) (← links)
- Inducing the Lyndon array (Q6536249) (← links)
- Space-efficient merging of succinct de Bruijn graphs (Q6536265) (← links)
- Compressibility measures for two-dimensional data (Q6545417) (← links)
