The generation of random permutations on the fly

DOI10.1016/0020-0190(88)90210-4zbMATH Open0658.68089OpenAlexW2079467789MaRDI QIDQ1111400FDOQ1111400

Authors: Gilles Brassard, Sampath Kannan 

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90210-4

Recommendations

• Observations on the generation of permutations from random sequences
• scientific article; zbMATH DE number 176751
• In-place random list permutations
• Random permutations on distributed, external and hierarchical memory
• Fast generation of random permutations via networks simulation

zbMATH Keywords

data structurerandom permutationbalanced treereal-time applicationrehashing

Mathematics Subject Classification ID

Data structures (68P05) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Universal classes of hash functions
• Title not available (Why is that?)
• A Fast Monte-Carlo Test for Primality
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Fast generation of random permutations via networks simulation
• In-place random list permutations
• Integrated strategy for generating permutation
• A note on unscrambling address lines
• Title not available (Why is that?)
• Unicyclic strong permutations
• Title not available (Why is that?)
• Observations on the generation of permutations from random sequences
• Title not available (Why is that?)
• Random list permutations in place

This page was built for publication: The generation of random permutations on the fly

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