scientific article
From MaRDI portal
Publication:4036581
zbMath0769.68036MaRDI QIDQ4036581
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)
Related Items
Fine-grained secure computation ⋮ The parallel complexity of growth models ⋮ Fast and optimal simulations between CRCW PRAMs ⋮ The log-star revolution ⋮ Parallel Weighted Random Sampling ⋮ On a compaction theorem of Ragde ⋮ Efficient sampling of random permutations ⋮ Randomized range-maxima in nearly-constant parallel time ⋮ Randomization helps to perform independent tasks reliably ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Algorithm 947
