Improved bounds on the costs of optimal and balanced binary search trees:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Massachusetts
1975
|
Schriftenreihe: | Massachusetts Institute of Technology <Cambridge, Mass.> / Project MAC: MAC technical memorandum
69 |
Schlagworte: | |
Beschreibung: | Zugl.: Cambridge, Mass., MIT, Diss. |
Beschreibung: | 41 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009804755 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940915s1975 m||| 00||| engod | ||
035 | |a (OCoLC)2191962 | ||
035 | |a (DE-599)BVBBV009804755 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
050 | 0 | |a QA76.M41 | |
100 | 1 | |a Bayer, Paul J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Improved bounds on the costs of optimal and balanced binary search trees |
264 | 1 | |a Cambridge, Massachusetts |c 1975 | |
300 | |a 41 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Massachusetts Institute of Technology <Cambridge, Mass.> / Project MAC: MAC technical memorandum |v 69 | |
500 | |a Zugl.: Cambridge, Mass., MIT, Diss. | ||
650 | 4 | |a Computer programming | |
650 | 4 | |a Information theory | |
650 | 4 | |a Probabilities | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
810 | 2 | |a Project MAC: MAC technical memorandum |t Massachusetts Institute of Technology <Cambridge, Mass.> |v 69 |w (DE-604)BV008910218 |9 69 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006488237 |
Datensatz im Suchindex
_version_ | 1804124155563474944 |
---|---|
any_adam_object | |
author | Bayer, Paul J. |
author_facet | Bayer, Paul J. |
author_role | aut |
author_sort | Bayer, Paul J. |
author_variant | p j b pj pjb |
building | Verbundindex |
bvnumber | BV009804755 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.M41 |
callnumber-search | QA76.M41 |
callnumber-sort | QA 276 M41 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)2191962 (DE-599)BVBBV009804755 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01165nam a2200337 cb4500</leader><controlfield tag="001">BV009804755</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940915s1975 m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)2191962</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009804755</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bayer, Paul J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Improved bounds on the costs of optimal and balanced binary search trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="c">1975</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">41 S.</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">Massachusetts Institute of Technology <Cambridge, Mass.> / Project MAC: MAC technical memorandum</subfield><subfield code="v">69</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Mass., MIT, Diss.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilities</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="810" ind1="2" ind2=" "><subfield code="a">Project MAC: MAC technical memorandum</subfield><subfield code="t">Massachusetts Institute of Technology <Cambridge, Mass.></subfield><subfield code="v">69</subfield><subfield code="w">(DE-604)BV008910218</subfield><subfield code="9">69</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006488237</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV009804755 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:41:10Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006488237 |
oclc_num | 2191962 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 41 S. |
publishDate | 1975 |
publishDateSearch | 1975 |
publishDateSort | 1975 |
record_format | marc |
series2 | Massachusetts Institute of Technology <Cambridge, Mass.> / Project MAC: MAC technical memorandum |
spelling | Bayer, Paul J. Verfasser aut Improved bounds on the costs of optimal and balanced binary search trees Cambridge, Massachusetts 1975 41 S. txt rdacontent n rdamedia nc rdacarrier Massachusetts Institute of Technology <Cambridge, Mass.> / Project MAC: MAC technical memorandum 69 Zugl.: Cambridge, Mass., MIT, Diss. Computer programming Information theory Probabilities (DE-588)4113937-9 Hochschulschrift gnd-content Project MAC: MAC technical memorandum Massachusetts Institute of Technology <Cambridge, Mass.> 69 (DE-604)BV008910218 69 |
spellingShingle | Bayer, Paul J. Improved bounds on the costs of optimal and balanced binary search trees Computer programming Information theory Probabilities |
subject_GND | (DE-588)4113937-9 |
title | Improved bounds on the costs of optimal and balanced binary search trees |
title_auth | Improved bounds on the costs of optimal and balanced binary search trees |
title_exact_search | Improved bounds on the costs of optimal and balanced binary search trees |
title_full | Improved bounds on the costs of optimal and balanced binary search trees |
title_fullStr | Improved bounds on the costs of optimal and balanced binary search trees |
title_full_unstemmed | Improved bounds on the costs of optimal and balanced binary search trees |
title_short | Improved bounds on the costs of optimal and balanced binary search trees |
title_sort | improved bounds on the costs of optimal and balanced binary search trees |
topic | Computer programming Information theory Probabilities |
topic_facet | Computer programming Information theory Probabilities Hochschulschrift |
volume_link | (DE-604)BV008910218 |
work_keys_str_mv | AT bayerpaulj improvedboundsonthecostsofoptimalandbalancedbinarysearchtrees |