Follow
Dr. Suman Kumar Sourabh
Dr. Suman Kumar Sourabh
Professor of Statistics, Patna University
Verified email at pup.ac.in
Title
Cited by
Cited by
Year
On why an algorithmic time complexity measure can be system invariant rather than system independent
S Chakraborty, SK Sourabh
Applied Mathematics and Computation 190 (1), 195-204, 2007
322007
A computer experiment oriented approach to algorithmic complexity
S Chakraborty
LAP LAMBERT Academic Publishing, 2010
312010
Replacement sort revisited: The “gold standard” unearthed!
S Chakraborty, SK Sourabh, M Bose, K Sushant
Applied mathematics and computation 189 (1), 384-394, 2007
172007
How robust is quicksort average complexity?
SK Sourabh, S Chakraborty
arXiv preprint arXiv:0811.4376, 2008
152008
How robust are average complexity measures? A statistical case study
S Chakraborty, SK Sourabh
Applied mathematics and computation 189 (2), 1787-1797, 2007
92007
On the philosophy of statistical bounds: A case study on a determinant algorithm
S Chakraborty, C Wahi, SK Sourabh, LR Saraswati, A Mukherjee
Journal of Modern Mathematics and Statistics 1 (1-4), 15-23, 2007
82007
Empirical Study on the Robustness of Average Complexity & Parameterized Complexity Measure for Heapsort Algorithm
SK Sourabh, S Chakraborty
INTERNATIONAL JOURNAL OF COMPUTATIONAL COGNITION (HTTP://WWW. IJCC. US) 7 (4), 1, 2009
62009
On how statistics provides a reliable and valid measure for an algorithm’s complexity
S Chakraborty, KK Sundararajan, BK Das, SK Sourabh
Journal InterStat, Dec2004 2, 0
5
Linear diophantine equation: Solution and applications
UN Roy, RP Sah, AK Sah, SK Sourabh
International Journal of Mathematics Trends and Technology-IJMTT 65, 2019
42019
Are Subsequences of Decimal Digits of PI Random?
SK Sourabh, S Chakraborty, BK Das
Annals. Computer Science Series 7 (2), 2009
22009
A note on distributions that are sorted faster than others by our new sorting algorithm
SK Sourabh, KK Sundararajan, S Chakraborty
InterStat Mar 1, 2007
22007
Empirical O (n 2) Complexity is Convincingly Gettable with Two Dense Matrices in nxn Matrix Multiplication!
SK Sourabh, S Chakraborty
22006
Early Proofs of Fermat‟ s Little Theorem and Applications
RP Sah, UN Roy, AK Sah, SK Sourabh
International Journal of Mathematics Trends and Technology-IJMTT 64, 2018
12018
SAMPLING ALGORITHMS: AN EMPIRICAL STUDY ON THE ROBUSTNESS OF AVERAGE CASE COMPLEXITY
SK Sourabh, S Chakraborty, VS Singh
The system can't perform the operation now. Try again later.
Articles 1–14