>
Fa
|
Ar
|
En
journal of the iranian statistical society
سال:2004 - دوره:3 - شماره:2
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
- صفحه:139-148
Connecting Yule Process; Bisection and Binary Search Tree via Martingales
- صفحه:89-116
Measuring Post-Quickselect Disorder
- صفحه:219-249
On the Average Height of b-Balanced Ordered Trees
- صفحه:175-218
One-Sided Interval Trees
- صفحه:149-164
Periodic oscillations in the Analysis of Algorithms and Their Cancellations
- صفحه:251-270
Polya-Type Urn Models with Multiple Drawings
- صفحه:165-173
Probability Generating Functions for Sattolo's Algorithm
- صفحه:297-308
Profile and Height of Random Binary Search Trees
- صفحه:117-138
Quickselect Revisited
- صفحه:271-296
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
