J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. The University Series in Higher Mathematics. Van Nostrand, Princeton, NJ, 1966. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Random Walks with "Back Buttons" - Fagin, Karlin, Kleinberg, Raghavan.. (2000) (2 citations) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. The University Series in Higher Mathematics. Van Nostrand, Princeton, NJ, 1966.
The Griffiths Singularity Random Field - Aernout Van Enter (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov chains (Second Edition, Springer-Verlag, 1976).
Title Sequence compaction for power estimation: theory and .. - Authors Radu Marculescu (Correct)
No context found.
G. Kemeny, J. L. Snell, and A. W. Knapp, `Denumerable Markov Chains', D.Van Nostrand Company, Inc., 1966.
Verifying Nondeterministic Probabilistic Channel.. - Baier, Bertrand.. (2005) (Correct)
No context found.
KEMENY, J. G., SNELL, J. L., AND KNAPP, A. W. 1966. Denumerable Markov Chains. D. Van Nostrand Co., Princeton, NJ, USA.
A Note on the Attractor-Property - Of Infinite-State Markov (Correct)
No context found.
J. G. Kemeny, J. L. Snell, A. W. Knapp, Denumerable Markov Chains, D. Van Nostrand Co., Princeton, NJ, USA, 1966.
Nash Equilibrium for Upward-Closed Objectives - Chatterjee (2005) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Reachability Objectives - Krishnendu Chatterjee Luca (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Trace-Driven Steady-State Probability Estimation in.. - Marculescu.. (1998) (3 citations) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp, `Denumerable Markov Chains', D.Van Nostrand Company, Inc., 1966.
Constrained Markov Decision Processes - Altman (1999) (23 citations) (Correct)
No context found.
J. G. Kemeney, J. L. Snell and A. W. Knapp (1976), Denumerable Markov Chains, Springer-Verlag.
Constrained Markov Decision Processes with Total Cost Criteria.. - Altman (1995) (2 citations) (Correct)
No context found.
J. G. Kemeney, J. L. Snell and A. W. Knapp, Denumerable Markov Chains, SpringerVerlag, 1976.
Analytic Perturbation Theory and its Applications - Avrachenkov (1999) (2 citations) (Correct)
No context found.
J.G. Kemeny, J.L. Snell and A.W. Knapp, Denumerable Markov Chains, D. Van Nostrand Company Inc., Toronto, 1966.
Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2005) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Springer-Verlag, New York, 2nd edition, 1976.
Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2005) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp, Denumerable Markov Chains, Springer-Verlag, New York, 2nd edition, 1976.
Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2004) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp, Denumerable Markov Chains, SpringerVerlag, New York, 2nd edition, 1976.
Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2005) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Springer-Verlag, New York, 2nd edition, 1976.
Model Checking Discounted Temporal Properties - de Alfaro, Faella, Henzinger, .. (2003) (2 citations) (Correct)
No context found.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Van Nostrand, 1966.
Decision Algorithms for Probabilistic Bisimulation - Cattani, Segala (2002) (2 citations) (Correct)
No context found.
J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer-Verlag, second edition, 1976.
Implementation of Symbolic Model Checking for Probabilistic.. - Parker (1999) (5 citations) (Correct)
No context found.
J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Model Checking for Probability and Time: From Theory to Practice - Kwiatkowska (2003) (6 citations) (Correct)
No context found.
J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Faster and Symbolic CTMC Model Checking - Katoen, Kwiatkowska, Norman.. (2001) (6 citations) (Correct)
No context found.
J. Kemeny, J. Snell and A. Knapp. Denumerable Markov Chains. Van Nostrand, 1966.
Automatic Verification of the IEEE-1394 Root Contention.. - Daws, Kwiatkowska.. (2002) (2 citations) (Correct)
No context found.
J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
PCTL model checking of symbolic probabilistic - Systems Marta Kwiatkowska (Correct)
No context found.
J. G. Kemeny, J. L. Snell, and A. W Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
Performance Analysis of Probabilistic Timed - Automata Using Digital (Correct)
No context found.
J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
Implementation of Symbolic Model Checking for Probabilistic Systems - Parker (2002) (5 citations) (Correct)
No context found.
J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
Randomized Dining Philosophers without Fairness Assumption - Duflot, al. (2004) (1 citation) (Correct)
No context found.
J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. D. van Nostrand Co., 1966.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC