Algorithm design

By Michael T. Goodrich. 2001

585 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Indexing Compressed Text (2003, background): “7 gives indices (3, 4), (7, 8) and (8, 9) for the substrings T [3, 4], T [7, 8] and T [8, 9].”
Efficient Assembly of Sparse Matrices Using Hashing (2006, methodology): “An alternative approach would be to use a tree-based structure to resolve collisions among hash keys, for instance an AVL-tree [6].”
Introduction to Multi-Armed Bandits (2019, background): “, one based on Kleinberg and Tardos (2005), should suffice for background.”