Find link

language:

Find link is a tool written by Edward Betts.

searching for Introduction to Algorithms 54 found (234 total)

alternate case: introduction to Algorithms

Udi Manber (603 words) [view diff] exact match in snippet view article find links to article

Algorithms" summarizing his textbook (which remains in print) Introduction to Algorithms: A Creative Approach. He became the chief scientist at Yahoo!

Overlapping subproblems (309 words) [view diff] exact match in snippet view article find links to article

programming Introduction to Algorithms, 2nd ed., (Cormen, Leiserson, Rivest, and Stein) 2001, p. 327. ISBN 0-262-03293-7. Introduction to Algorithms, 3rd ed

Õ (640 words) [view diff] case mismatch in snippet view article find links to article

"\~o" and "\~O" exists. Ã Tilde Asu & Teras (2009:369) Omniglot Introduction to algorithms. Cormen, Thomas H. (Third ed.). Cambridge, Mass.: MIT Press. 2009

Data structure (1,825 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press. ISBN 978-0262033848.

Approximate string matching (1,666 words) [view diff] exact match in snippet view article find links to article

1963191. S2CID 15635688. Cormen, Thomas; Leiserson, Rivest (2001). Introduction to Algorithms (2nd ed.). MIT Press. pp. 364–7. ISBN 978-0-262-03293-3. Gusfield

Structure (2,209 words) [view diff] case mismatch in snippet view article find links to article

Rivest, Ronald L.; Stein, Clifford (2009). "Data structures". Introduction to algorithms (3rd ed.). Cambridge, Massachusetts: MIT Press. pp. 229–339. ISBN 978-0262033848

Nondeterministic algorithm (382 words) [view diff] exact match in snippet view article find links to article

1145/321420.321422. S2CID 1990464. Cormen, Thomas H. (2009). Introduction to Algorithms (3rd ed.). MIT Press. ISBN 978-0-262-03384-8. "Nondeterministic

Hash collision (1,130 words) [view diff] exact match in snippet view article find links to article

function – Hash function without any collisions Thomas, Cormen (2009), Introduction to Algorithms, MIT Press, p. 253, ISBN 978-0-262-03384-8 Stapko, Timothy (2008)

Polylogarithmic function (230 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2022). Introduction to Algorithms (4th ed.). Cambridge, Mass.: The MIT Press. pp. 74–75. ISBN 9780262046305

Index mapping (308 words) [view diff] case mismatch in snippet view article find links to article

0, 1, 0, 1, 0 }; return T[m-1]; } Cormen, Thomas H. (2009). Introduction to algorithms (3rd ed.). Cambridge, Mass.: MIT Press. pp. 253–255. ISBN 9780262033848

2–3 tree (1,216 words) [view diff] exact match in snippet view article find links to article

Algorithms. Addison-Wesley., pp.145–147 Cormen, Thomas (2009). Introduction to Algorithms. London: The MIT Press. pp. 504. ISBN 978-0-262-03384-8. Sedgewick

Optimal substructure (742 words) [view diff] exact match in snippet view article find links to article

Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press. ISBN 978-0-262-03384-8.

Reduction (complexity) (1,657 words) [view diff] exact match in snippet view article

Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, MIT Press, 2001, ISBN 978-0-262-03293-3 Hartley Rogers, Jr.:

Tree (graph theory) (3,383 words) [view diff] exact match in snippet view article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2022). Introduction to Algorithms (4th ed.). Section B.5.3, Binary and positional trees: MIT Press

Quadratic probing (884 words) [view diff] case mismatch in snippet view article find links to article

Leiserson, Charles Eric; Rivest, Ronald Linn; Stein, Clifford (2009). Introduction to algorithms (3rd ed.). Cambridge, Massachusetts London, England: MIT Press

Left rotation (268 words) [view diff] exact match in snippet view article find links to article

Leiserson, Ronald L. Rivest, and Clifford Stein, 16 July 2001, Introduction to Algorithms, second edition. McGraw-Hill, ISBN 0-07-013151-1. Chapter 13.

Algorithmic technique (835 words) [view diff] case mismatch in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction To Algorithms. MIT Press. p. 9. ISBN 9780262032933. Skiena, Steven S. (1998)

Skip list (2,414 words) [view diff] exact match in snippet view article find links to article

Algorithms and Data Structures Skip Lists lecture (MIT OpenCourseWare: Introduction to Algorithms) Open Data Structures - Chapter 4 - Skiplists, Pat Morin Skip

Recursion (3,678 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms. Mit Pr. ISBN 978-0-262-03293-3. Kernighan, B.; Ritchie, D. (1988)

Michael Dinneen (292 words) [view diff] exact match in snippet view article find links to article

Auckland. Michael J. Dinneen, Georgy Gimel'farb, and Mark C. Wilson. Introduction to Algorithms, Data Structures and Formal Languages. Pearson (Education New

Set (mathematics) (4,771 words) [view diff] case mismatch in snippet view article

Charles E Leiserson; Ronald L Rivest; Clifford Stein (2001). Introduction To Algorithms. MIT Press. p. 1070. ISBN 978-0-262-03293-3. Halmos 1960, p. 1

Chris Rivest (179 words) [view diff] exact match in snippet view article find links to article

Technology Review, MIT, 2010 Cf. Acknowledgements, p.xxi, in Cormen, Rivest, et al., Introduction to Algorithms, MIT Press TR35 profile (archived 2011)

Divide-and-conquer algorithm (2,609 words) [view diff] exact match in snippet view article find links to article

Leiserson; Ronald L. Rivest; Clifford Stein (31 July 2009). Introduction to Algorithms. MIT Press. ISBN 978-0-262-53305-8. Brassard, G., and Bratley

Bachelor of Software Engineering (889 words) [view diff] exact match in snippet view article find links to article

CS Requirements: Fundamentals of Programming Data Structures Introduction to Algorithms Operating Systems Computer Architecture Programming Languages

Best, worst and average case (1,273 words) [view diff] exact match in snippet view article find links to article

analysis Smoothed analysis Interval finite element Big O notation Introduction to Algorithms (Cormen, Leiserson, Rivest, and Stein) 2001, Chapter 2 "Getting

Akra–Bazzi method (929 words) [view diff] exact match in snippet view article find links to article

Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009). Introduction to Algorithms. MIT Press. ISBN 978-0262033848. O Método de Akra-Bazzi na Resolução

Right rotation (268 words) [view diff] exact match in snippet view article find links to article

Leiserson, Ronald L. Rivest, and Clifford Stein, 16 July 2001, Introduction to Algorithms, second edition. McGraw-Hill, ISBN 0-07-013151-1. Chapter 13.

Lookup table (3,070 words) [view diff] case mismatch in snippet view article find links to article

LOOKUP"!, by MrExcel East, 31 March 2012 Cormen, Thomas H. (2009). Introduction to algorithms (3rd ed.). Cambridge, Mass.: MIT Press. pp. 253–255. ISBN 9780262033848

Weighted median (1,274 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms. MIT Press. ISBN 9780262032933. Horowitz, Ellis; Sahni, Sartaj;

M-ary tree (2,761 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2022). Introduction to Algorithms (4th ed.). Section B.5.3, Binary and positional trees: MIT Press

Longest path problem (2,662 words) [view diff] case mismatch in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), Introduction To Algorithms (2nd ed.), MIT Press, p. 978, ISBN 9780262032933. Lawler, Eugene

Manolis Kellis (2,678 words) [view diff] exact match in snippet view article find links to article

required undergraduate introductory algorithm courses 6.006: Introduction to Algorithms and 6.046: Design and Analysis of Algorithms with Profs. Ron Rivest

Average-case complexity (2,752 words) [view diff] exact match in snippet view article find links to article

Charles E., Rivest, Ronald L., Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4. A. Bogdanov

Optimal binary search tree (2,965 words) [view diff] case mismatch in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald; Stein, Clifford (2009). Introduction to algorithms (PDF) (Third ed.). The MIT Press. p. 503. ISBN 978-0-262-03384-8

Rolling hash (2,011 words) [view diff] exact match in snippet view article find links to article

2017–2031. doi:10.1109/TPDS.2020.2984632. S2CID 215817722. Retrieved 2020-07-22. MIT 6.006: Introduction to Algorithms 2011- Recitation 9 - Rolling Hash

Simplex algorithm (6,186 words) [view diff] exact match in snippet view article find links to article

Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7

Binary tree (5,083 words) [view diff] case mismatch in snippet view article find links to article

Pragmatics (3rd ed.). Morgan Kaufmann. p. 347. ISBN 978-0-08-092299-7. Introduction to algorithms. Cormen, Thomas H., Cormen, Thomas H. (2nd ed.). Cambridge, Mass

Birthday problem (6,857 words) [view diff] exact match in snippet view article find links to article

58: 103–116. doi:10.1016/0377-0427(93)E0258-N. Cormen; et al. Introduction to Algorithms. Fletcher, James (16 June 2014). "The birthday paradox at the

Decision tree model (3,229 words) [view diff] case mismatch in snippet view article find links to article

387–389. doi:10.1080/00029890.1959.11989306. ISSN 0002-9890. Introduction to algorithms. Cormen, Thomas H. (Third ed.). Cambridge, Mass.: MIT Press. 2009

Horner's method (5,170 words) [view diff] exact match in snippet view article find links to article

Ronald L.; Stein10.1016/0315-0860(81)90069-0, Clifford (2009). "Introduction to Algorithms". Historia Mathematica. 8 (3) (3rd ed.). MIT Press: 277–318. doi:10

Knuth–Morris–Pratt algorithm (4,068 words) [view diff] exact match in snippet view article find links to article

Clifford (2001). "Section 32.4: The Knuth-Morris-Pratt algorithm". Introduction to Algorithms (Second ed.). MIT Press and McGraw-Hill. pp. 923–931. ISBN 0-262-03293-7

Miller–Rabin primality test (5,241 words) [view diff] exact match in snippet view article find links to article

Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. "31". Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. pp. 968–971. ISBN 0-262-03384-4

Linear probing (3,605 words) [view diff] case mismatch in snippet view article find links to article

Leiserson, Charles Eric; Rivest, Ronald Linn; Stein, Clifford (2009). Introduction to algorithms (3rd ed.). Cambridge, Massachusetts London, England: MIT Press

Matrix chain multiplication (2,663 words) [view diff] exact match in snippet view article find links to article

Stein, Clifford (2001). "15.2: Matrix-chain multiplication". Introduction to Algorithms. Vol. Second Edition. MIT Press and McGraw-Hill. pp. 331–338.

Matrix chain multiplication (2,663 words) [view diff] exact match in snippet view article find links to article

Stein, Clifford (2001). "15.2: Matrix-chain multiplication". Introduction to Algorithms. Vol. Second Edition. MIT Press and McGraw-Hill. pp. 331–338.

Cooley–Tukey FFT algorithm (5,397 words) [view diff] case mismatch in snippet view article find links to article

; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009). Introduction to algorithms (3rd ed.). Cambridge, Mass.: MIT Press. pp. 915–918. ISBN 978-0-262-03384-8

Exponentiation (13,336 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press. ISBN 978-0-262-03293-3. Online resource

News Literacy Project (1,710 words) [view diff] exact match in snippet view article find links to article

journalists and subject matter experts, that examine topics such as "Introduction to Algorithms," "Misinformation," "Conspiratorial Thinking," "Understanding

K-way merge algorithm (2,409 words) [view diff] case mismatch in snippet view article find links to article

Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2001). Introduction To Algorithms. MIT Press. pp. 28–29. ISBN 978-0-262-03293-3. Bentley, Jon Louis

Secret sharing using the Chinese remainder theorem (2,222 words) [view diff] exact match in snippet view article find links to article

Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7

Primary clustering (1,272 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1137/100800774. ISSN 0097-5397. Cormen, Thomas H. (2022). Introduction to algorithms. Charles Eric Leiserson, Ronald L. Rivest, Clifford Stein (Fourth ed

Algorithmic bias (14,073 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). Cambridge, Mass.: MIT Press. p. 5. ISBN 978-0-262-03384-8

List of Carnegie Mellon University people (8,428 words) [view diff] exact match in snippet view article find links to article

Science at Massachusetts Institute of Technology, co-author of the Introduction to Algorithms Ronald D. Macfarlane (M.S. 1957, Ph.D. 1959), Distinguished Professor

Mathematics education in the United States (12,472 words) [view diff] exact match in snippet view article find links to article

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). The MIT Press. ISBN 978-0-262-03384-8. Roughgarden