An O(log n) insertion algorithm for one-sided height-balanced binary search trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Helsinki, Finland
1977
|
| Schriftenreihe: | Tietojenkäsittelyopin Laitos <Helsinki>: Report A
1977,9 |
| Beschreibung: | 13 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009797338 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940908s1977 |||| 00||| engod | ||
| 035 | |a (OCoLC)57803157 | ||
| 035 | |a (DE-599)BVBBV009797338 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 080 | |a 681.3 | ||
| 100 | 1 | |a Räihä, Kari-Jouko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| 264 | 1 | |a Helsinki, Finland |c 1977 | |
| 300 | |a 13 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Tietojenkäsittelyopin Laitos <Helsinki>: Report A |v 1977,9 | |
| 830 | 0 | |a Tietojenkäsittelyopin Laitos <Helsinki>: Report A |v 1977,9 |w (DE-604)BV000904448 |9 1977,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006481823 | ||
Datensatz im Suchindex
| _version_ | 1804124145816961024 |
|---|---|
| any_adam_object | |
| author | Räihä, Kari-Jouko |
| author_facet | Räihä, Kari-Jouko |
| author_role | aut |
| author_sort | Räihä, Kari-Jouko |
| author_variant | k j r kjr |
| building | Verbundindex |
| bvnumber | BV009797338 |
| ctrlnum | (OCoLC)57803157 (DE-599)BVBBV009797338 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00877nam a2200277 cb4500</leader><controlfield tag="001">BV009797338</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940908s1977 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)57803157</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009797338</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-91G</subfield></datafield><datafield tag="080" ind1=" " ind2=" "><subfield code="a">681.3</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Räihä, Kari-Jouko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An O(log n) insertion algorithm for one-sided height-balanced binary search trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Helsinki, Finland</subfield><subfield code="c">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 Bl.</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">Tietojenkäsittelyopin Laitos <Helsinki>: Report A</subfield><subfield code="v">1977,9</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Tietojenkäsittelyopin Laitos <Helsinki>: Report A</subfield><subfield code="v">1977,9</subfield><subfield code="w">(DE-604)BV000904448</subfield><subfield code="9">1977,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006481823</subfield></datafield></record></collection> |
| id | DE-604.BV009797338 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:41:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006481823 |
| oclc_num | 57803157 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 Bl. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| record_format | marc |
| series | Tietojenkäsittelyopin Laitos <Helsinki>: Report A |
| series2 | Tietojenkäsittelyopin Laitos <Helsinki>: Report A |
| spelling | Räihä, Kari-Jouko Verfasser aut An O(log n) insertion algorithm for one-sided height-balanced binary search trees Helsinki, Finland 1977 13 Bl. txt rdacontent n rdamedia nc rdacarrier Tietojenkäsittelyopin Laitos <Helsinki>: Report A 1977,9 Tietojenkäsittelyopin Laitos <Helsinki>: Report A 1977,9 (DE-604)BV000904448 1977,9 |
| spellingShingle | Räihä, Kari-Jouko An O(log n) insertion algorithm for one-sided height-balanced binary search trees Tietojenkäsittelyopin Laitos <Helsinki>: Report A |
| title | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_auth | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_exact_search | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_full | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_fullStr | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_full_unstemmed | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_short | An O(log n) insertion algorithm for one-sided height-balanced binary search trees |
| title_sort | an o log n insertion algorithm for one sided height balanced binary search trees |
| volume_link | (DE-604)BV000904448 |
| work_keys_str_mv | AT raihakarijouko anologninsertionalgorithmforonesidedheightbalancedbinarysearchtrees |