Mita Pal

According to our database, Mita Pal authored at least 4 papers between 2011 and 2012.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2012

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

Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty

CoRR, 2012

Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!

Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty

CoRR, 2012

How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?

Mita Pal, Soubhik Chakraborty, N. C. Mahanti

CoRR, 2012

2011

K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!

Kiran Kumar Sundararajan, Mita Pal, Soubhik Chakraborty, N. C. Mahanti

CoRR, 2011