Danny Dubé (Université Laval, Quebec City, Canada), PhD, Professor
Professor, Department of Computer Science and Software Engineering, Université Laval, Quebec City, Canada.
Education and Training
Danny Dubé studied Computer Science at University of Montreal, where he received the B.Sc. in 1994, the M.Sc. in 1996, and the Ph.D. in 2003. He started his career at Université Laval, in Quebec City, as an assistant professor in 2003. HE turned associate professor in 2008. His research field during my studies and up to 2010 was the implementation of programming languages. Since 2005, Danny Dubé got interested in data compression and, in 2010, it became his sole research field.
- Danny Dubé, Vincent Beaudoin, "Lossless Data Compression via Substring Enumeration", in Proceedings of the Data Compression Conference, pages 229-238, Snowbird, Utah, USA, March 2010.
- Danny Dubé, Hidetoshi Yokoo, "The Universality and Linearity of Compression by Substring Enumeration", in Proceedings of the International Symposium on Information Theory, pages 1519-1523, Saint-Petersburg, Russia, July-August 2011.
- Ahmad Al-Rababa'a, Danny Dubé, Jean-Yves Chouinard, "Using Bit Recycling to Reduce Knuth's Balanced Codes Redundancy", in Proceedings of the Canadian Workshop on Information Theory, pages 6-11, Toronto, Ontario, Canada, June 2013.
- Ahmad Al-Rababa'a, Danny Dubé, "Using Bit Recycling to Reduce the Redundancy in Plurally Parsable Dictionaries", in Proceedings of the Canadian Workshop on Information Theory, pages 62-65, Saint John's, Newfoundland and Labrador, Canada, July 2015.
- Danny Dubé, "Leaner Skeleton Trees for Direct-Access Compressed Files", (accepted but not presented at the) International Symposium on Information Theory and Applications, Monterey, California, USA, November 2016.