On Parallel Searching
From MaRDI portal
Recommendations
Cited in
(53)- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Effect of data organization in a system of interleaved memories on the performance of parallel search
- Parallel searching of multidimensional cubes
- Parallel multiple search
- Polynomial terse sets
- Separating the power of EREW and CREW PRAMs with small communication width
- Ramsey numbers by stochastic algorithms with new heuristics
- The complexity of parallel search
- Fast integer merging on the EREW PRAM
- Fast integer merging on the EREW PRAM
- The complexity of parallel prefix problems on small domains
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
- An insight on PRAM computational bounds
- Simultaneous Search
- On separating the EREW and CREW PRAM models
- Heaps with bits
- Parallel algorithms for nevanlinna-pick interpolation:the scalar case∗
- Parallel exhaustive search without coordination
- Improving the efficiency of parallel minimum spanning tree algorithms
- Optimal merging and sorting on the EREW PRAM
- scientific article; zbMATH DE number 2068040 (Why is no real title available?)
- A complexity theory of efficient parallel algorithms
- Effect of parallelism on the efficiency of binary tree search.
- Parallel random access machines with bounded memory wordsize
- Optimal cooperative search in fractional cascaded data structures
- Routing, merging, and sorting on parallel models of computation
- Searching Semisorted Tables
- scientific article; zbMATH DE number 512895 (Why is no real title available?)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- Parallel strategies for direct multisearch
- Restricted CRCW PRAMs
- Parallel searching in generalized Monge arrays
- Blocking in parallel multisearch problems
- Modelling and search complexity in multiprocessor Systems
- A Binary Search with a Parallel Recovery of the Bits
- Space-efficient parallel merging
- scientific article; zbMATH DE number 865205 (Why is no real title available?)
- Pipelined search on coarse grained networks
- scientific article; zbMATH DE number 3843145 (Why is no real title available?)
- Unbounded Searching Algorithms
- scientific article; zbMATH DE number 176084 (Why is no real title available?)
- scientific article; zbMATH DE number 3860406 (Why is no real title available?)
- PRAMs with variable word-size
- Limits on the power of concurrent-write parallel machines
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs
- Parallel processing can be harmful: The unusual behavior of interpolation search
- A fast algorithm for scalar Nevanlinna-Pick interpolation
- An O(n+k) algorithm for ordered retrieval from an associative memory
- Piled-Slab Searches
- Incomparability in parallel computation
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
- Separating the power of EREW and CREW PRAMs with small communication width
This page was built for publication: On Parallel Searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746899)
