↓ 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 159 Polynomial equations-solving and its applications
  3. Altmetric Badge
    Chapter 160 Quasi-random combinatorial structures
  4. Altmetric Badge
    Chapter 161 Hamiltonian abstract Voronoi diagrams in linear time
  5. Altmetric Badge
    Chapter 162 Every set of disjoint line segments admits a binary tree
  6. Altmetric Badge
    Chapter 163 The traveling cameraman problem, with applications to automatic optical inspection
  7. Altmetric Badge
    Chapter 164 On determining the congruity of point sets in higher dimensions
  8. Altmetric Badge
    Chapter 165 On random hard sets for NP
  9. Altmetric Badge
    Chapter 166 Computing solutions uniquely collapses the polynomial hierarchy
  10. Altmetric Badge
    Chapter 167 Verifying the determinant in parallel
  11. Altmetric Badge
    Chapter 168 Hardness of approximating graph transformation problem
  12. Altmetric Badge
    Chapter 169 Randomized wait-free naming
  13. Altmetric Badge
    Chapter 170 Unifying themes for network selection
  14. Altmetric Badge
    Chapter 171 Robust asynchronous algorithms in networks with a fault detection ring
  15. Altmetric Badge
    Chapter 172 Distributed algorithms for finding small cycle covers in arbitrary networks
  16. Altmetric Badge
    Chapter 173 A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming
  17. Altmetric Badge
    Chapter 174 Analysis of the convergency of topology preserving neural networks on learning
  18. Altmetric Badge
    Chapter 175 On helping and interactive proof systems
  19. Altmetric Badge
    Chapter 176 Average time complexity of the SAT 1.2 algorithm
  20. Altmetric Badge
    Chapter 177 Average cost to produce partial orders
  21. Altmetric Badge
    Chapter 178 Two notes on low-density subset sum algorithm
  22. Altmetric Badge
    Chapter 179 Rotation distance, triangulations of planar surfaces and hyperbolic geometry
  23. Altmetric Badge
    Chapter 180 Finitely representable spatial objects and efficient computation
  24. Altmetric Badge
    Chapter 181 Computing all small cuts in undirected networks
  25. Altmetric Badge
    Chapter 182 Edge-coloring and f-coloring for various classes of graphs
  26. Altmetric Badge
    Chapter 183 Edge-disjoint paths in permutation graphs
  27. Altmetric Badge
    Chapter 184 Minimum augmentation to k-edge-connect specified vertices of a graph
  28. Altmetric Badge
    Chapter 185 Algorithmic Chernoff-Hoeffding inequalities in integer programming
  29. Altmetric Badge
    Chapter 186 Approximate pattern matching with samples
  30. Altmetric Badge
    Chapter 187 An efficient optimal algorithm for minimizing the overall communication cost in replicated data management
  31. Altmetric Badge
    Chapter 188 Multispace search: A new optimization approach
  32. Altmetric Badge
    Chapter 189 Realizing degree sequences in parallel
  33. Altmetric Badge
    Chapter 190 Efficient sequential and parallel algorithms for the negative cycle problem
  34. Altmetric Badge
    Chapter 191 Fast and efficient operations on Parallel Priority Queues
  35. Altmetric Badge
    Chapter 192 Heaps with bits
  36. Altmetric Badge
    Chapter 193 Components and projections of curves over finite fields
  37. Altmetric Badge
    Chapter 194 On the approximation of finding various minimal, maximal, and consistent sequences
  38. Altmetric Badge
    Chapter 195 A linear-time algorithm for computing characteristic strings
  39. Altmetric Badge
    Chapter 196 The maximum latency and identification of positive Boolean functions
  40. Altmetric Badge
    Chapter 197 Fast deterministic Hot-Potato routing on processor arrays
  41. Altmetric Badge
    Chapter 198 k-pairwise cluster fault tolerant routing in hypercubes
  42. Altmetric Badge
    Chapter 199 On Steiner minimal trees in grid graphs and its application to VLSI routing
  43. Altmetric Badge
    Chapter 200 Optimal routing of permutations on rings
  44. Altmetric Badge
    Chapter 201 Resource bounded randomness and weakly complete problems
  45. Altmetric Badge
    Chapter 202 Deterministic Ω automata vis-a-vis deterministic Buchi automata
  46. Altmetric Badge
    Chapter 203 Quantum computation and NP-complete problems
  47. Altmetric Badge
    Chapter 204 Separability and one-way functions
  48. Altmetric Badge
    Chapter 205 On the approximation of largest common subtrees and largest common point sets
  49. Altmetric Badge
    Chapter 206 An approximation scheme for some Steiner tree problems in the plane
  50. Altmetric Badge
    Chapter 207 A chain decomposition algorithm for the proof of a property on minimum weight triangulations
  51. Altmetric Badge
    Chapter 208 Generating algorithm for quasi-full Steiner tree
  52. Altmetric Badge
    Chapter 209 Analysing deletions in competitive self-adjusting linear list algorithms
  53. Altmetric Badge
    Chapter 210 Are Fibonacci heaps optimal?
  54. Altmetric Badge
    Chapter 211 Simple and efficient graph compression schemes for dense and complement graphs
  55. Altmetric Badge
    Chapter 212 Improved algorithms for coloring random graphs
  56. Altmetric Badge
    Chapter 213 On the parallel complexity of solving recurrence equations
  57. Altmetric Badge
    Chapter 214 Extended graph connectivity and its gradually increasing parallel complexity
  58. Altmetric Badge
    Chapter 215 Parallel h-v drawings of binary trees
  59. Altmetric Badge
    Chapter 216 An efficient parallel strategy for recognizing series-parallel graphs
  60. Altmetric Badge
    Chapter 217 Orthogonal queries in segments and triangles
  61. Altmetric Badge
    Chapter 218 Further computational geometry in secondary memory
  62. Altmetric Badge
    Chapter 219 Shortest safari routes in simple polygons
  63. Altmetric Badge
    Chapter 220 On greedy tetrahedralization of points in 3D
  64. Altmetric Badge
    Chapter 221 The totally-perfect bipartite graph and its construction
  65. Altmetric Badge
    Chapter 222 k Best Cuts for Circular-Arc graphs
  66. Altmetric Badge
    Chapter 223 Revisiting circular arc graphs
  67. Altmetric Badge
    Chapter 224 Weighted irredundance of interval graphs
  68. Altmetric Badge
    Chapter 225 A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
  69. Altmetric Badge
    Chapter 226 On the size of ordered binary decision diagrams representing threshold functions
  70. Altmetric Badge
    Chapter 227 Nonuniform lowness and strong nonuniform lowness
  71. Altmetric Badge
    Chapter 228 Definition and existence of super complexity cores
  72. Altmetric Badge
    Chapter 229 Efficient algorithms for assigning chain-like tasks on a chain-like network computer
  73. Altmetric Badge
    Chapter 230 Manpower scheduling with shift change constraints
  74. Altmetric Badge
    Chapter 231 Fast algorithms for transversal matroid intersection problems
  75. Altmetric Badge
    Chapter 232 A convex hull algorithm on coarse-grained multiprocessor
  76. Altmetric Badge
    Chapter 233 A multiway merging network
  77. Altmetric Badge
    Chapter 234 Reporting and counting intersections of lines within a polygon
  78. Altmetric Badge
    Chapter 235 A new problem in string searching
  79. Altmetric Badge
    Chapter 236 Achieving the shortest clock period by inserting the minimum amount of delay
  80. Altmetric Badge
    Chapter 237 A randomized algorithm to Finite Automata Public Key Cryptosystem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
5 Wikipedia pages

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.
Title
Algorithms and Computation
Published by
Springer Berlin Heidelberg, January 1994
DOI 10.1007/3-540-58325-4
ISBNs
978-3-54-058325-7, 978-3-54-048653-4
Editors

Ding-Zhu Du, Xiang-Sun Zhang

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 %
Professor > Associate Professor 2 100%
Readers by discipline Count As %
Computer Science 2 100%