8 citations · 19 across the 16 of their papers we have counts for
17 papers
Simulating Raga Notes with a Markov Chain of Order 1-2
Devashish Gosain, Soubhik Chakraborty, Mohit Sajwan
Semi Natural Algorithmic composition (SNCA) is the technique of using algorithms to create music note sequences in computer with the understanding that how to render them would be…
A Statistical Peek into Average Case Complexity
Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick
The present paper gives a statistical adventure towards exploring the average case complexity behavior of computer algorithms. Rather than following the traditional count based ana…
An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War
Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick
In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn dense matrices which computes the product matrix with average complexity Tavg(n) = d1…
Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm
Niraj Kumar Singh, Soubhik Chakraborty
Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in…
The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs
Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty
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 th…
Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in…