We suggest a new non-recursive algorithm for constructing binary search tree given an array of numbers. The has $O(N)$ time and $O(1)$ memory complexity if the $N$ numbers is sorted. resulting minimal height can be transformed to complete (retaining height) with $O(\log N)$ memory. allows simple effective parallelization.

Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for rn-dependent random variables . Examples include : the number of leaves (La ), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left de...

in this paper, an algorithm is presented for the formation of optimal null basis vectors corresponding to sparse flexibility matrices. for controlling the independence of the vectors, a generator is selected in each corresponding self-equilibrating systems, and the sequence of generators is modeled as decision variables. since the equilibrium conditions and uniqueness of generators consists a u...

The Amaldi 10 Parallel Session C2 on gravitational wave (GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact...

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly a...

The masses of neutron stars in neutron star binaries are observed to fall in a narrow mass range around ∼1.33M_{⊙}. We explore the advantage of focusing on this region of the parameter space in gravitational-wave searches. We find that an all-sky (externally triggered) search with an optimally reduced template bank is expected to detect 14% (61%) more binary mergers than without the reduction. ...