Jetzt 20% Rabatt auf alle English Books. Jetzt in über 4 Millionen Büchern stöbern und profitieren!
Willkommen, schön sind Sie da!
Logo Ex Libris

Optimal Algorithms

  • Kartonierter Einband
  • 320 Seiten
(0) Erste Bewertung abgeben
Alle Bewertungen ansehen
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel... Weiterlesen
100.00 CHF 80.00
Sie sparen CHF 20.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich


This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.

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.


Titel: Optimal Algorithms
Untertitel: International Symposium. Varna, Bulgaria, May 29-June 2, 1989. Proceedings
EAN: 9783540518594
ISBN: 3540518592
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Anzahl Seiten: 320
Gewicht: 487g
Größe: H235mm x B155mm x T17mm
Jahr: 1989
Untertitel: Englisch
Auflage: 1989

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"