Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms'' and ``The finite Markov chain renaissance'' held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993 (Q1897255): Difference between revisions

The articles of this volume will be reviewed individually. Indexed articles: \textit{Aldous, David}, On simulating a Markov chain stationary distribution when transition probabilities are unknown, 1-9 [Zbl 0877.60050] \textit{Alon, Noga}, A note on network reliability, 11-14 [Zbl 0830.60086] \textit{Diaconis, Persi; Gangolli, Anil}, Rectangular arrays with fixed margins, 15-41 [Zbl 0839.05005] \textit{Diaconis, Persi; Holmes, Susan}, Three examples of Monte-Carlo Markov chains: At the interface between statistical computing, computer science, and statistical mechanics, 43-56 [Zbl 0827.60059] \textit{Dobrow, Robert P.; Fill, James Allen}, The move-to-front rule for self-organizing lists with Markov dependent requests, 57-80 [Zbl 0827.60054] \textit{Godbole, Anant P.; Skipper, Daphne E.; Sunley, Rachel A.}, The asymptotic lower bound on the diagonal Ramsey numbers: A closer look, 81-94 [Zbl 0834.05049] \textit{Karlin, Anna R.; Raghavan, Prabhakar}, Random walks and undirected graph connectivity: A survey, 95-101 [Zbl 0830.60062] \textit{Spencer, Joel; Tetali, Prasad}, Sidon sets with small gaps, 103-109 [Zbl 0833.60011] \textit{Steele, J. Michael}, Variations on the monotone subsequence theme of Erdös and Szekeres, 111-131 [Zbl 0832.60012] \textit{Welsh, Dominic}, Randomised approximation schemes for Tutte-Gröthendieck invariants, 133-148 [Zbl 0831.05018] \textit{Yukich, J. E.}, Quasi-additive Euclidean functionals, 149-158 [Zbl 0828.60060]