9 citations · 11 across the 3 of their papers we have counts for
3 papers
math.ST2020★ 1 cited
On absolute central moments of Poisson distribution
Pavel S. Ruzankin
A recurrence formula for absolute central moments of Poisson distribution is suggested.
cs.DS2019★ 1 cited
A fast algorithm for constructing balanced binary search trees
Pavel S. Ruzankin
We suggest a new non-recursive algorithm for constructing a binary search tree given an array of numbers. The algorithm has time and memory complexity if the given ar…
stat.CO2017★ 9 cited
A fast algorithm for maximal propensity score matching
Pavel S. Ruzankin
We present a new algorithm which detects the maximal possible number of matched disjoint pairs satisfying a given caliper when a bipartite matching is done with respect to a scalar…