Algorithmics of Nonuniformity

The subject is at the crossroads of Discrete Mathematics and Computer Science, with a strong probabilistic flavor. The main tools used before are on the one hand analytic (generating functions and complex analysis), and on the other probabilistic (strong laws, central limit theorems, martingales, etc.) Often, professionals worked with one set of tools or the other. We offer a reconciliation to espouse these fields to come in hand-in-hand offering a harmonious and beneficial marriage.

Micha Hofri is a Professor of Computer Science, and former department head, at Worcester Polytechnic Institute. He holds a BS and an MS degree in Physics, and a Ph.D. of Industrial Engineering (1972), all from Technion, the Israel Institute of Technology. He has 39 publications in Mathematics. Hosam Mahmoud is a Professor in, and former chair of, the Department of Statistics at George Washington University in Washington D.C. He holds a B.Sc in Mathematics and one in Electrical Engineering, both from the University in Cairo, in Egypt, as well as an M.S (1981) and a Ph.D. (1983) in Computer Science, from Ohio State University. He is on the editorial board of five academic journals. He has written three books, the most recent one, P’olya Urn Models was published by CRC Press in 2008.