Parallel algorithms for generating random permutations on a shared memory machine

Asynchronous shared memory parallel computation

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

Converting high probability into nearly-constant time—with applications to parallel hashing

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Wait-free parallel algorithms for the union-find problem

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Asynchronous shared memory parallel computation (preliminary version)

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures

A method for implementing lock-free shared-data structures

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures

Engineering parallel in-place random generation of integer permutations

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

Is your permutation algorithm unbiased for n ≠ 2m?

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I