Embedded Files
October 16th, Hamilton, Canada
The 21st Workshop on Compression, Text, and Algorithms (WCTA 2026) will be held at McMaster University on October 16th, 2026, in room ITB 222 of the Information Technology Building (ITB). Following tradition, WCTA is co-located with SPIRE 2026 and the day after it. It is a venue for junior members of our community to present preferably unpublished work, work in progress, surveys of interest, and open problems, among others. WCTA has no published proceedings, so the results presented can also be submitted to other workshops and conferences.
Important dates
Abstract deadline: September 7th, 2026 (anywhere on Earth)
Notification: September 10th, 2026
Workshop: October 16th, 2026
Draft Program
9:15 to 9:30 - opening
9:30 to 10:00 - "Compressed 2D Suffix Trees" by Arnab Ganguly, Daniel Gibney, Rahul Shah and Sharma V. Thankachan
10:00 to 10:30 - "Independent Roman Domination: An FPT and Polynomial-Time Perspective" by Himanshu Kumar (remote talk)
10:30 to 10:45 - break
10:45 to 11:15 - "A New Approach to the Lossless Compression of BitNet Models" by Gabriel Carmona and Paolo Ferragina
11:15 to 11:45 - "Algorithmic Aspects of Eternal Relaxed Vertex Cover on Some Graph Classes" by Ankita Kumari and Himanshu Kumar (remote talk)
11:45 to 1:15 - lunch (not provided)
1:15 to 2:30 - "Early Ideas in Data Structures and Text Processing" by Ian Munro (keynote; abstract and bio below)
2:30 to 2:45 - break
2:45 to 3:15 - "Minimum Entropy Slope Selection for Compressing Piecewise Linear Approximations" by Filippo Lari
3:15 to 3:55 - "Succinct and Compact Representations of Horizontally Convex Polyominoes and Convex Polycubes" by William T. Doan and Natan Melzer
3:55 to 4:00 - closing
Keynote:
Early Ideas in Data Structures and Text Processing
Ian Munro (University of Waterloo)
Abstract: We will discuss a variety of early problems, techniques, "near proofs" and, indeed, attitudes in data structures (including text search, compression and sorting). These will include a hashing problem I posed to Erdős, a sorting method from the 1950s that "may recently" have been subsumed in terms of minimizing comparisons, as well as several more standard issues in text processing.
Bio: Ian Munro is Distinguished Professor Emeritus and, until retirement, was University Professor and Canada Research Chair in Algorithm Design in the D.R. Cheriton School of Computer Science at the University of Waterloo, where he has been a faculty member since completing his PhD at the University of Toronto in 1971. His research has concentrated on the efficiency of algorithms and data structures. He has authored over 150 conference and 100 journal papers and has supervised 26 Ph.D.'s on the subject. Dr. Munro has held visiting positions at a number of major universities and research labs, including AT&T Bell Labs, Princeton University and the Max Planck Institute for Informatics. His consulting activities have included work with government and several major computer companies. He has served on the editorial boards of CACM, Inf & Comp, and B.I.T., and the program committees of most of the major conferences in his area. He is a former Director of Waterloo's Institute for Computer Research. He was elected Fellow of the Royal Society of Canada in 2003 and Fellow of the ACM in 2008, and made University Professor in 2006.
Program Chairs
Travis Gagie
Shahin Kamali (York University)
Page updated
Google Sites
Report abuse