The complexity of parallel algorithms:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Stanford, CA
Dep. of Computer Science, Stanford Univ.
1985
|
Schlagworte: | |
Beschreibung: | Literaturverz. S. 67 - 69 |
Beschreibung: | III, 69 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021985450 | ||
003 | DE-604 | ||
005 | 20050412000000.0 | ||
007 | t | ||
008 | 050321s1985 d||| |||| 00||| eng d | ||
035 | |a (OCoLC)475931748 | ||
035 | |a (DE-599)BVBBV021985450 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a STAN CS 86 1092 | ||
100 | 1 | |a Anderson, Richard |e Verfasser |4 aut | |
245 | 1 | 0 | |a The complexity of parallel algorithms |c by Richard Anderson |
264 | 1 | |a Stanford, CA |b Dep. of Computer Science, Stanford Univ. |c 1985 | |
300 | |a III, 69 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Literaturverz. S. 67 - 69 | ||
650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
689 | 0 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015200406 |
Datensatz im Suchindex
_version_ | 1804135959701225472 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Anderson, Richard |
author_facet | Anderson, Richard |
author_role | aut |
author_sort | Anderson, Richard |
author_variant | r a ra |
building | Verbundindex |
bvnumber | BV021985450 |
ctrlnum | (OCoLC)475931748 (DE-599)BVBBV021985450 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00931nam a2200301zc 4500</leader><controlfield tag="001">BV021985450</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050412000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050321s1985 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)475931748</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021985450</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">STAN CS 86 1092</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Anderson, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of parallel algorithms</subfield><subfield code="c">by Richard Anderson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, CA</subfield><subfield code="b">Dep. of Computer Science, Stanford Univ.</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 69 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 67 - 69</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015200406</subfield></datafield></record></collection> |
id | DE-604.BV021985450 |
illustrated | Illustrated |
index_date | 2024-07-02T16:10:13Z |
indexdate | 2024-07-09T20:48:48Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015200406 |
oclc_num | 475931748 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | III, 69 S. graph. Darst. |
publishDate | 1985 |
publishDateSearch | 1985 |
publishDateSort | 1985 |
publisher | Dep. of Computer Science, Stanford Univ. |
record_format | marc |
spelling | Anderson, Richard Verfasser aut The complexity of parallel algorithms by Richard Anderson Stanford, CA Dep. of Computer Science, Stanford Univ. 1985 III, 69 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 67 - 69 Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s DE-604 |
spellingShingle | Anderson, Richard The complexity of parallel algorithms Paralleler Algorithmus (DE-588)4193615-2 gnd |
subject_GND | (DE-588)4193615-2 |
title | The complexity of parallel algorithms |
title_auth | The complexity of parallel algorithms |
title_exact_search | The complexity of parallel algorithms |
title_exact_search_txtP | The complexity of parallel algorithms |
title_full | The complexity of parallel algorithms by Richard Anderson |
title_fullStr | The complexity of parallel algorithms by Richard Anderson |
title_full_unstemmed | The complexity of parallel algorithms by Richard Anderson |
title_short | The complexity of parallel algorithms |
title_sort | the complexity of parallel algorithms |
topic | Paralleler Algorithmus (DE-588)4193615-2 gnd |
topic_facet | Paralleler Algorithmus |
work_keys_str_mv | AT andersonrichard thecomplexityofparallelalgorithms |