Introduction to Algorithms, 2nd edition.

By T. Cormen, Charles E. Leiserson, R. Rivest, C. Stein. 2001

3,838 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.

Better k-best Parsing (2005, methodology): “4This can be implemented by a linear-time randomizedselection algorithm (a.k.a. quick-select) (Cormen et al., 2001).”
A survey of intrusion detection techniques for cyber-physical systems (2014, methodology): “Examples of a discrete dataset are dialed numbers or system state; Longest Common Subsequence (LCS) can be applied to discrete data over an interval, whereas Hamming distance can be applied to discrete data instantaneously [Park et al. 2010; Cormen et al. 2001].”
Synchronization (2018, methodology): “This quantitative analysis requires the Master Theorem for Linear Recurrences [1].”
Statistical schema matching across web query interfaces (2003, methodology): “In Step 1, we can translate the problem of nding consistent concepts into nding all cliques in an attribute \cooccurrence graph" [ 6 ].”