Noisy sort, a memory-intensive sorting algorithm

DOI10.1016/0024-3795(89)90484-9zbMath0666.68064OpenAlexW2090030337MaRDI QIDQ1116704

Susumu Horiguchi, Willard L. Miranker

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90484-9

zbMATH Keywords

sortingparallel algorithmtable-lookup

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Search Algorithms for Associative Memories
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Noisy sort, a memory-intensive sorting algorithm