Prakash Panangaden, PhD
Affiliations: | 1980 | Physics | University of Wisconsin-Milwaukee, Milwaukee, WI |
| 1996- | Computer Science | McGill University, Montreal, QC, Canada |
Google:
"Prakash Panangaden"Parents
Sign in to add mentor| Leonard Emanuel Parker | grad student | 1980 | UW-Milwaukee | |
| (Quantum Field Theory in Curved Spacetime) | ||||
Children
Sign in to add trainee| Charles Elkan | grad student | 1990 | Cornell |
| Josee Desharnais | grad student | 2000 | McGill |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Balle B, Panangaden P, Precup D. (2019) Singular value automata and approximate minimization Mathematical Structures in Computer Science. 29: 1444-1478 |
| Clerc F, Fijalkow N, Klin B, et al. (2019) Expressiveness of probabilistic modal logics: A gradual approach Information & Computation. 267: 145-163 |
| Chen L, Clerc F, Panangaden P. (2019) Bisimulation for Feller-Dynkin Processes Electronic Notes in Theoretical Computer Science. 347: 45-63 |
| Gagné N, Panangaden P. (2018) A Categorical Characterization of Relative Entropy on Standard Borel Spaces Electronic Notes in Theoretical Computer Science. 336: 135-153 |
| Chaput P, Danos V, Panangaden P, et al. (2014) Approximating markov processes by averaging Journal of the Acm. 61 |
| Kozen D, Mardare R, Panangaden P. (2014) A metrized duality theorem for markov processes Electronic Notes in Theoretical Computer Science. 308: 211-227 |
| Blute R, Panangaden P, Slavnov S. (2012) Deep inference and probabilistic coherence spaces Applied Categorical Structures. 20: 209-228 |
| Ferns N, Panangaden P, Precup D. (2011) Bisimulation metrics for continuous Markov decision processes Siam Journal On Computing. 40: 1662-1714 |
| Blute R, Panangaden P. (2011) Proof nets as formal feynman diagrams Lecture Notes in Physics. 813: 437-466 |
| Desharnais J, Gupta V, Jagadeesan R, et al. (2010) Weak bisimulation is sound and complete for pCTL* Information and Computation. 208: 203-219 |