| 2012 | ||
|---|---|---|
| i4 | Mita Pal, Soubhik Chakraborty, N. C. Mahanti: How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution? CoRR abs/1203.0120 (2012) | |
| i3 | Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty: Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! CoRR abs/1203.1830 (2012) | |
| i2 | Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty: The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs. CoRR abs/1204.5023 (2012) | |
| 2011 | ||
| i1 | Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty, N. C. Mahanti: K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs! CoRR abs/1107.3622 (2011) | |
| 1 | Soubhik Chakraborty | |
| 2 | N. C. Mahanti | |
| 3 | Niraj Kumar Singh | |
| 4 | Kiran Kumar Sundararajan |
Data released under the ODC-BY 1.0 license — See also our legal information page