Digital search trees with m trees: Level polynomials and insertion costs
Analysis of Algorithms
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2011-08-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/557/pdf |
| _version_ | 1827323839917326336 |
|---|---|
| author | Helmut Prodinger |
| author_facet | Helmut Prodinger |
| author_sort | Helmut Prodinger |
| collection | DOAJ |
| description | Analysis of Algorithms |
| first_indexed | 2024-04-25T02:00:04Z |
| format | Article |
| id | doaj.art-e43add17b4294660988057c7c6ca9f31 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:00:04Z |
| publishDate | 2011-08-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-e43add17b4294660988057c7c6ca9f312024-03-07T15:19:54ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502011-08-01Vol. 13 no. 3Analysis of Algorithms10.46298/dmtcs.557557Digital search trees with m trees: Level polynomials and insertion costsHelmut Prodinger0Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]Analysis of Algorithmshttps://dmtcs.episciences.org/557/pdf[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Helmut Prodinger Digital search trees with m trees: Level polynomials and insertion costs Discrete Mathematics & Theoretical Computer Science [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Digital search trees with m trees: Level polynomials and insertion costs |
| title_full | Digital search trees with m trees: Level polynomials and insertion costs |
| title_fullStr | Digital search trees with m trees: Level polynomials and insertion costs |
| title_full_unstemmed | Digital search trees with m trees: Level polynomials and insertion costs |
| title_short | Digital search trees with m trees: Level polynomials and insertion costs |
| title_sort | digital search trees with m trees level polynomials and insertion costs |
| topic | [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/557/pdf |
| work_keys_str_mv | AT helmutprodinger digitalsearchtreeswithmtreeslevelpolynomialsandinsertioncosts |