We study a markovian evolutionary process which encompasses the classical simple genetic algorithm. This process is obtained by randomly perturbing a very simple selection scheme. Using the ...

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 ...

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.

Teunis J. Ott, Jason Swanson, Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm, Journal of Applied Probability, Vol. 44, No. 3 (Sep., 2007), pp ...