Verfügbarkeit: Introduction to algorithms | Technische Universität München

Introduction to algorithms:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Cormen, Thomas H. (VerfasserIn), Leiserson, Charles E. (VerfasserIn), Rivest, Ronald L. (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Cambridge, Mass. u.a. MIT Pr. 1990
Ausgabe:	2. print.
Schriftenreihe:	The MIT electrical engineering and computer science series
Schlagwörter:	Informatik Algorithmus Datenstruktur Algorithmische Programmierung Einführung Lehrbuch
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002645527&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XVII, 1028 S. graph. Darst.
ISBN:	0262031418 0070131430 0262530910

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV004252835
003	DE-604
005	19910722
007	t\|
008	910228s1990 xx d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0262031418 \|9 0-262-03141-8
020			\|a 0070131430 \|9 0-07-013143-0
020			\|a 0262530910 \|9 0-262-53091-0
035			\|a (OCoLC)256165977
035			\|a (DE-599)BVBBV004252835
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91 \|a DE-384 \|a DE-20 \|a DE-83 \|a DE-11 \|a DE-188
050		0	\|a QA76.6
082	0		\|a 005.1
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 230 \|0 (DE-625)143617: \|2 rvk
084			\|a 68Q25 \|2 msc
084			\|a 68Rxx \|2 msc
084			\|a DAT 530f \|2 stub
100	1		\|a Cormen, Thomas H. \|e Verfasser \|0 (DE-588)12942661X \|4 aut
245	1	0	\|a Introduction to algorithms \|c Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest
250			\|a 2. print.
264		1	\|a Cambridge, Mass. u.a. \|b MIT Pr. \|c 1990
300			\|a XVII, 1028 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a The MIT electrical engineering and computer science series
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 Datenstruktur \|0 (DE-588)4011146-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 Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	0	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|8 3\p \|5 DE-604
689	1	0	\|a Informatik \|0 (DE-588)4026894-9 \|D s
689	1	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1		\|8 4\p \|5 DE-604
689	2	0	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|D s
689	2		\|8 5\p \|5 DE-604
700	1		\|a Leiserson, Charles E. \|e Verfasser \|4 aut
700	1		\|a Rivest, Ronald L. \|e Verfasser \|4 aut
856	4	2	\|m HEBIS Datenaustausch Mainz \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002645527&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
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
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 5\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-002645527

Datensatz im Suchindex

DE-BY-TUM_call_number	0834 MA.151 0834 IN.172
DE-BY-TUM_katkey	515511
DE-BY-TUM_location	LSB
DE-BY-TUM_media_number	TEMP2961342 TEMP2961343
_version_	1821939087543631872
adam_text	THOMAS H. CORMEN CHARLES E. LEISERSON RONALD L. RIVEST INTRODUCTION TO ALGORITHMS THE MIT PRESS CAMBRIDGE, MASSACHUSETTS LONDON, ENGLAND MCGRAW-HILL BOOK COMPANY NEW YORK ST. LOUIS SAN FRANCISCO MONTREAL TORONTO CONTENTS PREFACE JCIIV INTRODUCTION / 1.1 ALGORITHMS 1 1.2 ANALYZING ALGORITHMS 6 1.3 DESIGNING ALGORITHMS 11 1.4 SUMMARY 16 I MATHEMATICAL FOUNDATIONS INTRODUCTION 21 2 GROWTH OF FUNCTIONS 23 2. 1 ASYMPTOTIC NOTATION 23 2.2 STANDARD NOTATIONS AND COMMON FUNCTIONS 32 3 SUMMATIONS 42 3.1 SUMMATION FORMULAS AND PROPERTIES 42 3.2 BOUNDING SUMMATIONS 46 4 RECURRENCES 53 4.1 THE SUBSTITUTION METHOD 54 4.2 THE ITERATION METHOD 55 4.3 THE MASTER METHOD 61 K 4.4 PROOF OF THE MASTER THEOREM 64 5 SETS, ETC. 77 5.1 SETS 77 5.2 RELATIONS 81 5.3 FUNCTIONS 84 5.4 GRAPHS 86 5.5 TREES 91 VI CONTENTS COUNTING AND PROBABILITY 99 6.1 COUNTING 99 6.2 PROBABILITY 104 6.3 DISCRETE RANDOM VARIABLES 111 6.4 THE GEOMETRIC AND BINOMIAL DISTRIBUTIONS 115 6.5 THE TAILS OF THE BINOMIAL DISTRIBUTION 727 6.6 PROBABILISTIC ANALYSIS 126 II SORTING AND ORDER STATISTICS INTRODUCTION 137 7 HEAPSORT 140 7.1 HEAPS 140 7.2 MAINTAINING THE HEAP PROPERTY 142 7.3 BUILDING A HEAP 145 7.4 THE HEAPSORT ALGORITHM 147 7.5 PRIORITY QUEUES 149 8 QUICKSORT 153 8.1 DESCRIPTION OF QUICKSORT 153 8.2 PERFORMANCE OF QUICKSORT 756 8.3 RANDOMIZED VERSIONS OF QUICKSORT 767 8.4 ANALYSIS OF QUICKSORT 765 9 SORTING IN LINEAR TIME 172 9.1 LOWER BOUNDS FOR SORTING 7 72 9.2 COUNTING SORT 775 9.3 RADIX SORT 775 9.4 BUCKET SORT 750 10 MEDIANS AND ORDER STATISTICS 185 10.1 MINIMUM AND MAXIMUM 755 10.2 SELECTION IN EXPECTED LINEAR TIME 757 10.3 SELECTION IN WORST-CASE LINEAR TIME 759 CONTENTS VII III DATA STRUCTURES INTRODUCTION 197 11 ELEMENTARY DATA STRUCTURES 200 11.1 STACKS AND QUEUES 200 11.2 LINKED LISTS 204 11.3 IMPLEMENTING POINTERS AND OBJECTS 209 11.4 REPRESENTING ROOTED TREES 213 12 HASH TABLES 219 12.1 DIRECT-ADDRESS TABLES 219 12.2 HASH TABLES 221 12.3 HASH FUNCTIONS 226 12.4 OPEN ADDRESSING 232 13 BINARY SEARCH TREES 244 13.1 WHAT IS A BINARY SEARCH TREE? 244 13.2 QUERYING A BINARY SEARCH TREE 246 13.3 INSERTION AND DELETION 250 ~K 13.4 RANDOMLY BUILT BINARY SEARCH TREES 254 14 RED-BLACK TREES 263 14.1 PROPERTIES OF RED-BLACK TREES 263 14.2 ROTATIONS 265 14.3 INSERTION 265 14.4 DELETION 272 15 AUGMENTING DATA STRUCTURES 281 15.1 DYNAMIC ORDER STATISTICS 257 15.2 HOW TO AUGMENT A DATA STRUCTURE 257 15.3 INTERVAL TREES 290 IV ADVANCED DESIGN AND ANALYSIS TECHNIQUES INTRODUCTION 299 16 DYNAMIC PROGRAMMING 301 16.1 MATRIX-CHAIN MULTIPLICATION 302 16.2 ELEMENTS OF DYNAMIC PROGRAMMING 309 16.3 LONGEST COMMON SUBSEQUENCE 314 16.4 OPTIMAL POLYGON TRIANGULATION 320 VIII CONTENTS 17 GREEDY ALGORITHMS 329 17.1 AN ACTIVITY-SELECTION PROBLEM 329 17.2 ELEMENTS OF THE GREEDY STRATEGY 333 17.3 HUFFMAN CODES 337 } K 17.4 THEORETICAL FOUNDATIONS FOR GREEDY METHODS 345 I * 17.5 A TASK-SCHEDULING PROBLEM 350 * 18 AMORTIZED ANALYSIS 356 18.1 THE AGGREGATE METHOD 357 18.2 THE ACCOUNTING METHOD 360 18.3 THE POTENTIAL METHOD 363 18.4 DYNAMIC TABLES 367 V ADVANCED DATA STRUCTURES INTRODUCTION 379 19 B-TREES 381 19.1 DEFINITION OF B-TREES 384 19.2 BASIC OPERATIONS ON B-TREES 357 19.3 DELETING A KEY FROM A B-TREE 395 20 BINOMIAL HEAPS 400 20.1 BINOMIAL TREES AND BINOMIAL HEAPS 401 20.2 OPERATIONS ON BINOMIAL HEAPS 406 21 FIBONACCI HEAPS 420 21.1 STRUCTURE OF FIBONACCI HEAPS 427 21.2 MERGEABLE-HEAP OPERATIONS 423 21.3 DECREASING A KEY AND DELETING A NODE 431 21.4 BOUNDING THE MAXIMUM DEGREE 435 22 DATA STRUCTURES FOR DISJOINT SETS 440 22.1 DISJOINT-SET OPERATIONS 440 22.2 LINKED-LIST REPRESENTATION OF DISJOINT SETS 443 22.3 DISJOINT-SET FORESTS 446 K 22.4 ANALYSIS OF UNION BY RANK WITH PATH COMPRESSION 450 CONTENTS IX VI GRAPH ALGORITHMS INTRODUCTION 463 23 ELEMENTARY GRAPH ALGORITHMS 465 23.1 REPRESENTATIONS OF GRAPHS 465 23.2 BREADTH-FIRST SEARCH 469 23.3 DEPTH-FIRST SEARCH 477 23.4 TOPOLOGICAL SORT 485 23.5 STRONGLY CONNECTED COMPONENTS 488 24 MINIMUM SPANNING TREES 498 24.1 GROWING A MINIMUM SPANNING TREE 499 24.2 THE ALGORITHMS OF KRUSKAL AND PRIM 504 25 SINGLE-SOURCE SHORTEST PATHS 514 25.1 SHORTEST PATHS AND RELAXATION 575 25.2 DIJKSTRA S ALGORITHM 527 25.3 THE BELLMAN-FORD ALGORITHM 532 25 A SINGLE-SOURCE SHORTEST PATHS IN DIRECTED ACYCLIC GRAPHS 536 25.5 DIFFERENCE CONSTRAINTS AND SHORTEST PATHS 539 26 ALL-PAIRS SHORTEST PATHS 550 26.1 SHORTEST PATHS AND MATRIX MULTIPLICATION 552 26.2 THE FLOYD-WARSHALL ALGORITHM 555 26.3 JOHNSON S ALGORITHM FOR SPARSE GRAPHS 565 -K 26.4 A GENERAL FRAMEWORK FOR SOLVING PATH PROBLEMS IN DI- RECTED GRAPHS 570 27 MAXIMUM FLOW 579 27.1 FLOW NETWORKS 580 27.2 THE FORD-FULKERSON METHOD 557 27.3 MAXIMUM BIPARTITE MATCHING 600 K 21A PREFLOW-PUSH ALGORITHMS 605 *K 27.5 THE LIFT-TO-FRONT ALGORITHM 675 CONTENTS VII SELECTED TOPICS INTRODUCTION 631 28 SORTING NETWORKS 634 28.1 COMPARISON NETWORKS 634 28.2 THE ZERO-ONE PRINCIPLE 639 28.3 A BITONIC SORTING NETWORK 642 28.4 A MERGING NETWORK 646 28.5 A SORTING NETWORK 648 29 ARITHMETIC CIRCUITS 654 29.1 COMBINATIONAL CIRCUITS 655 29.2 ADDITION CIRCUITS 660 29.3 MULTIPLICATION CIRCUITS 677 29.4 CLOCKED CIRCUITS 675 30 ALGORITHMS FOR PARALLEL COMPUTERS 688 30.1 POINTER JUMPING 692 30.2 CRCW ALGORITHMS VERSUS EREW ALGORITHMS 707 30.3 BRENT S THEOREM AND WORK EFFICIENCY 709 K 30.4 WORK-EFFICIENT PARALLEL PREFIX COMPUTATION 714 30.5 DETERMINISTIC SYMMETRY BREAKING 720 31 MATRIX OPERATIONS 730 31.1 PROPERTIES OF MATRICES 730 31.2 STRASSEN S ALGORITHM FOR MATRIX MULTIPLICATION 739 ~K 31.3 ALGEBRAIC NUMBER SYSTEMS AND BOOLEAN MATRIX MULTIPLI- CATION 745 31 A SOLVING SYSTEMS OF LINEAR EQUATIONS 749 31.5 INVERTING MATRICES 762 31.6 SYMMETRIC POSITIVE-DEFINITE MATRICES AND LEAST-SQUARES APPROXIMATION 766 32 POLYNOMIALS AND THE FFT 776 32.1 REPRESENTATION OF POLYNOMIALS 775 32.2 THE DFT AND FFT 783 32.3 EFFICIENT FFT IMPLEMENTATIONS 797 33 NUMBER-THEORETIC ALGORITHMS 801 33.1 ELEMENTARY NUMBER-THEORETIC NOTIONS 502 33.2 GREATEST COMMON DIVISOR 505 33.3 MODULAR ARITHMETIC 814 CONTENTS XI 33.4 SOLVING MODULAR LINEAR EQUATIONS 520 33.5 THE CHINESE REMAINDER THEOREM 823 33.6 POWERS OF AN ELEMENT 527 33.7 THE RSA PUBLIC-KEY CRYPTOSYSTEM 831 K 33.8 PRIMALITY TESTING 557 K 33.9 INTEGER FACTORIZATION 844 34 STRING MATCHING 853 34.1 THE NAIVE STRING-MATCHING ALGORITHM 555 34.2 THE RABIN-KARP ALGORITHM 557 34.3 STRING MATCHING WITH FINITE AUTOMATA 562 34.4 THE KNUTH-MORRIS-PRATT ALGORITHM 569 K 34.5 THE BOYER-MOORE ALGORITHM 576 35 COMPUTATIONAL GEOMETRY 886 35.1 LINE-SEGMENT PROPERTIES 557 35.2 DETERMINING WHETHER ANY PAIR OF SEGMENTS INTERSECTS 592 35.3 FINDING THE CONVEX HULL 595 35.4 FINDING THE CLOSEST PAIR OF POINTS 905 36 NP-COMPLETENESS 916 36.1 POLYNOMIAL TIME 977 36.2 POLYNOMIAL-TIME VERIFICATION 924 36.3 NP-COMPLETENESS AND REDUCIBILITY 929 36.4 NP-COMPLETENESS PROOFS 939 36.5 NP-COMPLETE PROBLEMS 946 37 APPROXIMATION ALGORITHMS 964 37.1 THE VERTEX-COVER PROBLEM 966 37.2 THE TRAVELING-SALESMAN PROBLEM 969 37.3 THE SET-COVERING PROBLEM 974 37 A THE SUBSET-SUM PROBLEM 975 BIBLIOGRAPHY 987 INDEX 997
any_adam_object	1
author	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L.
author_GND	(DE-588)12942661X
author_facet	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L.
author_role	aut aut aut
author_sort	Cormen, Thomas H.
author_variant	t h c th thc c e l ce cel r l r rl rlr
building	Verbundindex
bvnumber	BV004252835
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 230
classification_tum	DAT 530f
ctrlnum	(OCoLC)256165977 (DE-599)BVBBV004252835
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	2. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02752nam a2200649 c 4500</leader><controlfield tag="001">BV004252835</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19910722 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">910228s1990 xx d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262031418</subfield><subfield code="9">0-262-03141-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0070131430</subfield><subfield code="9">0-07-013143-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262530910</subfield><subfield code="9">0-262-53091-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)256165977</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004252835</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-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</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></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 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</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">68Rxx</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="100" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12942661X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to algorithms</subfield><subfield code="c">Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 1028 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="490" ind1="0" ind2=" "><subfield code="a">The MIT electrical engineering and computer science series</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">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">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">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leiserson, Charles E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rivest, Ronald L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Mainz</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=002645527&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\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">5\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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002645527</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.BV004252835
illustrated	Illustrated
indexdate	2024-12-20T08:15:28Z
institution	BVB
isbn	0262031418 0070131430 0262530910
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-002645527
oclc_num	256165977
open_access_boolean
owner	DE-91 DE-BY-TUM DE-384 DE-20 DE-83 DE-11 DE-188
owner_facet	DE-91 DE-BY-TUM DE-384 DE-20 DE-83 DE-11 DE-188
physical	XVII, 1028 S. graph. Darst.
publishDate	1990
publishDateSearch	1990
publishDateSort	1990
publisher	MIT Pr.
record_format	marc
series2	The MIT electrical engineering and computer science series
spellingShingle	Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L. Introduction to algorithms Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd
subject_GND	(DE-588)4026894-9 (DE-588)4001183-5 (DE-588)4011146-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 ; Charles E. Leiserson ; Ronald L. Rivest
title_fullStr	Introduction to algorithms Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest
title_full_unstemmed	Introduction to algorithms Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest
title_short	Introduction to algorithms
title_sort	introduction to algorithms
topic	Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Datenstruktur (DE-588)4011146-5 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd
topic_facet	Informatik Algorithmus Datenstruktur Algorithmische Programmierung Einführung Lehrbuch
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002645527&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT cormenthomash introductiontoalgorithms AT leisersoncharlese introductiontoalgorithms AT rivestronaldl introductiontoalgorithms

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Handapparate (nicht verfügbar)

Bestandsangaben von Handapparate (nicht verfügbar)
Signatur:	0834 IN.172 Lageplan 0834 MA.151 Lageplan
Exemplar 1	Dauerhaft ausgeliehen Ausgeliehen
Exemplar 2	Dauerhaft ausgeliehen Ausgeliehen