M. J. Golin -- Selected Talks

This file contains a selected list of a few of my talks.

COSSAC 2001 A Personal View of Generalized Huffman Encoding
Chebyshev Polynomials and Spanning Tree Formulas For Circulant Graphs
SODA 2004 Algorithms for Infinite Huffman-Codes
ANALCO 2005 Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. Also a PDF Version
SODA 2005 The Knuth-Yao Quadrangle Inequality Speedup is a Consequence of Total Monotonicity (SODA Version)
Longer Version
ADS 2007 (The 3rd Bertinoro Workshop on Algorithms and Data Structures)
Revisiting The Monge Property
SODA 2009 A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
2009 Conference on Probabilistic Techniques in Computer Science at CRM Barcelona
Shannon Coding for the Discrete Noiseless Channel and Related Problems
ITCSC Winter School 2010: The Joy of Computer Science
Improving Dynamic Programming
2011 PFAC: Philippe Flajolet and Analytic Combinatorics (Conference in the memory of Philippe Flajolet)
Philippe Flajolet, Divide & Conquer Recurrences and The Mellin-Perron Formula PDF Keynote
2015 Talk at CRM
Graph Evacuation Problems Keynote PDF PPTX

2015 Binary Comparison Search Trees
Keynote PDF PPTX
2018 Ethics & Fairness in in AI

2019 Dagstuhl Seminar on Data Structures for the Cloud and External Memory Data
Polynomial Time Algorithms for Constructing Optimal AIFV Codes
2019 Ethics & Fairness in in AI

2020 Ethics & Fairness in in AI

Return to home page www.cs.ust.hk/~golin.

Last updated 01/03/2012 02:09 PM +0800