Parallel searching of multidimensional cubes

DOI10.1016/0012-365X(93)90381-3zbMATH Open0802.68038OpenAlexW2049177452MaRDI QIDQ685702FDOQ685702

Umesh V. Vazirani, Miklos Santha

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

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
• Parallel strategies for direct multisearch
• Parallel Algorithms and Subcube Embedding on a Hypercube

zbMATH Keywords

lower boundssearchingmultidimensional cube

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Searching ordered structures
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
• Parallel strategies for direct multisearch
• Parallel searching in generalized Monge arrays
• Modelling and search complexity in multiprocessor Systems
• More Efficient Parallel Totally Monotone Matrix Searching
• Title not available (Why is that?)
• Title not available (Why is that?)

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)