George T. Heineman

George T. Heineman

George T. Heineman is an Associate Professor of Computer Science at WPI. His research interests are in Software Engineering. He co-edited the 2001 book "Component-Based Software Engineering: Putting the Pieces Together". He was the Program Chair for the 2005 International Symposium on Component-Based Software Engineering.

Aside from his professional pursuits, George is an avid puzzler. He invented Sujiken®, a Sudoku variation played on a right-triangle arrangement of cells in which numbers cannot repeat in a horizontal row, vertical column or diagonal in any direction. See more at http://www.sujiken.com.

Algorithms in a Nutshell Algorithms in a Nutshell
by George T. Heineman, Gary Pollice, Stanley Selkow
Second Edition March 2016
Print: $59.99
Ebook: $50.99

Algorithms in a Nutshell Algorithms in a Nutshell
by George T. Heineman, Gary Pollice, Stanley Selkow
October 2008
OUT OF PRINT

Working with Algorithms in Python Working with Algorithms in Python
by George T. Heineman
July 2014
Video: $169.99

Webcast: Implementing Bloom Filters in Python
December 01, 2015
In this webcast, George Heineman will implement a Bloom Filter in Python and demonstrate its predictable behavior using several examples.

Webcast: Explore algorithms in Python with a GUI-based app
August 19, 2015
In this webcast, George Heineman will demonstrate the principles behind kd-trees and how they can be used to solve a number of interesting problems, such as nearest neighbor and range queries.

"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