Giovanni Manzini

According to our database1, Giovanni Manzini authored at least 100 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
The Alternating BWT: An algorithmic perspective.
Theor. Comput. Sci., 2020

Lightweight merging of compressed indices based on BWT variants.
Theor. Comput. Sci., 2020

2019
A compact index for order-preserving pattern matching.
Softw., Pract. Exper., 2019

25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241).
Dagstuhl Reports, 2019

Tree-Shape Grammars for Random Access.
CoRR, 2019

Matching reads to many genomes with the r-index.
CoRR, 2019

External memory BWT and LCP computation for sequence collections with applications.
Algorithms for Molecular Biology, 2019

Prefix-free parsing for building big BWTs.
Algorithms for Molecular Biology, 2019

Inducing the Lyndon Array.
Proceedings of the String Processing and Information Retrieval, 2019

Rpair: Rescaling RePair with Rsync.
Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Merging of Succinct de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2019

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.
Proceedings of the Research in Computational Molecular Biology, 2019

A New Class of Searchable and Provably Highly Compressible String Transformations.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Lyndon array construction during Burrows-Wheeler inversion.
J. Discrete Algorithms, 2018

Prefix-Free Parsing for Building Big BWTs.
CoRR, 2018

STAble: a novel approach to de novo assembly of RNA-seq data and its application in a metabolic model network based metatranscriptomic workflow.
BMC Bioinformatics, 2018

Prefix-Free Parsing for Building Big BWTs.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Block Sorting-Based Transformations on Words: Beyond the Magic BWT.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Wheeler graphs: A framework for BWT-based data structures.
Theor. Comput. Sci., 2017

Compressed Spaced Suffix Arrays.
Mathematics in Computer Science, 2017

Lightweight BWT and LCP Merging via the Gap Algorithm.
Proceedings of the String Processing and Information Retrieval, 2017

An Encoding for Order-Preserving Matching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Wheeler Graphs: Variations on a Theme by Burrows and Wheeler.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Dictionary-Based Data Compression.
Encyclopedia of Algorithms, 2016

Burrows-Wheeler Transform.
Encyclopedia of Algorithms, 2016

Boosting Textual Compression.
Encyclopedia of Algorithms, 2016

From H&M to Gap for Lightweight BWT Merging.
CoRR, 2016

Toward a Succinct Index for Order-Preserving Pattern Matching.
CoRR, 2016

Compressing and Indexing Stock Market Data.
CoRR, 2016

XBWT Tricks.
Proceedings of the String Processing and Information Retrieval, 2016

Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.
Proceedings of the String Processing and Information Retrieval, 2016

2015
Multiple seeds sensitivity using a single seed with threshold.
J. Bioinformatics and Computational Biology, 2015

Longest Common Prefix with Mismatches.
Proceedings of the String Processing and Information Retrieval, 2015

Relative Select.
Proceedings of the String Processing and Information Retrieval, 2015

2014
Design and analysis of periodic multiple seeds.
Theor. Comput. Sci., 2014

Spaced Seed Design Using Perfect Rulers.
Fundam. Inform., 2014

Reusing an FM-index.
CoRR, 2014

Relative FM-Indexes.
Proceedings of the String Processing and Information Retrieval, 2014

2013
Foreword.
Theor. Comput. Sci., 2013

Better spaced seeds using Quadratic Residues.
J. Comput. Syst. Sci., 2013

2012
Lightweight Data Indexing and Compression in External Memory.
Algorithmica, 2012

2011
Spaced Seeds Design Using Perfect Rulers.
Proceedings of the String Processing and Information Retrieval, 2011

2010
Move-to-Front, Distance Coding, and Inversion Frequencies revisited.
Theor. Comput. Sci., 2010

On compressing the textual web.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

2009
Compressing and indexing labeled trees, with applications.
J. ACM, 2009

The myriad virtues of Wavelet Trees.
Inf. Comput., 2009

Succinct Representations of Trees.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Permuted Longest-Common-Prefix Array.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Dictionary-Based Data Compression.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Burrows-Wheeler Transform.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Boosting Textual Compression.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Foreword.
Theor. Comput. Sci., 2007

Compressed representations of sequences and full-text indexes.
ACM Trans. Algorithms, 2007

Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
BMC Bioinformatics, 2007

Space-Conscious Compression.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Compressing and searching XML data via two zips.
Proceedings of the 15th international conference on World Wide Web, 2006

The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression.
Proceedings of the Algorithms, 2006

2005
Indexing compressed text.
J. ACM, 2005

Boosting textual compression in optimal linear time.
J. ACM, 2005

Structuring labeled trees for optimal succinctness, and beyond.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
A simple and fast DNA compressor.
Softw., Pract. Exper., 2004

Engineering a Lightweight Suffix Array Construction Algorithm.
Algorithmica, 2004

Two Space Saving Tricks for Linear Time LCP Array Computation.
Proceedings of the Algorithm Theory, 2004

An Alphabet-Friendly FM-Index.
Proceedings of the String Processing and Information Retrieval, 2004

Compression boosting in optimal linear time using the Burrows-Wheeler Transform.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
On computing the entropy of cellular automata.
Theor. Comput. Sci., 2003

2001
Inversion of circulant matrices over Zm.
Math. Comput., 2001

An analysis of the Burrows-Wheeler transform.
J. ACM, 2001

An experimental study of a compressed index.
Inf. Sci., 2001

An experimental study of an opportunistic index.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Ergodicity, transitivity, and regularity for linear cellular automata over Zm.
Theor. Comput. Sci., 2000

Opportunistic Data Structures with Applications.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.
Theor. Comput. Sci., 1999

Parallel Complexity of Numerically Accurate Linear System Solvers.
SIAM J. Comput., 1999

Compression of Low Entropy Strings with Lempel-Ziv Algorithms.
SIAM J. Comput., 1999

Attractors of Linear Cellular Automata.
J. Comput. Syst. Sci., 1999

Finding Exact Solutions to the Bandwidth Minimization Problem.
Computing, 1999

Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Efficient Algorithms foe On-Line Symbol Ranking Compression.
Proceedings of the Algorithms, 1999

1998
Invertible Linear Cellular Automata over Zm: Algorithmic and Dynamical Aspects.
J. Comput. Syst. Sci., 1998

Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata.
J. Complex., 1998

Lower bounds for sparse matrix vector multiplication on hypercubic networks.
Discrete Mathematics & Theoretical Computer Science, 1998

Attractors of D-dimensional Linear Cellular Automata.
Proceedings of the STACS 98, 1998

Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates.
J. Complex., 1997

On Ergodic Linear Cellular Automata over Zm.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On the Parallel Complexity of Matrix Factorization Algorithms.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
On the Ordering of Sparse Linear Systems.
Theor. Comput. Sci., 1996

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
INFORMS Journal on Computing, 1996

Parallel Complexity of Householder QR Factorization.
Proceedings of the Algorithms, 1996

Lyapunov Exponents Vs Expansivity and Sensitivity in Cellular Automata.
Proceedings of the ACRI '96, 1996

1995
Algebraic Techniques in Communication Complexity.
Inf. Process. Lett., 1995

BIDA: An Improved Perimeter Search Algorithm.
Artif. Intell., 1995

1994
sparse Matrix Computations on the Hypercube and Related Networks.
J. Parallel Distributed Comput., 1994

Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results.
Inf. Process. Lett., 1994

1993
Global Strategies for Augmenting the Efficiency of TSP Heuristics.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1991
Large Sorting and Routing Problems on the Hypercube and Related Networks.
Parallel Processing Letters, 1991

Searching graphs using mixed strategies.
J. Exp. Theor. Artif. Intell., 1991

Radix Sort on the Hypercube.
Inf. Process. Lett., 1991


  Loading...