Introduction to parallel algorithms and architectures: arrays, trees, hypercubes
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
San Mateo, Calif.
Kaufmann
1992
|
Schlagworte: | |
Online-Zugang: | UPA01 URL des Erstveröffentlichers |
Beschreibung: | Literaturverzeichnis: Seiten 785-801 |
Beschreibung: | 1 Online-Ressource (XVII, 831 Seiten) |
ISBN: | 9781483207728 |
DOI: | 10.1016/C2013-0-08299-0 |
Internformat
MARC
LEADER | 00000nmm a2200000 c 4500 | ||
---|---|---|---|
001 | BV047287454 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 210518s1992 |||| o||u| ||||||eng d | ||
020 | |a 9781483207728 |9 978-1-4832-0772-8 | ||
024 | 7 | |a 10.1016/C2013-0-08299-0 |2 doi | |
035 | |a (OCoLC)1252702578 | ||
035 | |a (DE-599)BVBBV047287454 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-739 | ||
050 | 0 | |a QA76.58 | |
082 | 0 | |a 004/.35 |2 20 | |
084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a DAT 530f |2 stub | ||
084 | |a DAT 516f |2 stub | ||
084 | |a DAT 216f |2 stub | ||
100 | 1 | |a Leighton, Frank Thomson |e Verfasser |0 (DE-588)1158155654 |4 aut | |
245 | 1 | 0 | |a Introduction to parallel algorithms and architectures |b arrays, trees, hypercubes |c F. Thomson Leighton |
264 | 1 | |a San Mateo, Calif. |b Kaufmann |c 1992 | |
300 | |a 1 Online-Ressource (XVII, 831 Seiten) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Literaturverzeichnis: Seiten 785-801 | ||
650 | 7 | |a Computerarchitectuur |2 gtt | |
650 | 7 | |a Parallelprogrammering |2 gtt | |
650 | 4 | |a Parallélisme (Informatique) | |
650 | 4 | |a Programmation parallèle (Informatique) | |
650 | 4 | |a Parallel algorithms | |
650 | 4 | |a Parallel processing (Electronic computers) | |
650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
689 | 0 | 1 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
689 | 1 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 1-55860-117-1 |
856 | 4 | 0 | |u https://doi.org/10.1016/C2013-0-08299-0 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-33-ESD | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-032690883 | ||
966 | e | |u https://doi.org/10.1016/C2013-0-08299-0 |l UPA01 |p ZDB-33-ESD |q UPA_Einzelkauf_Kaufmann |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182458233520128 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Leighton, Frank Thomson |
author_GND | (DE-588)1158155654 |
author_facet | Leighton, Frank Thomson |
author_role | aut |
author_sort | Leighton, Frank Thomson |
author_variant | f t l ft ftl |
building | Verbundindex |
bvnumber | BV047287454 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.58 |
callnumber-search | QA76.58 |
callnumber-sort | QA 276.58 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 151 ST 130 ST 134 |
classification_tum | DAT 530f DAT 516f DAT 216f |
collection | ZDB-33-ESD |
ctrlnum | (OCoLC)1252702578 (DE-599)BVBBV047287454 |
dewey-full | 004/.35 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004/.35 |
dewey-search | 004/.35 |
dewey-sort | 14 235 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
discipline_str_mv | Informatik |
doi_str_mv | 10.1016/C2013-0-08299-0 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02161nmm a2200577 c 4500</leader><controlfield tag="001">BV047287454</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210518s1992 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781483207728</subfield><subfield code="9">978-1-4832-0772-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/C2013-0-08299-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1252702578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047287454</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</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 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="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 216f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leighton, Frank Thomson</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1158155654</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to parallel algorithms and architectures</subfield><subfield code="b">arrays, trees, hypercubes</subfield><subfield code="c">F. Thomson Leighton</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Mateo, Calif.</subfield><subfield code="b">Kaufmann</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 831 Seiten)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis: Seiten 785-801</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerarchitectuur</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallelprogrammering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation parallèle (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">1-55860-117-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/C2013-0-08299-0</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032690883</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1016/C2013-0-08299-0</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">UPA_Einzelkauf_Kaufmann</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV047287454 |
illustrated | Not Illustrated |
index_date | 2024-07-03T17:19:13Z |
indexdate | 2024-07-10T09:07:52Z |
institution | BVB |
isbn | 9781483207728 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032690883 |
oclc_num | 1252702578 |
open_access_boolean | |
owner | DE-739 |
owner_facet | DE-739 |
physical | 1 Online-Ressource (XVII, 831 Seiten) |
psigel | ZDB-33-ESD ZDB-33-ESD UPA_Einzelkauf_Kaufmann |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
publisher | Kaufmann |
record_format | marc |
spelling | Leighton, Frank Thomson Verfasser (DE-588)1158155654 aut Introduction to parallel algorithms and architectures arrays, trees, hypercubes F. Thomson Leighton San Mateo, Calif. Kaufmann 1992 1 Online-Ressource (XVII, 831 Seiten) txt rdacontent c rdamedia cr rdacarrier Literaturverzeichnis: Seiten 785-801 Computerarchitectuur gtt Parallelprogrammering gtt Parallélisme (Informatique) Programmation parallèle (Informatique) Parallel algorithms Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s Parallelverarbeitung (DE-588)4075860-6 s DE-604 Erscheint auch als Druck-Ausgabe 1-55860-117-1 https://doi.org/10.1016/C2013-0-08299-0 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | Leighton, Frank Thomson Introduction to parallel algorithms and architectures arrays, trees, hypercubes Computerarchitectuur gtt Parallelprogrammering gtt Parallélisme (Informatique) Programmation parallèle (Informatique) Parallel algorithms Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
subject_GND | (DE-588)4193615-2 (DE-588)4075860-6 |
title | Introduction to parallel algorithms and architectures arrays, trees, hypercubes |
title_auth | Introduction to parallel algorithms and architectures arrays, trees, hypercubes |
title_exact_search | Introduction to parallel algorithms and architectures arrays, trees, hypercubes |
title_exact_search_txtP | Introduction to parallel algorithms and architectures arrays, trees, hypercubes |
title_full | Introduction to parallel algorithms and architectures arrays, trees, hypercubes F. Thomson Leighton |
title_fullStr | Introduction to parallel algorithms and architectures arrays, trees, hypercubes F. Thomson Leighton |
title_full_unstemmed | Introduction to parallel algorithms and architectures arrays, trees, hypercubes F. Thomson Leighton |
title_short | Introduction to parallel algorithms and architectures |
title_sort | introduction to parallel algorithms and architectures arrays trees hypercubes |
title_sub | arrays, trees, hypercubes |
topic | Computerarchitectuur gtt Parallelprogrammering gtt Parallélisme (Informatique) Programmation parallèle (Informatique) Parallel algorithms Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
topic_facet | Computerarchitectuur Parallelprogrammering Parallélisme (Informatique) Programmation parallèle (Informatique) Parallel algorithms Parallel processing (Electronic computers) Paralleler Algorithmus Parallelverarbeitung |
url | https://doi.org/10.1016/C2013-0-08299-0 |
work_keys_str_mv | AT leightonfrankthomson introductiontoparallelalgorithmsandarchitecturesarraystreeshypercubes |