Journal papers

1. G. Manzini.
   Sparse Matrix Computations on the Hypercube and Related Networks.
   Journal of Parallel and Distributed Computing, Vol. 21 (1994), 169-183.

2. G. Manzini.
   Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results.
   Information Processing Letters, Vol. 50 (1994), 231-238.

3. G. Manzini.
   BIDA*: an Improved Perimeter Search Algorithm.
   Artificial Intelligence, Vol. 75 (1995), 347-360.

4. B. Codenotti, G. Manzini, L. Margara.
   Algebraic Techniques in Communication Complexity.
   Information Processing Letters, Vol. 56 (1995), 191-195.

5. G. Manzini, L. Margara.
   Minimal Residual Algorithm and Matrix-Vector Information.
   Computers and Mathematics with Applications, Vol. 32 (1996), 57-63.

6. G. Manzini.
   On the Ordering of Sparse Linear Systems.
   Theoretical Computer Science, Vol. 156 (1996), 301-313.

7. B. Codenotti, G. Manzini, L. Margara, G. Resta.
   Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
   INFORMS/ORSA Journal on Computing, Vol. 8 (1996), 125-133.

8. G. Manzini.
   Perimeter Search in Restricted Memory
   Computers and Mathematics with Applications, Vol. 32 (1996), 37-45.

9. G. M. Del Corso, G. Manzini.
   On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimate.
   Journal of Complexity, Vol. 13, n. 4, (1997), 419-456.

10. G. Manzini, L. Margara.
    Invertible Linear Cellular Automata over Zm: Algorithmic and Dynamical Aspects.
    Journal of Computer and System Sciences. Vol. 56, n. 1, (1998), 60-67.

11. G. Manzini.
    Lower Bounds for Sparse Matrix Vector Multiplication on Hypercubic Networks.
    Discrete Mathematics and Theoretical Computer Science. Vol 2, (1998), 35-47.

12. M. Finelli, G. Manzini, L. Margara.
    Lyapunov Exponents Vs Expansivity and Sensitivity in Cellular Automata
    Journal of Complexity. Vol. 14, n. 2, (1998), 210-233.

13. G. M. Del Corso, G. Manzini.
    Finding Exact Solutions to the Bandwidth Minimization Problem.
    Computing. Vol. 62, n. 3, (1999), 189-203.

14. M. Leoncini, G. Manzini, L. Margara.
    Parallel Complexity of Numerically Accurate Linear System Solvers.
    SIAM J. on Computing. Vol. 28, n. 6, (1999), 2030-2058.

15. G. Manzini, L. Margara.
    Attractors of Linear Cellular Automata.
    Journal of Computer and System Sciences. Vol. 58, n. 3, (1999), 597-610.

16. G. Manzini, L. Margara.
    A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.
    Theoretical Computer Science. Vol. 221, n. 2, (1999), 157-177.
    (DOI link).

17. R. Kosaraju, G. Manzini.
    Compression of Low Entropy Strings with Lempel-Ziv Algorithms.
    SIAM J. on Computing. Vol. 29, n. 3, (1999), 893-911.

18. B. Codenotti, G. M. Del Corso, G. Manzini.
    Matrix Rank and Communication Complexity.
    Linear Algebra and its Applications. Vol. 304, n. 1-3, (2000), 193-200.

19. G. Cattaneo, E. Formenti, G. Manzini, L. Margara.
    Ergodicity, Transitivity, and Regularity for Additive Cellular Automata over Zm.
    Theoretical Computer Science. Vol. 233, n. 1-2, (2000), 147-164.

20. D. Bini, G. M. Del Corso, G. Manzini, L. Margara.
    Inversion of Circulant Matrices over Zm.
    Mathematics of Computation. Vol. 70, (2001), 1169-1182.

21. P. Ferragina, G. Manzini.
    An Experimental Study of a Compressed Index (Invited paper).
    Information Sciences. Vol 135, (2001), 13-28.
    (DOI link).

22. G. Manzini.
    An Analysis of the Burrows-Wheeler Transform.
    Journal of the ACM. Vol. 48, n. 3, (2001), 407-430.
    (DOI link).

23. C. J. Accettella, G. M. Del Corso, G. Manzini
    Inversion of Two Level Circulant Matrices over Zp.
    Linear Algebra and its Applications. Vol. 366, (2003), 5-23.
    (DOI link).

24. M. D'amico, G. Manzini, L. Margara.
    On Computing the Entropy of Cellular Automata.
    Theoretical Computer Science. Vol. 290, n. 3, (2003), 1629-1646.
    (DOI link).

25. G. Manzini, P. Ferragina
    Engineering a Lightweight Suffix Array Construction Algorithm.
    Algorithmica. Vol. 40 (2004), 33-50.
    (DOI link).

26. G. Manzini, M. Rastero
    A Simple and Fast DNA Compression Algorithm
    Software: Practice and Experience. Vol. 34 (2004), 1397-1411.
    (DOI link).
    

27. P. Ferragina, G. Manzini.
    Indexing Compressed Text.
    Journal of the ACM. Vol. 52 (2005), 552-581.
    (DOI link).
    

28. P. Ferragina, R. Giancarlo, G. Manzini, M. Sciortino.
    Boosting Textual Compression in Optimal Linear Time.
    Journal of the ACM. Vol. 52 (2005), 688-713.
    (DOI link).
    

29. P. Ferragina, G. Manzini, V. Mäkinen, G. Navarro
    Compressed Representations of Sequences and Full-Text Indexes
    ACM Transactions on Algorithms. Vol. 3 (2007).
    (DOI link)

30. P. Ferragina, R. Giancarlo, V. Greco, G. Manzini, G. Valiente
    Compression-based Classification of Biological Sequences and Structures via the Universal Similarity Metric: Experimental Assessment.
    BMC Bioinformatics, 8:252, (2007)
    (DOI link)

31. P. Ferragina, G. Manzini, S. Muthukrishnan, (Editors).
    The Burrows-Wheeler Transform and its applications.
    Theoretical Computer Science. Vol. 387, n. 2, (2007).
    (DOI link).
    

32. P. Ferragina, R. Giancarlo, G. Manzini
    The Myriad Virtues of Wavelet Trees.
    Information and Computation, Vol. 207, (2009), 849-866.
    (DOI link).
    

33. P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan.
    Compressing and Indexing Labeled Trees, with Applications.
    Journal of the ACM, Vol 57, (2009), 1-33.
    (DOI link).

34. T. Gagie, G. Manzini
    Move-to-Front, Distance Coding, and Inversion Frequencies revisited.
    Theoretical Computer Science, Vol 411, (2010), 2925-2944.
    (DOI link).

35. P. Ferragina, T. Gagie, G. Manzini
    Lightweight Data Indexing and Compression in External Memory.
    Algorithmica, Vol. 63, (2012), 707-730.
    (DOI link).

36. R. Giancarlo, G. Manzini (editors),
    Special Issue on Combinatorial Pattern Matching.
    Theoretical Computer Science, Vol. 483 (2013).
    (DOI link).

37. L. Egidi, G. Manzini
    Better Spaced Seeds using Quadratic Residues.
    Journal of Computer and System Sciences, Vol. 79, (2013), 1144-1155.
    (DOI link).

38. L. Egidi, G. Manzini
    Design and Analysis of Periodic Multiple Seeds.
    Theoretical Computer Science, Vol. 522, (2014), 62-76.
    (DOI link).

Conference papers

39. B. Codenotti, G. Manzini, L. Margara, G. Resta.
    Global Strategies for Augmenting the Efficiency of TSP Heuristics.
    Third Workshop on Algorithms and Data Structures, (WADS '93),
    Montreal, Canada, 1993. Springer Verlag Lecture Notes in Computer Science n. 709.

40. G. Manzini.
    Improving the Efficiency of Backtrack Search.
    Proc. Int. Conf. on Artificial Intelligence: Methodologies Systems Applications (AIMSA '96),
    Sozopol, Bulgaria, 1996. IOS Press.

41. M. Leoncini, G. Manzini, L. Margara.
    Parallel Complexity of Householder QR factorization.
    Proc. European Symposium on Algorithms (ESA '96),
    Barcelona, Spain, 1996. Springer Verlag Lecture Notes in Computer Science n. 1136.

42. G. Cattaneo, E. Formenti, G. Manzini, L. Margara.
    On Ergodic Linear Cellular Automata over Zm.
    Proc. 14th Int. Symp. on Theoretical Aspects of Computer Science (STACS '97),
    Luebeck, Germany, 1997. Springer Verlag Lecture Notes in Computer Science n. 1200.

43. G. Manzini, L. Margara.
    A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.
    Proc. 24th Int. Colloquium on Automata, Languages, and Programming (ICALP '97),
    Bologna, Italy, 1997. Springer Verlag Lecture Notes in Computer Science n. 1256.
    Preliminary version of [20].

44. M. Leoncini, G. Manzini, L. Margara.
    On the Parallel Complexity of Matrix Factorization Algorithms.
    Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA '97),
    Newport, Rhode Island, USA, 1997.
    Preliminary version of [17].

45. R. Kosaraju, G. Manzini.
    Compression of Low Entropy Strings with Lempel-Ziv Algorithms.
    Proc. Int. Conference on Compression and Complexity of Sequences (SEQUENCES '97),
    Positano, Italy, 1997. IEEE Press. Preliminary version of [21].

46. G. Manzini, L. Margara.
    Invertible Linear Cellular Automata over Zm: Algorithmic and Dynamical Aspects.
    Proc. 22nd Int. Symposium on Mathematical Foundations of Computer Science (MFCS '97),
    Bratislava, Slovakia, 1997. Springer Verlag Lecture Notes in Computer Science n. 1295.
    Preliminary version of [13].

47. G. Manzini, L. Margara.
    Attractors of D-dimensional Linear Cellular Automata.
    Proc. 15th Int. Symp. on Theoretical Aspects of Computer Science (STACS '98),
    Paris, France, 1998. Springer Verlag Lecture Notes in Computer Science n. 1373. Preliminary version of [18].

48. M. D'amico, G. Manzini, L. Margara.
    On Computing the Entropy of Cellular Automata.
    Proc. 25th Int. Colloquium on Automata, Languages, and Programming (ICALP '98),
    Aalborg, Denmark, 1998. Springer Verlag Lecture Notes in Computer Science n. 1443.

49. D. Bini, G. M. Del Corso, G. Manzini, L. Margara.
    Inversion of Circulant Matrices over Zm.
    Proc. 25th Int. Colloquium on Automata, Languages, and Programming (ICALP '98),
    Aalborg, Denmark, 1998. Springer Verlag Lecture Notes in Computer Science n. 1443.
    Preliminary version of [23].

50. G. Manzini.
    Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance.
    Proc. 23rd Int. Symposium on Mathematical Foundations of Computer Science (MFCS '98),
    Brno, Czech Republic, 1998. Springer Verlag Lecture Notes in Computer Science n. 1450.
    

51. G. Manzini.
    An Analysis of the Burrows-Wheeler Transform.
    Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA '99).
    Baltimore (MD), 1999. Pagg. 669-677. SIAM Press.
    Preliminary version of [25].
    

52. G. Manzini.
    Efficient Algorithms for on-line Symbol Ranking Compression.
    Proc. 7th European Symposium on Algorithms (ESA '99).
    Prague, Czech Republic, 1999. Springer Verlag Lecture Notes in Computer Science n. 1643.
    

53. G. Manzini.
    The Burrows-Wheeler Transform: Theory and Practice (invited talk).
    Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS '99).
    Szklarska Poreba, Poland, 1999. Springer Verlag Lecture Notes in Computer Science n. 1672, 34-47.
    

54. P. Ferragina, G. Manzini.
    Opportunistic Data Structures with Applications.
    Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS '00).
    Redondo Beach (CA), 2000, Pagg. 390-398.
    

55. P. Ferragina, G. Manzini.
    An Experimental Study of an Opportunistic Index.
    Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA '01).
    Washington, DC, 2001, 269-278.
    Preliminary version of [24].
    

56. G. Manzini, P. Ferragina
    Engineering a Lightweight Suffix Array Construction Algorithm.
    Proc. 10th European Symposium on Algorithms (ESA '02).
    Rome, Italy, 2002. Springer Verlag Lecture Notes in Computer Science n. 2461, 698-710.
    Preliminary version of [28].
    

57. P. Ferragina, G. Manzini.
    Compression Boosting in Optimal Linear Time Using the Burrows-Wheeler Transform.
    Proc. 15th Symposium on Discrete Algorithms (SODA '04)
    New Orleans (LA), 2004, Pagg. 648-656.
    Preliminary version of [30].
    

58. G. Manzini.
    Two Space Saving Tricks for Linear Time LCP Array Computation.
    Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT '04),
    Humlebæk, Denmark, 2004, Springer Verlag Lecture Notes in Computer Science n. 3111, 372-383.
    

59. P. Ferragina, G. Manzini, V. Mäkinen, G. Navarro
    An Alphabet Friendly FM-index.
    Proc. 11th Symposium on String Processing and Information Retrieval (SPIRE '04).
    Padova, Italy, 2004. Springer Verlag Lecture Notes in Computer Science n. 3246, 150-160.
    

60. P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan.
    Structuring labeled trees for optimal succinctness, and beyond.
    Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS '05).
    Pittsburgh (PA), 2005, Pagg. 184-193.
    

61. P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan.
    Compressing and Searching XML Data Via Two Zips
    Proc. World Wide Web Conference 2006 (WWW '06).
    Edinburgh, Scotland, 2006. Pagg. 751-760.
    

62. P. Ferragina, R. Giancarlo, G. Manzini
    The Myriad Virtues of Wavelet Trees.
    Proc. 33th Int. Colloquium on Automata, Languages, and Programming (ICALP '06),
    Venice, Italy, 2006.
    Springer Verlag Lecture Notes in Computer Science n. 4051, 561-572.
    (DOI link)

63. P. Ferragina, R. Giancarlo, G. Manzini
    The Engineering of a Compression Boosting Library: Theory vs Practice in BWT compression.
    Proc. 14th European Symposium on Algorithms (ESA '06),
    Zürich, Switzerland, 2006.
    Springer Verlag Lecture Notes in Computer Science n. 4168, 756-767.
    (DOI link)

64. T. Gagie, G. Manzini
    Move-to-Front, Distance Coding, and Inversion Frequencies Revisited.
    Proc. 18th Symposium on Combinatorial Pattern Matching (CPM '07),
    London, Ontario, Canada, 2007.
    Springer Verlag Lecture Notes in Computer Science, n. 4580, 71-82.
    (DOI link)

65. T. Gagie, G. Manzini
    Space-conscious compression.
    Proc. 32nd Int. Symposium on Mathematical Foundations of Computer Science (MFCS '07),
    Cesky Krumlov, Czech Republic, 2007.
    Springer Verlag Lecture Notes in Computer Science, n. 4708, 206-217.
    (DOI link).

66. J. Kärkkäinen, G. Manzini, S. Puglisi
    Permuted Longest-Common-Prefix Array.
    Proc. 20th Symposium on Combinatorial Pattern Matching (CPM '09),
    Lille, France, 2009.
    Springer Verlag Lecture Notes in Computer Science n. 5577, 181-192.
    (DOI link).

67. P. Ferragina, G. Manzini
    On Compressing the Textual Web.
    Proc. 3rd ACM International Conference on Web Search and Data Mining (WSDM '10)
    New York City, USA, 2010.
    (DOI link).

68. P. Ferragina, T. Gagie, G. Manzini
    Lightweight Data Indexing and Compression in External Memory.
    Proc. 9th Latin American Theoretical Informatics Symposium (LATIN '10)
    Oaxaca, México, 2010.
    Springer Verlag Lecture Notes in Computer Science n. 6034, 698-711. (DOI link).

69. L. Egidi, G. Manzini
    Spaced Seeds Design Using Perfect Rulers.
    Proc. 18th Int. Symposium on String Processing and Information Retrieval (SPIRE '11),
    Pisa, Italy, 2011.
    Springer Verlag Lecture Notes in Computer Science n. 7024, 32-43. (DOI link).