PH.D. DISSERTATIONS SUPERVISED

1970-1971 R.M. Keller
  "Closures of Parallel Program Schemata"
   
1971-1972 Y. Silva-Filho
  "Two Methods for Solving Large Linear Programs"
   
  A. Weintraub
  "A Primal Approach to Network Flow Problems with Convex Costs"
   
  J. Goffin
  "On the Finite Convergence of the Relaxation Method for Solving Systems of Inequalities"
   
  N. Zadeh
  "On the Computational Difficulty of Network Flow Problems"
   
  S. Kundu
 
"Studies in Graph Theory: 1. Partial Squares of Trees
  2. Factorization of Graphs"
   
1973-1974 Anne Cottrell
  "A Lower Bound for the Scholz-Brauer Problem"
   
1975-1976 Kellogg Booth
  "PQ-Tree Algorithms"
   
1977-1978 Robert MacGregor
  "On Partitioning a Graph: A Theoretical and Empirical Study"
   
1978-1979 Thomas Schaefer
  "Complexity of Combinatorial Games"
   
1979-1980 D. Gusfield
  "Sensitivity Analysis for Combinatorial Optimization"
   
1980-1981 Pedro Gazmuri
  "Probabilistic Analysis of Packing, Coloring and Scheduling Problems"
   
  Barbara Simons
  "Scheduling Jobs with Release Times and Deadlines"
   
1981-1982 Rubin Johnson
  "Some Combinatorial Aspects of Network Reliability"
   
1982-1983 Faith Fich
  "Two Problems in Concrete Complexity-Cycle Detection and Parallel Prefix Computation"
   
  Narendra Karmarkar
  "Coping with NP-Hard Problems"
   
1983-1984 Ron Shamir
  "On Efficiency of the Simplex Method"
   
  Kathleen O'Hara
  "Structure and Complexity of the Involution Principle for Partitions"
   
  Michael Luby
  "Monte-Carlo Methods for Estimating System Reliability"
   
  James Richardson
  "Synchronizing Concurrent Access to Shared Data"
   
1985-1986 Howard Karloff
  "Fast Parallel Algorithms for Graph-Theoretic Problems: Matching, Coloring and Partitioning"
   
1986-1987 Prabhakar Ragde
  "Lower Bounds for Parallel Computation"
   
  Jon Frankle
  "Circuit Placement Methods Using Multiple Eigenvectors and Linear Probe Techniques"
   
1987-1988 Danny Soroker
  "Fast Parallel Algorithms for Graphs and Networks"
   
  Valerie King
  "The Complexity of Graph Properties"
   
1988-1989 Rajeev Motwani
  "Probabilistic Analysis of Network Flow Algorithms"
   
  Noam Nisan
  "Complexity of Pseudorandom Number Generation"
   
1989-1990 Sally Floyd
  "On Space-Bounded Learning and the Vapnik-Chervonenkis Dimension"
   
  Phil Gibbons
  "The Asynchronous PRAM: A Semi-Synchronous Model for Shared Memory MIMD Machines"
   
  Lisa Hellerstein
  "On Characterizing and Learning Some Classes of Read-Once Functions"
   
  Yanjun Zhang
  "Parallel Algorithms for Combinatorial Search Problems"
   
1990-1991 Sandra Irani
  "Competitive Algorithms for On-Line Paging and Graph Coloring"
   
1992-1993 Lee Newberg
  "Finding, Evaluating and Counting DNA Physical Maps"
   
1994-1995 Eunice Santos
  "Studies of Parallel Complexity Within the LogP Model"
   
  Abhijit Sahay
  "Models of Parallel Computation"
   
2000-2001 Daniel Fasulo
  `Algorithms for DNA Restriction Mapping'
   
  George W. Hartzell III
  "An Assessment of Genome Annotation Tools and an Approach to Solving a Set of Problems from the Human Genome Project"
   
2003-2004 Eric Xing
  "Probabilistic Graphical Models and Algorithms for Genomic Analysis"

Back to top

Last updated 10/15/04