Introduction to algorithms:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. [u.a.]
MIT Press
2009
|
| Ausgabe: | 3. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | XIX, 1292 S. graph. Darst. |
| ISBN: | 9780262033848 0262033844 9780262533058 0262533057 9788120340077 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035620713 | ||
| 003 | DE-604 | ||
| 005 | 20230126 | ||
| 007 | t | ||
| 008 | 090709s2009 d||| |||| 00||| eng d | ||
| 020 | |a 9780262033848 |c hbk |9 978-0-262-03384-8 | ||
| 020 | |a 0262033844 |9 0-262-03384-4 | ||
| 020 | |a 9780262533058 |c pbk |9 978-0-262-53305-8 | ||
| 020 | |a 0262533057 |9 0-262-53305-7 | ||
| 020 | |a 9788120340077 |9 978-81-203-4007-7 | ||
| 035 | |a (OCoLC)698955316 | ||
| 035 | |a (DE-599)BVBBV035620713 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-91 |a DE-634 |a DE-83 |a DE-706 |a DE-29T |a DE-739 |a DE-92 |a DE-860 |a DE-91G |a DE-11 |a DE-703 |a DE-Aug4 |a DE-898 |a DE-19 |a DE-355 |a DE-188 |a DE-384 |a DE-523 |a DE-862 |a DE-522 |a DE-473 |a DE-M382 |a DE-573 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 65Rxx |2 msc | ||
| 084 | |a 68Q25 |2 msc | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Introduction to algorithms |c Thomas H. Cormen ... |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a Cambridge, Mass. [u.a.] |b MIT Press |c 2009 | |
| 300 | |a XIX, 1292 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer programming | |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 655 | 7 | |8 2\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 2 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Cormen, Thomas H. |e Sonstige |0 (DE-588)12942661X |4 oth | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017675862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017675862 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| DE-BY-862_location | 2000 |
|---|---|
| DE-BY-FWS_call_number | 2000/ST 134 C811 I6(3) |
| DE-BY-FWS_katkey | 355274 |
| DE-BY-FWS_media_number | 083000510513 |
| _version_ | 1824553886472470528 |
| adam_text | Titel: Introduction to algorithms
Autor: Cormen, Thomas H.
Jahr: 2009
Contents
Preface xiii
I Foundations
Introduction 3
1 The Role of Algorithms in Computing 5
1.1 Algorithms 5
1.2 Algorithms as a technology 11
2 Getting Started 16
2.1 Insertion sort 16
2.2 Analyzing algorithms 23
2.3 Designing algorithms 29
3 Growth of Functions 43
3.1 Asymptotic notation 43
3.2 Standard notations and common functions 53
4 Divide-and-Conquer 65
4.1 The maximum-subarray problem 68
4.2 Strassen s algorithm for matrix multiplication 75
4.3 The substitution method for solving recurrences 83
4.4 The recursion-tree method for solving recurrences 88
4.5 The master method for solving recurrences 93
* 4.6 Proof of the master theorem 97
5 Probabilistic Analysis and Randomized Algorithms 114
5.1 The hiring problem /14
5.2 Indicator random variables 118
5.3 Randomized algorithms 722
* 5.4 Probabilistic analysis and further uses of indicator random variables
130
vi Contents
II Sorting and Order Statistics
Introduction 147
6 Heapsort 151
6.1 Heaps 75/
6.2 Maintaining the heap property 154
6.3 Building a heap 156
6.4 The heapsort algorithm 159
6.5 Priority queues 162
7 Quicksort 170
7.1 Description of quicksort 770
7.2 Performance of quicksort 174
7.3 A randomized version of quicksort 779
7.4 Analysis of quicksort 180
8 Sorting in Linear Time 191
8.1 Lower bounds for sorting 797
8.2 Counting sort 194
8.3 Radix sort 797
8.4 Bucket sort 200
9 Medians and Order Statistics 213
9.1 Minimum and maximum 214
9.2 Selection in expected linear time 215
9.3 Selection in worst-case linear time 220
III Data Structures
Introduction 229
10 Elementary Data Structures 232
10.1 Stacks and queues 232
10.2 Linked lists 236
10.3 Implementing pointers and objects 241
10.4 Representing rooted trees 246
11 Hash Tables 253
11.1 Direct-address tables 254
11.2 Hash tables 256
11.3 Hash functions 262
11.4 Open addressing 269
• 11.5 Perfect hashing 277
Contents vii
12 Binary Search Trees 286
12.1 What is a binary search tree? 286
12.2 Querying a binary search tree 289
12.3 Insertion and deletion 294
•k 12.4 Randomly built binary search trees 299
13 Red-Black Trees 308
13.1 Properties of red-black trees 308
13.2 Rotations 312
13.3 Insertion 5/5
13.4 Deletion 323
14 Augmenting Data Structures 339
14.1 Dynamic order statistics 539
14.2 How to augment a data structure 345
14.3 Interval trees 348
TV Advanced Design and Analysis Techniques
Introduction 357
15 Dynamic Programming 359
15.1 Rod cutting 360
15.2 Matrix-chain multiplication 370
15.3 Elements of dynamic programming 378
15.4 Longest common subsequence 390
15.5 Optimal binary search trees 397
16 Greedy Algorithms 414
16.1 An activity-selection problem 415
16.2 Elements of the greedy strategy 423
16.3 Huffman codes 428
•k 16.4 Matroids and greedy methods 437
•k 16.5 A task-scheduling problem as a matroid 445
17 Amortized Analysis 457
17.1 Aggregate analysis 452
17.2 The accounting method 456
17.3 The potential method 459
17.4 Dynamic tables 463
viii Contents
V Advanced Data Structures
Introduction 481
18 B-Trees 484
18.1 Definition of B-trees 488
18.2 Basic operations on B-trees 491
18.3 Deleting a key from a B-tree 499
19 Fibonacci Heaps 505
19.1 Structure of Fibonacci heaps 507
19.2 Mergeable-heap operations 570
19.3 Decreasing a key and deleting a node 518
19A Bounding the maximum degree 523
20 van Emde Boas Trees 531
20.1 Preliminary approaches 532
20.2 A recursive structure 536
20.3 The van Emde Boas tree 545
21 Data Structures for Disjoint Sets 561
21.1 Disjoint-set operations 567
21.2 Linked-list representation of disjoint sets 564
21.3 Disjoint-set forests 568
•k 21.4 Analysis of union by rank with path compression 573
VI Graph Algorithms
Introduction 587
22 Elementary Graph Algorithms 589
22.1 Representations of graphs 589
22.2 Breadth-first search 594
22.3 Depth-first search 603
22.4 Topological sort 672
22.5 Strongly connected components 675
23 Minimum Spanning Trees 624
23.1 Growing a minimum spanning tree 625
23.2 The algorithms of Kruskal and Prim 631
Contents ix
24 Single-Source Shortest Paths 643
24.1 The Bellman-Ford algorithm 657
24.2 Single-source shortest paths in directed acyclic graphs 655
24.3 Dijkstra s algorithm 658
24.4 Difference constraints and shortest paths 664
24.5 Proofs of shortest-paths properties 671
25 All-Pairs Shortest Paths 684
25.1 Shortest paths and matrix multiplication 686
25.2 The Floyd-Warshall algorithm 693
25.3 Johnson s algorithm for sparse graphs 700
26 Maximum Flow 708
26.1 Flow networks 709
26.2 The Ford-Fulkerson method 714
26.3 Maximum bipartite matching 732
* 26.4 Push-relabel algorithms 736
• 26.5 The relabel-to-front algorithm 748
VII Selected Topics
Introduction 769
27 Multithreaded Algorithms 772
27.1 The basics of dynamic multithreading 774
27.2 Multithreaded matrix multiplication 792
27.3 Multithreaded merge sort 797
28 Matrix Operations 813
28.1 Solving systems of linear equations 813
28.2 Inverting matrices 827
28.3 Symmetric positive-definite matrices and least-squares approximation
832
29 Linear Programming 843
29.1 Standard and slack forms 850
29.2 Formulating problems as linear programs 859
29.3 The simplex algorithm 864
29.4 Duality 879
29.5 The initial basic feasible solution 886
x Contents
30 Polynomials and the FFT 898
30.1 Representing polynomials 900
30.2 The DFT and FFT 906
30.3 Efficient FFT implementations 915
31 Number-Theoretic Algorithms 926
31.1 Elementary number-theoretic notions 927
31.2 Greatest common divisor 933
31.3 Modular arithmetic 939
31.4 Solving modular linear equations 946
31.5 The Chinese remainder theorem 950
31.6 Powers of an element 954
31.7 The RSA public-key cryptosystem 958
• 31.8 Primality testing 965
•k 31.9 Integer factorization 975
32 String Matching 985
32.1 The naive string-matching algorithm 988
32.2 The Rabin-Karp algorithm 990
32.3 String matching with finite automata 995
• 32.4 The Knuth-Morris-Pratt algorithm 7002
33 Computational Geometry 1014
33.1 Line-segment properties 1015
33.2 Determining whether any pair of segments intersects 7027
33.3 Finding the convex hull 7029
33.4 Finding the closest pair of points 7059
34 NP-Completeness 1048
34.1 Polynomial time 7055
34.2 Polynomial-time verification 7067
34.3 NP-completeness and reducibility 1067
34.4 NP-completeness proofs 7078
34.5 NP-complete problems 7086
35 Approximation Algorithms 1106
35.1 The vertex-cover problem 7708
35.2 The traveling-salesman problem 7777
35.3 The set-covering problem 7777
35.4 Randomization and linear programming 7725
35.5 The subset-sum problem 7728
Contents xi
VIII Appendix: Mathematical Background
Introduction 1143
A Summations 1145
A.I Summation formulas and properties 1145
A.2 Bounding summations 1149
B Sets, Etc. 1158
B.I Sets 1158
B.2 Relations 1163
B.3 Functions 1166
B.4 Graphs 1168
B.5 Trees 1173
C Counting and Probability 1183
C.I Counting 7/SJ
C.2 Probability 7789
C.3 Discrete random variables 7796
C.4 The geometric and binomial distributions 7207
• C.5 The tails of the binomial distribution 7208
D Matrices 1217
D.I Matrices and matrix operations 7277
D.2 Basic matrix properties 7222
Bibliography 1231
Index 1251
|
| any_adam_object | 1 |
| author_GND | (DE-588)12942661X |
| building | Verbundindex |
| bvnumber | BV035620713 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)698955316 (DE-599)BVBBV035620713 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02779nam a2200661 c 4500</leader><controlfield tag="001">BV035620713</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230126 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090709s2009 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262033848</subfield><subfield code="c">hbk</subfield><subfield code="9">978-0-262-03384-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262033844</subfield><subfield code="9">0-262-03384-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262533058</subfield><subfield code="c">pbk</subfield><subfield code="9">978-0-262-53305-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262533057</subfield><subfield code="9">0-262-53305-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9788120340077</subfield><subfield code="9">978-81-203-4007-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)698955316</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035620713</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-M382</subfield><subfield code="a">DE-573</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65Rxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to algorithms</subfield><subfield code="c">Thomas H. Cormen ...</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. [u.a.]</subfield><subfield code="b">MIT Press</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 1292 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">2\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)12942661X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017675862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017675862</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4151278-9 Einführung gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Einführung Lehrbuch |
| id | DE-604.BV035620713 |
| illustrated | Illustrated |
| indexdate | 2025-02-20T06:43:00Z |
| institution | BVB |
| isbn | 9780262033848 0262033844 9780262533058 0262533057 9788120340077 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017675862 |
| oclc_num | 698955316 |
| open_access_boolean | |
| owner | DE-20 DE-91 DE-BY-TUM DE-634 DE-83 DE-706 DE-29T DE-739 DE-92 DE-860 DE-91G DE-BY-TUM DE-11 DE-703 DE-Aug4 DE-898 DE-BY-UBR DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-188 DE-384 DE-523 DE-862 DE-BY-FWS DE-522 DE-473 DE-BY-UBG DE-M382 DE-573 |
| owner_facet | DE-20 DE-91 DE-BY-TUM DE-634 DE-83 DE-706 DE-29T DE-739 DE-92 DE-860 DE-91G DE-BY-TUM DE-11 DE-703 DE-Aug4 DE-898 DE-BY-UBR DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-188 DE-384 DE-523 DE-862 DE-BY-FWS DE-522 DE-473 DE-BY-UBG DE-M382 DE-573 |
| physical | XIX, 1292 S. graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | MIT Press |
| record_format | marc |
| spellingShingle | Introduction to algorithms Algoritmen gtt Computer algorithms Computer programming Datenstruktur (DE-588)4011146-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4026894-9 (DE-588)4001183-5 (DE-588)4293504-0 (DE-588)4151278-9 (DE-588)4123623-3 |
| title | Introduction to algorithms |
| title_auth | Introduction to algorithms |
| title_exact_search | Introduction to algorithms |
| title_full | Introduction to algorithms Thomas H. Cormen ... |
| title_fullStr | Introduction to algorithms Thomas H. Cormen ... |
| title_full_unstemmed | Introduction to algorithms Thomas H. Cormen ... |
| title_short | Introduction to algorithms |
| title_sort | introduction to algorithms |
| topic | Algoritmen gtt Computer algorithms Computer programming Datenstruktur (DE-588)4011146-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd |
| topic_facet | Algoritmen Computer algorithms Computer programming Datenstruktur Informatik Algorithmus Algorithmische Programmierung Einführung Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017675862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT cormenthomash introductiontoalgorithms |
Inhaltsverzeichnis
THWS Schweinfurt Zentralbibliothek Lesesaal
| Signatur: |
2000 ST 134 C811 I6(3) |
|---|---|
| Exemplar 1 | ausleihbar Verfügbar Bestellen |