Prabhakar Ragde

After completing his Ph.D., Professor Prabhakar Ragde held an NSERC Postdoctoral Fellowship at the University of Toronto from 1986 to 1988. In 1997-98, he was a Visiting Associate Professor at Simon Fraser University in Burnaby, British Columbia.

Professor Ragde's work addresses problems for which there is evidence (such as NP-completeness) of intractability in sequential or parallel computation environments, but which may admit efficient solutions for special cases. Problems defined on linear structures such as paths and branching structures such as trees often permit the application of classic algorithm design techniques such as greedy algorithms or dynamic programming. However, these structures may be too narrowly defined.

Professor Ragde is also interested in the theory and practice of functional programming and its relationship to persistent data structures and concurrent algorithms.