Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Panangaden, Prakash"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating Markov processes by averaging
Philippe Chaput
,
Vincent Danos
,
Prakash Panangaden
,
Gordon Plotkin
Journal of the ACM
61
(1), 2014, pp. 5: 1-45
Causality in physics and computation
Prakash Panangaden
Theoretical Computer Science
546
, 2014, pp. 10-16
Strong completeness for Markovian logics
Dexter Kozen
,
Radu Mardare
,
Prakash Panangaden
Lecture Notes in Computer Science
8087
, 2013, pp. 655-666
Taking it to the limit: Approximate reasoning for Markov processes
Kim Guldstrand Larsen
,
Radu Mardare
,
Prakash Panangaden
Lecture Notes in Computer Science
7464
, 2012, pp. 681-692
Bisimulation metrics for continuous Markov decision processes
Norm Ferns
,
Prakash Panangaden
,
Doina Precup
SIAM Journal on Computing
40
(6), 2011, pp. 1662-1714
Weak bisimulation is sound and complete for pCTL
Josée Desharnais
,
Vineet Gupta
,
Radha Jagadeesan
,
Prakash Panangaden
Information and Computation
208
(2), 2010, pp. 203-219
Approximating Markov processes by averaging
Philippe Chaput
,
Vincent Danos
,
Prakash Panangaden
,
Gordon Plotkin
Lecture Notes in Computer Science
5556
, 2009, pp. 127-138
Anonymity protocols as noisy channels
Konstantinos Chatzikokolakis
,
Catuscia Palamidessi
,
Prakash Panangaden
Information and Computation
206
(2-4), 2008, pp. 378-401
The measurement calculus
Vincent Danos
,
Elham Kashefi
,
Prakash Panangaden
Journal of the ACM
54
(2), 2007, pp. 8: 1-45
Bisimulation and cocongruence for probabilistic systems
Vincent Danos
,
Josée Desharnais
,
François Laviolette
,
Prakash Panangaden
Information and Computation
204
(4), 2006, pp. 503-523
The one way to quantum computation
Vincent Danos
,
Elham Kashefi
,
Prakash Panangaden
Lecture Notes in Computer Science
4052
, 2006, pp. 13-21
Reasoning about quantum knowledge
Ellie D'Hondt
,
Prakash Panangaden
Lecture Notes in Computer Science
3821
, 2005, pp. 553-564
Metrics for labelled Markov processes
Josée Desharnais
,
Vineet Gupta
,
Radha Jagadeesan
,
Prakash Panangaden
Theoretical Computer Science
318
(3), 2004, pp. 323-354
Approximating labelled Markov processes
Josée Desharnais
,
Vineet Gupta
,
Radha Jagadeesan
,
Prakash Panangaden
Information and Computation
184
(1), 2003, pp. 160-200
Bisimulation for labelled Markov processes
Josée Desharnais
,
Abbas Edalat
,
Prakash Panangaden
Information and Computation
179
(2), 2002, pp. 163-193
Measure and probability for concurrency theorists
Prakash Panangaden
Theoretical Computer Science
253
(2), 2001, pp. 287-309
On the expressive power of first-order Boolean function in PCF
Riccardo Pucella
,
Prakash Panangaden
Theoretical Computer Science
266
(1-2), 2001, pp. 543-567
Generating irregular partitionable data structures
Prakash Panangaden
,
Clark Verbrugge
Theoretical Computer Science
238
(1-2), 2000, pp. 31-80
The expressive power of indeterminate primitives in asynchronous computation
Prakash Panangaden
Lecture Notes in Computer Science
1026
, 1995, pp. 124-150
The logical structure of concurrent constraint programming languages
Prakash Panangaden
Lecture Notes in Computer Science
836
, 1994, pp. 129
Nonexpressibility of fairness and signaling
David McAllester
,
Prakash Panangaden
,
Vasant Shanbhogue
Journal of Computer and System Sciences
47
(2), 1993, pp. 287-321
The expressive power of indeterminate dataflow primitives
Prakash Panangaden
,
Vasant Shanbhogue
Information and Computation
98
(1), 1992, May, pp. 99-131
The expressive power of delay operators in SCCS
Carol Critchlow
,
Prakash Panangaden
Acta Informatica
28
, 1991, pp. 447-452
A domain-theoretic model for a higher-order process calculus
Radha Jagadeesan
,
Prakash Panangaden
Lecture Notes in Computer Science
443
, 1990, pp. 181-194
Stability and sequentiality in dataflow networks
Prakash Panangaden
,
Vasant Shanbhogue
,
Eugene W. Stark
Lecture Notes in Computer Science
443
, 1990, pp. 308-321
Seiten 1
2
>