Home Page: Pradyut Shah

Pradyut Shah

Research Interests

My research interests are in the broad field of computational complexity. My primary research consists of obtaining lower bounds for combinatorial algorithms. I'm also interested in explicit constructions of combinatorial objects and issues related to randomness in computation.

Publications

Pradyut Shah, Lower Bounds for Parallel Computation, PhD Thesis.
Ketan Mulmuley and Pradyut Shah, A Lower bound on Computing Blocking Flows in Graphs, Technical Report.
Ketan Mulmuley and Pradyut Shah, A Lower bound on the Shortest Path Problem,
(to appear in Journal of Computer and System Sciences).