Ph.D. THESES

Ying Xiao, “QoS Paths Selection in Communication Networks: Approximation Algorithms Based on Mathematical Programming Techniques” Fall 2005.

Ming Shan Su, “Multilevel Adaptive Distributed Diagnosis for Fault Location in a Network of Processors and Design of a Distributed Network Fault Detection System Based on the SNMP Protocol, School of Computer Science, University of Oklahoma, December 2001.

Seth Noble, “Development and Testing of a New Transport Protocol for Multimedia Application”, School of Computer Science, University of Oklahoma, 1999.

Chad Lamb, “Graph Models and Systems Level Testing”, Dept. of ECE, University of Oklahoma, 1997.

T. Ramalingam, “Test Case Generation and Fault Diagnosis Methods for Communication Protocols Based on FSM and EFSM Models”, Electrical and Computer Engineering, Concordia University, Montreal, Canada, Nov. 1994.

R. Chalasani, “Parallel Network Optimization on a Shared Memory Multiprocessor and Application in VLSI Layout Compaction and Wire Balancing”, Electrical and Computer Engineering, Concordia University, Montreal, Canada, May 1994.

K. Huang, “System Level Diagnosis and Wafer Testing,” Electrical and Computer Engineering, McGill University, Montreal, Canada, February 1993. (Co-supervisor: V.K. Agarwal, McGill University, Montreal).

A. Das, “Diagnosability and Diagnosis of Sparsely Interconnected Multiprocessor Systems”, Electrical and Computer Engineering, Concordia University, Montreal, Canada, November, 1989. (Co-supervisor: V.K. Agarwal, McGill University, Montreal)

Patrick Rioux, “Minimum Cost Sizing of Rearrangeable Networks with Multiperiod Demands,” Electrical and Computer Engineering, Concordia University, Montreal, Canada, Feb., 1988. (Co-supervisor: B.T. Smith, Ecole Polytechnic, Montreal).

Marc A. Comeau, “Reachability and Sequencing Problems on Marked Graphs and State Graphs: Algorithms Based on Network Programming,” Electrical Engineering, Concordia University, Montreal, Canada, June 1986.

R. Jayakumar, “Design and Analysis of Graph Algorithms: Spanning Tree Enumeration, Planar Embedding, and Maximal Planarization,” Electrical Engineering, Concordia University, Montreal, Canada, June 1984.

M.G.G. Naidu, “Studies in Resistance n-port Networks and Graphs,” Electrical Engineering Department, I.I.T., Madras, India, 1975.

P. S. Reddy, “Analysis and Synthesis of K- and Y- Matrices of n-port Networks,” Electrical Engineering Department, I.I.T. Madras, India, 1972.

RECENT MASTER’S THESES

Ravi Ravindran, “ Distributed and Sequential Heuristics for QoS Routing in Communication Networks”, School of Computer Science, University of Oklahoma, December 2000.( Now at Nortel Networks, Ottawa, Canada).

I am presently co-advising Ravindran for PhD at Carleton University, Canada.

Venkateswaran S. Chandsrasekharapuram, “ Networked Computing for the Maximum Flow problem”, School of Computer Science, University of Oklahoma, 1997.( Now at Motorola, Chicago)