Introduction to Algorithms, third edition

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

2,936 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.

Beyond Data and Model Parallelism for Deep Neural Networks (2018, methodology): “Similar to the BellmanFord shortest-path algorithm (Section 24.1 of Cormen et al. (2009)), the delta simulation algorithm iteratively dequeues updated tasks and propagates the updates to subsequent tasks (line 6-14).”
CoverNet: Multimodal Behavior Prediction Using Trajectory Sets (2019, background): “Given a set of representative trajectory data, the problem of finding the best fixed trajectory set of size |K| can be cast as an instance of the NP-hard set cover problem [11].”
Cloud-Assisted Data Fusion and Sensor Selection for Internet of Things (2016, methodology): “The implementation of BestShortestPath is trivial, as it uses Dijkstra’s algorithm [24] to compute the shortest paths, while respecting the path quality constraint (5).”
MISIM: An End-to-End Neural Code Similarity System (2020, neutral): “he highest level, code similarity systems aim to determine if two or more code snippets are solving a similar problem, even if the implementations they use differ (e.g., various algorithms of sort() (Cormen et al., 2009)). Historically, code similarity systems have been considered an auxiliary featu”