Sold Out
Book Categories |
Foreword | ||
Preface | ||
On simulating a Markov chain stationary distribution when transition probabilities are unknown | 1 | |
A note on network reliability | 11 | |
Rectangular arrays with fixed margins | 15 | |
Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics | 43 | |
The move-to-front rule for self-organizing lists with Markov dependent requests | 57 | |
The asymptotic lower bound on the diagonal Ramsey numbers: A closer look | 81 | |
Random walks and undirected graph connectivity: A survey | 95 | |
Sidon sets with small gaps | 103 | |
Variations on the monotone subsequence theme of Erdos and Szekeres | 111 | |
Randomised approximation schemes for Tutte-Grothendieck invariants | 133 | |
Quasi-additive Euclidean functionals | 149 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionDiscrete Probability and Algorithms
X
This Item is in Your InventoryDiscrete Probability and Algorithms
X
You must be logged in to review the productsX
X
X
Add Discrete Probability and Algorithms, Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are, Discrete Probability and Algorithms to the inventory that you are selling on WonderClubX
X
Add Discrete Probability and Algorithms, Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are, Discrete Probability and Algorithms to your collection on WonderClub |