scientific article; zbMATH DE number 176751

zbMATH Open0769.68036MaRDI QIDQ4036581FDOQ4036581

Authors: Torben Hagerup 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Fast generation of random permutations via networks simulation
• Fast generation of random permutations via networks simulation
• Efficient low-contention parallel algorithms
• Random permutations on distributed, external and hierarchical memory
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

zbMATH Keywords

integer sortingcomputation of random permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Cited In (21)

• Efficient sampling of random permutations
• Fast generation of random permutations via networks simulation
• Sampling Lower Bounds: Boolean Average-Case and Permutations
• In-place random list permutations
• The generation of random permutations on the fly
• The log-star revolution
• Fine-grained secure computation
• Random permutations on distributed, external and hierarchical memory
• Randomization helps to perform independent tasks reliably
• Applying fast simulation to find the number of good permutations
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• The parallel complexity of growth models
• Title not available (Why is that?)
• Delayed path coupling and generating random permutations
• Algorithm 947
• On a compaction theorem of Ragde
• Randomized range-maxima in nearly-constant parallel time
• Fast and optimal simulations between CRCW PRAMs
• A parallel derangement generation algorithm
• Parallel Weighted Random Sampling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036581)