Efficient linear-time ranking and unranking of derangements (Q2094363): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ken-ichi Tanaka / rank
Normal rank
 
Property / author
 
Property / author: Ken-ichi Tanaka / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114167073 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: hfloat / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2022.106288 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281689989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matters Computational / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code for derangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant time generation of derangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Random Derangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of random derangements with the expected distribution of cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking permutations in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic ranking and unranking of derangements in cycle notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time generation of uniform random derangements encoded in cycle notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726126 / rank
 
Normal rank

Latest revision as of 15:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient linear-time ranking and unranking of derangements
scientific article

    Statements

    Efficient linear-time ranking and unranking of derangements (English)
    0 references
    0 references
    0 references
    28 October 2022
    0 references
    combinatorial problem
    0 references
    algorithms
    0 references
    derangement
    0 references
    unranking
    0 references
    linear-time
    0 references

    Identifiers