Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Combinatorial enumeration). Showing records 1 – 23 of 23 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Rutgers University

1. Shar, Nathaniel. Experimental methods in permutation patterns and bijective proof.

Degree: PhD, Mathematics, 2016, Rutgers University

Experimental mathematics is the technique of developing conjectures and proving theorems through the use of experimentation; that is, exploring finitely many cases and detecting patterns… (more)

Subjects/Keywords: Combinatorial enumeration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shar, N. (2016). Experimental methods in permutation patterns and bijective proof. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/50595/

Chicago Manual of Style (16th Edition):

Shar, Nathaniel. “Experimental methods in permutation patterns and bijective proof.” 2016. Doctoral Dissertation, Rutgers University. Accessed January 15, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/50595/.

MLA Handbook (7th Edition):

Shar, Nathaniel. “Experimental methods in permutation patterns and bijective proof.” 2016. Web. 15 Jan 2021.

Vancouver:

Shar N. Experimental methods in permutation patterns and bijective proof. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Jan 15]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50595/.

Council of Science Editors:

Shar N. Experimental methods in permutation patterns and bijective proof. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/50595/


Oregon State University

2. Maxwell, Mark M. Asymptotic enumeration for combinatorial structures.

Degree: PhD, Mathematics, 1994, Oregon State University

 There are many combinatorial structures which can be regarded as complexes of certain basic blocks. Familiar examples are involutions, finite graphs, and Stirling numbers of… (more)

Subjects/Keywords: Combinatorial enumeration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maxwell, M. M. (1994). Asymptotic enumeration for combinatorial structures. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/16827

Chicago Manual of Style (16th Edition):

Maxwell, Mark M. “Asymptotic enumeration for combinatorial structures.” 1994. Doctoral Dissertation, Oregon State University. Accessed January 15, 2021. http://hdl.handle.net/1957/16827.

MLA Handbook (7th Edition):

Maxwell, Mark M. “Asymptotic enumeration for combinatorial structures.” 1994. Web. 15 Jan 2021.

Vancouver:

Maxwell MM. Asymptotic enumeration for combinatorial structures. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1957/16827.

Council of Science Editors:

Maxwell MM. Asymptotic enumeration for combinatorial structures. [Doctoral Dissertation]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/16827


Florida Atlantic University

3. Sullivan, Shaun. Multivariate finite operator calculus applied to counting ballot paths containing patterns.

Degree: PhD, 2011, Florida Atlantic University

Summary: Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length,… (more)

Subjects/Keywords: Combinatorial probabilities; Lattice paths; Combinatorial enumeration problems; Generating functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sullivan, S. (2011). Multivariate finite operator calculus applied to counting ballot paths containing patterns. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3174076

Chicago Manual of Style (16th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Doctoral Dissertation, Florida Atlantic University. Accessed January 15, 2021. http://purl.flvc.org/FAU/3174076.

MLA Handbook (7th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Web. 15 Jan 2021.

Vancouver:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2011. [cited 2021 Jan 15]. Available from: http://purl.flvc.org/FAU/3174076.

Council of Science Editors:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Doctoral Dissertation]. Florida Atlantic University; 2011. Available from: http://purl.flvc.org/FAU/3174076


Michigan State University

4. Baker-Jarvis, Duff. Bijective proofs for the shuffle compatibility of descent statistics.

Degree: 2019, Michigan State University

Thesis Ph. D. Michigan State University. Mathematics 2019

"Define a permutation to be any sequence of distinct positive integers. Given two permutations pi and sigma… (more)

Subjects/Keywords: Nonparametric statistics; Combinatorial analysis; Distribution (Probability theory); Combinatorial enumeration problems; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baker-Jarvis, D. (2019). Bijective proofs for the shuffle compatibility of descent statistics. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:47771

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Baker-Jarvis, Duff. “Bijective proofs for the shuffle compatibility of descent statistics.” 2019. Thesis, Michigan State University. Accessed January 15, 2021. http://etd.lib.msu.edu/islandora/object/etd:47771.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Baker-Jarvis, Duff. “Bijective proofs for the shuffle compatibility of descent statistics.” 2019. Web. 15 Jan 2021.

Vancouver:

Baker-Jarvis D. Bijective proofs for the shuffle compatibility of descent statistics. [Internet] [Thesis]. Michigan State University; 2019. [cited 2021 Jan 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:47771.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Baker-Jarvis D. Bijective proofs for the shuffle compatibility of descent statistics. [Thesis]. Michigan State University; 2019. Available from: http://etd.lib.msu.edu/islandora/object/etd:47771

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Reykjavík University

5. Christian Bean 1993-. Finding structure in permutation sets .

Degree: 2018, Reykjavík University

 New automatic methods for enumerating permutation classes are introduced. The first is Struct, which is an algorithm that conjectures a structural description using rules similar… (more)

Subjects/Keywords: Tölvunarfræði; Doktorsritgerðir; Talningarfræði; Computer science; Combinatorial enumeration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

1993-, C. B. (2018). Finding structure in permutation sets . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/31663

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

1993-, Christian Bean. “Finding structure in permutation sets .” 2018. Thesis, Reykjavík University. Accessed January 15, 2021. http://hdl.handle.net/1946/31663.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

1993-, Christian Bean. “Finding structure in permutation sets .” 2018. Web. 15 Jan 2021.

Vancouver:

1993- CB. Finding structure in permutation sets . [Internet] [Thesis]. Reykjavík University; 2018. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1946/31663.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

1993- CB. Finding structure in permutation sets . [Thesis]. Reykjavík University; 2018. Available from: http://hdl.handle.net/1946/31663

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Michigan State University

6. Ionel, Eleny-Nocoleta. Genus one enumerative invariants in Pn.

Degree: PhD, Department of Mathematics, 1995, Michigan State University

Subjects/Keywords: Geometry, Algebraic; Combinatorial enumeration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ionel, E. (1995). Genus one enumerative invariants in Pn. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:25986

Chicago Manual of Style (16th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Doctoral Dissertation, Michigan State University. Accessed January 15, 2021. http://etd.lib.msu.edu/islandora/object/etd:25986.

MLA Handbook (7th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Web. 15 Jan 2021.

Vancouver:

Ionel E. Genus one enumerative invariants in Pn. [Internet] [Doctoral dissertation]. Michigan State University; 1995. [cited 2021 Jan 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986.

Council of Science Editors:

Ionel E. Genus one enumerative invariants in Pn. [Doctoral Dissertation]. Michigan State University; 1995. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986


Stellenbosch University

7. Selkirk, Sarah Jane. On a generalisation of k-Dyck paths.

Degree: MSc, Mathematical Sciences, 2019, Stellenbosch University

ENGLISH ABSTRACT: (Refer to full text abstract for symbols that did not transfer correctly). We consider a family of non-negative lattice paths consisting of the… (more)

Subjects/Keywords: Combinatorial analysis; Lattice paths; Combinational enumeration problems; Dyck paths; Catalan numbers (Mathematics); UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Selkirk, S. J. (2019). On a generalisation of k-Dyck paths. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/107091

Chicago Manual of Style (16th Edition):

Selkirk, Sarah Jane. “On a generalisation of k-Dyck paths.” 2019. Masters Thesis, Stellenbosch University. Accessed January 15, 2021. http://hdl.handle.net/10019.1/107091.

MLA Handbook (7th Edition):

Selkirk, Sarah Jane. “On a generalisation of k-Dyck paths.” 2019. Web. 15 Jan 2021.

Vancouver:

Selkirk SJ. On a generalisation of k-Dyck paths. [Internet] [Masters thesis]. Stellenbosch University; 2019. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10019.1/107091.

Council of Science Editors:

Selkirk SJ. On a generalisation of k-Dyck paths. [Masters Thesis]. Stellenbosch University; 2019. Available from: http://hdl.handle.net/10019.1/107091

8. Koda, Yasunori. Combinatorial algorithms on partially ordered sets.

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

 The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats… (more)

Subjects/Keywords: Combinatorial enumeration problems; Partially ordered sets

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koda, Y. (2018). Combinatorial algorithms on partially ordered sets. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9558

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Thesis, University of Victoria. Accessed January 15, 2021. https://dspace.library.uvic.ca//handle/1828/9558.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Web. 15 Jan 2021.

Vancouver:

Koda Y. Combinatorial algorithms on partially ordered sets. [Internet] [Thesis]. University of Victoria; 2018. [cited 2021 Jan 15]. Available from: https://dspace.library.uvic.ca//handle/1828/9558.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koda Y. Combinatorial algorithms on partially ordered sets. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9558

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Freie Universität Berlin

9. Jochemko, Katharina Victoria. Über die Kombinatorik von Bewertungen.

Degree: 2015, Freie Universität Berlin

 Die vorliegende Arbeit beschäftigt sich mit der Struktur translationsinvarianter Bewertungen auf Polytopen und damit im Zusammenhang stehenden Abzählproblemen mit geometrischen Lösungsansätzen. Den Ausgangspunkt des ersten… (more)

Subjects/Keywords: Polytopes; valuations; nonnegativity; lattice point enumeration; unimodality; order preserving maps; combinatorial reciprocity;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jochemko, K. V. (2015). Über die Kombinatorik von Bewertungen. (Thesis). Freie Universität Berlin. Retrieved from https://refubium.fu-berlin.de/handle/fub188/11166

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jochemko, Katharina Victoria. “Über die Kombinatorik von Bewertungen.” 2015. Thesis, Freie Universität Berlin. Accessed January 15, 2021. https://refubium.fu-berlin.de/handle/fub188/11166.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jochemko, Katharina Victoria. “Über die Kombinatorik von Bewertungen.” 2015. Web. 15 Jan 2021.

Vancouver:

Jochemko KV. Über die Kombinatorik von Bewertungen. [Internet] [Thesis]. Freie Universität Berlin; 2015. [cited 2021 Jan 15]. Available from: https://refubium.fu-berlin.de/handle/fub188/11166.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jochemko KV. Über die Kombinatorik von Bewertungen. [Thesis]. Freie Universität Berlin; 2015. Available from: https://refubium.fu-berlin.de/handle/fub188/11166

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Oxford

10. Farr, Graham E. Topics in computational complexity.

Degree: PhD, 1986, University of Oxford

The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete.

Subjects/Keywords: 510; Computational complexity : Combinatorial enumeration problems : Percolation (Statistical physics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farr, G. E. (1986). Topics in computational complexity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525

Chicago Manual of Style (16th Edition):

Farr, Graham E. “Topics in computational complexity.” 1986. Doctoral Dissertation, University of Oxford. Accessed January 15, 2021. http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525.

MLA Handbook (7th Edition):

Farr, Graham E. “Topics in computational complexity.” 1986. Web. 15 Jan 2021.

Vancouver:

Farr GE. Topics in computational complexity. [Internet] [Doctoral dissertation]. University of Oxford; 1986. [cited 2021 Jan 15]. Available from: http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525.

Council of Science Editors:

Farr GE. Topics in computational complexity. [Doctoral Dissertation]. University of Oxford; 1986. Available from: http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525


Florida Atlantic University

11. Bozovic, Vladimir. Algebraic and combinatorial aspects of group factorizations.

Degree: PhD, 2008, Florida Atlantic University

Summary: The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a… (more)

Subjects/Keywords: Physical measurements; Mapping (Mathematics); Combinatorial enumeration problems; Algebra, Abstract

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bozovic, V. (2008). Algebraic and combinatorial aspects of group factorizations. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/107805

Chicago Manual of Style (16th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Doctoral Dissertation, Florida Atlantic University. Accessed January 15, 2021. http://purl.flvc.org/FAU/107805.

MLA Handbook (7th Edition):

Bozovic, Vladimir. “Algebraic and combinatorial aspects of group factorizations.” 2008. Web. 15 Jan 2021.

Vancouver:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2008. [cited 2021 Jan 15]. Available from: http://purl.flvc.org/FAU/107805.

Council of Science Editors:

Bozovic V. Algebraic and combinatorial aspects of group factorizations. [Doctoral Dissertation]. Florida Atlantic University; 2008. Available from: http://purl.flvc.org/FAU/107805


Virginia Tech

12. Ramachandran, Sridhar. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.

Degree: MS, Industrial and Systems Engineering, 1991, Virginia Tech

Subjects/Keywords: Combinatorial enumeration problems; LD5655.V855 1991.R363

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramachandran, S. (1991). A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/45116

Chicago Manual of Style (16th Edition):

Ramachandran, Sridhar. “A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.” 1991. Masters Thesis, Virginia Tech. Accessed January 15, 2021. http://hdl.handle.net/10919/45116.

MLA Handbook (7th Edition):

Ramachandran, Sridhar. “A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem.” 1991. Web. 15 Jan 2021.

Vancouver:

Ramachandran S. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. [Internet] [Masters thesis]. Virginia Tech; 1991. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10919/45116.

Council of Science Editors:

Ramachandran S. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem. [Masters Thesis]. Virginia Tech; 1991. Available from: http://hdl.handle.net/10919/45116


Simon Fraser University

13. Ahmad, Seema. Some results on the structure of the [sigma]2 enumeration degrees.

Degree: 1989, Simon Fraser University

Subjects/Keywords: Recursive functions.; Computable functions.; Combinatorial enumeration problems.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmad, S. (1989). Some results on the structure of the [sigma]2 enumeration degrees. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/7884

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmad, Seema. “Some results on the structure of the [sigma]2 enumeration degrees.” 1989. Thesis, Simon Fraser University. Accessed January 15, 2021. http://summit.sfu.ca/item/7884.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmad, Seema. “Some results on the structure of the [sigma]2 enumeration degrees.” 1989. Web. 15 Jan 2021.

Vancouver:

Ahmad S. Some results on the structure of the [sigma]2 enumeration degrees. [Internet] [Thesis]. Simon Fraser University; 1989. [cited 2021 Jan 15]. Available from: http://summit.sfu.ca/item/7884.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmad S. Some results on the structure of the [sigma]2 enumeration degrees. [Thesis]. Simon Fraser University; 1989. Available from: http://summit.sfu.ca/item/7884

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Simon Fraser University

14. Wehner, Stephan. Computable enumeration and the problem of repetition.

Degree: 1995, Simon Fraser University

Subjects/Keywords: Combinatorial enumeration problems.; Computable functions.; Recursion theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wehner, S. (1995). Computable enumeration and the problem of repetition. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wehner, Stephan. “Computable enumeration and the problem of repetition.” 1995. Thesis, Simon Fraser University. Accessed January 15, 2021. http://summit.sfu.ca/item/6715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wehner, Stephan. “Computable enumeration and the problem of repetition.” 1995. Web. 15 Jan 2021.

Vancouver:

Wehner S. Computable enumeration and the problem of repetition. [Internet] [Thesis]. Simon Fraser University; 1995. [cited 2021 Jan 15]. Available from: http://summit.sfu.ca/item/6715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wehner S. Computable enumeration and the problem of repetition. [Thesis]. Simon Fraser University; 1995. Available from: http://summit.sfu.ca/item/6715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Manes, Konstantinos. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.

Degree: 2014, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς

The Catalan numbers are considered to be the second most significant numbers in Combinatorics, after the binomial coefficients, because they appear frequently in various combinatorial(more)

Subjects/Keywords: Μονοπάτια Dyck; Μονοπάτια Grand-Dyck; Αριθμοί Catalan; ΓΕΝΝΗΤΡΙΕΣ ΣΥΝΑΡΤΗΣΕΙΣ; Συνδυαστική απαρίθμηση; Τύπος αντιστροφής Lagrange; Dyck paths; Grand-Dyck paths; Catalan numbers; GENERATING FUNCTIONS; Combinatorial enumeration; Lagrange inversion formula

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manes, K. (2014). Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. (Thesis). University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Retrieved from http://hdl.handle.net/10442/hedi/34603

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Manes, Konstantinos. “Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.” 2014. Thesis, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Accessed January 15, 2021. http://hdl.handle.net/10442/hedi/34603.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Manes, Konstantinos. “Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck.” 2014. Web. 15 Jan 2021.

Vancouver:

Manes K. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. [Internet] [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10442/hedi/34603.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Manes K. Απαρίθμηση προτύπων σε μονοπάτια Dyck και Grand-Dyck. [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2014. Available from: http://hdl.handle.net/10442/hedi/34603

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


California State University – San Bernardino

16. Nazzal, Lamies Joureus. Homomorphic images of semi-direct products.

Degree: MAin Mathematics, Mathematics, 2004, California State University – San Bernardino

The main purpose of this thesis is to describe methods of constructing computer-free proofs of existence of finite groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

Subjects/Keywords: Finite groups; Products of subgroups; Combinatorial enumeration problems; Isomorphisms (Mathematics); Representations of groups; Symmetric domains; Group theory; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nazzal, L. J. (2004). Homomorphic images of semi-direct products. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd-project/2770

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nazzal, Lamies Joureus. “Homomorphic images of semi-direct products.” 2004. Thesis, California State University – San Bernardino. Accessed January 15, 2021. https://scholarworks.lib.csusb.edu/etd-project/2770.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nazzal, Lamies Joureus. “Homomorphic images of semi-direct products.” 2004. Web. 15 Jan 2021.

Vancouver:

Nazzal LJ. Homomorphic images of semi-direct products. [Internet] [Thesis]. California State University – San Bernardino; 2004. [cited 2021 Jan 15]. Available from: https://scholarworks.lib.csusb.edu/etd-project/2770.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nazzal LJ. Homomorphic images of semi-direct products. [Thesis]. California State University – San Bernardino; 2004. Available from: https://scholarworks.lib.csusb.edu/etd-project/2770

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Queensland

17. Marbach, Trent. Latin Squares and Related Structures.

Degree: School of Mathematics & Physics, 2016, University of Queensland

Subjects/Keywords: latin square; latin trade; transversal; nearly orthogonal; k-homogeneous; intersection problem; combinatorial enumeration; 0101 Pure Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marbach, T. (2016). Latin Squares and Related Structures. (Thesis). University of Queensland. Retrieved from http://espace.library.uq.edu.au/view/UQ:400935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Marbach, Trent. “Latin Squares and Related Structures.” 2016. Thesis, University of Queensland. Accessed January 15, 2021. http://espace.library.uq.edu.au/view/UQ:400935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Marbach, Trent. “Latin Squares and Related Structures.” 2016. Web. 15 Jan 2021.

Vancouver:

Marbach T. Latin Squares and Related Structures. [Internet] [Thesis]. University of Queensland; 2016. [cited 2021 Jan 15]. Available from: http://espace.library.uq.edu.au/view/UQ:400935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marbach T. Latin Squares and Related Structures. [Thesis]. University of Queensland; 2016. Available from: http://espace.library.uq.edu.au/view/UQ:400935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Belhoul, Lyes. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.

Degree: Docteur es, Informatique, 2014, Paris 9

Notre objectif dans cette thèse est de proposer des algorithmes efficaces pour résoudre des problèmes d’optimisation combinatoire difficiles. Dans un premier temps, nous établissons le… (more)

Subjects/Keywords: Énumération ordonnée; Branch and Bound; Problèmes d’optimisation combinatoire mono et multi-Objectifs; Problème d’affectation; Problème du voyageur de commerce asymétrique; Ordered Enumeration; Branch and Bound; Mono and Multi-Objective Combinatorial Optimization Problems; Assignment Problem; Asymmetric Travelling Salesman Problem; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Belhoul, L. (2014). Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2014PA090060

Chicago Manual of Style (16th Edition):

Belhoul, Lyes. “Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.” 2014. Doctoral Dissertation, Paris 9. Accessed January 15, 2021. http://www.theses.fr/2014PA090060.

MLA Handbook (7th Edition):

Belhoul, Lyes. “Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration.” 2014. Web. 15 Jan 2021.

Vancouver:

Belhoul L. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. [Internet] [Doctoral dissertation]. Paris 9; 2014. [cited 2021 Jan 15]. Available from: http://www.theses.fr/2014PA090060.

Council of Science Editors:

Belhoul L. Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée : Solving single and multi-objective combinatorial optimization problems by ordered enumeration. [Doctoral Dissertation]. Paris 9; 2014. Available from: http://www.theses.fr/2014PA090060

19. Carroll, Christina C. Enumerative combinatorics of posets.

Degree: PhD, Mathematics, 2008, Georgia Tech

 This thesis contains several results concerning the combinatorics of partially ordered sets (posets) which are either of enumerative or extremal nature. The first concerns conjectures… (more)

Subjects/Keywords: Enumeration; Entropy; Dedekind's problem; Combinatorial analysis; Partially ordered sets; Graph theory

…1.4 Entropy as an Enumeration Tool Entropy is a concept which has its origins in physics… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carroll, C. C. (2008). Enumerative combinatorics of posets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/22659

Chicago Manual of Style (16th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Doctoral Dissertation, Georgia Tech. Accessed January 15, 2021. http://hdl.handle.net/1853/22659.

MLA Handbook (7th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Web. 15 Jan 2021.

Vancouver:

Carroll CC. Enumerative combinatorics of posets. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1853/22659.

Council of Science Editors:

Carroll CC. Enumerative combinatorics of posets. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/22659

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

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

 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

…most natural of these, and it imposes a visually appealing structure with nice combinatorial… …Chapters 3 and 4, followed by natural extensions to combinatorial algorithms, in Chapter 5… …the one mentioned above. 1.1 Main results The combinatorial richness of tatami coverings… …characterisation or enumeration of them would be much more complicated. The structure discovered by the… …encapsulate some of the combinatorial properties of coverings of the rectangle. Here, isomorphism… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Erickson, Alejandro. “Monomino-Domino Tatami Coverings.” 2013. Web. 15 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


ETH Zürich

21. Razen, Andreas. Crossing-Free Configurations on Planar Point Sets.

Degree: 2009, ETH Zürich

Subjects/Keywords: GRAPH TRANSFORMATIONS (GRAPH THEORY); COMBINATORIAL ENUMERATION; GRAPHENZERLEGUNG (GRAPHENTHEORIE); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); ABZÄHLENDE KOMBINATORIK; GRAPH PARTITIONING (GRAPH THEORY); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); GRAPHENTRANSFORMATIONEN (GRAPHENTHEORIE); info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Razen, A. (2009). Crossing-Free Configurations on Planar Point Sets. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72836

Chicago Manual of Style (16th Edition):

Razen, Andreas. “Crossing-Free Configurations on Planar Point Sets.” 2009. Doctoral Dissertation, ETH Zürich. Accessed January 15, 2021. http://hdl.handle.net/20.500.11850/72836.

MLA Handbook (7th Edition):

Razen, Andreas. “Crossing-Free Configurations on Planar Point Sets.” 2009. Web. 15 Jan 2021.

Vancouver:

Razen A. Crossing-Free Configurations on Planar Point Sets. [Internet] [Doctoral dissertation]. ETH Zürich; 2009. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/20.500.11850/72836.

Council of Science Editors:

Razen A. Crossing-Free Configurations on Planar Point Sets. [Doctoral Dissertation]. ETH Zürich; 2009. Available from: http://hdl.handle.net/20.500.11850/72836

22. Βαμβακάρη, Μαλβίνα. Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.

Degree: 1997, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

Subjects/Keywords: Συνδυαστικές δομές; Κεντρικά οριακά θεωρήματα; Τοπικά οριακά θεωρήματα; Ορθογώνια πολυώνυμα; Σύνολα και πολυώνυμα συζεύξεως γραφημάτων; Ταχύτητα σύγκλισης; Ασυμπτωτικές μέθοδοι απαρίθμησης; Μονοδιάστατες-πολυδιάστατες διακριτές κατανομές δυναμοσειράς; Univariate-multivariate discrete power series distributions; Combinatorial structures; Central limit theorems; Local linit theorems; Orthogonal polynomials; Matching sets and polynomials of graphs; Rate of convergence; Asymptotic methods of enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Βαμβακάρη, . . (1997). Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/19922

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Βαμβακάρη, Μαλβίνα. “Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.” 1997. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed January 15, 2021. http://hdl.handle.net/10442/hedi/19922.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Βαμβακάρη, Μαλβίνα. “Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις.” 1997. Web. 15 Jan 2021.

Vancouver:

Βαμβακάρη . Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 1997. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10442/hedi/19922.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Βαμβακάρη . Κεντρικά και τοπικά οριακά θεωρήματα για πολλαπλές ακολουθίες μη αρνητικών αριθμών - ασυμπτωτικές εκφράσεις. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 1997. Available from: http://hdl.handle.net/10442/hedi/19922

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

23. Williams, Aaron Michael. Shift gray codes.

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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Williams, Aaron Michael. “Shift gray codes.” 2009. Web. 15 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.