Permutations on the Block PRAM (original) (raw)
Related papers
Permutations on the Block PRAM, 45 Info. Processing Letters 69 (1993)
A compact data structure and parallel algorithms for permutation graphs
Lecture Notes in Computer Science, 1995
Computing in permutation groups without memory
2014
A Vector Space Framework for Parallel Stable Permutations
Formal Methods, 1995
Implementation Complexity of Bit PermutationInstructions
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
Siam Journal on Computing, 1998
Complexity issues in general purpose parallel computing
1991
Fast Generation of Random Permutations Via Networks Simulation
Algorithmica, 1998
Parallel algorithmic techniques for combinatorial computation
Lecture Notes in Computer Science, 1989
Communicai ’ Ion Complexity of Prams
2002
On the shuffle-exchange permutation network
The power of collision: Randomized parallel algorithms for chaining and integer sorting
Lecture Notes in Computer Science, 1990
Sublinear Communication for Integer Permutations
2007
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
Routing, merging and sorting on parallel models of computation
1982
Permutation Operations inBlock Ciphers
Efficient low-contention parallel algorithms
Journal of Computer and System Sciences, 1996
Hardware Complexity and Parallel Computation (Preliminary Version)
IEEE Symposium on Foundations of Computer Science, 1980
Contention Resolution in Hashing Based Shared Memory Simulations
SIAM Journal on Computing, 2000
Communication complexity of PRAMs
Theoretical Computer Science, 1990
On communication latency in PRAM computations
Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, 1989
Access Complexity: A New Complexity Analysis Framework for Parallel Computation
The organization of permutation architectures with bused interconnections
IEEE Transactions on Computers, 1990
Algorithms for Parallel Memory, I: Two-Level Memories
Hardware complexity and parallel computation
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980
One, two, three . . . infinity: lower bounds for parallel computation
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85, 1985
Randomized permutations in a coarse grained parallel environment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03, 2003
An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs
Efficient PRAM simulation on a distributed memory machine
Michael Luby, Friedhelm Meyer auf der Heide
Algorithmica, 1996
Comparing Fast Implementations of Bit Permutation Instructions
Trade-offs between communication throughput and parallel time
1994
The QRQW PRAM: accounting for contention in parallel algorithms
1994
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990