|
|
|
|
|
Algorithms in a Nutshell
George Heineman, Gary Pollice, Stanley Selkow WPI Department of Computer Science Friday, October 31, 2008 Abstract: Professors George Heineman, Gary Pollice and
Stanley Selkow have just published a book with
O'Reilly Media entitled "Algorithms in a Nutshell". This book serves two audiences. For
undergraduate students, this reference is a concise introduction to the most
commonly used algorithms in the Computer Science Literature. For the working
professional, the book contains fully-coded solutions to show how the
algorithms can rapidly be coded within your own software systems to achieve
improved code performance. The full
code repository associated with the book can be freely downloaded. In this hour presentation, there
will be two speakers. Professor Heineman will
discuss an efficient algorithm for detecting intersections among line
segments. An obvious brute-force implementation can be performed in O(n^2) but in this talk we describe an O(n log n)
algorithm which uses basic data structures (lists, heaps, and stacks).
Professor Selkow will discuss a probabilistic
algorithm for estimating the size of a search tree used to determine the
number of ways that Non-threatening queens can be placed on an NxN chess board. ____ George Heineman is
an Associate professor of Computer Science with an interest in Software
Engineering. He has a life-long interest in Algorithms. Stan Selkow has been a
professor at WPI since 1980. Gary Pollice is a
Professor of Practice at WPI since 2003. Host:
Micha Hofri Refreshments will be
served. Last modified: October 27, 2008 |
