Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | German |
| Published: |
Aachen
Shaker
1996
|
| Edition: | Als Ms. gedr. |
| Series: | Berichte aus der Informatik
|
| Subjects: | |
| Physical Description: | VIII, 141 S. graph. Darst. |
| ISBN: | 3826517377 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV024415781 | ||
| 003 | DE-604 | ||
| 005 | 20090910 | ||
| 007 | t | ||
| 008 | 961217s1996 d||| m||| 00||| ger d | ||
| 015 | |a 96,N35,0535 |2 dnb | ||
| 016 | 7 | |a 94.827045.4 |2 DE-101 | |
| 020 | |a 3826517377 |9 3-8265-1737-7 | ||
| 035 | |a (OCoLC)916020095 | ||
| 035 | |a (DE-599)BVBBV024415781 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 100 | 1 | |a Gottwald, Stephan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen |c Stephan Gottwald |
| 250 | |a Als Ms. gedr. | ||
| 264 | 1 | |a Aachen |b Shaker |c 1996 | |
| 300 | |a VIII, 141 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Berichte aus der Informatik | |
| 502 | |a Zugl.: Berlin, Freie Univ., Diss., 1996 | ||
| 650 | 0 | 7 | |a Massive Parallelität |0 (DE-588)4324752-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Massive Parallelität |0 (DE-588)4324752-0 |D s |
| 689 | 0 | 1 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | 2 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |D s |
| 689 | 0 | |5 DE-188 | |
| 700 | 1 | 2 | |a Gottwald, Stephan |4 aut |t Das Divide-and-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018393607 | ||
Record in the Search Index
| _version_ | 1804140385731084288 |
|---|---|
| any_adam_object | |
| author | Gottwald, Stephan Gottwald, Stephan |
| author_facet | Gottwald, Stephan Gottwald, Stephan |
| author_role | aut aut |
| author_sort | Gottwald, Stephan |
| author_variant | s g sg s g sg |
| building | Verbundindex |
| bvnumber | BV024415781 |
| classification_rvk | SK 910 |
| ctrlnum | (OCoLC)916020095 (DE-599)BVBBV024415781 |
| discipline | Mathematik |
| edition | Als Ms. gedr. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01622nam a2200433 c 4500</leader><controlfield tag="001">BV024415781</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961217s1996 d||| m||| 00||| ger d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">96,N35,0535</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94.827045.4</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3826517377</subfield><subfield code="9">3-8265-1737-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916020095</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024415781</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gottwald, Stephan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen</subfield><subfield code="c">Stephan Gottwald</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Als Ms. gedr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">Shaker</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 141 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">Berichte aus der Informatik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Berlin, Freie Univ., Diss., 1996</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Massive Parallelität</subfield><subfield code="0">(DE-588)4324752-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Massive Parallelität</subfield><subfield code="0">(DE-588)4324752-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-188</subfield></datafield><datafield tag="700" ind1="1" ind2="2"><subfield code="a">Gottwald, Stephan</subfield><subfield code="4">aut</subfield><subfield code="t">Das Divide-and-Conquer-Prinzip für massiv-parallele numerische Algorithmen</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018393607</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV024415781 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:59:09Z |
| institution | BVB |
| isbn | 3826517377 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018393607 |
| oclc_num | 916020095 |
| open_access_boolean | |
| owner | DE-83 DE-11 DE-188 |
| owner_facet | DE-83 DE-11 DE-188 |
| physical | VIII, 141 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Shaker |
| record_format | marc |
| series2 | Berichte aus der Informatik |
| spelling | Gottwald, Stephan Verfasser aut Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen Stephan Gottwald Als Ms. gedr. Aachen Shaker 1996 VIII, 141 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berichte aus der Informatik Zugl.: Berlin, Freie Univ., Diss., 1996 Massive Parallelität (DE-588)4324752-0 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Massive Parallelität (DE-588)4324752-0 s Paralleler Algorithmus (DE-588)4193615-2 s Divide-and-conquer-Verfahren (DE-588)4291466-8 s DE-188 Gottwald, Stephan aut Das Divide-and-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| spellingShingle | Gottwald, Stephan Gottwald, Stephan Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen Massive Parallelität (DE-588)4324752-0 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd |
| subject_GND | (DE-588)4324752-0 (DE-588)4193615-2 (DE-588)4291466-8 (DE-588)4113937-9 |
| title | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| title_alt | Das Divide-and-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| title_auth | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| title_exact_search | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| title_full | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen Stephan Gottwald |
| title_fullStr | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen Stephan Gottwald |
| title_full_unstemmed | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen Stephan Gottwald |
| title_short | Das Divide-&-Conquer-Prinzip für massiv-parallele numerische Algorithmen |
| title_sort | das divide conquer prinzip fur massiv parallele numerische algorithmen |
| topic | Massive Parallelität (DE-588)4324752-0 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd |
| topic_facet | Massive Parallelität Paralleler Algorithmus Divide-and-conquer-Verfahren Hochschulschrift |
| work_keys_str_mv | AT gottwaldstephan dasdivideconquerprinzipfurmassivparallelenumerischealgorithmen |