Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Victoria" +contributor:("Ruskey, Frank")`

.
Showing records 1 – 14 of
14 total matches.

▼ Search Limiters

University of Victoria

1. Saba, Sahand. Coroutine-based combinatorial generation.

Degree: Department of Computer Science, 2015, University of Victoria

URL: http://hdl.handle.net/1828/5879

► The two well-known approaches to designing combinatorial generation algorithms are the recursive approach and the iterative approach. In this thesis a third design approach using…
(more)

Subjects/Keywords: combinatorial generation; coroutines; python

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Saba, S. (2015). Coroutine-based combinatorial generation. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/5879

Chicago Manual of Style (16^{th} Edition):

Saba, Sahand. “Coroutine-based combinatorial generation.” 2015. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/5879.

MLA Handbook (7^{th} Edition):

Saba, Sahand. “Coroutine-based combinatorial generation.” 2015. Web. 10 Jul 2020.

Vancouver:

Saba S. Coroutine-based combinatorial generation. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/5879.

Council of Science Editors:

Saba S. Coroutine-based combinatorial generation. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/5879

University of Victoria

2. Bultena, Bette. Face-balanced, Venn and polyVenn diagrams.

Degree: Dept. of Computer Science, 2013, University of Victoria

URL: http://hdl.handle.net/1828/4873

► A \emph{simple} n-\emph{Venn diagram} is a collection of n simple intersecting closed curves in the plane where exactly two curves meet at any intersection point;…
(more)

Subjects/Keywords: Venn diagram; graph theory; computational geometry; minimum area Venn diagram; Winkler's conjecture

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bultena, B. (2013). Face-balanced, Venn and polyVenn diagrams. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4873

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bultena, Bette. “Face-balanced, Venn and polyVenn diagrams.” 2013. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/4873.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bultena, Bette. “Face-balanced, Venn and polyVenn diagrams.” 2013. Web. 10 Jul 2020.

Vancouver:

Bultena B. Face-balanced, Venn and polyVenn diagrams. [Internet] [Thesis]. University of Victoria; 2013. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/4873.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bultena B. Face-balanced, Venn and polyVenn diagrams. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4873

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

3. Irvine, Veronika. Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns.

Degree: Department of Computer Science, 2016, University of Victoria

URL: http://hdl.handle.net/1828/7495

► Bobbin lace is a 500-year-old art form in which threads are braided together in an alternating manner to produce a lace fabric. A key component…
(more)

Subjects/Keywords: exhaustive combinatorial generation; lattice path; bobbin lace; graph theory; planar symmetry; tessellation; computational lace; alternating braid

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Irvine, V. (2016). Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7495

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Irvine, Veronika. “Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns.” 2016. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/7495.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Irvine, Veronika. “Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns.” 2016. Web. 10 Jul 2020.

Vancouver:

Irvine V. Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns. [Internet] [Thesis]. University of Victoria; 2016. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/7495.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Irvine V. Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns. [Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7495

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

4. Ahmadi Mamakani, Abdolkhalegh. Searching for Simple Symmetric Venn Diagrams.

Degree: Dept. of Computer Science, 2013, University of Victoria

URL: http://hdl.handle.net/1828/4709

► An n-Venn diagram is defined as a collection of n finitely intersecting closed curves dividing the plane into 2^n distinct regions, where each region is…
(more)

Subjects/Keywords: Simple Venn diagrams; Bounded Venn diagrams; Crosscut symmetry; Newroz; Polar symmetry; Rotational symmetry

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ahmadi Mamakani, A. (2013). Searching for Simple Symmetric Venn Diagrams. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4709

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ahmadi Mamakani, Abdolkhalegh. “Searching for Simple Symmetric Venn Diagrams.” 2013. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/4709.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ahmadi Mamakani, Abdolkhalegh. “Searching for Simple Symmetric Venn Diagrams.” 2013. Web. 10 Jul 2020.

Vancouver:

Ahmadi Mamakani A. Searching for Simple Symmetric Venn Diagrams. [Internet] [Thesis]. University of Victoria; 2013. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/4709.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadi Mamakani A. Searching for Simple Symmetric Venn Diagrams. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4709

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

5. Spreen, Thomas D. The Binary String-to-String Correction Problem.

Degree: Dept. of Computer Science, 2013, University of Victoria

URL: http://hdl.handle.net/1828/4884

► String-to-String Correction is the process of transforming some mutable string M into an exact copy of some other string (the target string T), using a…
(more)

Subjects/Keywords: transportation problem; np-hard; swap; deletion; binary string; Iversonian; target string; mutable string; longest common subsequence; lcs; binary string-to-string correction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Spreen, T. D. (2013). The Binary String-to-String Correction Problem. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4884

Chicago Manual of Style (16^{th} Edition):

Spreen, Thomas D. “The Binary String-to-String Correction Problem.” 2013. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/4884.

MLA Handbook (7^{th} Edition):

Spreen, Thomas D. “The Binary String-to-String Correction Problem.” 2013. Web. 10 Jul 2020.

Vancouver:

Spreen TD. The Binary String-to-String Correction Problem. [Internet] [Masters thesis]. University of Victoria; 2013. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/4884.

Council of Science Editors:

Spreen TD. The Binary String-to-String Correction Problem. [Masters Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4884

6. Sawada, Joseph James. Fast algorithms to generate restricted classes of strings under rotation.

Degree: Department of Computer Science, 2018, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/9017

► A necklace is a representative of an equivalence class of k-ary strings under rotation. Efficient algorithms for generating (i.e., listing) necklaces have been known for…
(more)

Subjects/Keywords: Algorithms; Computer programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sawada, J. J. (2018). Fast algorithms to generate restricted classes of strings under rotation. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9017

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sawada, Joseph James. “Fast algorithms to generate restricted classes of strings under rotation.” 2018. Thesis, University of Victoria. Accessed July 10, 2020. https://dspace.library.uvic.ca//handle/1828/9017.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sawada, Joseph James. “Fast algorithms to generate restricted classes of strings under rotation.” 2018. Web. 10 Jul 2020.

Vancouver:

Sawada JJ. Fast algorithms to generate restricted classes of strings under rotation. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Jul 10]. Available from: https://dspace.library.uvic.ca//handle/1828/9017.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sawada JJ. Fast algorithms to generate restricted classes of strings under rotation. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9017

Not specified: Masters Thesis or Doctoral Dissertation

7. Erickson, Alejandro. Monomino-Domino Tatami Coverings.

Degree: Dept. of Computer Science, 2013, University of Victoria

URL: http://hdl.handle.net/1828/4902

► We present several new results on the combinatorial properties of a locally restricted version of monomino-domino coverings of rectilinear regions. These are monomino-domino tatami coverings,…
(more)

Subjects/Keywords: combinatorics; cstheory; math.CO; cs.CC; computer science theory; mathematics; tiling; covering; tatami restriction; monomino; domino; enumeration; combinatorial algorithms; combinatorial generation; computational complexity

…my advisor’s grant.
The *University* *of* *Victoria* for funding me through my first two years…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Erickson, A. (2013). Monomino-Domino Tatami Coverings. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4902

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Erickson, Alejandro. “Monomino-Domino Tatami Coverings.” 2013. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/4902.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Erickson, Alejandro. “Monomino-Domino Tatami Coverings.” 2013. Web. 10 Jul 2020.

Vancouver:

Erickson A. Monomino-Domino Tatami Coverings. [Internet] [Thesis]. University of Victoria; 2013. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/4902.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Erickson A. Monomino-Domino Tatami Coverings. [Thesis]. University of Victoria; 2013. Available from: http://hdl.handle.net/1828/4902

Not specified: Masters Thesis or Doctoral Dissertation

8. Evans, Patricia Anne. Algorithms and complexity for annotated sequence analysis.

Degree: Department of Computer Science, 2017, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/8864

► Molecular biologists use algorithms that compare and otherwise analyze sequences that represent genetic and protein molecules. Most of these algorithms, however, operate on the basic…
(more)

Subjects/Keywords: Problem solving; Data processing; Algorithms; Computational complexity

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Evans, P. A. (2017). Algorithms and complexity for annotated sequence analysis. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8864

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Evans, Patricia Anne. “Algorithms and complexity for annotated sequence analysis.” 2017. Thesis, University of Victoria. Accessed July 10, 2020. https://dspace.library.uvic.ca//handle/1828/8864.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Evans, Patricia Anne. “Algorithms and complexity for annotated sequence analysis.” 2017. Web. 10 Jul 2020.

Vancouver:

Evans PA. Algorithms and complexity for annotated sequence analysis. [Internet] [Thesis]. University of Victoria; 2017. [cited 2020 Jul 10]. Available from: https://dspace.library.uvic.ca//handle/1828/8864.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Evans PA. Algorithms and complexity for annotated sequence analysis. [Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8864

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

9. Effler, Scott. Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic.

Degree: Dept. of Computer Science, 2008, University of Victoria

URL: http://hdl.handle.net/1828/1265

► This thesis explores 2-generated and cubic Cayley graphs. All 2-generated Cayley graphs with generators from Sn where n < 9, were generated. Further, 3-generated cubic…
(more)

Subjects/Keywords: Hamiltonicity; Cayley graphs; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Effler, S. (2008). Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1265

Chicago Manual of Style (16^{th} Edition):

Effler, Scott. “Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic.” 2008. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/1265.

MLA Handbook (7^{th} Edition):

Effler, Scott. “Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic.” 2008. Web. 10 Jul 2020.

Vancouver:

Effler S. Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic. [Internet] [Masters thesis]. University of Victoria; 2008. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/1265.

Council of Science Editors:

Effler S. Enumeration, isomorphism and Hamiltonicity of Cayley graphs: 2-generated and cubic. [Masters Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/1265

University of Victoria

10. Chow, Stirling Christopher. Generating and drawing area-proportional Euler and Venn diagrams.

Degree: Dept. of Computer Science, 2007, University of Victoria

URL: http://hdl.handle.net/1828/128

► An Euler diagram C = {c_1, c_2,..., c_n} is a collection of n simple closed curves (i.e., Jordan curves) that partition the plane into connected…
(more)

Subjects/Keywords: Venn Diagrams; Euler Diagrams; Computational Geometry; Information Visualization; Computational Complexity; Area-Proportional; Logic Diagrams; UVic Science Index::Sciences and Engineering::Applied Sciences::Computer science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chow, S. C. (2007). Generating and drawing area-proportional Euler and Venn diagrams. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/128

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chow, Stirling Christopher. “Generating and drawing area-proportional Euler and Venn diagrams.” 2007. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/128.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chow, Stirling Christopher. “Generating and drawing area-proportional Euler and Venn diagrams.” 2007. Web. 10 Jul 2020.

Vancouver:

Chow SC. Generating and drawing area-proportional Euler and Venn diagrams. [Internet] [Thesis]. University of Victoria; 2007. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/128.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chow SC. Generating and drawing area-proportional Euler and Venn diagrams. [Thesis]. University of Victoria; 2007. Available from: http://hdl.handle.net/1828/128

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

11. Weston, Mark Richard Nicholas. Symmetries of Venn diagrams on the sphere.

Degree: Dept. of Computer Science, 2009, University of Victoria

URL: http://hdl.handle.net/1828/1348

► A diagram on a surface is a collection of coloured simple closed curves which generally intersect only at points, and a Venn diagram of n…
(more)

Subjects/Keywords: symmetry; groups; Venn diagrams; sphere; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Weston, M. R. N. (2009). Symmetries of Venn diagrams on the sphere. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1348

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Weston, Mark Richard Nicholas. “Symmetries of Venn diagrams on the sphere.” 2009. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/1348.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Weston, Mark Richard Nicholas. “Symmetries of Venn diagrams on the sphere.” 2009. Web. 10 Jul 2020.

Vancouver:

Weston MRN. Symmetries of Venn diagrams on the sphere. [Internet] [Thesis]. University of Victoria; 2009. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/1348.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Weston MRN. Symmetries of Venn diagrams on the sphere. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1348

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

12. Woodcock, Jennifer Roselynn. A faster algorithm for torus embedding.

Degree: Dept. of Computer Science, 2007, University of Victoria

URL: http://hdl.handle.net/1828/130

► Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We…
(more)

Subjects/Keywords: torus; obstruction; graph theory; embedding; graph; graph minor; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Woodcock, J. R. (2007). A faster algorithm for torus embedding. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/130

Chicago Manual of Style (16^{th} Edition):

Woodcock, Jennifer Roselynn. “A faster algorithm for torus embedding.” 2007. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/130.

MLA Handbook (7^{th} Edition):

Woodcock, Jennifer Roselynn. “A faster algorithm for torus embedding.” 2007. Web. 10 Jul 2020.

Vancouver:

Woodcock JR. A faster algorithm for torus embedding. [Internet] [Masters thesis]. University of Victoria; 2007. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/130.

Council of Science Editors:

Woodcock JR. A faster algorithm for torus embedding. [Masters Thesis]. University of Victoria; 2007. Available from: http://hdl.handle.net/1828/130

University of Victoria

13. Williams, Aaron Michael. Shift gray codes.

Degree: Dept. of Computer Science, 2009, University of Victoria

URL: http://hdl.handle.net/1828/1966

► Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding…
(more)

Subjects/Keywords: shorthand universal cycles; combinatorial generation; minimal-change order; loopless algorithm; efficient algorithm; combinations; multiset permutations; balanced parentheses; Dyck words; Catalan paths; Schroder paths; Motzkin words; linear-extensions; posets; connected unit interval graphs; inversions; binary trees; k-ary trees; ordered trees with fixed branching sequence; Lyndon words; pre-necklaces; theoretical computer science; discrete mathematics; combinatorics; brute forcs; de Bruijn cycles; bubble languages; cool-lex order; lexicographic order; combinatorial enumeration; stacker-crane problem; traveling salesman problem; middle levels; fixed-density de Bruijn cycle; fixed-content; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science; UVic Subject Index::Sciences and Engineering::Mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Williams, A. M. (2009). Shift gray codes. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1966

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/1966.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Web. 10 Jul 2020.

Vancouver:

Williams AM. Shift gray codes. [Internet] [Thesis]. University of Victoria; 2009. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/1966.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Williams AM. Shift gray codes. [Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1966

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

14. Deugau, Christopher Jordan. Algorithms and combinatorics of maximal compact codes.

Degree: Dept. of Computer Science, 2010, University of Victoria

URL: http://hdl.handle.net/1828/2101

► The implementation of two different algorithms for generating compact codes of some size N are presented. An analysis of both algorithms is given. in an…
(more)

Subjects/Keywords: combinatorial analysis; algorithms; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Deugau, C. J. (2010). Algorithms and combinatorics of maximal compact codes. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2101

Chicago Manual of Style (16^{th} Edition):

Deugau, Christopher Jordan. “Algorithms and combinatorics of maximal compact codes.” 2010. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/2101.

MLA Handbook (7^{th} Edition):

Deugau, Christopher Jordan. “Algorithms and combinatorics of maximal compact codes.” 2010. Web. 10 Jul 2020.

Vancouver:

Deugau CJ. Algorithms and combinatorics of maximal compact codes. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/2101.

Council of Science Editors:

Deugau CJ. Algorithms and combinatorics of maximal compact codes. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2101