Searching for CITATIONS to document sorted by Number of Citations:
Introduction to algorithms
(2000)
by Leiserson Cormen, Rivest
J. ACM
Add To MetaCart
-
Fast Planning Through Planning Graph Analysis
- Cited by 759 (2 self) – Show/Hide Context – Add To MetaCart
-
LEDA: A Platform for Combinatorial and Geometric Computing
- Cited by 545 (38 self) – Show/Hide Context – Add To MetaCart
-
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
- Cited by 446 (25 self) – Show/Hide Context – Add To MetaCart
-
FAST VOLUME RENDERING USING A SHEAR-WARP FACTORIZATION OF THE VIEWING TRANSFORMATION
- Cited by 381 (2 self) – Show/Hide Context – Add To MetaCart
-
Complexity-Effective Superscalar Processors
- Cited by 367 (6 self) – Show/Hide Context – Add To MetaCart
-
Algorithm for Optimal Winner Determination in Combinatorial Auctions
- Cited by 362 (47 self) – Show/Hide Context – Add To MetaCart
-
Bayesian Network Classifiers
- Cited by 354 (20 self) – Show/Hide Context – Add To MetaCart
-
Small Byzantine Quorum Systems
- Cited by 311 (44 self) – Show/Hide Context – Add To MetaCart
-
Secure Group Communications Using Key Graphs
- Cited by 306 (13 self) – Show/Hide Context – Add To MetaCart
-
Three-dimensional Alpha Shapes
- Cited by 300 (24 self) – Show/Hide Context – Add To MetaCart

