Parallel searching of multidimensional cubes

DOI10.1016/0012-365X(93)90381-3MaRDI QIDQ685702zbMATH OpenOpenAlexFDO

Authors Miklos Santha, Umesh V. Vazirani

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90381-3

zbMATH Keywords

lower boundssearchingmultidimensional cube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Parallel searching in the plane
• On Parallel Searching
• Parallel searching in generalized Monge arrays
• Parallel searching on \(m\) rays
• Parallel multiple search
• The complexity of parallel search
• scientific article; zbMATH DE number 4078826
• Parallel strategies for direct multisearch
• Parallel Algorithms and Subcube Embedding on a Hypercube

Cites work

• Parallelism in Comparison Problems
• Routing, merging, and sorting on parallel models of computation
• Searching ordered structures

Cited in

(10)

• Searching ordered structures
• scientific article; zbMATH DE number 3916017 (Why is no real title available?)
• Effect of parallelism on the efficiency of binary tree search.
• More Efficient Parallel Totally Monotone Matrix Searching
• Parallel searching in generalized Monge arrays
• Modelling and search complexity in multiprocessor Systems
• Parallel strategies for direct multisearch
• scientific article; zbMATH DE number 4057020 (Why is no real title available?)
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
• Searching monotone multi-dimensional arrays

This page was built for publication: Parallel searching of multidimensional cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685702)