↓ Skip to main content

Algorithms and Computation

Overview of attention for book
Cover of 'Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
  3. Altmetric Badge
    Chapter 2 Some Constrained Notions of Planarity
  4. Altmetric Badge
    Chapter 3 Reachability Problems on Directed Graphs
  5. Altmetric Badge
    Chapter 4 Greedy Construction of 2-Approximation Minimum Manhattan Network
  6. Altmetric Badge
    Chapter 5 The Complexity of Minimum Convex Coloring
  7. Altmetric Badge
    Chapter 6 On the Complexity of Reconfiguration Problems
  8. Altmetric Badge
    Chapter 7 Multiobjective Disk Cover Admits a PTAS
  9. Altmetric Badge
    Chapter 8 Data Stream Algorithms via Expander Graphs
  10. Altmetric Badge
    Chapter 9 Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
  11. Altmetric Badge
    Chapter 10 Optimal Key Tree Structure for Deleting Two or More Leaves
  12. Altmetric Badge
    Chapter 11 Comparing First-Fit and Next-Fit for Online Edge Coloring
  13. Altmetric Badge
    Chapter 12 Selecting Sums in Arrays
  14. Altmetric Badge
    Chapter 13 Succinct and I/O Efficient Data Structures for Traversal in Trees
  15. Altmetric Badge
    Chapter 14 Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
  16. Altmetric Badge
    Chapter 15 Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
  17. Altmetric Badge
    Chapter 16 The Isolation Game: A Game of Distances
  18. Altmetric Badge
    Chapter 17 On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
  19. Altmetric Badge
    Chapter 18 The Complexity of Rationalizing Matchings
  20. Altmetric Badge
    Chapter 19 A Game Theoretic Approach for Efficient Graph Coloring
  21. Altmetric Badge
    Chapter 20 Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
  22. Altmetric Badge
    Chapter 21 An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
  23. Altmetric Badge
    Chapter 22 On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
  24. Altmetric Badge
    Chapter 23 An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
  25. Altmetric Badge
    Chapter 24 The Balanced Edge Cover Problem
  26. Altmetric Badge
    Chapter 25 Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
  27. Altmetric Badge
    Chapter 26 A New Algorithm for Finding Trees with Many Leaves
  28. Altmetric Badge
    Chapter 27 Faster Parameterized Algorithms for Minimum Fill-In
  29. Altmetric Badge
    Chapter 28 Graph Layout Problems Parameterized by Vertex Cover
  30. Altmetric Badge
    Chapter 29 A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
  31. Altmetric Badge
    Chapter 30 How to Guard a Graph?
  32. Altmetric Badge
    Chapter 31 Tree Decontamination with Temporary Immunity
  33. Altmetric Badge
    Chapter 32 Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
  34. Altmetric Badge
    Chapter 33 Squaring the Circle with Weak Mobile Robots
  35. Altmetric Badge
    Chapter 34 Evaluation of General Set Expressions
  36. Altmetric Badge
    Chapter 35 Computing with Priced Information: When the Value Makes the Price
  37. Altmetric Badge
    Chapter 36 Deductive Inference for the Interiors and Exteriors of Horn Theories
  38. Altmetric Badge
    Chapter 37 Leaf Powers and Their Properties: Using the Trees
  39. Altmetric Badge
    Chapter 38 Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
  40. Altmetric Badge
    Chapter 39 Minimizing Total Flow-Time: The Unrelated Case
  41. Altmetric Badge
    Chapter 40 Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
  42. Altmetric Badge
    Chapter 41 Space-Efficient Informational Redundancy
  43. Altmetric Badge
    Chapter 42 Minkowski Sum Selection and Finding
  44. Altmetric Badge
    Chapter 43 Constructing the Simplest Possible Phylogenetic Network from Triplets
  45. Altmetric Badge
    Chapter 44 New Results on Optimizing Rooted Triplets Consistency
  46. Altmetric Badge
    Chapter 45 A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
  47. Altmetric Badge
    Chapter 46 Inducing Polygons of Line Arrangements
  48. Altmetric Badge
    Chapter 47 Free-Form Surface Partition in 3-D
  49. Altmetric Badge
    Chapter 48 Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
  50. Altmetric Badge
    Chapter 49 Preprocessing Imprecise Points and Splitting Triangulations
  51. Altmetric Badge
    Chapter 50 Efficient Output-Sensitive Construction of Reeb Graphs
  52. Altmetric Badge
    Chapter 51 Signature Theory in Holographic Algorithms
  53. Altmetric Badge
    Chapter 52 The Complexity of SPP Formula Minimization
  54. Altmetric Badge
    Chapter 53 Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
  55. Altmetric Badge
    Chapter 54 Negation-Limited Inverters of Linear Size
  56. Altmetric Badge
    Chapter 55 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
  57. Altmetric Badge
    Chapter 56 A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
  58. Altmetric Badge
    Chapter 57 Detecting Commuting Patterns by Clustering Subtrajectories
  59. Altmetric Badge
    Chapter 58 On the Stretch Factor of Convex Delaunay Graphs
  60. Altmetric Badge
    Chapter 59 Covering a Simple Polygon by Monotone Directions
  61. Altmetric Badge
    Chapter 60 On the Stability of Web Crawling and Web Search
  62. Altmetric Badge
    Chapter 61 Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
  63. Altmetric Badge
    Chapter 62 Computing Frequency Dominators and Related Problems
  64. Altmetric Badge
    Chapter 63 Computing Best Swaps in Optimal Tree Spanners
  65. Altmetric Badge
    Chapter 64 Covering a Point Set by Two Disjoint Rectangles
  66. Altmetric Badge
    Chapter 65 Computing the Maximum Detour of a Plane Graph in Subquadratic Time
  67. Altmetric Badge
    Chapter 66 Finding Long Paths, Cycles and Circuits
  68. Altmetric Badge
    Chapter 67 Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
  69. Altmetric Badge
    Chapter 68 On Labeled Traveling Salesman Problems
  70. Altmetric Badge
    Chapter 69 Navigating in a Graph by Aid of Its Spanning Tree
  71. Altmetric Badge
    Chapter 70 Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
  72. Altmetric Badge
    Chapter 71 Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
  73. Altmetric Badge
    Chapter 72 Bandwidth of Bipartite Permutation Graphs
  74. Altmetric Badge
    Chapter 73 König Deletion Sets and Vertex Covers above the Matching Size
  75. Altmetric Badge
    Chapter 74 Independent Sets of Maximum Weight in Apple-Free Graphs
  76. Altmetric Badge
    Chapter 75 Enumeration of Perfect Sequences of Chordal Graph
  77. Altmetric Badge
    Chapter 76 From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
  78. Altmetric Badge
    Chapter 77 New Results on the Most Significant Bit of Integer Multiplication
  79. Altmetric Badge
    Chapter 78 Sorting with Complete Networks of Stacks
  80. Altmetric Badge
    Chapter 79 Algorithms and Computation
  81. Altmetric Badge
    Chapter 80 Algorithms and Computation
  82. Altmetric Badge
    Chapter 81 Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
Attention for Chapter 14: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
Altmetric Badge

About this Attention Score

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

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
18 Mendeley
citeulike
2 CiteULike
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
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
Chapter number 14
Book title
Algorithms and Computation
Published in
Lecture notes in computer science, January 2008
DOI 10.1007/978-3-540-92182-0_14
Book ISBNs
978-3-54-092181-3, 978-3-54-092182-0
Authors

Puglisi, Simon J., Turpin, Andrew, Simon J. Puglisi, Andrew Turpin

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Russia 1 6%
Unknown 17 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 6 33%
Researcher 3 17%
Professor 2 11%
Student > Master 2 11%
Student > Postgraduate 2 11%
Other 3 17%
Readers by discipline Count As %
Computer Science 13 72%
Environmental Science 2 11%
Agricultural and Biological Sciences 2 11%
Unknown 1 6%
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 28 August 2012.
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
#45,181
of 170,389 outputs
Outputs of similar age from Lecture notes in computer science
#38
of 86 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 170,389 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 17th percentile – i.e., 17% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 86 others from the same source and published within six weeks on either side of this one. This one is in the 32nd percentile – i.e., 32% of its contemporaries scored the same or lower than it.