A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
[chapter]
2014
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
We show that simple sequential randomized iterative algorithms for random permutation, list contraction, and tree contraction are highly parallel. In particular, if iterations of the algorithms are run as soon as all of their dependencies have been resolved, the resulting computations have logarithmic depth (parallel time) with high probability. Our proofs make an interesting connection between the dependence structure of two of the problems and random binary trees. Building upon this analysis,
doi:10.1137/1.9781611973730.30
dblp:conf/soda/ShunGBFG15
fatcat:4gi73s3gvzh5bl5rvnow2hp63i