PowerPoint Presentations

Rating System

S - suitable for students of computer science
G - suitable for general audiences
R - research presentation

Supplemental Materials for the Great American Textbook

Rating:  S

          

Other Presentations

  1. Fast Finds: Making Google & BLAST Faster - given to Niagara University Research Council, Sep., 2005.  Rating:  G
  2. A Pre-Processing Algorithm for String Pattern Matching- given at the International Conference on Algorithmic Mathematics and Computer Science, Las Vegas, June, 2005. Rating: R
  3. Faster Finds from Gallo to Google - given to the Niagara University Bioinformatics Seminar, March 16, 2005.  Rating: G
  4. A Parallel Algorithm for Approximate Regularity - given to Niagara University Research Council, Nov., 2000.  Rating:  G
  5. Intro to Parallel Architectures - given to CIS 270 at Niagara University, Dec., 1999.  Rating:  S
  6. Even faster point set pattern matching in 3-d - given at the Niagara University Research Council, Sep., 1999.  Rating:  G
  7. Even faster point set pattern matching in 3-d - given at the Vision Geometry VIII conference of SPIE - the International Society for Optical Engineering - Denver, CO, July, 1999.  Rating: R

    The conference paper is in the Proceedings of SPIE Vision Geometry VIII (1999), 168-178. An expanded version of the paper is found at

    L. Boxer and R. Haralick, Even faster point set pattern matching in 3-d, SUNY at Buffalo Department of Computer Science and Engineering Technical Report 2001-01. Other authors have since obtained solutions to the problem that have faster running times.

To Boxer's home page