Title：Fractal Perfect Hash Families
Speaker：Professor Charles J. Colbourn, Arizona State University
Charles Colbourn is a Professor and Ph.D. supervisor of Computing, Informatics and Decision Systems Engineering at Arizona State University. He is one of the editors-in-chief of Journal of Combinatorial Designs, and also an associate editor of Designs, Codes and Cryptography, Journal of Combinatorial Theory (A), Discrete Mathematics，IEEE， Journal of Statistical Planning and Inference，and Journal of Statistical Theory and Practice.
He earned his Ph.D. in Computer Science at the University of Toronto in 1980. His research concentrates on combinatorics, network algorithms and network design. Colbourn’s research employs combinatorial mathematics and algorithms to address problems in diverse areas including software testing, networking (optical, wireless, wireline), computational molecular biology, communications and information theory and experimental design. He develops deep combinatorial results with real applications. He has authored more than 300 papers in the international core journals. In 2003, he was awarded the Euler Medal Lifetime for Research Achievement.