Find link

language:

Find link is a tool written by Edward Betts.

searching for Thomas H. Cormen 6 found (459 total)

Search data structure (930 words) [view diff] exact match in snippet view article find links to article

two or more data structures can be combined to obtain lower costs. Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest (1990). Introduction to Algorithms

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

Reduction (recursion theory) Truth table reduction Turing reduction Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction

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

Cambridge University Press. pp. 139–143. ISBN 978-0-511-77637-3. Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (31 July 2009)

Set (mathematics) (4,726 words) [view diff] exact match in snippet view article

An Introduction. Courier Corporation. p. 2. ISBN 978-0-486-65252-8. Thomas H. Cormen; Charles E Leiserson; Ronald L Rivest; Clifford Stein (2001). Introduction

Algorithm (7,354 words) [view diff] exact match in snippet view article find links to article

Pebble to the Microchip. Springer Verlag. ISBN 978-3-540-63369-3. Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2009). Introduction

Binary tree (5,125 words) [view diff] no match in snippet view article find links to article

347. ISBN 978-0-08-092299-7. Introduction to algorithms. Cormen, Thomas H., Cormen, Thomas H. (2nd ed.). Cambridge, Mass.: MIT Press. 2001. p. 128. ISBN 0-262-03293-7