↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Discrete Probability and Algorithms
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown
Altmetric Badge
Chapter 2
A Note on Network Reliability
Altmetric Badge
Chapter 3
Rectangular Arrays with Fixed Margins
Altmetric Badge
Chapter 4
Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
Altmetric Badge
Chapter 5
The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
Altmetric Badge
Chapter 6
The Asymptotic Lower Bound on the Diagonal Ramsey Numbers: A Closer Look
Altmetric Badge
Chapter 7
Random Walks and Undirected Graph Connectivity: A Survey
Altmetric Badge
Chapter 8
Sidon Sets with Small Gaps
Altmetric Badge
Chapter 9
Variations on the Monotone Subsequence Theme of Erdös and Szekeres
Altmetric Badge
Chapter 10
Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
Altmetric Badge
Chapter 11
Quasi-Additive Euclidean Functionals
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
news
1
news outlet
syllabi
1
institution with syllabi
wikipedia
1
Wikipedia page
Citations
dimensions_citation
17
Dimensions
Readers on
mendeley
25
Mendeley
Book overview
1. On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown
2. A Note on Network Reliability
3. Rectangular Arrays with Fixed Margins
4. Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
5. The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
6. The Asymptotic Lower Bound on the Diagonal Ramsey Numbers: A Closer Look
7. Random Walks and Undirected Graph Connectivity: A Survey
8. Sidon Sets with Small Gaps
9. Variations on the Monotone Subsequence Theme of Erdös and Szekeres
10. Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
11. Quasi-Additive Euclidean Functionals
Summary
News
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
2
syllabi from
1
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Unknown
2
Unknown