Efficient algorithms with threaded balanced trees:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Mikrofilm Buch |
Sprache: | English |
Veröffentlicht: |
1980
|
Ausgabe: | [Mikrofiche-Ausg.] |
Schlagworte: | |
Beschreibung: | Includes bibliographical references (leaves 132-134) |
Beschreibung: | IX, 134 leaves graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV039686686 | ||
003 | DE-604 | ||
005 | 20111108 | ||
007 | he|uuuuuuuucu | ||
008 | 111107s1980 d||| bm||| 00||| eng d | ||
035 | |a (OCoLC)7533674 | ||
035 | |a (DE-599)BVBBV039686686 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
100 | 1 | |a Harel, Dov |e Verfasser |4 aut | |
245 | 1 | 0 | |a Efficient algorithms with threaded balanced trees |c by Dov Harel |
250 | |a [Mikrofiche-Ausg.] | ||
264 | 1 | |c 1980 | |
300 | |a IX, 134 leaves |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b h |2 rdamedia | ||
338 | |b he |2 rdacarrier | ||
500 | |a Includes bibliographical references (leaves 132-134) | ||
502 | |a Irvine, Calif., Univ., Diss., 1980 | ||
533 | |a Mikroform-Ausgabe |b Ann Arbor, Mich. |c Univ. Microfilms Internat. |d 1981 |e 2 Mikrofiches |n Mikrofiche-Ausg.: |7 s1981 | ||
650 | 4 | |a Algorithms | |
650 | 4 | |a Data structures (Computer science) | |
650 | 4 | |a Trees (Graph theory) | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
776 | 0 | 8 | |i Reproduktion von |a Harel, Dov |t Efficient algorithms with threaded balanced trees |d 1980 |
999 | |a oai:aleph.bib-bvb.de:BVB01-024535574 |
Datensatz im Suchindex
_version_ | 1804148553646342145 |
---|---|
any_adam_object | |
author | Harel, Dov |
author_facet | Harel, Dov |
author_role | aut |
author_sort | Harel, Dov |
author_variant | d h dh |
building | Verbundindex |
bvnumber | BV039686686 |
ctrlnum | (OCoLC)7533674 (DE-599)BVBBV039686686 |
edition | [Mikrofiche-Ausg.] |
format | Thesis Microfilm Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01223nam a2200349 c 4500</leader><controlfield tag="001">BV039686686</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111108 </controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">111107s1980 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)7533674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039686686</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harel, Dov</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms with threaded balanced trees</subfield><subfield code="c">by Dov Harel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 134 leaves</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">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">Includes bibliographical references (leaves 132-134)</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Irvine, Calif., Univ., Diss., 1980</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikroform-Ausgabe</subfield><subfield code="b">Ann Arbor, Mich.</subfield><subfield code="c">Univ. Microfilms Internat.</subfield><subfield code="d">1981</subfield><subfield code="e">2 Mikrofiches</subfield><subfield code="n">Mikrofiche-Ausg.:</subfield><subfield code="7">s1981</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</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="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Harel, Dov</subfield><subfield code="t">Efficient algorithms with threaded balanced trees</subfield><subfield code="d">1980</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024535574</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV039686686 |
illustrated | Illustrated |
indexdate | 2024-07-10T00:08:58Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024535574 |
oclc_num | 7533674 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | IX, 134 leaves graph. Darst. |
publishDate | 1980 |
publishDateSearch | 1980 |
publishDateSort | 1980 |
record_format | marc |
spelling | Harel, Dov Verfasser aut Efficient algorithms with threaded balanced trees by Dov Harel [Mikrofiche-Ausg.] 1980 IX, 134 leaves graph. Darst. txt rdacontent h rdamedia he rdacarrier Includes bibliographical references (leaves 132-134) Irvine, Calif., Univ., Diss., 1980 Mikroform-Ausgabe Ann Arbor, Mich. Univ. Microfilms Internat. 1981 2 Mikrofiches Mikrofiche-Ausg.: s1981 Algorithms Data structures (Computer science) Trees (Graph theory) (DE-588)4113937-9 Hochschulschrift gnd-content Reproduktion von Harel, Dov Efficient algorithms with threaded balanced trees 1980 |
spellingShingle | Harel, Dov Efficient algorithms with threaded balanced trees Algorithms Data structures (Computer science) Trees (Graph theory) |
subject_GND | (DE-588)4113937-9 |
title | Efficient algorithms with threaded balanced trees |
title_auth | Efficient algorithms with threaded balanced trees |
title_exact_search | Efficient algorithms with threaded balanced trees |
title_full | Efficient algorithms with threaded balanced trees by Dov Harel |
title_fullStr | Efficient algorithms with threaded balanced trees by Dov Harel |
title_full_unstemmed | Efficient algorithms with threaded balanced trees by Dov Harel |
title_short | Efficient algorithms with threaded balanced trees |
title_sort | efficient algorithms with threaded balanced trees |
topic | Algorithms Data structures (Computer science) Trees (Graph theory) |
topic_facet | Algorithms Data structures (Computer science) Trees (Graph theory) Hochschulschrift |
work_keys_str_mv | AT hareldov efficientalgorithmswiththreadedbalancedtrees |