ملخص
An extremely simple derivation of the formula for the expected number of nodes on level l in a random digital search tree, built from n random data was studied. Some concepts of basic hypergeometric series were used. The basic hypergeometric series has many significant applications in several areas of pure and applied mathematics including the theory of partitions, combinatorial identities, number theory and statistics.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 717-723 |
عدد الصفحات | 7 |
دورية | Applied Mathematics and Computation |
مستوى الصوت | 148 |
رقم الإصدار | 3 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - يناير 30 2004 |
ASJC Scopus subject areas
- ???subjectarea.asjc.2600.2605???
- ???subjectarea.asjc.2600.2604???