Volume 14; Issue 4

Algorithmica

Volume 14; Issue 4
1

A 2n−2 step algorithm for routing in ann×narray with constant-size queues

T. Leighton, F. Makedon, I. G. Tollis
Journal:
Algorithmica
Year:
1995
Language:
english
File:
PDF, 740 KB
english, 1995
2

Balancing minimum spanning trees and shortest-path trees

S. Khuller, B. Raghavachari, N. Young
Journal:
Algorithmica
Year:
1995
Language:
english
File:
PDF, 897 KB
english, 1995
3

Bottom-up mergesort — A detailed analysis

W. Panny, H. Prodinger
Journal:
Algorithmica
Year:
1995
Language:
english
File:
PDF, 547 KB
english, 1995
4

Finding all periods and initial palindromes of a string in parallel

D. Breslauer, Z. Galil
Journal:
Algorithmica
Year:
1995
Language:
english
File:
PDF, 718 KB
english, 1995
5

An efficient parallel algorithm for shortest paths in planar layered digraphs

S. Subramanian, R. Tamassia, J. S. Vitter
Journal:
Algorithmica
Year:
1995
Language:
english
File:
PDF, 942 KB
english, 1995