Optimal Algorithms
Springer Berlin (Verlag)
978-3-540-51859-4 (ISBN)
Randomization in parallel algorithms and its impact on computational geometry.- There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees.- Computing digitized voronoi diagrams on a systolic screen and applications to clustering.- PRAM algorithms for identifying polygon similarity.- A framework for parallel graph algorithm design.- Fast soliton automata.- An upper bound on the order of locally testable deterministic finite automata.- A fast algorithm to decide on simple grammars equivalence.- Complexity of the parallel Givens factorization on shared memory architectures.- Optimal bounds on the dictionary problem.- Optimal constant space move-to-fear list organization.- Improved bounds on the size of separators of toroidal graphs.- On some properties of (a,b)-trees.- Disassembling two-dimensional composite parts via translations.- Which triangulations approximate the complete graph?.- The approximability of problems complete for P.- A structural overview of NP optimization problems.- Sorting within distance bound on a mesh-connected processor array.- Local insertion sort revisited.- Packet routing on grids of processors.- Optimal parallel computations for halin graphs.- Optimal parallel algorithms for b-matchings in trees.
Erscheint lt. Verlag | 8.11.1989 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VIII, 312 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 580 g |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Informatik ► Theorie / Studium ► Algorithmen | |
Mathematik / Informatik ► Mathematik | |
Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • Automata • Complexity • data structure • data structures • Equivalence • Finite • Geometrische Algorithmen • Geometry • Graphenalgorithmen • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Komplexität (Kybern.) • Komplexität von Algorithmen • Optimierung • Optimization • Parallele Algrithmen • Paralleler Algorithmus • Probabilistisches Rechnen |
ISBN-10 | 3-540-51859-2 / 3540518592 |
ISBN-13 | 978-3-540-51859-4 / 9783540518594 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich