Assistant Professor of Computer Science and Engineering
Dr. Sathyanarayanan Srinivasan has completed his Ph. D. from National Institute of Technology Warangal. He did his doctoral research in the field of Theoretical Computer Science, specifically on the design and analysis of distributed algorithms. In his doctoral work, he has also introduced new techniques for proving the correctness and safety of asynchronous distributed algorithms. He is currently working in formal verification of asynchronous algorithms.
Google Scholar Link: Sathyanarayanan S – Google Scholar
- Sathyanarayanan Srinivasan and Ramesh Kandukoori. “A Paxos-based algorithm to minimize the overhead of process recovery in consensus.” Acta Informatica 56, no. 5 (2019): 433-446.
- Sathyanarayanan Srinivasan & Ramesh kandukoori (2021) A synod based deterministic and indulgent leader election protocol for asynchronous large groups, International Journal of Parallel, Emergent and Distributed Systems, DOI: 10.1080/17445760.2021.1879067
- Sathyanarayanan Srinivasan and K. S. Joseph, “A survey on stochastic vehicle routing problem,” International Conference on Information Communication and Embedded Systems (ICICES2014), 2014, pp. 1-7, doi: 10.1109/ICICES.2014.7033895.
- Sathyanarayanan S, K. S. Joseph and S. K. V. Jayakumar, “A hybrid population seeding technique based Genetic Algorithm for stochastic Multiple Depot Vehicle Routing Problem,” 2015 International Conference on Computing and Communications Technologies (ICCCT), 2015, pp. 119-127, doi: 10.1109/ICCCT2.2015.7292731.
Srinivasan S, Kandukoori R. Solving consensus in true partial synchrony. IEEE Transactions on Parallel and Distributed Systems. 2022 Mar 7;33(12):3478-90.