The following pages link to Soubhik Chakraborty (Q355522):
Displaying 15 items.
- The middle pivot element algorithm (Q355523) (← links)
- Computational musicology in Hindustani music (Q483137) (← links)
- A new sorting algorithm (Q2371521) (← links)
- A simple empirical formula for categorizing computing operations (Q2381324) (← links)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← links)
- How robust are average complexity measures? A statistical case study (Q2383700) (← links)
- Can a randomized binary search have an \(O(1)\) complexity at least in practice? (Q2383711) (← links)
- Winograd's algorithm statistically revisited: it pays to weigh than to count! (Q2383729) (← links)
- Software complexity: a statistical case study through insertion sort (Q2383731) (← links)
- On why an algorithmic time complexity measure can be system invariant rather than system independent (Q2383744) (← links)
- A survey on implementation of lightweight block ciphers for resource constraints devices (Q5043892) (← links)
- (Q5171949) (← links)
- (Q5172011) (← links)
- (Q5172019) (← links)
- Parameterized Complexity on a New Sorting Algorithm: A Study in Simulation (Q6231285) (← links)