Introduction to algorithms:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. [u.a.]
MIT Press
1993
|
| Ausgabe: | 10. print. |
| Schriftenreihe: | MIT electrical engineering and computer science series
|
| Schlagworte: | |
| Beschreibung: | XVII, 1028 S. graph. Darst. |
| ISBN: | 0262031418 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010020416 | ||
| 003 | DE-604 | ||
| 005 | 20130724 | ||
| 007 | t | ||
| 008 | 950201s1993 d||| |||| 00||| engod | ||
| 020 | |a 0262031418 |9 0-262-03141-8 | ||
| 035 | |a (OCoLC)489990735 | ||
| 035 | |a (DE-599)BVBBV010020416 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-29T |a DE-20 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 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 10. print. | ||
| 264 | 1 | |a Cambridge, Mass. [u.a.] |b MIT Press |c 1993 | |
| 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 MIT electrical engineering and computer science series | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a algorithme parallele |2 inriac | |
| 650 | 7 | |a algorithmique |2 inriac | |
| 650 | 7 | |a analyse algorithme |2 inriac | |
| 650 | 7 | |a appariement |2 inriac | |
| 650 | 7 | |a approximation |2 inriac | |
| 650 | 7 | |a circuit arithmetique |2 inriac | |
| 650 | 7 | |a completude |2 inriac | |
| 650 | 7 | |a conception algorithme |2 inriac | |
| 650 | 7 | |a fft |2 inriac | |
| 650 | 7 | |a geometrie algorithmique |2 inriac | |
| 650 | 7 | |a matrice |2 inriac | |
| 650 | 7 | |a structure donnee |2 inriac | |
| 650 | 7 | |a theorie nombre |2 inriac | |
| 650 | 7 | |a tri |2 inriac | |
| 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 Algorithmische Programmierung |0 (DE-588)4293504-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |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 | |
| 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-006643243 | |
Datensatz im Suchindex
| _version_ | 1814985751104847872 |
|---|---|
| adam_text | |
| any_adam_object | |
| 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 | BV010020416 |
| classification_rvk | ST 134 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)489990735 (DE-599)BVBBV010020416 |
| discipline | Informatik |
| edition | 10. print. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV010020416</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130724</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950201s1993 d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262031418</subfield><subfield code="9">0-262-03141-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)489990735</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010020416</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-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</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">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">10. print.</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">1993</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">MIT electrical engineering and computer science series</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallele</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">appariement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">approximation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">circuit arithmetique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">completude</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">conception algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fft</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">geometrie algorithmique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">matrice</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure donnee</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">theorie nombre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">tri</subfield><subfield code="2">inriac</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">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="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="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="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-006643243</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.BV010020416 |
| illustrated | Illustrated |
| indexdate | 2024-11-06T15:01:35Z |
| institution | BVB |
| isbn | 0262031418 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006643243 |
| oclc_num | 489990735 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-29T DE-20 |
| owner_facet | DE-91G DE-BY-TUM DE-29T DE-20 |
| physical | XVII, 1028 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | MIT Press |
| record_format | marc |
| series2 | MIT electrical engineering and computer science series |
| spelling | Cormen, Thomas H. Verfasser (DE-588)12942661X aut Introduction to algorithms Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest 10. print. Cambridge, Mass. [u.a.] MIT Press 1993 XVII, 1028 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier MIT electrical engineering and computer science series Algorithmes ram algorithme graphe inriac algorithme parallele inriac algorithmique inriac analyse algorithme inriac appariement inriac approximation inriac circuit arithmetique inriac completude inriac conception algorithme inriac fft inriac geometrie algorithmique inriac matrice inriac structure donnee inriac theorie nombre inriac tri inriac Datenstruktur (DE-588)4011146-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content Datenstruktur (DE-588)4011146-5 s Algorithmus (DE-588)4001183-5 s 3\p DE-604 Informatik (DE-588)4026894-9 s 4\p DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 5\p DE-604 Leiserson, Charles E. Verfasser aut Rivest, Ronald L. Verfasser aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L. Introduction to algorithms Algorithmes ram algorithme graphe inriac algorithme parallele inriac algorithmique inriac analyse algorithme inriac appariement inriac approximation inriac circuit arithmetique inriac completude inriac conception algorithme inriac fft inriac geometrie algorithmique inriac matrice inriac structure donnee inriac theorie nombre inriac tri inriac Datenstruktur (DE-588)4011146-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4026894-9 (DE-588)4293504-0 (DE-588)4001183-5 (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 | Algorithmes ram algorithme graphe inriac algorithme parallele inriac algorithmique inriac analyse algorithme inriac appariement inriac approximation inriac circuit arithmetique inriac completude inriac conception algorithme inriac fft inriac geometrie algorithmique inriac matrice inriac structure donnee inriac theorie nombre inriac tri inriac Datenstruktur (DE-588)4011146-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes algorithme graphe algorithme parallele algorithmique analyse algorithme appariement approximation circuit arithmetique completude conception algorithme fft geometrie algorithmique matrice structure donnee theorie nombre tri Datenstruktur Informatik Algorithmische Programmierung Algorithmus Einführung Lehrbuch |
| work_keys_str_mv | AT cormenthomash introductiontoalgorithms AT leisersoncharlese introductiontoalgorithms AT rivestronaldl introductiontoalgorithms |