Optimal Algorithms

1. Packet routing on grids of processors

   • Manfred Kunde

   Pages 254-265

2. Optimal parallel computations for halin graphs

   • Krzysztof Diks, Wojciech Rytter

   Pages 266-273

3. Optimal parallel algorithms for b-matchings in trees

   • Constantine N. K. Osiakwan, Selim G. Akl

   Pages 274-308

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.

• Equivalence
• Finite
• Geometrische Algorithmen
• Graphenalgorithmen
• Komplexität von Algorithmen
• Parallele Algrithmen
• Probabilistisches Rechnen
• algorithm
• algorithms
• automata
• complexity
• data structure
• geometry
• optimization
• algorithm analysis and problem complexity
• data structures

Policies and ethics