Optimal Randomized Algorithms for Local Sorting and Set-Maxima
From MaRDI portal
Publication:4032937
Recommendations
- On the deterministic complexity of searching local maxima
- On a randomized version of exhaustive local search
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- scientific article; zbMATH DE number 2077129
- Stochastic Algorithms: Foundations and Applications
- Randomized algorithms in combinatorial optimization: A survey
- scientific article; zbMATH DE number 780783
- Local algorithms for independent sets are half-optimal
- Randomized range-maxima in nearly-constant parallel time
Cited in
(8)- Monomial bases for broken circuit complexes
- Acyclic orientations of random graphs
- Counting restricted orientations of random graphs
- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Matching nuts and bolts faster
- Matching nuts and bolts faster
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
This page was built for publication: Optimal Randomized Algorithms for Local Sorting and Set-Maxima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032937)