| 2009 |
|---|
| 12 | EE | Soubhik Chakraborty:
On Why and What of Randomness
CoRR abs/0902.1232: (2009) |
| 2008 |
|---|
| 11 | EE | Bidu Prakash Das,
Soubhik Chakraborty:
On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2
CoRR abs/0809.2884: (2008) |
| 10 | EE | Soubhik Chakraborty,
Sandeep Singh Solanki,
Sayan Roy,
Shivee Chauhan,
Sanjaya Shankar Tripathy,
Kartik Mahto:
A Statistical Approach to Modeling Indian Classical Music Performance
CoRR abs/0809.3214: (2008) |
| 9 | EE | Suman Kumar Sourabh,
Soubhik Chakraborty:
How robust is quicksort average complexity?
CoRR abs/0811.4376: (2008) |
| 8 | EE | Soubhik Chakraborty,
Rayalla Ranganayakulu,
Shivee Chauhan,
Sandeep Singh Solanki,
Kartik Mahto:
Which notes are Vadi-Samvadi in Raga Rageshree?
CoRR abs/0812.0706: (2008) |
| 2007 |
|---|
| 7 | EE | Soubhik Chakraborty,
Kiran Kumar Sundararajan:
A simple empirical formula for categorizing computing operations.
Applied Mathematics and Computation 189(1): 326-340 (2007) |
| 6 | EE | Soubhik Chakraborty,
Suman Kumar Sourabh,
Mausumi Bose,
Kumar Sushant:
Replacement sort revisited: The "gold standard" unearthed!
Applied Mathematics and Computation 189(1): 384-394 (2007) |
| 5 | EE | Soubhik Chakraborty,
Suman Kumar Sourabh:
How robust are average complexity measures? A statistical case study.
Applied Mathematics and Computation 189(2): 1787-1797 (2007) |
| 4 | EE | Soubhik Chakraborty:
Can a randomized binary search have an O(1) complexity at least in practice?
Applied Mathematics and Computation 189(2): 1884-1888 (2007) |
| 3 | EE | Soubhik Chakraborty,
Kiran Kumar Sundararajan:
Winograd's algorithm statistically revisited: It pays to weigh than to count!
Applied Mathematics and Computation 190(1): 15-20 (2007) |
| 2 | EE | Soubhik Chakraborty,
Suman Kumar Sourabh:
On why an algorithmic time complexity measure can be system invariant rather than system independent.
Applied Mathematics and Computation 190(1): 195-204 (2007) |
| 1 | EE | Anchala Kumari,
Soubhik Chakraborty:
Software complexity: A statistical case study through insertion sort.
Applied Mathematics and Computation 190(1): 40-50 (2007) |
