On the public citation graph

Generating Random Permutations by Coin Tossing

0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-60590-8_7openalex-snapshot
The RC5 encryption algorithm
inferredcites →https://doi.org/10.1007/978-3-319-02744-9openalex-snapshot
A Chronicle of Permutation Statistical Methods
inferredcites →https://doi.org/10.1007/978-3-540-74619-5_28openalex-snapshot
Perfect Block Ciphers with Small Blocks
inferredcites →https://doi.org/10.1007/978-3-642-19934-9_23openalex-snapshot
Efficient Parallel Random Rearrange
inferredcites →https://doi.org/10.1007/978-3-642-31464-3_30openalex-snapshot
Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?
inferredcites →https://doi.org/10.1007/978-3-7091-2900-5_4openalex-snapshot
Collision-Resolution Algorithms and Random-Access Communications
inferredcites →https://doi.org/10.1007/978-3-7908-2604-3_1openalex-snapshot
Complexity Questions in Non-Uniform Random Variate Generation
inferredcites →https://doi.org/10.1007/s00026-009-0002-4openalex-snapshot
On Tries, Contention Trees and Their Analysis
inferredcites →https://doi.org/10.1007/s00026-009-0003-3openalex-snapshot
Random and Exhaustive Generation of Permutations and Cycles
inferredcites →https://doi.org/10.1007/s00365-004-0561-xopenalex-snapshot
Digital Sums and Divide-and-Conquer Recurrences: Fourier Expansions and Absolute Convergence
inferredcites →https://doi.org/10.1007/s11222-016-9648-zopenalex-snapshot
The expected bit complexity of the von Neumann rejection algorithm
inferredcites →https://doi.org/10.1007/s11227-014-1202-1openalex-snapshot
Converting random bits into random numbers
inferredcites →https://doi.org/10.1016/0020-0190(88)90210-4openalex-snapshot
The generation of random permutations on the fly
inferredcites →https://doi.org/10.1016/0020-0190(92)90222-hopenalex-snapshot
Random list permutations in place
inferredcites →https://doi.org/10.1016/0304-3975(94)00281-mopenalex-snapshot
Mellin transforms and asymptotics: Finite differences and Rice's integrals
inferredcites →https://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferredcites →https://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferredcites →https://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferredcites →https://doi.org/10.1017/cbo9780511801655openalex-snapshot
Analytic Combinatorics
inferredcites →https://doi.org/10.1017/s0021900200019720openalex-snapshot
Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
inferredcites →https://doi.org/10.1080/00207168908803745openalex-snapshot
Observations on the generation of permutations from random sequences
inferredcites →https://doi.org/10.1080/0161-119191865812openalex-snapshot
THE EFFICIENT GENERATION OF CRYPTOGRAPHIC CONFUSION SEQUENCES
inferredcites →https://doi.org/10.1090/psapm/010/0113289openalex-snapshot
Teaching combinatorial tricks to a computer
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0414948-5openalex-snapshot
Table errata: Higher transcendental functions. Vol. I, II (McGraw-Hill, New York, 1953) by A. Erdélyi, W. Magnus, F. Oberhettinger and F. G. Tricomi
inferredcites →https://doi.org/10.1109/71.877833openalex-snapshot
Randomized initialization protocols for ad hoc networks
inferredcites →https://doi.org/10.1109/tit.1981.1056363openalex-snapshot
Entropy and an optimal random number transformation (Corresp.)
inferredcites →https://doi.org/10.1109/tpds.2007.253278openalex-snapshot
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
inferredcites →https://doi.org/10.1111/j.2517-6161.1962.tb00474.xopenalex-snapshot
A Simple Randomization Procedure
inferredcites →https://doi.org/10.1111/j.2517-6161.1968.tb00751.xopenalex-snapshot
Random Permutations
inferredcites →https://doi.org/10.1137/1.9781611972979.5openalex-snapshot
Boltzmann Sampling of Unlabelled Structures
inferredcites →https://doi.org/10.1145/1283920.1283929openalex-snapshot
Computer programming as an art
inferredcites →https://doi.org/10.1145/2669372openalex-snapshot
Algorithm 947
inferredcites →https://doi.org/10.1145/363269.363619openalex-snapshot
Algorithm 362: generation of random permutations [G6]
inferredcites →https://doi.org/10.1145/364520.364540openalex-snapshot
Algorithm 235: Random permutation
inferredcites →https://doi.org/10.1145/97444.97674openalex-snapshot
Parallel algorithms for generating random permutations on a shared memory machine
inferredcites →https://doi.org/10.1201/9781315273075openalex-snapshot
Randomization, Bootstrap and Monte Carlo Methods in Biology
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.1214/aoap/1075828056openalex-snapshot
A general limit theorem for recursive algorithms and combinatorial structures
inferredcites →https://doi.org/10.1214/aop/1048516530openalex-snapshot
Second phase changes in random $\boldsymbol{m}$-ary search trees and generalized quicksort: Convergence rates
inferredcites →https://doi.org/10.2307/1401380openalex-snapshot
Tables of Random Permutations
inferredcites →https://doi.org/10.2307/2280633openalex-snapshot
Statistical Tables for Biological, Agricultural and Medical Research.
inferredcites →https://doi.org/10.2307/2282765openalex-snapshot
Tables of Random Permutations
inferredcites →https://doi.org/10.2307/2289328openalex-snapshot
Non-Uniform Random Variate Generation.
inferredcites →https://doi.org/10.2307/2529766openalex-snapshot
Sums of Independent Random Variables.
inferredcites →https://doi.org/10.24033/bsmf.378openalex-snapshot
Sur la numération factorielle, application aux permutations
inferredcites →https://doi.org/10.2989/qm.2008.31.4.2.606openalex-snapshot
Joint Distributions for Movements of Elements in Sattolo's and the Fisher-Yates Algorithm
inferredcites →https://doi.org/10.46298/dmtcs.498openalex-snapshot
Asymptotic variance of random symmetric digital search trees
inferredcites →https://doi.org/10.48550/arxiv.1304.1916openalex-snapshot
Optimal Discrete Uniform Generation from Coin Flips, and Applications
inferredcites →https://doi.org/10.5860/choice.189236openalex-snapshot
A chronicle of permutation statistical methods: 1920-2000, and beyond
inferredcites →https://doi.org/10.6028/nist.sp.800-90openalex-snapshot
Recommendation for random number generation using deterministic random bit generators (revised)
inferredcites →https://doi.org/10.6028/nist.sp.800-90aopenalex-snapshot
Recommendation for random number generation using deterministic random bit generators
inferredcites →https://doi.org/10.71781/10987openalex-snapshot
Échantillonnage des distributions continues non uniformes en précision arbitraire et protocole pour l'échantillonnage exact distribué des distributions discrètes quantiques

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-93800-4_15openalex-snapshot
Binary Solutions to Some Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/s12095-019-00384-4openalex-snapshot
Unicyclic strong permutations
inferred← citeshttps://doi.org/10.1007/s40314-020-01295-4openalex-snapshot
Efficient generation of random derangements with the expected distribution of cycle lengths
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102284openalex-snapshot
Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study
inferred← citeshttps://doi.org/10.1017/jpr.2017.56openalex-snapshot
Dependence between path-length and size in random digital trees
inferred← citeshttps://doi.org/10.1109/icetas48360.2019.9117417openalex-snapshot
Modified Mutated Firefly Algorithm
inferred← citeshttps://doi.org/10.1109/isit.2019.8849766openalex-snapshot
Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks
inferred← citeshttps://doi.org/10.1109/tifs.2019.2953383openalex-snapshot
Secure and Efficient Compressed Sensing-Based Encryption With Sparse Matrices
inferred← citeshttps://doi.org/10.1137/1.9781611975505.2openalex-snapshot
Ranked Schröder Trees
inferred← citeshttps://doi.org/10.1142/s179383092150107xopenalex-snapshot
Generation of the symmetric group Sn2
inferred← citeshttps://doi.org/10.1145/3230636openalex-snapshot
Fast Random Integer Generation in an Interval
inferred← citeshttps://doi.org/10.1145/3505287openalex-snapshot
Bandwidth-Optimal Random Shuffling for GPUs
inferred← citeshttps://doi.org/10.1186/s42400-023-00192-7openalex-snapshot
WAS: improved white-box cryptographic algorithm over AS iteration
inferred← citeshttps://doi.org/10.3390/info11120576openalex-snapshot
Hiding the Source Code of Stored Database Programs
inferred← citeshttps://doi.org/10.38124/ijisrt/ijisrt24may1654openalex-snapshot
Transposition Cipher as a Solution for a Better Bank Verification Number (BVN) Security in Communication Channel
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12881openalex-snapshot
Boltzmann sampling of irreducible context-free structures in linear time
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-2393/paper_313.pdfopenalex-snapshot
Random Re-Ordering of the Parties in the Consensus Protocol
inferred← citeshttps://doi.org/10.62056/a6n59qgxqopenalex-snapshot
Efficient isochronous fixed-weight sampling with applications to NTRU
inferred← citeshttps://doi.org/10.70675/782124a1z4de9z4e2azb5a6zb4cf1830a85eopenalex-snapshot
Combinatorics of trees under increasing labellings : asymptotics, bijections and algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.