default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoubhik Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ankita Kumari, Purushottam Singh
, Prashant Pranav, Sandip Dutta, Soubhik Chakraborty:
Prevention of sleep deprivation attack in MANET using cumulative priority based cluster head selection. Concurr. Comput. Pract. Exp. 36(16) (2024)- [j14]Sukanta Kumar Dash, Sandeep Singh Solanki, Soubhik Chakraborty:
Deep Convolutional Neural Networks for Predominant Instrument Recognition in Polyphonic Music Using Discrete Wavelet Transform. Circuits Syst. Signal Process. 43(7): 4239-4271 (2024) - [j13]Nayancy, Sandip Dutta, Soubhik Chakraborty:
Lightweight blockchain approach to reduce double-spend and 51% attacks on Proof-of-Work. Intell. Data Anal. 28(5): 1309-1319 (2024) - [j12]Ankita Kumari, Sandip Dutta, Soubhik Chakraborty:
A fuzzy based Q - learning approach to prevent sinkhole attacks in MANET (FQ - SPM). J. Intell. Fuzzy Syst. 46(1): 1615-1626 (2024) - 2023
- [j11]Niraj Kumar Singh, Komal Naaz, Soubhik Chakraborty:
Komala and Kaṭhora: A Novel Approach Towards Classification of Hindi Poetry. ACM Trans. Asian Low Resour. Lang. Inf. Process. 22(6): 168:1-168:13 (2023) - 2021
- [j10]Prashant Pranav, Sandip Dutta, Soubhik Chakraborty:
Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption. Soft Comput. 25(21): 13127-13145 (2021) - 2020
- [j9]Prashant Pranav, Soubhik Chakraborty, Sandip Dutta:
A new cipher system using semi-natural composition in Indian raga. Soft Comput. 24(2): 1529-1537 (2020)
2010 – 2019
- 2018
- [i14]Devashish Gosain, Soubhik Chakraborty, Mohit Sajwan:
Simulating Raga Notes with a Markov Chain of Order 1-2. CoRR abs/1808.01603 (2018) - 2017
- [c6]Barzan Mozafari, Jags Ramnarayan, Sudhir Menon, Yogesh Mahajan, Soubhik Chakraborty, Hemant Bhanawat, Kishor Bachhav:
SnappyData: A Unified Cluster for Streaming, Transactions and Interactice Analytics. CIDR 2017 - 2016
- [c5]Jags Ramnarayan, Barzan Mozafari, Sumedh Wale, Sudhir Menon, Neeraj Kumar, Hemant Bhanawat, Soubhik Chakraborty, Yogesh Mahajan, Rishitesh Mishra, Kishor Bachhav:
SnappyData: A Hybrid Transactional Analytical Store Built On Spark. SIGMOD Conference 2016: 2153-2156 - 2014
- [b1]Soubhik Chakraborty, Guerino Mazzola, Swarima Tewari, Moujhuri Patra:
Computational Musicology in Hindustani Music. Computational Music Science, Springer 2014, ISBN 978-3-319-11471-2, pp. 1-107 - 2013
- [i13]Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick:
An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War. CoRR abs/1308.2400 (2013) - [i12]Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick:
A Statistical Peek into Average Case Complexity. CoRR abs/1312.4802 (2013) - 2012
- [c4]Niraj Kumar Singh, Soubhik Chakraborty:
Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity. ACITY (2) 2012: 107-113 - [c3]Niraj Kumar Singh, Soubhik Chakraborty:
A statistical approach to the relative performance analysis of sorting algorithms. CCSEIT 2012: 57-62 - [i11]Ripunjai Kumar Shukla, Soubhik Chakraborty:
On an Ethical Use of Neural Networks: A Case Study on a North Indian Raga. CoRR abs/1202.5953 (2012) - [i10]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) - [i9]Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty:
Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more! CoRR abs/1203.1830 (2012) - [i8]Niraj Kumar Singh, Mita Pal, Soubhik Chakraborty:
The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs. CoRR abs/1204.5023 (2012) - [i7]Niraj 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
- [c2]Moujhuri Patra, Soubhik Chakraborty, Dipak Ghosh:
Optimized Neural Architecture for Time Series Prediction Using Raga Notes. CMMR/FRSM 2011: 26-33 - [c1]Shashi Bhushan Singh, Soubhik Chakraborty, Keashav Mohan Jha:
Assessment of Level of Recovery of Cognitive Impairment in the Cerebrovascular Accident and Head Injuries Cases: Therapeutic Impact of North Indian Ragas. CMMR/FRSM 2011: 44-52 - [i6]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)
2000 – 2009
- 2009
- [i5]Soubhik Chakraborty:
On Why and What of Randomness. CoRR abs/0902.1232 (2009) - 2008
- [i4]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) - [i3]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) - [i2]Suman Kumar Sourabh, Soubhik Chakraborty:
How robust is quicksort average complexity? CoRR abs/0811.4376 (2008) - [i1]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
- [j8]Kiran Kumar Sundararajan, Soubhik Chakraborty:
A new sorting algorithm. Appl. Math. Comput. 188(1): 1037-1041 (2007) - [j7]Soubhik Chakraborty, Kiran Kumar Sundararajan:
A simple empirical formula for categorizing computing operations. Appl. Math. Comput. 189(1): 326-340 (2007) - [j6]Soubhik Chakraborty, Suman Kumar Sourabh, Mausumi Bose, Kumar Sushant:
Replacement sort revisited: The "gold standard" unearthed! Appl. Math. Comput. 189(1): 384-394 (2007) - [j5]Soubhik Chakraborty, Suman Kumar Sourabh:
How robust are average complexity measures? A statistical case study. Appl. Math. Comput. 189(2): 1787-1797 (2007) - [j4]Soubhik Chakraborty:
Can a randomized binary search have an O(1) complexity at least in practice? Appl. Math. Comput. 189(2): 1884-1888 (2007) - [j3]Soubhik Chakraborty, Kiran Kumar Sundararajan:
Winograd's algorithm statistically revisited: It pays to weigh than to count! Appl. Math. Comput. 190(1): 15-20 (2007) - [j2]Anchala Kumari, Soubhik Chakraborty:
Software complexity: A statistical case study through insertion sort. Appl. Math. Comput. 190(1): 40-50 (2007) - [j1]Soubhik Chakraborty, Suman Kumar Sourabh:
On why an algorithmic time complexity measure can be system invariant rather than system independent. Appl. Math. Comput. 190(1): 195-204 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
