Free Web Hosting



Research Interests
Theoretical Computer Science - Algorithms & Complexity, Game Theory & Mechanism Design, Combinatorial Optimization, Graph Theory, Machine Learning & Cryptography


Optimal Placement Algorithms for Virtual Machines
Umesh Bellur, Chetan S. Rao, Madhu Kumar S.D.
• Submitted (
arXiv:1011.5064v1 [cs.DC])

Improved approximation bounds for Vector Bin Packing
Chetan S. Rao
• Submitted (arXiv:1007.1345v1 [cs.DS])

Research work

Matchings in graphs -- Fall '10
Supervisor : Prof. K. Muralikrishnan, NIT Calicut
• Currently working on Edmond's blossom algorithm and determining the complexity of matching problem (currently known to be in RNC).
• Assigned the complexity class of decision version of maximum matching - logspace (L).

Mechanisms for Prediction Markets -- Summer '10
Supervisor : Prof. Y. Narahari, IISc Bangalore
• Worked on different mechanisms for prediction markets and proposed a better heuristic for the same.

Placement Algorithm for Virtual Machines -- Fall '10
Supervisor : Prof. Umesh Bellur, IIT Bombay
• Worked on the placement algorithm; for a set of input configurations of VMs on Physical Machines (a multi-dimensional bin packing problem)

Character Recognition using Artificial Neural Networks -- Fall '10
Supervisor : Prof. S Kumaravel, NIT Calicut
• Worked on recognizing characters using the feed-forward back-propagation artificial neural network. Also performed comparison studies for different configurations.

Cloud Computing for Mobile World -- Fall '10
Supervisor : Prof. Madhu Kumar S.D., NIT Calicut
• A literature survey on the current status of Mobile Cloud Computing (MCC) and analysed it's shortcomings.

Approximation Algorithm for Dynamic Flows -- Spring '10
Supervisor : Prof. Priya Chandran, NIT Calicut
• A literature survey on the various dynamic flow algorithms for evacuation problems, routing & traffic management problems.

Acyclic Edge Coloring of Graphs -- Summer '09
Supervisor : Prof. L. Sunil Chandran, IISc Bangalore
• A literature survey on acyclic & adjacent vertex graph colorings
• Developed an exact algorithm for acyclic edge colorings in degree-bounded graphs

Deterministic Encryption -- Fall '09
Supervisor : Prof. M.P. Sebastian, NIT Calicut
• A literature survey on deterministic encryption and its use in outsourced databases

Other work

Greatest Internet Mersenne Prime Search
• Contribute to the GIMPS
• Current ranking = 2972 (4th May 2010)

Imagination is more important than knowledge. For while knowledge defines all we currently know and understand, imagination points to all we might yet discover and create

-- Albert Einstein (1879 - 1955)

drupal statistics module