Background: Many online resources for the life sciences have been developed and introduced in peer-reviewed papers recently, ranging from databases and web applications to data-an...
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...