dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Soubhik Chakraborty Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRipunjai Kumar Shukla, Soubhik Chakraborty: On an Ethical Use of Neural Networks: A Case Study on a North Indian Raga CoRR abs/1202.5953: (2012)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMita 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNiraj Kumar Singh, Mita Pal, Soubhik Chakraborty: Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! CoRR abs/1203.1830: (2012)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNiraj Kumar Singh, Mita Pal, Soubhik Chakraborty: The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs CoRR abs/1204.5023: (2012)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNiraj Kumar Singh, Soubhik Chakraborty: Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm CoRR abs/1204.5083: (2012)
2011
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiran 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)
2009
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty: On Why and What of Randomness CoRR abs/0902.1232: (2009)
2008
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBidu 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)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik 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)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSuman Kumar Sourabh, Soubhik Chakraborty: How robust is quicksort average complexity? CoRR abs/0811.4376: (2008)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty, Rayalla Ranganayakulu, Shivee Chauhan, Sandeep Singh Solanki, Kartik Mahto: Which notes are Vadi-Samvadi in Raga Rageshree? CoRR abs/0812.0706: (2008)
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty, Kiran Kumar Sundararajan: A simple empirical formula for categorizing computing operations. Applied Mathematics and Computation 189(1): 326-340 (2007)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty, Suman Kumar Sourabh, Mausumi Bose, Kumar Sushant: Replacement sort revisited: The "gold standard" unearthed! Applied Mathematics and Computation 189(1): 384-394 (2007)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty, Suman Kumar Sourabh: How robust are average complexity measures? A statistical case study. Applied Mathematics and Computation 189(2): 1787-1797 (2007)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik Chakraborty: Can a randomized binary search have an O(1) complexity at least in practice? Applied Mathematics and Computation 189(2): 1884-1888 (2007)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik 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)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoubhik 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)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnchala Kumari, Soubhik Chakraborty: Software complexity: A statistical case study through insertion sort. Applied Mathematics and Computation 190(1): 40-50 (2007)

Coauthor Index

1Mausumi Bose [6]
2Shivee Chauhan [8] [10]
3Bidu Prakash Das [11]
4Anchala Kumari [1]
5N. C. Mahanti [13] [17]
6Kartik Mahto [8] [10]
7Mita Pal [13] [15] [16] [17]
8Rayalla Ranganayakulu [8]
9Sayan Roy [10]
10Ripunjai Kumar Shukla [18]
11Niraj Kumar Singh [14] [15] [16]
12Sandeep Singh Solanki [8] [10]
13Suman Kumar Sourabh [2] [5] [6] [9]
14Kiran Kumar Sundararajan [3] [7] [13]
15Kumar Sushant [6]
16Sanjaya Shankar Tripathy [10]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page