EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES

DOI10.1142/S0129054103002229zbMath1101.68509OpenAlexW2090919369MaRDI QIDQ5696958

Kshirasagar Naik, David S. L. Wei, Sy-Yen Kuo, Sanguthevar Rajasekaran

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103002229

zbMATH Keywords

hypercubede Bruijn networklarge distributed filesdistributed sortingdistributed selection

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Distributed sorting
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Selection and sorting with limited storage
• A distributed selection algorithm and its expected communication complexity
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Expected time bounds for selection

This page was built for publication: EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES