Search Results 1-4 of 4

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. These algorithms run in O(n log n) time with O(n) space, while using O(n) arithmetic operation …

    Technical report of IEICE. VLD 112(114), 93-96, 2012-06-25

    References (8)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. These algorithms run in O(n log n) time with O(n) space, while using O(n) arithmetic operation …

    IEICE technical report. Circuits and systems 112(113), 93-96, 2012-06-25

    References (8) Cited by (1)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. These algorithms run in O(n log n) time with O(n) space, while using O(n) arithmetic operation …

    Mathematical Systems Science and its Applications : IEICE technical report 112(116), 93-96, 2012-06-25

    References (8)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. These algorithms run in O(n log n) time with O(n) space, while using O(n) arithmetic operation …

    IEICE technical report. Signal processing 112(115), 93-96, 2012-06-25

    References (8)

Page Top