@TechReport{Dartmouth:TR2001-404,
  author = {Eric Kidd},
  title = {{Efficient Compression of Generic Function Dispatch Tables}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {TR2001-404},
  year = {2001},
  month = {June},
  URL = {http://www.cs.dartmouth.edu/reports/TR2001-404.ps.Z},
  comment = {
    Senior Honors Thesis.  Advisor: Chris Hawblitzel.
  },
  abstract = {
      A generic function is similar to an overloaded operator, but provides a way
    to select an appropriate behavior at run-time instead of compile-time.
    Dujardin and colleagues have proposed an algorithm for building and
    compressing generic function dispatch tables.
       We present several modifications to their algorithm, including an
    improvement to Pseudo-Closest-Poles and two new algorithms for compressing
    pole tables.  The two new compression algorithms are simple and fast, and
    one produces smaller output than the original.
  }
}