NIRF IQAC

facebook

twitter

linkedIn

youtube

Virtual Tour

V N Muralidhara

Associate Professor

murali@iiitb.ac.in

Education : Ph.D. (IIT Delhi)

Ph.D. (Indian Institute of Technology Delhi)

Prof Muralidhara has done PhD in Computer Science and Engineering at Indian Institute of Technology Delhi. His thesis was in the area of Algorithms. He has done M.Tech. in Computer Application at IIT Delhi and M.Sc. in Mathematics at University of Hyderabad. He is interested in the theory of algorithms and complexity, and it's applications. More specifically, his broad area of research interests include combinatorial optimization, approximation algorithms, randomized algorithms and on-line algorithms.

Prof Muralidhara V. N. joined IIITB in August 2009. His primary focus area is the theory of algorithms and complexity, and it's applications.

Theory of algorithms and complexity and its applications, Combinatorial optimization, Approximation algorithms, Randomized algorithms, On-line algorithms

  • Jivitej S. Chadha, Naveen Garg, Amit Kumar and V. N. Muralidhara.
    A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation.
    41st ACM Symposium on Theory of Computing (STOC), pages 679-684, 2009.
  • Naveen Garg, Amit Kumar and Muralidhara V N.
    Minimizing total flow time: the unrelated case.
    19th International Symposium on Algorithms and Computation (ISAAC), pages 424-435, 2008. 
  • Muralidhara V.N. and Sandeep Sen.
    Improvements on the Johnson bound for Reed Solomon codes.
    Discrete Applied Mathematics, Volume 157, Issue 4, pages 812-818 2009.
  • Muralidhara V.N. and Sandeep Sen.
    A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography.
    INDOCRYPT 2007: 48-57.

 

  • Muralidhara V.N. and Sandeep Sen.
    An online set-cover problem with application to Network Discovery. Under Review.