vix.ing · top · new · best · stats · spec

The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs

2012/04/23 by Niraj Kumar Singh, Singh, Niraj Kumar, Mita Pal +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithms and Data Compression #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Mathematical Approximation and Integration #cs.DS

paper · pdf · doi:10.48550/arxiv.1204.5023

arxiv created 2012/04/23 · openalex publication_date 2012/04/23 · arxiv updated 2012/04/24 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that this algorithm is sensitive to parameters of both distributions. But the main effects as well as the interaction effects involving these parameters and the input size are more significant for negative binomial case.

Citations

Related