Meredith J. Goldsmith

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

1995

1 Daniel P. Heyman, Meredith J. Goldsmith: Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. INFORMS Journal on Computing 7(1): 101-108 (1995)

	1995
1		Daniel P. Heyman, Meredith J. Goldsmith: Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. INFORMS Journal on Computing 7(1): 101-108 (1995)

Coauthor Index

1 Daniel P. Heyman [1]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page