2 search results - page 1 / 1 » Faster Generation of Shorthand Universal Cycles for Permutat... |
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mat...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...