Faster generation of shorthand universal cycles for permutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6196 LNCS, Issue , 2010, Pages 298-307

  Holroyd, Alexander ^a   Ruskey, Frank ^b   Williams, Aaron ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC CONSTRUCTION; AMORTIZED TIME; DISCRETE MATHEMATICS; EXPLICIT CONSTRUCTIONS; GRAY CODES; JACKSON; SUBSTRING; WILLIAMS;

ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 77955030422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14031-0_33     Document Type: Conference Paper

References (9)

1. Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Mathematics 110, 43-59 (1992)
2. de Bruijn, N.G.: A Combinatorial Problem. Koninkl. Nederl. Acad.Wetensch. Proc. Ser A 49, 758-764 (1946)
3. Duckworth, R., Stedman, F.: Tintinnalogia (1668)
4. Jackson, B.: Universal cycles of k-subsets and k-permutations. Discrete Mathematics 149, 123-129 (1996)
5. Knuth, D.E.: The Art of Computer Programming. Generating All Tuples and Permutations, Fascicle 2, vol.4. Addison-Wesley, Reading (2005)
6. Ruskey, F., Williams, A.: The coolest way to generate combinations. Discrete Mathematics 309, 5305-5320 (2009)
7. Ruskey, F., Williams, A.: An explicit universal cycle for the (n - 1)-permutations of an n-set. ACM Transactions on Algorithms (in press)
8. White, A.T.: Fabian Stedman: The First Group Theorist? The American Mathematical Monthly 103, 771-778 (1996)
9. Williams, A.: Loopless Generation of Multiset Permutations Using a Constant Number of Variables by Prefix Shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, pp. 987-996.