↓ Skip to main content
What is this page? Embed badge

Discrete Probability and Algorithms

Overview of attention for book
Cover of 'Discrete Probability and Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown
  3. Altmetric Badge
    Chapter 2 A Note on Network Reliability
  4. Altmetric Badge
    Chapter 3 Rectangular Arrays with Fixed Margins
  5. Altmetric Badge
    Chapter 4 Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics
  6. Altmetric Badge
    Chapter 5 The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests
  7. Altmetric Badge
    Chapter 6 The Asymptotic Lower Bound on the Diagonal Ramsey Numbers: A Closer Look
  8. Altmetric Badge
    Chapter 7 Random Walks and Undirected Graph Connectivity: A Survey
  9. Altmetric Badge
    Chapter 8 Sidon Sets with Small Gaps
  10. Altmetric Badge
    Chapter 9 Variations on the Monotone Subsequence Theme of Erdös and Szekeres
  11. Altmetric Badge
    Chapter 10 Randomised Approximation Schemes for Tutte-Gröthendieck Invariants
  12. Altmetric Badge
    Chapter 11 Quasi-Additive Euclidean Functionals
Attention for Chapter 9: Variations on the Monotone Subsequence Theme of Erdös and Szekeres
Altmetric Badge

Citations

dimensions_citation
17 Dimensions

Readers on

mendeley
7 Mendeley
Summary Dimensions citations
So far, Dimensions has found 17 publications that cite this research output.

17

The most recent citing publications are shown below. View all 17 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.