Introduction to algorithms / Thomas H. Cormen ; Charles E. Leiserson ; Robert L. Rivest.
Saved in:
Personal Name(s): | Cormen, Thomas H. |
---|---|
Leiserson, Charles Eric. / Rivest, Ronald L. | |
Imprint: |
Cambridge, Mass. :
MIT Press,
1990.
|
Physical Description: |
XVII, 1028 p. |
Note: |
englisch |
ISBN: |
0262031418 (hbd.) 0070131430 9780070131439 0262530910 (pbk.) |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
The MIT electrical engineering and computer science series.
|
Keywords: |
graph algorithms |
Subject (ZB): | |
Classification: |
LEADER | 01289cam a2200373 n 4500 | ||
---|---|---|---|
001 | 17557 | ||
005 | 20031209134400.0 | ||
008 | r1990 | ||
020 | |a 0262031418 (hbd.) | ||
020 | |a 0262530910 (pbk.) | ||
020 | |a 0070131430 | ||
035 | |a (Sirsi) a25070 | ||
084 | 0 | |a DCA - Informatics - theoretical |2 ZB | |
084 | 0 | |a MDE - Decidability, calculability, enumerability |2 ZB | |
084 | 0 | |a MDA - Foundations of mathematics |2 ZB | |
084 | 0 | |a MNLS - Computational methods - algorithms, software | |
245 | 0 | 0 | |a Introduction to algorithms / |c Thomas H. Cormen ; Charles E. Leiserson ; Robert L. Rivest. |
260 | |a Cambridge, Mass. : |b MIT Press, |c 1990. | ||
300 | |a XVII, 1028 p. | ||
490 | 0 | |a The MIT electrical engineering and computer science series. | |
500 | |a englisch | ||
596 | |a 52 | ||
650 | 4 | |a computer algorithm | |
650 | 4 | |a sorting | |
650 | 4 | |a data structure | |
650 | 4 | |a parallel computing | |
650 | 4 | |a dynamic programming | |
653 | |a graph algorithms | ||
700 | 1 | |a Cormen, Thomas H. | |
700 | 1 | |a Leiserson, Charles Eric. | |
700 | 1 | |a Rivest, Ronald L. | |
900 | |a B 066925'01' | ||
908 | |a Lehrbuch | ||
949 | |a B 066925'01' |w LC |c 1 |i 1099100477 |d 16/12/2002 |l STACKS |m S |p €123.49 |r Y |s Y |t INSTB |u 25/3/2009 |x INST-D |1 PRINT |2 HB |