Digital Search Trees with m trees: Level polynomials and insertion costs

Date
2011
Authors
Prodinger H.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Please help us populate SUNScholar with the post print version of this article. It can be e-mailed to: scholar@sun.ac.za
Keywords
Approximate counting, Asymptotics, Cancellations, Digital search tree, Expectation and variance, Q analysis, Rice, s method, Polynomials, Plant extracts
Citation
Discrete Mathematics and Theoretical Computer Science
13
3
http://www.scopus.com/inward/record.url?eid=2-s2.0-80053471801&partnerID=40&md5=b0ef8723afc22c65ea2951c04de97941
URI
http://hdl.handle.net/10019.1/18867
Collections
Stellenbosch University - Scopus Publications