Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
From MaRDI portal
Publication:4302288
DOI10.1137/S0097539790184298zbMath0938.68879OpenAlexW2028325745MaRDI QIDQ4302288
Publication date: 14 August 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539790184298
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
The deterministic complexity of parallel multisearch ⋮ Optimal, output-sensitive algorithms for constructing planar hulls in parallel ⋮ Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model ⋮ Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
This page was built for publication: Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
