Introduction to Algorithms, 3rd Edition

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

1,012 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.

In Algorithms & Complexity

Citations in the corpus

Rethinking Attention with Performers (2020, methodology): “Unidirectional FAVOR+ using fast prefix-sum pre-computation in parallel (Ladner & Fischer, 1980; Cormen et al., 2009) has O(mLd) space complexity to store GPS which can be reduced to O(md+ Ld+mL) by running a simple (though non-parallel in L) aggregation of GPS i,:,: without storing the whole tensor”
Masked Language Modeling for Proteins via Linearly Scalable Long-Context Transformers (2020, methodology): “An efficient algorithm to compute the prefix-sum of L elements takes O(L) total steps and O(logL) time when computed in parallel [31, 16].”
fastcluster: Fast Hierarchical, Agglomerative Clustering Routines for R and Python (2013, positive): “It links Prim’s algorithm for the minimum spanning tree of a graph (see Cormen, Leiserson, Rivest, and Stein 2009, Section 23.2) with the observation that a single linkage dendrogram can be obtained from the minimum spanning tree of a graph.”
Diagonal State Spaces are as Effective as Structured State Spaces (2022, methodology): “It is well-known that this can be done in OpL logpLqq time via Fast Fourier Transform (FFT) (Cormen et al., 2009).”
GFF Utilities: GffRead and GffCompare (2020, background): “TrMap first loads the reference annotation into an interval tree data structure 29 , and then for each query transcript it reports all the reference transcripts that overlap it, along with their overlap classification codes.”
Novel Linearized Power Flow and Linearized OPF Models for Active Distribution Networks With Application in Distribution LMP (2018, methodology): “Then, the loss factors for distribution (LF-D) can be expressed in a recursive manner, similar to the backward/forward sweep algorithm for solving radial distribution power flows [26]–[28].”