↓ 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 Piecewise-Linear Approximations of Uncertain Functions
  3. Altmetric Badge
    Chapter 2 A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
  4. Altmetric Badge
    Chapter 3 On the Area Requirements of Euclidean Minimum Spanning Trees
  5. Altmetric Badge
    Chapter 4 Multi-target Ray Searching Problems
  6. Altmetric Badge
    Chapter 5 Convex Transversals
  7. Altmetric Badge
    Chapter 6 How to Cover a Point Set with a V-Shape of Minimum Width
  8. Altmetric Badge
    Chapter 7 Witness Rectangle Graphs
  9. Altmetric Badge
    Chapter 8 Faster Optimal Algorithms for Segment Minimization with Small Maximal Value
  10. Altmetric Badge
    Chapter 9 Orthogonal Cartograms with Few Corners Per Face
  11. Altmetric Badge
    Chapter 10 Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
  12. Altmetric Badge
    Chapter 11 Feedback Vertex Set in Mixed Graphs
  13. Altmetric Badge
    Chapter 12 Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
  14. Altmetric Badge
    Chapter 13 Frequency Capping in Online Advertising
  15. Altmetric Badge
    Chapter 14 Adjacency-Preserving Spatial Treemaps
  16. Altmetric Badge
    Chapter 15 Register Loading via Linear Programming
  17. Altmetric Badge
    Chapter 16 Connecting a Set of Circles with Minimum Sum of Radii
  18. Altmetric Badge
    Chapter 17 Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
  19. Altmetric Badge
    Chapter 18 New Algorithms for 1-D Facility Location and Path Equipartition Problems
  20. Altmetric Badge
    Chapter 19 Multicut in Trees Viewed through the Eyes of Vertex Cover
  21. Altmetric Badge
    Chapter 20 Beyond Triangulation: Covering Polygons with Triangles
  22. Altmetric Badge
    Chapter 21 Lossless Fault-Tolerant Data Structures with Additive Overhead
  23. Altmetric Badge
    Chapter 22 Binary Identification Problems for Weighted Trees
  24. Altmetric Badge
    Chapter 23 Computing the Fréchet Distance between Folded Polygons
  25. Altmetric Badge
    Chapter 24 Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
  26. Altmetric Badge
    Chapter 25 Path Minima Queries in Dynamic Weighted Trees
  27. Altmetric Badge
    Chapter 26 On Rectilinear Partitions with Minimum Stabbing Number
  28. Altmetric Badge
    Chapter 27 Flattening Fixed-Angle Chains Is Strongly NP-Hard
  29. Altmetric Badge
    Chapter 28 An O(n log n) Algorithm for a Load Balancing Problem on Paths
  30. Altmetric Badge
    Chapter 29 Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees
  31. Altmetric Badge
    Chapter 30 Flow Computations on Imprecise Terrains
  32. Altmetric Badge
    Chapter 31 Tracking Moving Objects with Few Handovers
  33. Altmetric Badge
    Chapter 32 Inducing the LCP-Array
  34. Altmetric Badge
    Chapter 33 Horoball Hulls and Extents in Positive Definite Space
  35. Altmetric Badge
    Chapter 34 Enumerating Minimal Subset Feedback Vertex Sets
  36. Altmetric Badge
    Chapter 35 Upper Bounds for Maximally Greedy Binary Search Trees
  37. Altmetric Badge
    Chapter 36 On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
  38. Altmetric Badge
    Chapter 37 Resilient and Low Stretch Routing through Embedding into Tree Metrics
  39. Altmetric Badge
    Chapter 38 Consistent Labeling of Rotating Maps
  40. Altmetric Badge
    Chapter 39 Finding Longest Approximate Periodic Patterns
  41. Altmetric Badge
    Chapter 40 A (5/3 + ε)-Approximation for Strip Packing
  42. Altmetric Badge
    Chapter 41 Reversing Longest Previous Factor Tables is Hard
  43. Altmetric Badge
    Chapter 42 Space Efficient Data Structures for Dynamic Orthogonal Range Counting
  44. Altmetric Badge
    Chapter 43 Searching in Dynamic Tree-Like Partial Orders
  45. Altmetric Badge
    Chapter 44 Counting Plane Graphs: Flippability and Its Applications
  46. Altmetric Badge
    Chapter 45 Geometric Computations on Indecisive Points
  47. Altmetric Badge
    Chapter 46 Closest Pair and the Post Office Problem for Stochastic Points
  48. Altmetric Badge
    Chapter 47 Competitive Search in Symmetric Trees
  49. Altmetric Badge
    Chapter 48 Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
  50. Altmetric Badge
    Chapter 49 Planar Subgraphs without Low-Degree Nodes
  51. Altmetric Badge
    Chapter 50 Constructing Orthogonal de Bruijn Sequences
  52. Altmetric Badge
    Chapter 51 A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
  53. Altmetric Badge
    Chapter 52 Succinct 2D Dictionary Matching with No Slowdown
  54. Altmetric Badge
    Chapter 53 PTAS for Densest k-Subgraph in Interval Graphs
  55. Altmetric Badge
    Chapter 54 Improved Distance Queries in Planar Graphs
  56. Altmetric Badge
    Chapter 55 Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers
  57. Altmetric Badge
    Chapter 56 Faster Algorithms for Minimum-Link Paths with Restricted Orientations
  58. Altmetric Badge
    Chapter 57 Streaming Algorithms for 2-Coloring Uniform Hypergraphs
  59. Altmetric Badge
    Chapter 58 Density-Constrained Graph Clustering
  60. Altmetric Badge
    Chapter 59 The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
  61. Altmetric Badge
    Chapter 60 Theory vs. Practice in the Design and Analysis of Algorithms
  62. Altmetric Badge
    Chapter 61 A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint
Attention for Chapter 32: Inducing the LCP-Array
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (61st percentile)

Mentioned by

wikipedia
5 Wikipedia pages

Readers on

mendeley
8 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
Inducing the LCP-Array
Chapter number 32
Book title
Algorithms and Data Structures
Published in
Lecture notes in computer science, August 2011
DOI 10.1007/978-3-642-22300-6_32
Book ISBNs
978-3-64-222299-3, 978-3-64-222300-6
Authors

Johannes Fischer

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 13%
Unknown 7 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 25%
Researcher 2 25%
Student > Postgraduate 2 25%
Other 1 13%
Unknown 1 13%
Readers by discipline Count As %
Computer Science 6 75%
Agricultural and Biological Sciences 1 13%
Unknown 1 13%
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 06 February 2014.
All research outputs
#8,759,452
of 25,837,817 outputs
Outputs from Lecture notes in computer science
#2,564
of 8,201 outputs
Outputs of similar age
#48,121
of 133,640 outputs
Outputs of similar age from Lecture notes in computer science
#10
of 77 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. This one is in the 43rd percentile – i.e., 43% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,201 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.2. This one has gotten more attention than average, scoring higher than 53% 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 133,640 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 35th percentile – i.e., 35% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 77 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 61% of its contemporaries.