39 citations · 51 across the 25 of their papers we have counts for
5 papers · 1 filter
Asymptotic expansions for factorial moments of some distributions in the analysis of algorithms
Sumit Kumar Jha
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and num…
Rate of convergence of major cost incurred in the in-situ permutation algorithm
Sumit Kumar Jha
The in-situ permutation algorithm due to MacLeod replaces by where is a permutation of …
On the Sum of Linear Coefficients of a Boolean Valued Function
Sumit Kumar Jha
Let be a Boolean valued function having total degree . Then a conjecture due to Servedio and Gopalan asserts that $\sum_{i=1}^{n}\widehat{f}…
Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
Sumit Kumar Jha
We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate the moments of comparisons used by the quick sort algorithm. We reemphasize that this approach helps in cal…
Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm
Sumit Kumar Jha
We calculate asymptotic expansions for the moments of number of comparisons used by the randomized quick sort algorithm using the singularity analysis of certain generating functio…