Language:

Italiano English

Giovanni Manzini

My photo

Department of Science and Technological Innovation
University of Piemonte Orientale "Amedeo Avogadro"
Viale T. Michel, 11 - 15121 - Alessandria - Italy

Telephone:+39 0131 360 173
Faximile:+39 0131 360 198
Email:firstname.lastname@uniupo.it

Biography

I received my PhD in Applied Mathematics from the Scuola Normale Superiore of Pisa. I have been Visiting Scientist at the Massachusetts Institute of Technology, and Visiting Professor the Johns Hopkins University and the University of Melbourne. I am currently Professor of Computer Science at the University of Eastern Piedmont and a member of the BioAlgo groups of the Institute of Informatics and Telematics of the National Research Council. Full CV.

Research

My current research interest is the design of algorithms and data structures for solving theoretical and applied problems in the fields of Data Compression and Indexing Data Structures for Massive Data Sets.

Publications

Please check my page at DBLP or my old, seldom updated, list of publications. If you believe in statistics, here is my personal profile at Google Scholar.

Software Projects

Together with colleagues and students I have developed a few software projects related to my research. My current major project is the bwtdisk library for the computation of the Burrows-Wheeler transform in external memory. The main feature of this library is that it stores the input output and intermediate files in compressed form, and that it accesses files on disk only by sequential scans thus taking full advantage of modern caching architectures. A related project is a family of lightweight algorithms for the computation of the Suffix Array and the LCP Array. Although these algorithms are no longer the state-of-the-art, they were the first designed to use a small working space without sacrificing speed, an approach later followed by all the most successful suffix array construction algorithms.
Older projects are a Compression Booster based on the Burrows-Wheeler Transform, a Simple and Fast DNA Compression Algorithm, and two algorithms for the bandwidth minimization problem cited by Knuth in the book: Selected Papers on Analysis of Algorithms.

Professional Services

Invited speaker at the conferences CPM '17, WCTA '11, IWOCA '09 and MFCS '99, and invited lecturer at the 2008 Lipari School on Algorithms: Science and Engineering. I have served as program co-chair for the CPM '11 conference, and on the program committee of the conferences SPIRE '17, CPM '16, IWOCA '15, WSDM '15, WABI '14, AlCoB '14, WABI '13, LATIN '12, SPIRE '10, SPIRE '08, ICTCS '07, SPIRE '07, SPIRE '06, CPM '05, and others. I was co-organizer of the DIMACS Workshop: The Burrows-Wheeler Transform: Ten Years Later, and guest editor of Special Issues of Theoretical Computer Science devoted to the Burrows-Wheeler Transform and its Applications, and Combinatorial Pattern Matching.

Teaching

I had the opportunity of teaching a large number of subjects ranging from Object Oriented Programming, to Discrete Mathematics, to Algorithms and Data Structures, to Numerical Analysis. This year I am teaching Introduction to Programming and two short courses on Bionformatics, and Mobile Application Development.