A fast parallel algorithm for the closest pair problem

DOI10.1016/0020-0190(80)90035-6zbMath0445.68055OpenAlexW2080228175MaRDI QIDQ1145510

Charles R. Dyer

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90035-6

zbMATH Keywords

parallel computationparallel algorithmtime complexityspace complexitybounded cellular array automatonclosest pair problemlog- space pyramid cellular automaton

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item

This page was built for publication: A fast parallel algorithm for the closest pair problem