- Shift Gray Codes Aaron Michael Williams
- LOOPLESS GENERATION OF MULTISET PERMUTATIONS BY PREFIX AARON WILLIAMS
- C SC 322 Midterm Review Materials Propositional Logic
- The Feline Josephus Problem Frank Ruskey and Aaron Williams
- ASSIGNMENT THREE SOLUTIONS MATH 4805 / COMP 4805 / MATH 5605
- Algorithmica manuscript No. (will be inserted by the editor)
- The Coolest Way To Generate Combinations Frank Ruskey and Aaron Williams
- ASSIGNMENT 3 DUE NOVEMBER 8TH, 2008
- Theory of Computing Systems manuscript No. (will be inserted by the editor)
- ASSIGNMENT 4 DUE NOVEMBER 29TH, 2007
- Universal Cycles for Permutations Theory and Applications
- ASSIGNMENT TWO--COMP 252 Instructions: Your grade will be determined based on the score of your best n -1 answers.
- SOLUTIONS 2 Answers to the BONUS questions are available by request via email.
- Advances in Packing Directed Joins Bertrand Guenin 2
- ASSIGNMENT 1 DUE SEPTEMBER 27TH, 2007
- HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS
- Brute-Force Algorithms Fields Undergraduate Network @ Carleton
- Research Interests My research interests include discrete mathematics and theoretical computer science, and my
- New Constructions for Universal Cycles and de Bruijn Cycles
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
- O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
- 2011JUNE 22ND, 2011 INTERNATIONAL WORKSHOP ON COMBINATORIAL ALGORITHMS / 22ND ANNUAL / UNIVERSITY OF VICTORIA
- ASSIGNMENT TWO MATH 4805 / COMP 4805 / MATH 5605
- SOLUTIONS ONE --COMP 252 (1) (a) Below is the completed table.
- O(1)-Time Unsorting by Boustrophedon Linked List
- Packing Directed Joins Aaron Michael Williams
- ASSIGNMENT ONE MATH 4805 / COMP 4805 / MATH 5605
- Cooler Gray Codes and de Bruijn Sequences
- THE COOLEST WAY TO GENERATE COMBINATIONS FRANK RUSKEY AND AARON WILLIAMS
- Basic Definitions Multisets are sets that allow repetitions
- Efficient Generation of Hamilton Cycles in Restricted and Generalized
- Special Issue on Generalizing de Bruijn Cycles and Gray Codes. 309: 17 5404-5320, 2009.
- Binary-Graceful Forests Wendy Myrvold University of Victoria
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- ASSIGNMENT ONE SOLUTIONS MATH 4805 / COMP 4805 / MATH 5605
- Generating Balanced Parentheses and Binary Trees by Prefix Shifts Frank Ruskey1 Aaron Williams2
- Hamilton Cycles in Restricted Rotator Graphs
- ASSIGNMENT ONE --COMP 252 Instructions: Your grade will be determined based on the score of your best n -1 answers.
- C SC 322 Final Exam Review Materials Refer to the Midterm Review Materials page for the testable material from the rst half of the course. Approximately 30-40%
- Shift Gray Codes Aaron Michael Williams
- de Bruijn Cycles Let B(N) be the set of length N binary strings.
- Hamilton Cycles in Restricted and Incomplete Rotator Brett Stevens
- BINARY BUBBLE LANGUAGES AND COOL-LEX ORDER FRANK RUSKEY, JOE SAWADA, AND AARON WILLIAMS
- MIDTERM FOR MATH 4805 / COMP 4805 / MATH 5605 THURSDAY, NOVEMBER 11TH
- SOLUTIONS 4 1. a) y represents the position of the leftmost 0.
- Packing Dicycle Covers in Planar Graphs with No K5 -e Minor
- ASSIGNMENT TWO SOLUTIONS MATH 4805 / COMP 4805 / MATH 5605
- De Bruijn Sequences with Maximum Density
- Table of contents 1 Introduction to Combinatorial Generation
- Cool-lex Order and k-ary Catalan Structures Stephane Durocher
- ASSIGNMENT 2 DUE OCTOBER 19TH (OR 22ND), 2007
- Faster Generation of Shorthand Universal Cycles for Permutations
- SOLUTIONS 1 1. After applying rules (a)-(c) we have a three way tie with Chile, Morocco, and Turkey. According to the
- AN EXPLICIT UNIVERSAL CYCLE FOR THE (n -1)-PERMUTATIONS OF AN n-SET
- SOLVING WILF'S SIGMATAU PROBLEM Aaron Williams McGill University
- ASSIGNMENT THREE MATH 4805 / COMP 4805 / MATH 5605
- De Bruijn Sequences for the Binary Strings with Maximum Density
- DE BRUIJN SEQUENCES FOR FIXED-WEIGHT BINARY STRINGS FRANK RUSKEY, JOE SAWADA, AND AARON WILLIAMS
- Ringing Campanologically New methods for Old Church Bells
- Efficient Oracles for Generating Binary Bubble School of Computer Science
