Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
COCOON
2010
Springer
favorite
Email
discuss
report
153
views
Combinatorics
»
more
COCOON 2010
»
Faster Generation of Shorthand Universal Cycles for Permutations
14 years 1 months ago
Download
webhome.cs.uvic.ca
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 Mathematics, 149
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Real-time Traffic
Circular String
|
COCOON 2010
|
Combinatorics
|
Universal Cycle
|
claim paper
Related Content
»
Almost random graphs with simple hash functions
more »
Post Info
More Details (n/a)
Added
19 Jul 2010
Updated
19 Jul 2010
Type
Conference
Year
2010
Where
COCOON
Authors
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision