↓ Skip to main content

SWAT 90

Overview of attention for book
Cover of 'SWAT 90'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 73 Structural complexity theory: Recent surprises
  3. Altmetric Badge
    Chapter 74 Approximating maximum independent sets by excluding subgraphs
  4. Altmetric Badge
    Chapter 75 Generating sparse spanners for weighted graphs
  5. Altmetric Badge
    Chapter 76 Finding the k smallest spanning trees
  6. Altmetric Badge
    Chapter 77 The file distribution problem for processor networks
  7. Altmetric Badge
    Chapter 78 Translating polygons with applications to hidden surface removal
  8. Altmetric Badge
    Chapter 79 Output-sensitive generation of the perspective view of isothetic parallelepipeds
  9. Altmetric Badge
    Chapter 80 Graphics in flatland revisited
  10. Altmetric Badge
    Chapter 81 The visibility diagram: A data structure for visibility problems and motion planning
  11. Altmetric Badge
    Chapter 82 Fast updating of well-balanced trees
  12. Altmetric Badge
    Chapter 83 How to update a balanced binary tree with a constant number of rotations
  13. Altmetric Badge
    Chapter 84 Ranking trees generated by rotations
  14. Altmetric Badge
    Chapter 85 Expected behaviour analysis of AVL trees
  15. Altmetric Badge
    Chapter 86 Analysis of the expected search cost in skip lists
  16. Altmetric Badge
    Chapter 87 Lower bounds for monotonic list labeling
  17. Altmetric Badge
    Chapter 88 Sorting shuffled monotone sequences
  18. Altmetric Badge
    Chapter 89 A faster parallel algorithm for a matrix searching problem
  19. Altmetric Badge
    Chapter 90 A rectilinear steiner minimal tree algorithm for convex point sets
  20. Altmetric Badge
    Chapter 91 Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
  21. Altmetric Badge
    Chapter 92 Input-sensitive compliant motion in the plane
  22. Altmetric Badge
    Chapter 93 Fast algorithms for greedy triangulation
  23. Altmetric Badge
    Chapter 94 Star unfolding of a polytope with applications
  24. Altmetric Badge
    Chapter 95 Space-sweep algorithms for parametric optimization
  25. Altmetric Badge
    Chapter 96 Approximating finite weighted point sets by hyperplanes
  26. Altmetric Badge
    Chapter 97 Data structures for Traveling Salesmen
  27. Altmetric Badge
    Chapter 98 Efficient parallel algorithms for shortest paths in planar graphs
  28. Altmetric Badge
    Chapter 99 The pathwidth and treewidth of cographs
  29. Altmetric Badge
    Chapter 100 Canonical representations of partial 2-and 3-trees
  30. Altmetric Badge
    Chapter 101 On matroids and hierarchical graphs
  31. Altmetric Badge
    Chapter 102 Fast algorithms for two dimensional and multiple pattern matching
  32. Altmetric Badge
    Chapter 103 Boyer-Moore approach to approximate string matching
  33. Altmetric Badge
    Chapter 104 Complete problems with L-samplable distributions
  34. Altmetric Badge
    Chapter 105 Upper envelope onion peeling
  35. Altmetric Badge
    Chapter 106 Applications of a semi-dynamic convex hull algorithm
  36. Altmetric Badge
    Chapter 107 Intersection queries in sets of disks
  37. Altmetric Badge
    Chapter 108 Dynamic partition trees
Attention for Chapter 88: Sorting shuffled monotone sequences
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (60th percentile)

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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
Sorting shuffled monotone sequences
Chapter number 88
Book title
SWAT 90
Published in
Lecture notes in computer science, January 1990
DOI 10.1007/3-540-52846-6_88
Book ISBNs
978-3-54-052846-3, 978-3-54-047164-6
Authors

Christos Levcopoulos, Ola Petersson, Levcopoulos, Christos, Petersson, Ola

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 100%
Readers by discipline Count As %
Computer Science 2 100%
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 12 March 2012.
All research outputs
#12,853,567
of 22,663,969 outputs
Outputs from Lecture notes in computer science
#3,773
of 8,123 outputs
Outputs of similar age
#45,301
of 57,901 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 5 outputs
Altmetric has tracked 22,663,969 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 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 52% 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 57,901 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 21st percentile – i.e., 21% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 5 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