Abstract
The following analysis of hashing, based on unpublished notes by Michael Paterson, relies on two concepts: eigenoperators and what he calls “induction from the other end.” The cookie monster example below illustrates the value of finding an eigenoperator. “Induction at the other end” will appear later when we apply the techniques to various hashing schemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Boston
About this chapter
Cite this chapter
(2008). Operator Methods. In: Mathematics for the Analysis of Algorithms. Progress in Computer Science and Applied Logic (PCS), vol 1. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4729-2_3
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4729-2_3
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4728-5
Online ISBN: 978-0-8176-4729-2
eBook Packages: Springer Book Archive