↓ 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 8: Sidon Sets with Small Gaps
Altmetric Badge

Citations

dimensions_citation
17 Dimensions
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Sidon Sets with Small Gaps
Chapter number 8
Book title
Discrete Probability and Algorithms
Published by
Springer, New York, NY, January 1995
DOI 10.1007/978-1-4612-0801-3_8
Book ISBNs
978-1-4612-6905-2, 978-1-4612-0801-3
Authors

Joel Spencer, Prasad Tetali

View on publisher site

This page is provided by Altmetric.