↓ Skip to main content

Algorithms--ESA 2007 : 15th annual European symposium, Eilat, Israel, October 8-10, 2007 : proceedings

Overview of attention for book
Cover of 'Algorithms--ESA 2007 : 15th annual European symposium, Eilat, Israel, October 8-10, 2007 : proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Nash Equilibria: Where We Stand
  3. Altmetric Badge
    Chapter 2 Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
  4. Altmetric Badge
    Chapter 3 Arrangements in Geometry: Recent Advances and Challenges
  5. Altmetric Badge
    Chapter 4 Nash Equilibria in Voronoi Games on Graphs
  6. Altmetric Badge
    Chapter 5 Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation
  7. Altmetric Badge
    Chapter 6 Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
  8. Altmetric Badge
    Chapter 7 Finding Frequent Elements in Non-bursty Streams
  9. Altmetric Badge
    Chapter 8 Tradeoffs and Average-Case Equilibria in Selfish Routing
  10. Altmetric Badge
    Chapter 9 On the Variance of Subset Sum Estimation
  11. Altmetric Badge
    Chapter 10 On Minimum Power Connectivity Problems
  12. Altmetric Badge
    Chapter 11 On the Cost of Interchange Rearrangement in Strings
  13. Altmetric Badge
    Chapter 12 Finding Mobile Data: Efficiency vs. Location Inaccuracy
  14. Altmetric Badge
    Chapter 13 A Faster Query Algorithm for the Text Fingerprinting Problem
  15. Altmetric Badge
    Chapter 14 Polynomial Time Algorithms for Minimum Energy Scheduling
  16. Altmetric Badge
    Chapter 15 k-Mismatch with Don’t Cares
  17. Altmetric Badge
    Chapter 16 Finding Branch-Decompositions and Rank-Decompositions
  18. Altmetric Badge
    Chapter 17 Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
  19. Altmetric Badge
    Chapter 18 Linear-Time Ranking of Permutations
  20. Altmetric Badge
    Chapter 19 Radix Sorting with No Extra Space
  21. Altmetric Badge
    Chapter 20 Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
  22. Altmetric Badge
    Chapter 21 Order Statistics in the Farey Sequences in Sublinear Time
  23. Altmetric Badge
    Chapter 22 New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
  24. Altmetric Badge
    Chapter 23 Dial a Ride from k-Forest
  25. Altmetric Badge
    Chapter 24 Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
  26. Altmetric Badge
    Chapter 25 Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
  27. Altmetric Badge
    Chapter 26 Optimal Algorithms for k-Search with Application in Option Pricing
  28. Altmetric Badge
    Chapter 27 Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
  29. Altmetric Badge
    Chapter 28 Stackelberg Strategies for Atomic Congestion Games
  30. Altmetric Badge
    Chapter 29 Good Quality Virtual Realization of Unit Ball Graphs
  31. Altmetric Badge
    Chapter 30 Algorithms for Playing Games with Limited Randomness
  32. Altmetric Badge
    Chapter 31 Approximation of Partial Capacitated Vertex Cover
  33. Altmetric Badge
    Chapter 32 Optimal Resilient Dynamic Dictionaries
  34. Altmetric Badge
    Chapter 33 Determining the Smallest k Such That G Is k-Outerplanar
  35. Altmetric Badge
    Chapter 34 On the Size of Succinct Indices
  36. Altmetric Badge
    Chapter 35 Compact Oracles for Approximate Distances Around Obstacles in the Plane
  37. Altmetric Badge
    Chapter 36 Convex Combinations of Single Source Unsplittable Flows
  38. Altmetric Badge
    Chapter 37 Farthest-Polygon Voronoi Diagrams
  39. Altmetric Badge
    Chapter 38 Equitable Revisited
  40. Altmetric Badge
    Chapter 39 Online Scheduling of Equal-Length Jobs on Parallel Machines
  41. Altmetric Badge
    Chapter 40 k-Anonymization with Minimal Loss of Information
  42. Altmetric Badge
    Chapter 41 A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
  43. Altmetric Badge
    Chapter 42 Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling
  44. Altmetric Badge
    Chapter 43 Bundle Pricing with Comparable Items
  45. Altmetric Badge
    Chapter 44 Approximating Interval Scheduling Problems with Bounded Profits
  46. Altmetric Badge
    Chapter 45 Pricing Tree Access Networks with Connected Backbones
  47. Altmetric Badge
    Chapter 46 Distance Coloring
  48. Altmetric Badge
    Chapter 47 An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
  49. Altmetric Badge
    Chapter 48 To Fill or Not to Fill: The Gas Station Problem
  50. Altmetric Badge
    Chapter 49 Online Bandwidth Allocation
  51. Altmetric Badge
    Chapter 50 Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
  52. Altmetric Badge
    Chapter 51 On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
  53. Altmetric Badge
    Chapter 52 Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
  54. Altmetric Badge
    Chapter 53 Dynamic Plane Transitive Closure
  55. Altmetric Badge
    Chapter 54 Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
  56. Altmetric Badge
    Chapter 55 Estimating Clustering Indexes in Data Streams
  57. Altmetric Badge
    Chapter 56 Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
  58. Altmetric Badge
    Chapter 57 Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
  59. Altmetric Badge
    Chapter 58 Fast and Compact Oracles for Approximate Distances in Planar Graphs
  60. Altmetric Badge
    Chapter 59 Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
  61. Altmetric Badge
    Chapter 60 A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
  62. Altmetric Badge
    Chapter 61 Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
  63. Altmetric Badge
    Chapter 62 Fast Lowest Common Ancestor Computations in Dags
  64. Altmetric Badge
    Chapter 63 A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
  65. Altmetric Badge
    Chapter 64 Solutions to Real-World Instances of PSPACE-Complete Stacking
  66. Altmetric Badge
    Chapter 65 Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
  67. Altmetric Badge
    Chapter 66 An Experimental Study of New and Known Online Packet Buffering Algorithms
Attention for Chapter 13: A Faster Query Algorithm for the Text Fingerprinting Problem
Altmetric Badge
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
A Faster Query Algorithm for the Text Fingerprinting Problem
Chapter number 13
Book title
Algorithms – ESA 2007
Published by
Springer, Berlin, Heidelberg, October 2007
DOI 10.1007/978-3-540-75520-3_13
Book ISBNs
978-3-54-075519-7, 978-3-54-075520-3
Authors

Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang