Data Structures & Algorithms
A computer program is a collection of instructions to perform a specific task. For this, a computer program may need to store data, retrieve data, and perform computations on the data. A data structure is a way to store and organize data in order to facilitate access and modifications. And, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output. [Source]
Faculty Members:
- Dr. Ripon Patgiri, Assistant Professor
- Dr. Shyamosree Pal, Assistant Professor
Patents:
- Ripon Patgiri, and Malaya Dutta Borah, “Method to Construct A HEX-BLOOM Model to Verify Authenticity and Integrity with Privacy-Preserving Computing for Diverse Applications“, Patent Number:2021105739, Australian Patent (Status: Granted).
- Ripon Patgiri, “A Device and A Method For Generating One-Way Secure Hash Algorithm (OSHA)“, Patent number: 2021106629, Australian Patent (Status: Granted).
- Ripon Patgiri, “A Method And System For Generating A Truly Random Number For Conventional Computing Devices”, Patent Number: 2021107078, Australian Patent (Status: Granted).
Books:
- Monograph book, Ripon Patgiri, Sabuzima Nayak, and Naresh Babu Muppalaneni, “Bloom Filter: A Data Structure for Computer Networking, Big Data, Cloud Computing, Internet of Things, Bioinformatics and Beyond“, Elsevier, ISBN: 9780128235201 (ongoing).
Publications:
[1] Sabuzima Nayak, Ripon Patgiri, and Angana Borah, “A Survey on the roles of Bloom Filter in implementation of the Named Data Networking“, Computers Networks, Vol. 196 (2021), Elsevier, DOI: 10.1016/j.comnet.2021.108232
[2] Ripon Patgiri, Sabuzima Nayak and Samir Kumar Borgohain, “PassDB: A Password Database with Strict Privacy Protocol using 3D Bloom Filter“, Information Sciences, Vol. 539, Issue: October 2020, pages: 157 – 176, DOI: 10.1016/j.ins.2020.05.135
[3] Sabuzima Nayak and Ripon Patgiri, “A Review on Role of Bloom Filter on DNA Assembly“, IEEE Access, volume 7, pp. 66939-66954, DOI: 10.1109/ACCESS.2019.2910180 .
[4] Ripon Patgiri, Sabuzima Nayak and Samir Kumar Borgohain, “rDBF: A r-Dimensional Bloom Filter for Massive Scale Membership Query” Journal of Network and Computer Applications, Vol. 136, Issue: 15 June 2019, DOI: 10.1016/j.jnca.2019.03.004
[5] Ripon Patgiri, Sabuzima Nayak, and Samir Kumar Borgohain, “Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey“, Journal of Computer Networks and Communications, Volume 2019, Article ID 2712417, 10 pages, DOI: 10.1155/2019/2712417.
[6] Ripon Patgiri, Sabuzima Nayak, and Samir Kumar Borgohain, “ScaleBF: A High Scalable Membership Filter using 3D Bloom Filter“, International Journal of Advanced Computer Science and Applications, Vol. 9 No. 12, 2018, DOI: 10.14569/IJACSA.2018.091277.
[7] Ripon Patgiri, Sabuzima Nayak, and Samir Kumar Borgohain, “Role of Bloom Filter in Big Data Research: A Survey“, International Journal of Advanced Computer Science and Applications, Vol. 9, No. 11, 2018, DOI: 10.14569/IJACSA.2018.091193.
[8] Ripon Patgiri, Sabuzima Nayak, and Samir Kumar Borgohain, “Preventing DDoS using Bloom Filter: A Survey“, EAI Endorsed Transaction on Scalable Information Systems, Vol. 5, No. 19, DOI: 10.4108/eai.19-6-2018.155865.
[9] Sabuzima Nayak, and Ripon Patgiri, “countBF: A General-purpose High Accuracy and Space Efficient Counting Bloom Filter“, 17th International Conference on Network and Service Management, Izmir, Turkey, 25-29 October 2021.
[9] Ripon Patgiri, “Rando: A General-Purpose True Random Number Generator for Conventional Computers”, The 20th IEEE International Conference on Trust, Security, and Privacy in Computing and Communications (TrustCom 2021), 20-22 October 2021, Shenyang, China.
[10] Sabuzima Nayak, Ripon Patgiri and Naresh Babu Muppalaneni, “Is Bloom Filter a Bad Choice for Security and Privacy?”, IEEE 35th International Conference on Information Networking (ICOIN 2021), January 13-16, 2021, Korea.
[11] Ripon Patgiri, “sxKV: A Novel Secured and Bidirectional Key-Value Data Structure”, The 22nd IEEE International Conferences on High Performance Computing and Communications (HPCC’20), December, 14-16, 2020, Fiji.
[12] Lilapati Waikhom, Ripon Patgiri and Sabuzima Nayak, “A Survey on Bloom Filter for Multiple sets”, International Conference on Modeling, Simulation and Optimization, August 3-5, 2020.
[13] Ripon Patgiri, Sabuzima Nayak and Samir Kumar Borgohain, “acBF: A High Accuracy Membership Filter using rDBF“, 25th annual International Conference on Advanced Computing and Communications, 5th – 7th September 2019, Bangalore, India.
[14] Ripon Patgiri, “HFil: A High Accuracy Bloom Filter“, The 21st IEEE International Conferences on High Performance Computing and Communications (HPCC’19), to be held on Sat, 10 Aug, 2019 – Mon, 12 Aug, 2019, Zhangjiajie, China, doi: 10.1109/HPCC/SmartCity/DSS.2019.00300.
[15] Ripon Patgiri, Sabuzima Nayak, and Samir Kumar Borgohain, “PassDB: A Password Database using 3D Bloom Filter“, The 21st IEEE International Conferences on High Performance Computing and Communications (HPCC’19), to be held on Sat, 10 Aug, 2019 – Mon, 12 Aug, 2019, Zhangjiajie, China, doi: 10.1109/HPCC/SmartCity/DSS.2019.00162.
[16] Ripon Patgiri, Samir Kumar Borgohan, and Shyamosree Pal, “Elastica: A Large Scale Elastic Array Data Structure” , 8th edition, 2018 International Conference on Computer Communication and Informatics (ICCCI -2018), Jan. 04 – 06, 2018, Coimbatore, India, IEEE, DOI: 10.1109/ICCCI.2018.8441469.
[17] P. Bhowmick and S. Pal, Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph, Journal of Mathematical Imaging and Vision, Vol. 49, No. 1, pp. 98-122, 2014.
[18] S. Pal and P. Bhowmick, Determining Digital Circularity Using Integer Intervals, Journal of Mathematical Imaging and Vision, Vol. 42, No. 1, pp. 124, 2012.
[19] S. Pal, R. Dutta, and P. Bhowmick Circular Arc Segmentation by Curvature Estimation and Geometric Validation, DOI:10.1142/S0219467812500246, International Journal of Image and Graphics, Vol. 12, No. 4, 2012.
[20] S. Pal and P. Bhowmick, Cubic Approximation of Curve-shaped Objects in Z2: A Generalized Approach Based on Discrete Curvature, Journal of Discrete Mathematical Sciences & Cryptography, Vol. 13, No. 5, pp. 407427, 2010.
[21] S. Pal, P. Bhowmick, A. Biswas, and B. B. Bhattacharya, Understanding Digital Documents Using Gestalt Properties of Isothetic Components, International Journal of Digital Library Systems, Vol. 1, No. 3, pp. 126, 2010.
[22] D. Saha, N. Das, and S. Pal, A Digital-Geometric Approach for Computing Area Coverage in Wireless Sensor Networks, 10th International Conference on Distributed Computing and Internet Technologies (ICDCIT2014) Lecture Notes in Computer Science, Springer, Vol. 8337, pp 134-145, 2014.
[23] S. Pal, P. Bhowmick, and A. Biswas, FACET: A Fast Approximate Circularity Estimation Technique, Proc. 2nd International Conference on Emerging Applications of Information Technology (EAIT2011), Kolkata, IEEE CS Press, pp. 106109, 2011.
[24] S. Pal, and P. Bhowmick, Faster Circularity Estimation by Randomization, Proc. Students’ Technology Symposium (TechSym2011), Kharagpur, IEEE CS Press, pp. 160165, 2011.
[25] S. Pal, P. Bhowmick, A. Biswas, and B. B. Bhattacharya, GOAL: Towards understanding of Graphic Objects from Architectural to Line drawings, 8th Intl. Workshop on Graphics Recognition (GREC 2009), La Rochelle, France, LNCS, Springer, Vol. 6020, pp. 8192, 2010.
[26] S. Pratihar, S. Pal, P. Bhowmick, A. Biswas, and B. B. Bhattacharya, Recognition of Handdrawn Graphs Using Digital-geometric Techniques, 12th International Conference on Frontiers in Handwriting Recognition (ICFHR), Kolkata, IEEE CS Press, pp. 8994, 2010.
[27] S. Pal and P. Bhowmick, Estimation of Discrete Curvature Based on Chain-Code Pairing and Digital Straightness, Proc. 2009 IEEE International Conference on Image Processing, (ICIP), Cairo, Egypt, pp. 10971100, 2009.
[28] Amit Kumar Trivedi, Dalton Meitei Thounaojam, Shyamosree Pal, A Novel Minutiae Triangulation Technique for Non-invertible Fingerprint Template Generation, Expert Systems with Applications, Volume 186, 2021, 115832, ISSN 0957-4174,
https://doi.org/10.1016/j.eswa.2021.115832
[29] Dhar, Soumi and Pal, Shyamosree, Surface Reconstruction: Roles in the Field of Computer Vision and Computer Graphics, International Journal of Image and Graphics, pages 2250008, doi:10.1142/S0219467822500085.
[30] Surajkanta, Y., Pal, S. A Digital Geometry-Based Fingerprint Matching Technique. Arab J Sci Eng 46, 4073–4086 (2021). https://doi.org/10.1007/s13369-021-05390-4
[31] Surajkanta, Yumnam and Pal, Shyamosree, Recognition of Isothetic Arc Using Number Theoretic Properties, International Journal of Image and Graphics, volume 20(02), pages 2050011, 2020, doi: 10.1142/S0219467820500114.
[32] Amit Kumar Trivedi, Dalton Meitei Thounaojam, Shyamosree Pal, Non-Invertible cancellable fingerprint template for fingerprint biometric, Computers & Security, Volume 90, 2020, 101690, ISSN 0167-4048, https://doi.org/10.1016/j.cose.2019.101690.
[33] Surajkanta, Yumnam, and Shyamosree Pal. “Convergent Tangent Estimator for Discrete Objects Based on Isothetic Covers.” Journal of Computer Science, vol. 16, no. 4, Apr. 2020, pp. 467–78. DOI.org (Crossref), https://doi.org/10.3844/jcssp.2020.467.478.
[34] Trivedi, Amit Kumar, et al. “A Robust and Non-Invertible Fingerprint Template for Fingerprint Matching System.” Forensic Science International, vol. 288, July 2018, pp. 256–65. DOI.org (Crossref), https://doi.org/10.1016/j.forsciint.2018.04.045.