Uniform distribution modulo one and binary search trees
نویسندگان
چکیده
منابع مشابه
On uniform distribution modulo one
We introduce an elementary argument to the theory of distribution of sequences modulo one.
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملBinary Trees and Uniform Distribution of Traffic Cutback
The present subject originates from the development of the automatic volume control on the Common-Channel Interofftce Signaling (CCIS) messages for Calling Card Service [ 11. These messages are communicated between the Traflic Service Position System No. 1 (TSPS No. 1) and the Billing Validation Application (BVA), which are nodes on the CCIS network [2]. The TSPS No. 1 send queries to BVA data ...
متن کاملCombining Binary Search Trees
We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “well-behaved” bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2002
ISSN: 1246-7405
DOI: 10.5802/jtnb.366