Stanley Selkow received a BS in Electrical Engineering from Carnegie Institute of Technology in 1965, and then a Ph.D. in the same area from the University of Pennsylvania in 1970. From 1968 to 1970 he was in the Public Health Service at the National Institutes of Health at Bethesda Maryland. Since 1970 he has been on faculties at universities in Montreal, Knoxville TN and Worcester MA, as well as Chonqing, Lausanne and Paris. His major research has been in graph theory and algorithm design.
"It must be noted that much of this book is covered in some way by university-level computing degrees. Nonetheless, one tends to forget the principles and the algorithms themselves. One develops one's handful of favourites. This book helps one to keep playing with a full deck."
--Al Lukaszewski, About.com
"This book is a "keeper" - make room for it on your bookshelf as it's essential reading."
--Mike James, I Programmer
"Overall, this is a great book for developers looking for more tools in their arsenals. As you might suspect, this is not really a book to read cover to cover unless it's for a class. But it provides a clear and well laid out approach to some of the many algorithms that exist today in computer programming. It isn't an exhaustive list, but it certainly provides a great cross-section from which you could continue your search."
--Brian Fitzpatrick, Blogcrititcs Magazine