The Monday Meetings

The Monday meetings of the Algorithms Group of the University of Verona take place every Monday at 5 p.m. (Italian time), and have been taking place online (zoom) since March 2020. We have decided to stick to the online mode (zoom), since several of our regular members are physically in other places (in other cities, in other countries, or even on other continents!)

Working language is English. If you are interested in participating, send me an email.

The person in charge of coordinating the meetings is Francesco Masillo (francesco dot masillo at univr dot it).

List of talks of previous years:



Fall Semester 2023/2024



datespeakertitleliterature
Mon, Oct. 9, 2023 all Introduction and distribution of dates  
Mon, Oct. 16, 2023 Giuseppe Romana Circular String Attractors: an algorithmic overview Giuseppe Romana: Algorithmic View on Circular String Attractors, ICTCS 2023, Palermo, 13-15 Sept. 2023 (paper)
Mon, Oct. 23, 2023 Francesco Masillo Matching Statistics speed up BWT construction Francesco Masillo: Matching Statistics speed up BWT construction, ESA 2023, Amsterdam, 4-6 Sept. 2023 (paper)
Mon, Oct. 30, 2023 Andrea Cracco Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT Andrea Cracco, Alexandru I. Tomescu: Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT. Genome Research 2023 (paper)
Mon, Nov. 6, 2023 Elena Biagi On the number of equal-letter runs of the Bijective Burrows-Wheeler Transform Elena Biagi, Davide Cenzato, Zsuzsanna Lipták and Giuseppe Romana: On the number of equal-letter runs of the Bijective Burrows-Wheeler Transform, ICTCS 2023, Palermo, 13-15 Sept. 2023 (paper).
Mon, Nov. 13, 2023 Davide Cenzato On indexing string collections using the extended BWT Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino: r-indexing the eBWT SPIRE 2021: 3-12.
Mon, Nov. 20, 2023 Cristian Urbina Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data, by De and Kempa Rajat De and Dominik Kempa (Stony Brook University): Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data, accepted at SODA24, arXiv version:
Mon, Nov. 27, 2023 Zsuzsanna Lipták A shorthand universal cycle for fixed-weight binary strings by Ruskey, Sawada, and Williams (part 1) Frank Ruskey, Joe Sawada, Aaron Williams: De Bruijn sequences for fixed-weight binary strings, SIAM J Discrete Math. Vol. 26, No. 2, pp. 605-617 (2012)
Mon, Dec. 4, 2023 Martina Lucà Efficient matching statistics calculation in large text collections Project work with Francesco Masillo
Mon, Dec. 11, 2023 Zsuzsanna Lipták A shorthand universal cycle for fixed-weight binary strings by Ruskey, Sawada, and Williams (part 2) Frank Ruskey, Joe Sawada, Aaron Williams: De Bruijn sequences for fixed-weight binary strings, SIAM J Discrete Math. Vol. 26, No. 2, pp. 605-617 (2012)
Mon, Dec. 18, 2023 -    
Mon, Jan. 8, 2024 Zsuzsanna Lipták On the Burrows-Wheeler Transform of string collections  


List of talks of previous years: