Parallel searching in generalized Monge arrays

DOI10.1007/PL00009175zbMath0895.68028OpenAlexW2032090055MaRDI QIDQ1386363

Dina Kravets, Sandeep Sen, James K. Park, Alok Aggarwal

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009175

zbMATH Keywords

Monge arraysCREW-PRAM algorithmshypercubic networkssearching problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer system organization (68M99) Distributed algorithms (68W15)

Related Items

ANSV problem on BSRs ⋮ Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon ⋮ Perspectives of Monge properties in optimization ⋮ Monge and feasibility sequences in general flow problems ⋮ A faster parallel algorithm for a matrix searching problem