↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Efficient text searching of regular expressions
  3. Altmetric Badge
    Chapter 2 Efficient spatial point location
  4. Altmetric Badge
    Chapter 3 Constructing the Voronoi diagram of a set of line segments in parallel
  5. Altmetric Badge
    Chapter 4 Analysis of k d t -trees: K d-trees improved by local reorganisations
  6. Altmetric Badge
    Chapter 5 Optimal algorithms for List Indexing and Subset Rank
  7. Altmetric Badge
    Chapter 6 The Delaunay triangulation closely approximates the complete Euclidean graph
  8. Altmetric Badge
    Chapter 7 Computing the furthest site voronoi diagram for a set of discs
  9. Altmetric Badge
    Chapter 8 Fully persistent arrays
  10. Altmetric Badge
    Chapter 9 String searching algorithms revisited
  11. Altmetric Badge
    Chapter 10 Optimal channel placement for multi-terminal nets
  12. Altmetric Badge
    Chapter 11 Computing the minimum visible vertex distance between two polygons
  13. Altmetric Badge
    Chapter 12 Computing the kernel of a point set in a polygon
  14. Altmetric Badge
    Chapter 13 Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs
  15. Altmetric Badge
    Chapter 14 Linear time algorithms for computing reachability regions from polygonal figures
  16. Altmetric Badge
    Chapter 15 Computing the center of area of a polygon
  17. Altmetric Badge
    Chapter 16 Weighted orthogonal linear L ∞ -approximation and applications
  18. Altmetric Badge
    Chapter 17 Discs and other related data structures
  19. Altmetric Badge
    Chapter 18 Digital data structures and order statistics
  20. Altmetric Badge
    Chapter 19 On the performance of orthogonal range queries in multiattribute and doubly chained trees
  21. Altmetric Badge
    Chapter 20 Probabilistic analysis of algorithms and data structures
  22. Altmetric Badge
    Chapter 21 Stabbing parallel segments with a convex polygon
  23. Altmetric Badge
    Chapter 22 Selecting the Kth largest-area convex polygon
  24. Altmetric Badge
    Chapter 23 Finding All Shortest Path Edge Sequences on a convex polyhedron
  25. Altmetric Badge
    Chapter 24 Linear algorithms for parity path and two path problems on circular-arc graph
  26. Altmetric Badge
    Chapter 25 NC algorithms for circular-arc graphs
  27. Altmetric Badge
    Chapter 26 Parallel algorithms for the subgraph homeomorphism problem
  28. Altmetric Badge
    Chapter 27 Galleries, light matchings and visibility graphs
  29. Altmetric Badge
    Chapter 28 Weighted visibility graphs of bars and related flow problems
  30. Altmetric Badge
    Chapter 29 Parallel algorithms for cographs recognition and applications
  31. Altmetric Badge
    Chapter 30 Dynamic data structures for series parallel digraphs
  32. Altmetric Badge
    Chapter 31 Motion planning in the CL -environment
  33. Altmetric Badge
    Chapter 32 Self-adjusting k -ary search trees
  34. Altmetric Badge
    Chapter 33 Improving partial rebuilding by using simple balance criteria
  35. Altmetric Badge
    Chapter 34 An efficient all-parses systolic algorithm for general context-free parsing
  36. Altmetric Badge
    Chapter 35 A polynomial time algorithm for the local testability problem of deterministic finite automata
  37. Altmetric Badge
    Chapter 36 Skip lists: A probabilistic alternative to balanced trees
  38. Altmetric Badge
    Chapter 37 A fast algorithm for melding splay trees
  39. Altmetric Badge
    Chapter 38 An efficient algorithm for finding all maximal square blocks in a matrix
  40. Altmetric Badge
    Chapter 39 Complexity issues in tree-based version control
  41. Altmetric Badge
    Chapter 40 Structured NC
  42. Altmetric Badge
    Chapter 41 Heapsort—Adapted for presorted files
  43. Altmetric Badge
    Chapter 42 The distribution of keys in a binary heap
  44. Altmetric Badge
    Chapter 43 Optimal hypercube algorithms for labeled images
  45. Altmetric Badge
    Chapter 44 On the complexity of single row routing problems
  46. Altmetric Badge
    Chapter 45 A new search time update time tradeoff for the implicit dictionary
  47. Altmetric Badge
    Chapter 46 Sorting with minimum data movement (preliminary draft)
  48. Altmetric Badge
    Chapter 47 Augmentation problems on hierarchically defined graphs
  49. Altmetric Badge
    Chapter 48 On linear time minor tests and depth first search
  50. Altmetric Badge
    Chapter 49 Combinatorial and computational results for line arrangements in space
Attention for Chapter 33: Improving partial rebuilding by using simple balance criteria
Altmetric Badge

Mentioned by

4 Wikipedia pages


1 Dimensions

Readers on

7 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
Improving partial rebuilding by using simple balance criteria
Chapter number 33
Book title
Algorithms and Data Structures
Published in
Lecture notes in computer science, August 1989
DOI 10.1007/3-540-51542-9_33
Book ISBNs
978-3-54-051542-5, 978-3-54-048237-6

Arne Andersson, Andersson, Arne

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 29%
Professor 1 14%
Student > Bachelor 1 14%
Student > Master 1 14%
Professor > Associate Professor 1 14%
Other 0 0%
Unknown 1 14%
Readers by discipline Count As %
Computer Science 5 71%
Engineering 1 14%
Unknown 1 14%
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 19 December 2019.
All research outputs
of 22,785,242 outputs
Outputs from Lecture notes in computer science
of 8,124 outputs
Outputs of similar age
of 14,183 outputs
Outputs of similar age from Lecture notes in computer science
of 2 outputs
Altmetric has tracked 22,785,242 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,124 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 55% 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 14,183 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 2 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them