ANSV problem on BSRs

DOI10.1016/S0020-0190(97)00214-7zbMath1338.68284OpenAlexW2075964408MaRDI QIDQ293212

Kazuo Ushijima, Limin Xiang

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002147?np=y

zbMATH Keywords

parallel algorithmsbroadcasting with selective reductionall nearest smaller values

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Parallel searching in generalized Monge arrays
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: ANSV problem on BSRs