Soubhik Chakraborty

Orcid: 0000-0003-3530-9027

According to our database1, Soubhik Chakraborty authored at least 33 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A fuzzy based Q - learning approach to prevent sinkhole attacks in MANET (FQ - SPM).
J. Intell. Fuzzy Syst., January, 2024

2023
<i>Komala</i> and <i>Kaṭhora</i>: A Novel Approach Towards Classification of Hindi Poetry.
ACM Trans. Asian Low Resour. Lang. Inf. Process., June, 2023

2021
Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption.
Soft Comput., 2021

2020
A new cipher system using semi-natural composition in Indian raga.
Soft Comput., 2020

2018
Simulating Raga Notes with a Markov Chain of Order 1-2.
CoRR, 2018

2017
SnappyData: A Unified Cluster for Streaming, Transactions and Interactice Analytics.
Proceedings of the 8th Biennial Conference on Innovative Data Systems Research, 2017

2016
SnappyData: A Hybrid Transactional Analytical Store Built On Spark.
Proceedings of the 2016 International Conference on Management of Data, 2016

2014
Computational Musicology in Hindustani Music
Computational Music Science, Springer, ISBN: 978-3-319-11472-9, 2014

2013
A Statistical Peek into Average Case Complexity.
CoRR, 2013

An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War.
CoRR, 2013

2012
Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm
CoRR, 2012

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

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

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

On an Ethical Use of Neural Networks: A Case Study on a North Indian Raga
CoRR, 2012

A statistical approach to the relative performance analysis of sorting algorithms.
Proceedings of the Second International Conference on Computational Science, 2012

Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity.
Proceedings of the Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India, 2012

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

Assessment of Level of Recovery of Cognitive Impairment in the Cerebrovascular Accident and Head Injuries Cases: Therapeutic Impact of North Indian Ragas.
Proceedings of the Speech, Sound and Music Processing: Embracing Research in India, 2011

Optimized Neural Architecture for Time Series Prediction Using Raga Notes.
Proceedings of the Speech, Sound and Music Processing: Embracing Research in India, 2011

2009
On Why and What of Randomness
CoRR, 2009

2008
Which notes are Vadi-Samvadi in Raga Rageshree?
CoRR, 2008

How robust is quicksort average complexity?
CoRR, 2008

A Statistical Approach to Modeling Indian Classical Music Performance
CoRR, 2008

On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2
CoRR, 2008

2007
A new sorting algorithm.
Appl. Math. Comput., 2007

Software complexity: A statistical case study through insertion sort.
Appl. Math. Comput., 2007

Replacement sort revisited: The "gold standard" unearthed!
Appl. Math. Comput., 2007

On why an algorithmic time complexity measure can be system invariant rather than system independent.
Appl. Math. Comput., 2007

Winograd's algorithm statistically revisited: It pays to weigh than to count!
Appl. Math. Comput., 2007

How robust are average complexity measures? A statistical case study.
Appl. Math. Comput., 2007

A simple empirical formula for categorizing computing operations.
Appl. Math. Comput., 2007

Can a randomized binary search have an O(1) complexity at least in practice?
Appl. Math. Comput., 2007


  Loading...