↓ 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 Interactive Proofs for Quantum Computation
  3. Altmetric Badge
    Chapter 2 Drawing Plane Graphs
  4. Altmetric Badge
    Chapter 3 Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve
  5. Altmetric Badge
    Chapter 4 A Dynamic Dictionary for Priced Information with Application
  6. Altmetric Badge
    Chapter 5 Voronoi Diagram in the Flow Field
  7. Altmetric Badge
    Chapter 6 Polygonal Path Approximation: A Query Based Approach
  8. Altmetric Badge
    Chapter 7 A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs
  9. Altmetric Badge
    Chapter 8 Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees
  10. Altmetric Badge
    Chapter 9 Hotlink Enhancement Algorithms for Web Directories
  11. Altmetric Badge
    Chapter 10 Finding a Length-Constrained Maximum-Density Path in a Tree
  12. Altmetric Badge
    Chapter 11 The Intractability of Computing the Hamming Distance
  13. Altmetric Badge
    Chapter 12 Infinitely-Often Autoreducible Sets
  14. Altmetric Badge
    Chapter 13 Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem
  15. Altmetric Badge
    Chapter 14 Computational Complexity Measures of Multipartite Quantum Entanglement
  16. Altmetric Badge
    Chapter 15 A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs
  17. Altmetric Badge
    Chapter 16 Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem
  18. Altmetric Badge
    Chapter 17 Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
  19. Altmetric Badge
    Chapter 18 A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem
  20. Altmetric Badge
    Chapter 19 The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
  21. Altmetric Badge
    Chapter 20 Non-interactive Quantum Perfect and Statistical Zero-Knowledge
  22. Altmetric Badge
    Chapter 21 Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
  23. Altmetric Badge
    Chapter 22 A Faster Lattice Reduction Method Using Quantum Search
  24. Altmetric Badge
    Chapter 23 Three Sorting Algorithms Using Priority Queues
  25. Altmetric Badge
    Chapter 24 Lower Bounds on Correction Networks
  26. Altmetric Badge
    Chapter 25 Approximate Regular Expression Searching with Arbitrary Integer Weights
  27. Altmetric Badge
    Chapter 26 Constructing Compressed Suffix Arrays with Large Alphabets
  28. Altmetric Badge
    Chapter 27 On the Geometric Dilation of Finite Point Sets
  29. Altmetric Badge
    Chapter 28 On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
  30. Altmetric Badge
    Chapter 29 Optimal Point Set Projections onto Regular Grids
  31. Altmetric Badge
    Chapter 30 An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas
  32. Altmetric Badge
    Chapter 31 A Faster Algorithm for Two-Variable Integer Programming
  33. Altmetric Badge
    Chapter 32 Efficient Algorithms for Generation of Combinatorial Covering Suites
  34. Altmetric Badge
    Chapter 33 A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags
  35. Altmetric Badge
    Chapter 34 On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates
  36. Altmetric Badge
    Chapter 35 Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes
  37. Altmetric Badge
    Chapter 36 Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome
  38. Altmetric Badge
    Chapter 37 Settling the Intractability of Multiple Alignment
  39. Altmetric Badge
    Chapter 38 Efficient Algorithms for Optimizing Whole Genome Alignment with Noise
  40. Altmetric Badge
    Chapter 39 Segmenting Doughnut-Shaped Objects in Medical Images
  41. Altmetric Badge
    Chapter 40 On the Locality Properties of Space-Filling Curves
  42. Altmetric Badge
    Chapter 41 Geometric Restrictions on Producible Polygonal Protein Chains
  43. Altmetric Badge
    Chapter 42 Symmetric Layout of Disconnected Graphs
  44. Altmetric Badge
    Chapter 43 Approximation hardness of minimum edge dominating set and minimum maximal matching
  45. Altmetric Badge
    Chapter 44 Enumerating Global Roundings of an Outerplanar Graph
  46. Altmetric Badge
    Chapter 45 Augmenting Forests to Meet Odd Diameter Requirements
  47. Altmetric Badge
    Chapter 46 On the Existence and Determination of Satisfactory Partitions in a Graph
  48. Altmetric Badge
    Chapter 47 A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model
  49. Altmetric Badge
    Chapter 48 An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees
  50. Altmetric Badge
    Chapter 49 The Student-Project Allocation Problem
  51. Altmetric Badge
    Chapter 50 Algorithms for Enumerating Circuits in Matroids
  52. Altmetric Badge
    Chapter 51 A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model
  53. Altmetric Badge
    Chapter 52 Succinct Data Structures for Searchable Partial Sums
  54. Altmetric Badge
    Chapter 53 Range Mode and Range Median Queries on Lists and Trees
  55. Altmetric Badge
    Chapter 54 Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests
  56. Altmetric Badge
    Chapter 55 New Ways to Construct Binary Search Trees
  57. Altmetric Badge
    Chapter 56 Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
  58. Altmetric Badge
    Chapter 57 Biconnectivity on Symbolically Represented Graphs: A Linear Solution
  59. Altmetric Badge
    Chapter 58 A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs
  60. Altmetric Badge
    Chapter 59 Deterministic Algorithm for the t-Threshold Set Problem
  61. Altmetric Badge
    Chapter 60 Energy-Efficient Wireless Network Design
  62. Altmetric Badge
    Chapter 61 Wavelength Conversion in Shortest-Path All-Optical Networks
  63. Altmetric Badge
    Chapter 62 A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
  64. Altmetric Badge
    Chapter 63 Flexible Train Rostering
  65. Altmetric Badge
    Chapter 64 Counting Complexity Classes over the Reals I: The Additive Case
  66. Altmetric Badge
    Chapter 65 Some Properties of One-Pebble Turing Machines with Sublogarithmic Space
  67. Altmetric Badge
    Chapter 66 Hypergraph Decomposition and Secret Sharing
  68. Altmetric Badge
    Chapter 67 A Promising Key Agreement Protocol
  69. Altmetric Badge
    Chapter 68 Rapid Mixing of Several Markov Chains for a Hard-Core Model
  70. Altmetric Badge
    Chapter 69 Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
  71. Altmetric Badge
    Chapter 70 Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View —
  72. Altmetric Badge
    Chapter 71 Equilibria for Networks with Malicious Users
  73. Altmetric Badge
    Chapter 72 Quasi-optimal Arithmetic for Quaternion Polynomials
  74. Altmetric Badge
    Chapter 73 Upper Bounds on the Complexity of Some Galois Theory Problems
  75. Altmetric Badge
    Chapter 74 Unfolded Modular Multiplication
  76. Altmetric Badge
    Chapter 75 Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages

Readers on

mendeley
5 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.
Title
Algorithms and Computation
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/b94771
ISBNs
978-3-54-020695-8, 978-3-54-024587-2
Editors

Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 2 40%
Librarian 1 20%
Researcher 1 20%
Unknown 1 20%
Readers by discipline Count As %
Mathematics 1 20%
Computer Science 1 20%
Economics, Econometrics and Finance 1 20%
Social Sciences 1 20%
Unknown 1 20%