(Un)expected path lengths of asymmetric binary search trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Frankfurt, Main
1992
|
| Schriftenreihe: | Universität <Frankfurt, Main> / Fachbereich Informatik: Interner Bericht
92,3 |
| Beschreibung: | 15, 3 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015500 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)46226069 | ||
| 035 | |a (DE-599)BVBBV009015500 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Trier, Uwe |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a (Un)expected path lengths of asymmetric binary search trees |c Uwe Trier |
| 264 | 1 | |a Frankfurt, Main |c 1992 | |
| 300 | |a 15, 3 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Frankfurt, Main> / Fachbereich Informatik: Interner Bericht |v 92,3 | |
| 810 | 2 | |a Fachbereich Informatik: Interner Bericht |t Universität <Frankfurt, Main> |v 92,3 |w (DE-604)BV000600974 |9 92,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961082 | ||
Datensatz im Suchindex
| _version_ | 1804123364784078848 |
|---|---|
| any_adam_object | |
| author | Trier, Uwe |
| author_facet | Trier, Uwe |
| author_role | aut |
| author_sort | Trier, Uwe |
| author_variant | u t ut |
| building | Verbundindex |
| bvnumber | BV009015500 |
| ctrlnum | (OCoLC)46226069 (DE-599)BVBBV009015500 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00870nam a2200265 cb4500</leader><controlfield tag="001">BV009015500</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46226069</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015500</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Trier, Uwe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">(Un)expected path lengths of asymmetric binary search trees</subfield><subfield code="c">Uwe Trier</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Frankfurt, Main</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15, 3 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">Universität <Frankfurt, Main> / Fachbereich Informatik: Interner Bericht</subfield><subfield code="v">92,3</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik: Interner Bericht</subfield><subfield code="t">Universität <Frankfurt, Main></subfield><subfield code="v">92,3</subfield><subfield code="w">(DE-604)BV000600974</subfield><subfield code="9">92,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961082</subfield></datafield></record></collection> |
| id | DE-604.BV009015500 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961082 |
| oclc_num | 46226069 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 15, 3 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Universität <Frankfurt, Main> / Fachbereich Informatik: Interner Bericht |
| spelling | Trier, Uwe Verfasser aut (Un)expected path lengths of asymmetric binary search trees Uwe Trier Frankfurt, Main 1992 15, 3 S. txt rdacontent n rdamedia nc rdacarrier Universität <Frankfurt, Main> / Fachbereich Informatik: Interner Bericht 92,3 Fachbereich Informatik: Interner Bericht Universität <Frankfurt, Main> 92,3 (DE-604)BV000600974 92,3 |
| spellingShingle | Trier, Uwe (Un)expected path lengths of asymmetric binary search trees |
| title | (Un)expected path lengths of asymmetric binary search trees |
| title_auth | (Un)expected path lengths of asymmetric binary search trees |
| title_exact_search | (Un)expected path lengths of asymmetric binary search trees |
| title_full | (Un)expected path lengths of asymmetric binary search trees Uwe Trier |
| title_fullStr | (Un)expected path lengths of asymmetric binary search trees Uwe Trier |
| title_full_unstemmed | (Un)expected path lengths of asymmetric binary search trees Uwe Trier |
| title_short | (Un)expected path lengths of asymmetric binary search trees |
| title_sort | un expected path lengths of asymmetric binary search trees |
| volume_link | (DE-604)BV000600974 |
| work_keys_str_mv | AT trieruwe unexpectedpathlengthsofasymmetricbinarysearchtrees |