Optimal searching algorithms for parallel -pipelined computers:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Microform Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
1976
|
| Ausgabe: | [Mikrofiche-Ausg.] |
| Schlagwörter: | |
| Beschreibung: | Stanford, Calif., Univ., Diss., 1976. -Mikrofiche-Ausg.: Ann Arbor, Mich. : Univ. Microfilms Internat. 2 Mikrofiches |
| Umfang: | X, 160 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021997787 | ||
| 003 | DE-604 | ||
| 005 | 20061121000000.0 | ||
| 007 | he|uuuuuuuucu | ||
| 008 | 060914s1976 xx d||| b|||| 00||| eng d | ||
| 035 | |a (OCoLC)634848252 | ||
| 035 | |a (DE-599)BVBBV021997787 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Weller, Daniel Lee |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal searching algorithms for parallel -pipelined computers |c Daniel Lee Weller |
| 250 | |a [Mikrofiche-Ausg.] | ||
| 264 | 1 | |c 1976 | |
| 300 | |a X, 160 S. |b graph. Darst. | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 500 | |a Stanford, Calif., Univ., Diss., 1976. -Mikrofiche-Ausg.: Ann Arbor, Mich. : Univ. Microfilms Internat. 2 Mikrofiches | ||
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015212437 | |
Datensatz im Suchindex
| _version_ | 1818963521653702656 |
|---|---|
| any_adam_object | |
| author | Weller, Daniel Lee |
| author_facet | Weller, Daniel Lee |
| author_role | aut |
| author_sort | Weller, Daniel Lee |
| author_variant | d l w dl dlw |
| building | Verbundindex |
| bvnumber | BV021997787 |
| ctrlnum | (OCoLC)634848252 (DE-599)BVBBV021997787 |
| edition | [Mikrofiche-Ausg.] |
| format | Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00967nam a2200277zc 4500</leader><controlfield tag="001">BV021997787</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20061121000000.0</controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">060914s1976 xx d||| b|||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634848252</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021997787</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="100" ind1="1" ind2=" "><subfield code="a">Weller, Daniel Lee</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal searching algorithms for parallel -pipelined computers</subfield><subfield code="c">Daniel Lee Weller</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 160 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Stanford, Calif., Univ., Diss., 1976. -Mikrofiche-Ausg.: Ann Arbor, Mich. : Univ. Microfilms Internat. 2 Mikrofiches</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015212437</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021997787 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T12:46:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015212437 |
| oclc_num | 634848252 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | X, 160 S. graph. Darst. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| record_format | marc |
| spelling | Weller, Daniel Lee Verfasser aut Optimal searching algorithms for parallel -pipelined computers Daniel Lee Weller [Mikrofiche-Ausg.] 1976 X, 160 S. graph. Darst. h rdamedia he rdacarrier Stanford, Calif., Univ., Diss., 1976. -Mikrofiche-Ausg.: Ann Arbor, Mich. : Univ. Microfilms Internat. 2 Mikrofiches 1\p (DE-588)4113937-9 Hochschulschrift gnd-content 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Weller, Daniel Lee Optimal searching algorithms for parallel -pipelined computers |
| subject_GND | (DE-588)4113937-9 |
| title | Optimal searching algorithms for parallel -pipelined computers |
| title_auth | Optimal searching algorithms for parallel -pipelined computers |
| title_exact_search | Optimal searching algorithms for parallel -pipelined computers |
| title_full | Optimal searching algorithms for parallel -pipelined computers Daniel Lee Weller |
| title_fullStr | Optimal searching algorithms for parallel -pipelined computers Daniel Lee Weller |
| title_full_unstemmed | Optimal searching algorithms for parallel -pipelined computers Daniel Lee Weller |
| title_short | Optimal searching algorithms for parallel -pipelined computers |
| title_sort | optimal searching algorithms for parallel pipelined computers |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT wellerdaniellee optimalsearchingalgorithmsforparallelpipelinedcomputers |