↓ Skip to main content

Efficient Algorithms

Overview of attention for book
Cover of 'Efficient Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Building Mathematics-Based Software Systems to Advance Science and Create Knowledge
  3. Altmetric Badge
    Chapter 2 On Negations in Boolean Networks
  4. Altmetric Badge
    Chapter 3 The Lovász Local Lemma and Satisfiability
  5. Altmetric Badge
    Chapter 4 Kolmogorov-Complexity Based on Infinite Computations
  6. Altmetric Badge
    Chapter 5 Pervasive Theory of Memory
  7. Altmetric Badge
    Chapter 6 Introducing Quasirandomness to Computer Science
  8. Altmetric Badge
    Chapter 7 Reflections on Optimal and Nearly Optimal Binary Search Trees
  9. Altmetric Badge
    Chapter 8 Some Results for Elementary Operations
  10. Altmetric Badge
    Chapter 9 Maintaining Ideally Distributed Random Search Trees without Extra Space
  11. Altmetric Badge
    Chapter 10 A Pictorial Description of Cole’s Parallel Merge Sort
  12. Altmetric Badge
    Chapter 11 Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction
  13. Altmetric Badge
    Chapter 12 Algorithms for Energy Saving
  14. Altmetric Badge
    Chapter 13 Minimizing Average Flow-Time
  15. Altmetric Badge
    Chapter 14 Integer Linear Programming in Computational Biology
  16. Altmetric Badge
    Chapter 15 Via Detours to I/O-Efficient Shortest Paths
  17. Altmetric Badge
    Chapter 16 The Computational Geometry of Comparing Shapes
  18. Altmetric Badge
    Chapter 17 Finding Nearest Larger Neighbors
  19. Altmetric Badge
    Chapter 18 Multi-core Implementations of Geometric Algorithms
  20. Altmetric Badge
    Chapter 19 The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
  21. Altmetric Badge
    Chapter 20 On Map Labeling with Leaders
  22. Altmetric Badge
    Chapter 21 The Crossing Number of Graphs: Theory and Computation
  23. Altmetric Badge
    Chapter 22 Algorithm Engineering – An Attempt at a Definition
  24. Altmetric Badge
    Chapter 23 Of What Use Is Floating-Point Arithmetic in Computational Geometry?
  25. Altmetric Badge
    Chapter 24 Car or Public Transport—Two Worlds
  26. Altmetric Badge
    Chapter 25 Is the World Linear?
  27. Altmetric Badge
    Chapter 26 In Praise of Numerical Computation
  28. Altmetric Badge
    Chapter 27 Much Ado about Zero
  29. Altmetric Badge
    Chapter 28 Polynomial Precise Interval Analysis Revisited
Attention for Chapter 9: Maintaining Ideally Distributed Random Search Trees without Extra Space
Altmetric Badge

Citations

dimensions_citation
3 Dimensions
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
Maintaining Ideally Distributed Random Search Trees without Extra Space
Chapter number 9
Book title
Efficient Algorithms
Published in
ADS, January 2009
DOI 10.1007/978-3-642-03456-5_9
Book ISBNs
978-3-64-203455-8, 978-3-64-203456-5
Authors

Raimund Seidel