N. C. Mahanti

According to our database1, N. C. Mahanti authored at least 5 papers between 2005 and 2012.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

Temporal Association Rules Mining in T-databases Using Pipeline Technique.
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2008
Network Security Using Biometric and Cryptography.
Proceedings of the Advanced Concepts for Intelligent Vision Systems, 2008

2005
Computational Efficiency of Optimized Shortest Path Algorithms.
Int. J. Comput. Sci. Appl., 2005


  Loading...