Abstract
Most of the algorithms discussed in previous chapters were designed to optimize worst-case performance: they are guaranteed to return optimal solutions for every problem instance within a specified running time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skiena, S. (2020). Hashing and Randomized Algorithms. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54255-9
Online ISBN: 978-3-030-54256-6
eBook Packages: Computer ScienceComputer Science (R0)