↓ Skip to main content

Randomization and Approximation Techniques in Computer Science

Overview of attention for book
Cover of 'Randomization and Approximation Techniques in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Disjoint Paths in Expander Graphs via Random Walks: a Short Survey
  3. Altmetric Badge
    Chapter 2 A Derandomization Using Min-Wise Independent Permutations
  4. Altmetric Badge
    Chapter 3 An Algorithmic Embedding of Graphs via Perfect Matchings
  5. Altmetric Badge
    Chapter 4 Deterministic Hypergraph Coloring and Its Applications
  6. Altmetric Badge
    Chapter 5 On the Derandomization of Space-Bounded Computations
  7. Altmetric Badge
    Chapter 6 Talagrand’s Inequality and Locality in Distributed Computing
  8. Altmetric Badge
    Chapter 7 On-line Bin-Stretching
  9. Altmetric Badge
    Chapter 8 Combinatorial Linear Programming: Geometry Can Help
  10. Altmetric Badge
    Chapter 9 A Note on Bounding the Mixing Time by Linear Programming
  11. Altmetric Badge
    Chapter 10 Robotic Exploration, Brownian Motion and Electrical Resistance
  12. Altmetric Badge
    Chapter 11 Fringe analysis of synchronized parallel algorithms on 2–3 trees
  13. Altmetric Badge
    Chapter 12 On Balls and Bins with Deletions
  14. Altmetric Badge
    Chapter 13 “Balls into Bins” — A Simple and Tight Analysis
  15. Altmetric Badge
    Chapter 14 Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs
  16. Altmetric Badge
    Chapter 15 Using Approximation Hardness to Achieve Dependable Computation
  17. Altmetric Badge
    Chapter 16 Complexity of Sequential Pattern Matching Algorithms
  18. Altmetric Badge
    Chapter 17 A Random Server Model for Private Information Retrieval
  19. Altmetric Badge
    Chapter 18 Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)
  20. Altmetric Badge
    Chapter 19 Randomized Lower Bounds for Online Path Coloring
  21. Altmetric Badge
    Chapter 20 Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
  22. Altmetric Badge
    Chapter 21 On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem
  23. Altmetric Badge
    Chapter 22 A High Performance Approximate Algorithm for the Steiner Problem in Graphs
  24. Altmetric Badge
    Chapter 23 Random Geometric Problems on [0, 1] 2
  25. Altmetric Badge
    Chapter 24 A Role of Constraint in Self-Organization
  26. Altmetric Badge
    Chapter 25 Constructive Bounds and Exact Expectations for the Random Assignment Problem
  27. Altmetric Badge
    Chapter 26 The “Burnside Process” Converges Slowly
  28. Altmetric Badge
    Chapter 27 Quicksort Again Revisited
  29. Altmetric Badge
    Chapter 28 Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
  30. Altmetric Badge
    Chapter 29 Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
Attention for Chapter 12: On Balls and Bins with Deletions
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
11 Mendeley
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
On Balls and Bins with Deletions
Chapter number 12
Book title
Randomization and Approximation Techniques in Computer Science
Published in
Lecture notes in computer science, June 1999
DOI 10.1007/3-540-49543-6_12
Book ISBNs
978-3-54-065142-0, 978-3-54-049543-7
Authors

Cole, Richard, Frieze, Alan, Maggs, Bruce M., Mitzenmacher, Michael, Richa, Andréa W., Sitaraman, Ramesh, Upfal, Eli, Richard Cole, Alan Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman, Eli Upfal

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Canada 1 9%
Unknown 10 91%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 45%
Other 1 9%
Student > Master 1 9%
Researcher 1 9%
Professor > Associate Professor 1 9%
Other 0 0%
Unknown 2 18%
Readers by discipline Count As %
Computer Science 6 55%
Earth and Planetary Sciences 1 9%
Psychology 1 9%
Engineering 1 9%
Unknown 2 18%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 11 November 2022.
All research outputs
#7,571,329
of 23,090,520 outputs
Outputs from Lecture notes in computer science
#2,492
of 8,146 outputs
Outputs of similar age
#10,962
of 35,501 outputs
Outputs of similar age from Lecture notes in computer science
#3
of 6 outputs
Altmetric has tracked 23,090,520 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,146 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 35,501 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 9th percentile – i.e., 9% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 6 others from the same source and published within six weeks on either side of this one. This one has scored higher than 3 of them.