Programming classics: implementing the world's best algorithms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York u.a.
Prentice Hall
1993
|
| Schlagworte: | |
| Beschreibung: | XIV, 386 S. graph. Darst. |
| ISBN: | 0131004131 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009942775 | ||
| 003 | DE-604 | ||
| 005 | 19950609 | ||
| 007 | t | ||
| 008 | 941207s1993 xxud||| |||| 00||| eng d | ||
| 020 | |a 0131004131 |9 0-13-100413-1 | ||
| 035 | |a (OCoLC)832312451 | ||
| 035 | |a (DE-599)BVBBV009942775 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 005.1 |2 20 | |
| 084 | |a DAT 530f |2 stub | ||
| 100 | 1 | |a Oliver, Ian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Programming classics |b implementing the world's best algorithms |
| 264 | 1 | |a New York u.a. |b Prentice Hall |c 1993 | |
| 300 | |a XIV, 386 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 7 | |a algorithme combinatoire |2 inriac | |
| 650 | 7 | |a algorithme mise à jour |2 inriac | |
| 650 | 7 | |a algorithme permutation |2 inriac | |
| 650 | 7 | |a algorithme tri |2 inriac | |
| 650 | 7 | |a algorithme |2 inriac | |
| 650 | 7 | |a finance |2 inriac | |
| 650 | 7 | |a fusion |2 inriac | |
| 650 | 7 | |a lissage |2 inriac | |
| 650 | 7 | |a matrice |2 inriac | |
| 650 | 7 | |a nombre aléatoire |2 inriac | |
| 650 | 7 | |a numération |2 inriac | |
| 650 | 7 | |a programmation |2 inriac | |
| 650 | 7 | |a réseau |2 inriac | |
| 650 | 7 | |a structure donnée |2 inriac | |
| 650 | 7 | |a traitement texte |2 inriac | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer programming | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006587923 | ||
Datensatz im Suchindex
| _version_ | 1804124311533912064 |
|---|---|
| any_adam_object | |
| author | Oliver, Ian |
| author_facet | Oliver, Ian |
| author_role | aut |
| author_sort | Oliver, Ian |
| author_variant | i o io |
| building | Verbundindex |
| bvnumber | BV009942775 |
| 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_tum | DAT 530f |
| ctrlnum | (OCoLC)832312451 (DE-599)BVBBV009942775 |
| 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 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01639nam a2200553 c 4500</leader><controlfield tag="001">BV009942775</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950609 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941207s1993 xxud||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0131004131</subfield><subfield code="9">0-13-100413-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)832312451</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009942775</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</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">20</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">Oliver, Ian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programming classics</subfield><subfield code="b">implementing the world's best algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York u.a.</subfield><subfield code="b">Prentice Hall</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 386 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="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 combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme mise à jour</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme permutation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme tri</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">finance</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fusion</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">lissage</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">nombre aléatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">numération</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">traitement texte</subfield><subfield code="2">inriac</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006587923</subfield></datafield></record></collection> |
| id | DE-604.BV009942775 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:43:39Z |
| institution | BVB |
| isbn | 0131004131 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006587923 |
| oclc_num | 832312451 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | XIV, 386 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Prentice Hall |
| record_format | marc |
| spelling | Oliver, Ian Verfasser aut Programming classics implementing the world's best algorithms New York u.a. Prentice Hall 1993 XIV, 386 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmes ram algorithme combinatoire inriac algorithme mise à jour inriac algorithme permutation inriac algorithme tri inriac algorithme inriac finance inriac fusion inriac lissage inriac matrice inriac nombre aléatoire inriac numération inriac programmation inriac réseau inriac structure donnée inriac traitement texte inriac Computer algorithms Computer programming Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 |
| spellingShingle | Oliver, Ian Programming classics implementing the world's best algorithms Algorithmes ram algorithme combinatoire inriac algorithme mise à jour inriac algorithme permutation inriac algorithme tri inriac algorithme inriac finance inriac fusion inriac lissage inriac matrice inriac nombre aléatoire inriac numération inriac programmation inriac réseau inriac structure donnée inriac traitement texte inriac Computer algorithms Computer programming Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 |
| title | Programming classics implementing the world's best algorithms |
| title_auth | Programming classics implementing the world's best algorithms |
| title_exact_search | Programming classics implementing the world's best algorithms |
| title_full | Programming classics implementing the world's best algorithms |
| title_fullStr | Programming classics implementing the world's best algorithms |
| title_full_unstemmed | Programming classics implementing the world's best algorithms |
| title_short | Programming classics |
| title_sort | programming classics implementing the world s best algorithms |
| title_sub | implementing the world's best algorithms |
| topic | Algorithmes ram algorithme combinatoire inriac algorithme mise à jour inriac algorithme permutation inriac algorithme tri inriac algorithme inriac finance inriac fusion inriac lissage inriac matrice inriac nombre aléatoire inriac numération inriac programmation inriac réseau inriac structure donnée inriac traitement texte inriac Computer algorithms Computer programming Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes algorithme combinatoire algorithme mise à jour algorithme permutation algorithme tri algorithme finance fusion lissage matrice nombre aléatoire numération programmation réseau structure donnée traitement texte Computer algorithms Computer programming Algorithmus |
| work_keys_str_mv | AT oliverian programmingclassicsimplementingtheworldsbestalgorithms |