Optimal multiprocessor interconnection networks for divide-and-conquer algorithms:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Karlsruhe
Univ., Fak. für Informatik
1989
Karlsruhe Inst. für Logik, Komplexität u. Deduktionssysteme |
| Schriftenreihe: | Interner Bericht / Universität Karlsruhe, Fakultät für Informatik
1989,12 |
| Schlagwörter: | |
| Umfang: | 19 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002473340 | ||
| 003 | DE-604 | ||
| 005 | 20111107 | ||
| 007 | t| | ||
| 008 | 891211s1989 gw d||| |||| 00||| und d | ||
| 035 | |a (OCoLC)214121957 | ||
| 035 | |a (DE-599)BVBBV002473340 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Braun, Heinrich |e Verfasser |0 (DE-588)139316019 |4 aut | |
| 245 | 1 | 0 | |a Optimal multiprocessor interconnection networks for divide-and-conquer algorithms |c Heinrich Braun ; Frank Christian Stephan |
| 264 | 1 | |a Karlsruhe |b Univ., Fak. für Informatik |c 1989 | |
| 264 | 1 | |a Karlsruhe |b Inst. für Logik, Komplexität u. Deduktionssysteme | |
| 300 | |a 19 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Interner Bericht / Universität Karlsruhe, Fakultät für Informatik |v 1989,12 | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Stephan, Frank Christian |e Verfasser |4 aut | |
| 810 | 2 | |a Universität Karlsruhe, Fakultät für Informatik |t Interner Bericht |v 1989,12 |w (DE-604)BV000003275 |9 1989,12 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001596587 | |
Datensatz im Suchindex
| _version_ | 1818944929713356800 |
|---|---|
| any_adam_object | |
| author | Braun, Heinrich Stephan, Frank Christian |
| author_GND | (DE-588)139316019 |
| author_facet | Braun, Heinrich Stephan, Frank Christian |
| author_role | aut aut |
| author_sort | Braun, Heinrich |
| author_variant | h b hb f c s fc fcs |
| building | Verbundindex |
| bvnumber | BV002473340 |
| ctrlnum | (OCoLC)214121957 (DE-599)BVBBV002473340 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01517nam a2200385 cb4500</leader><controlfield tag="001">BV002473340</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111107 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">891211s1989 gw d||| |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)214121957</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002473340</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Braun, Heinrich</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139316019</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal multiprocessor interconnection networks for divide-and-conquer algorithms</subfield><subfield code="c">Heinrich Braun ; Frank Christian Stephan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Karlsruhe</subfield><subfield code="b">Univ., Fak. für Informatik</subfield><subfield code="c">1989</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Karlsruhe</subfield><subfield code="b">Inst. für Logik, Komplexität u. Deduktionssysteme</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 Bl.</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="1" ind2=" "><subfield code="a">Interner Bericht / Universität Karlsruhe, Fakultät für Informatik</subfield><subfield code="v">1989,12</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-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="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="700" ind1="1" ind2=" "><subfield code="a">Stephan, Frank Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität Karlsruhe, Fakultät für Informatik</subfield><subfield code="t">Interner Bericht</subfield><subfield code="v">1989,12</subfield><subfield code="w">(DE-604)BV000003275</subfield><subfield code="9">1989,12</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001596587</subfield></datafield></record></collection> |
| id | DE-604.BV002473340 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T07:51:02Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001596587 |
| oclc_num | 214121957 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 19 Bl. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Univ., Fak. für Informatik Inst. für Logik, Komplexität u. Deduktionssysteme |
| record_format | marc |
| series2 | Interner Bericht / Universität Karlsruhe, Fakultät für Informatik |
| spelling | Braun, Heinrich Verfasser (DE-588)139316019 aut Optimal multiprocessor interconnection networks for divide-and-conquer algorithms Heinrich Braun ; Frank Christian Stephan Karlsruhe Univ., Fak. für Informatik 1989 Karlsruhe Inst. für Logik, Komplexität u. Deduktionssysteme 19 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Interner Bericht / Universität Karlsruhe, Fakultät für Informatik 1989,12 Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 s Optimierung (DE-588)4043664-0 s Algorithmus (DE-588)4001183-5 s DE-604 Stephan, Frank Christian Verfasser aut Universität Karlsruhe, Fakultät für Informatik Interner Bericht 1989,12 (DE-604)BV000003275 1989,12 |
| spellingShingle | Braun, Heinrich Stephan, Frank Christian Optimal multiprocessor interconnection networks for divide-and-conquer algorithms Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4001183-5 (DE-588)4038397-0 |
| title | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms |
| title_auth | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms |
| title_exact_search | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms |
| title_full | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms Heinrich Braun ; Frank Christian Stephan |
| title_fullStr | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms Heinrich Braun ; Frank Christian Stephan |
| title_full_unstemmed | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms Heinrich Braun ; Frank Christian Stephan |
| title_short | Optimal multiprocessor interconnection networks for divide-and-conquer algorithms |
| title_sort | optimal multiprocessor interconnection networks for divide and conquer algorithms |
| topic | Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd |
| topic_facet | Optimierung Algorithmus Mehrprozessorsystem |
| volume_link | (DE-604)BV000003275 |
| work_keys_str_mv | AT braunheinrich optimalmultiprocessorinterconnectionnetworksfordivideandconqueralgorithms AT stephanfrankchristian optimalmultiprocessorinterconnectionnetworksfordivideandconqueralgorithms |