Algorithms and data structures : design, correctness, analysis / Jeffrey H. Kingston.
Saved in:
Personal Name(s): | Kingston, Jeffrey H. |
---|---|
Imprint: |
Reading, Mass. :
Addison-Wesley Pub. Co.,
1990.
|
Physical Description: |
IX, 315 S. |
Note: |
englisch |
ISBN: |
9780201417050 0201417057 |
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. */?>
International computer science series.
|
Keywords: |
binary trees graph algorithms axiomatic semantics fibonacci heaps data abstraction priority queues disjoint sets structure |
Subject (ZB): | |
Classification: | |
Shelf Classification: |
LEADER | 01148cam a2200361 n 4500 | ||
---|---|---|---|
001 | 883 | ||
005 | 19990323140600.0 | ||
008 | r1990 | ||
020 | |a 0201417057 | ||
035 | |a (Sirsi) a11344 | ||
084 | 0 | |a DCA - Informatics - theoretical |2 ZB | |
084 | 1 | |a DCA - Informatik - Theorie |2 LS | |
245 | 0 | 0 | |a Algorithms and data structures : |b design, correctness, analysis / |c Jeffrey H. Kingston. |
260 | |a Reading, Mass. : |b Addison-Wesley Pub. Co., |c 1990. | ||
300 | |a IX, 315 S. | ||
490 | 1 | |a International computer science series. | |
500 | |a englisch | ||
596 | |a 1 | ||
650 | 4 | |a data structure | |
650 | 4 | |a sorting | |
650 | 4 | |a algorithm theory | |
653 | |a binary trees | ||
653 | |a graph algorithms | ||
653 | |a axiomatic semantics | ||
653 | |a fibonacci heaps | ||
653 | |a data abstraction | ||
653 | |a priority queues | ||
653 | |a disjoint sets structure | ||
700 | 1 | |a Kingston, Jeffrey H. | |
900 | |a B 068125'01' | ||
900 | |a DCA 028 | ||
908 | |a Monographie, Sammelwerk | ||
949 | |a DCA 028 |w LC |c 1 |i 1091101056 |d 20/8/2009 |e 5/8/2009 |l STACKS |m ZB |n 15 |r Y |s Y |t ZBB |u 25/3/2009 |x ZB-D |1 PRINT |