Devices and CircuitsSelected List of PublicationsDesign AutomationProbabilistic algorithms and graph theoryContents

Probabilistic algorithms and graph theory

  1. Madhav P. Desai, Vasant B. Rao "On the convergence of reversible Markov chains," SIAM Journal on Matrix Analysis and Applications Volume 14, Issue 4 (October 1993).
  2. M.P. Desai, V.B. Rao, "A characterization of the smallest eigenvalue of a graph," Journal of Graph Theory Volume 18, Issue 2 (March 1994).
  3. M Desai, S Kumar, PR Kumar, "Quasi-Statically Cooled Markov Chains", Probability in the Engineering and Informational Sciences, 1994.
  4. M.P. Desai, VB Rao, "Finite-Time Behavior of Slowly Cooled Annealing Chains", Probability in the Engineering and Informational Sciences 1997.
  5. M.P. Desai, "Some results characterizing the finite time behaviour of the simulated annealing algorithm," Sadhana, vol. 24, pp. 317-337, 1999.
  6. Desai, M. Manjunath, D. "On the connectivity in finite ad hoc networks," IEEE Communications Letters, Oct 2002.
  7. Madhav Desai, D. Manjunath "On Range Matrices and Wireless Networks in d Dimensions", Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05), 2005.
  8. Madhav P. Desai, "On Cycles in Random Graphs," Arxiv arXiv:1009.6046, 2010.

Madhav Desai, December 30, 2010

Devices and CircuitsSelected List of PublicationsDesign AutomationProbabilistic algorithms and graph theoryContents