George S. Lueker

George S. Lueker is a computer scientist and Professor Emeritus in the Theory area of the Department of Computer Science at the University of California, Irvine. His research concerns the design and analysis of algorithms for concrete problems, with a special interest in applying probability to computer science by analysing algorithms and optimization problems when the inputs follow an assumed distribution. He has studied the optimum solutions of the bin-packing and partition problems, and with graduate student Mariko Molodowitch gave a simple proof that the probabilistic behaviour of double hashing is asymptotically equivalent to ideal uniform hashing. He also worked on bounds for the expected length of the longest common subsequence of random strings. With Kellogg S. Booth he discovered and named the PQ tree in 1976, a data structure representing families of permutations.