Introduction to Algorithms, third edition
Explore this paper's citation graph
Summary
Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book a great resource on the basic tools used to analyze the performance of algorithms.
- Type
- book
- Published
- 2009-07-31
- Cited by
- 2,939
- References
- 0
- OpenAlex
- https://openalex.org/W1507039213
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:60621753
Keywords
Computer science, Algorithm, Sorting, Variety (cybernetics), Range (aeronautics)
References
No references recorded for this paper.
Cited by
- Modeling Market and Regulatory Mechanisms for Pollution Abatement with Sharp and Random Variables
- Survey on Combinatorial Register Allocation and Instruction Scheduling
- Increasing Time Efficiency of Insertion Sort for the Worst Case Scenario
- Localization of multilayer networks by optimized single-layer rewiring.
- Convex hull game: a tangible context for algorithms and computer graphics concepts
- Synthetic tree models from iterated discrete graphs
- UAV Path Planning for Ice Intelligence Purposes using NLP
- PARAMETRIC MAXIMUM FL OW PROBLEM: TECHNIQUES AND ALGORITHMS
- The Combination of Bit Matching-Based Steganography and DES Cryptography for Data Security
- Generation and Prioritization of test sequences using UML activity diagram
- Simulated Annealing Approach To Flow Shop Scheduling
- SEA: a novel computational and GUI software pipeline for detecting activated biological sub-pathways
- TEAK: A novel computational and GUI software pipeline for reconstructing biological networks, detecting activated biological subnetworks, and querying biological networks.
- Automatic generation of OpenDrive roads from road measurements
- Policy driven capacity expansion planning of energy infrastructure: modeling and solutions using high performance computing
- Getting the right spin: A theory of optimal viral marketing
- Coloured graphs for assembly sequences generation applied to modular product ranges
- High-Performance Regular Expression Matching with Parabix and LLVM
- Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions
- Minimal digraphs with given imbalance sequence
Related papers
- Introduction to Algorithms
- A note on two problems in connexion with graphs
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- The Art of Computer Programming
- Scheduling multithreaded computations by work stealing
- Depth-First Search and Linear Graph Algorithms
- The implementation of the Cilk-5 multithreaded language
- Network Flows: Theory, Algorithms, and Applications
- Computational Geometry