Sciweavers

Share
5 search results - page 1 / 1
» swat 1992
Sort
View
SWAT
1992
Springer
104views Algorithms» more  SWAT 1992»
9 years 6 months ago
Low-Diameter Graph Decomposition is in NC
We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
9 years 6 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
9 years 6 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
SWAT
1992
Springer
111views Algorithms» more  SWAT 1992»
9 years 6 months ago
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
9 years 6 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
books