The expectation maximization (EM) algorithm is a popular, and often remarkably simple, method for maximum likelihood estimation in incomplete-data problems. One criticism of EM in practice is that ...

Moment-based algorithms for computing asymptotic parameters are especially useful when the transforms are not available explicitly as in models of busy periods or polling systems. Here we provide ...

He is the author of the multi-volume work, the magnum opus, The Art of Computer Programming. He made several key contributions to the rigorous analysis of the computational complexity of algorithms.

Basics of Java programming. The Euclidean algorithm. Time complexity of algorithms. Asymptotic notation. Heaps. Sorting. Recursive algorithms. Stacks and queues. Linked lists. Graphs. Breadth-first ...