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:(enumeration). Showing records 1 – 30 of 191 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Melbourne

1. Foxcroft, John Spencer Hugh. Combinatorial enumeration and the Bethe Ansatz.

Degree: 2017, University of Melbourne

 This thesis focuses on combinatorial enumeration of lattice paths using the Constant Term method. In particular we make use of the Bethe Ansatz, an Ansatz… (more)

Subjects/Keywords: combinatorics; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foxcroft, J. S. H. (2017). Combinatorial enumeration and the Bethe Ansatz. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/210785

Chicago Manual of Style (16th Edition):

Foxcroft, John Spencer Hugh. “Combinatorial enumeration and the Bethe Ansatz.” 2017. Doctoral Dissertation, University of Melbourne. Accessed August 14, 2020. http://hdl.handle.net/11343/210785.

MLA Handbook (7th Edition):

Foxcroft, John Spencer Hugh. “Combinatorial enumeration and the Bethe Ansatz.” 2017. Web. 14 Aug 2020.

Vancouver:

Foxcroft JSH. Combinatorial enumeration and the Bethe Ansatz. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/11343/210785.

Council of Science Editors:

Foxcroft JSH. Combinatorial enumeration and the Bethe Ansatz. [Doctoral Dissertation]. University of Melbourne; 2017. Available from: http://hdl.handle.net/11343/210785


Rutgers University

2. 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 August 14, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/50595/.

MLA Handbook (7th Edition):

Shar, Nathaniel. “Experimental methods in permutation patterns and bijective proof.” 2016. Web. 14 Aug 2020.

Vancouver:

Shar N. Experimental methods in permutation patterns and bijective proof. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Aug 14]. 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/

3. Maruoka, Shinji. State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: state enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maruoka, S. (n.d.). State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/1428

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maruoka, Shinji. “State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed August 14, 2020. http://hdl.handle.net/10061/1428.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maruoka, Shinji. “State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ.” Web. 14 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Maruoka S. State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10061/1428.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Maruoka S. State Enumeration Using Propositional Satisfiability and its Application to Multi-Clock Path Analysis : 充足可能性判定を用いた状態数え上げとマルチクロックパス解析への応用; ジュウソク カノウセイ ハンテイ オ モチイタ ジョウタイ カゾエアゲ ト マルチ クロック パス カイセキ エノ オウヨウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/1428

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


California State University – San Bernardino

4. Seager, Charles. Symmetric Presentations and Double Coset Enumeration.

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

  In this project, we demonstrate our discovery of original symmetric presentations and constructions of important groups, including nonabelian simple groups, and groups that have… (more)

Subjects/Keywords: Double Coset Enumeration; Other Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seager, C. (2018). Symmetric Presentations and Double Coset Enumeration. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/783

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):

Seager, Charles. “Symmetric Presentations and Double Coset Enumeration.” 2018. Thesis, California State University – San Bernardino. Accessed August 14, 2020. https://scholarworks.lib.csusb.edu/etd/783.

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

MLA Handbook (7th Edition):

Seager, Charles. “Symmetric Presentations and Double Coset Enumeration.” 2018. Web. 14 Aug 2020.

Vancouver:

Seager C. Symmetric Presentations and Double Coset Enumeration. [Internet] [Thesis]. California State University – San Bernardino; 2018. [cited 2020 Aug 14]. Available from: https://scholarworks.lib.csusb.edu/etd/783.

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

Council of Science Editors:

Seager C. Symmetric Presentations and Double Coset Enumeration. [Thesis]. California State University – San Bernardino; 2018. Available from: https://scholarworks.lib.csusb.edu/etd/783

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


University of Florida

5. Van Duzer, Anthony. Vertices of Rooted Trees, and Their Distance from the Closest Leaf.

Degree: PhD, Mathematics, 2019, University of Florida

 This dissertation will present a general way to calculate the asymptotic probability that a random vertex chosen from all trees of size n of a… (more)

Subjects/Keywords: combinatorics  – enumeration  – math  – trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Duzer, A. (2019). Vertices of Rooted Trees, and Their Distance from the Closest Leaf. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0054311

Chicago Manual of Style (16th Edition):

Van Duzer, Anthony. “Vertices of Rooted Trees, and Their Distance from the Closest Leaf.” 2019. Doctoral Dissertation, University of Florida. Accessed August 14, 2020. https://ufdc.ufl.edu/UFE0054311.

MLA Handbook (7th Edition):

Van Duzer, Anthony. “Vertices of Rooted Trees, and Their Distance from the Closest Leaf.” 2019. Web. 14 Aug 2020.

Vancouver:

Van Duzer A. Vertices of Rooted Trees, and Their Distance from the Closest Leaf. [Internet] [Doctoral dissertation]. University of Florida; 2019. [cited 2020 Aug 14]. Available from: https://ufdc.ufl.edu/UFE0054311.

Council of Science Editors:

Van Duzer A. Vertices of Rooted Trees, and Their Distance from the Closest Leaf. [Doctoral Dissertation]. University of Florida; 2019. Available from: https://ufdc.ufl.edu/UFE0054311


University of Waterloo

6. Rhee, Donguk. Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux.

Degree: 2012, University of Waterloo

 Cyclic sieving phenomenon (CSP) is a generalization by Reiner, Stanton, White of Stembridge's q=-1 phenomenon. When CSP is exhibited, orbits of a cyclic action on… (more)

Subjects/Keywords: Combinatorics; Enumeration; Cyclic sieving phenomenon

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rhee, D. (2012). Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7071

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):

Rhee, Donguk. “Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux.” 2012. Thesis, University of Waterloo. Accessed August 14, 2020. http://hdl.handle.net/10012/7071.

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

MLA Handbook (7th Edition):

Rhee, Donguk. “Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux.” 2012. Web. 14 Aug 2020.

Vancouver:

Rhee D. Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10012/7071.

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

Council of Science Editors:

Rhee D. Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/7071

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


University of Waterloo

7. La Croix, Michael Andrew. The combinatorics of the Jack parameter and the genus series for topological maps.

Degree: 2009, University of Waterloo

 Informally, a rooted map is a topologically pointed embedding of a graph in a surface. This thesis examines two problems in the enumerative theory of… (more)

Subjects/Keywords: Maps; Enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

La Croix, M. A. (2009). The combinatorics of the Jack parameter and the genus series for topological maps. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4561

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):

La Croix, Michael Andrew. “The combinatorics of the Jack parameter and the genus series for topological maps.” 2009. Thesis, University of Waterloo. Accessed August 14, 2020. http://hdl.handle.net/10012/4561.

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

MLA Handbook (7th Edition):

La Croix, Michael Andrew. “The combinatorics of the Jack parameter and the genus series for topological maps.” 2009. Web. 14 Aug 2020.

Vancouver:

La Croix MA. The combinatorics of the Jack parameter and the genus series for topological maps. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10012/4561.

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

Council of Science Editors:

La Croix MA. The combinatorics of the Jack parameter and the genus series for topological maps. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4561

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


University of Waterloo

8. Chan, Aaron C.S. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.

Degree: 2016, University of Waterloo

 The problem of map enumeration is one that has been studied intensely for the past half century. Early work on this subject included the works… (more)

Subjects/Keywords: combinatorics; enumeration; maps; permutations; genus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, A. C. S. (2016). Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10541

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):

Chan, Aaron C S. “Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.” 2016. Thesis, University of Waterloo. Accessed August 14, 2020. http://hdl.handle.net/10012/10541.

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

MLA Handbook (7th Edition):

Chan, Aaron C S. “Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.” 2016. Web. 14 Aug 2020.

Vancouver:

Chan ACS. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10012/10541.

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

Council of Science Editors:

Chan ACS. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10541

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


University of Guelph

9. Trick, Lana. Enumeration of Illusory Contours.

Degree: MS, Department of Psychology, 2014, University of Guelph

 Visual search and enumeration tasks were used to assess the attentional demands of processing illusory contour figures (figures composed of contours that are perceived despite… (more)

Subjects/Keywords: enumeration; illusory contour; visual search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trick, L. (2014). Enumeration of Illusory Contours. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8504

Chicago Manual of Style (16th Edition):

Trick, Lana. “Enumeration of Illusory Contours.” 2014. Masters Thesis, University of Guelph. Accessed August 14, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8504.

MLA Handbook (7th Edition):

Trick, Lana. “Enumeration of Illusory Contours.” 2014. Web. 14 Aug 2020.

Vancouver:

Trick L. Enumeration of Illusory Contours. [Internet] [Masters thesis]. University of Guelph; 2014. [cited 2020 Aug 14]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8504.

Council of Science Editors:

Trick L. Enumeration of Illusory Contours. [Masters Thesis]. University of Guelph; 2014. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8504


University of Melbourne

10. Chen, Jian. The role of attention in subitizing.

Degree: 2019, University of Melbourne

 This thesis aimed to address a long-standing question: “Why are small numbers of items enumerated differently from large numbers of items?” (Trick & Pylyshyn, 1993,… (more)

Subjects/Keywords: subitizing; counting; enumeration; attention; Posner cueing paradigm; visual enumeration mechanism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2019). The role of attention in subitizing. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/230741

Chicago Manual of Style (16th Edition):

Chen, Jian. “The role of attention in subitizing.” 2019. Doctoral Dissertation, University of Melbourne. Accessed August 14, 2020. http://hdl.handle.net/11343/230741.

MLA Handbook (7th Edition):

Chen, Jian. “The role of attention in subitizing.” 2019. Web. 14 Aug 2020.

Vancouver:

Chen J. The role of attention in subitizing. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/11343/230741.

Council of Science Editors:

Chen J. The role of attention in subitizing. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/230741


Bowling Green State University

11. Marshall, Andrew. A Computationally Easy Indexing of a Language of While Programs.

Degree: MS, Computer Science, 2008, Bowling Green State University

 The concept of an effective enumeration of all possible computer programs is a foundation of computability theory. To achieve an effective enumeration an indexing is… (more)

Subjects/Keywords: Computer Science; effective enumeration; while language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marshall, A. (2008). A Computationally Easy Indexing of a Language of While Programs. (Masters Thesis). Bowling Green State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586

Chicago Manual of Style (16th Edition):

Marshall, Andrew. “A Computationally Easy Indexing of a Language of While Programs.” 2008. Masters Thesis, Bowling Green State University. Accessed August 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586.

MLA Handbook (7th Edition):

Marshall, Andrew. “A Computationally Easy Indexing of a Language of While Programs.” 2008. Web. 14 Aug 2020.

Vancouver:

Marshall A. A Computationally Easy Indexing of a Language of While Programs. [Internet] [Masters thesis]. Bowling Green State University; 2008. [cited 2020 Aug 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586.

Council of Science Editors:

Marshall A. A Computationally Easy Indexing of a Language of While Programs. [Masters Thesis]. Bowling Green State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586


University of Alberta

12. Wang, Huaiyu. Effect of bacterial stress response on pathogen enumeration and its implications for food safety.

Degree: MS, Department of Agricultural, Food, and Nutritional Science, 2010, University of Alberta

 To determine the impact of stress response on enumeration, cell association status and the viability of Escherichia coli DH5α, Staphylococcus aureus ATCC 13565 and Listeria… (more)

Subjects/Keywords: bacterial stress response; food safety; pathogen enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2010). Effect of bacterial stress response on pathogen enumeration and its implications for food safety. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/0c483k54m

Chicago Manual of Style (16th Edition):

Wang, Huaiyu. “Effect of bacterial stress response on pathogen enumeration and its implications for food safety.” 2010. Masters Thesis, University of Alberta. Accessed August 14, 2020. https://era.library.ualberta.ca/files/0c483k54m.

MLA Handbook (7th Edition):

Wang, Huaiyu. “Effect of bacterial stress response on pathogen enumeration and its implications for food safety.” 2010. Web. 14 Aug 2020.

Vancouver:

Wang H. Effect of bacterial stress response on pathogen enumeration and its implications for food safety. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2020 Aug 14]. Available from: https://era.library.ualberta.ca/files/0c483k54m.

Council of Science Editors:

Wang H. Effect of bacterial stress response on pathogen enumeration and its implications for food safety. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/0c483k54m


University of Waterloo

13. Sato, Cristiane Maria. Core Structures in Random Graphs and Hypergraphs.

Degree: 2013, University of Waterloo

 The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by… (more)

Subjects/Keywords: combinatorics; graph theory; random graphs; probabilistic; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sato, C. M. (2013). Core Structures in Random Graphs and Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7787

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):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Thesis, University of Waterloo. Accessed August 14, 2020. http://hdl.handle.net/10012/7787.

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

MLA Handbook (7th Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Web. 14 Aug 2020.

Vancouver:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10012/7787.

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

Council of Science Editors:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7787

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

14. Guay-Paquet, Mathieu. Algebraic Methods and Monotone Hurwitz Numbers.

Degree: 2012, University of Waterloo

 We develop algebraic methods to solve join-cut equations, which are partial differential equations that arise in the study of permutation factorizations. Using these techniques, we… (more)

Subjects/Keywords: Combinatorics; Enumeration

…and give the answer to some enumeration problem on permutations, then this problem is said… …Since many important enumeration problems can be phrased in terms of this basic problem… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guay-Paquet, M. (2012). Algebraic Methods and Monotone Hurwitz Numbers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7005

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):

Guay-Paquet, Mathieu. “Algebraic Methods and Monotone Hurwitz Numbers.” 2012. Thesis, University of Waterloo. Accessed August 14, 2020. http://hdl.handle.net/10012/7005.

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

MLA Handbook (7th Edition):

Guay-Paquet, Mathieu. “Algebraic Methods and Monotone Hurwitz Numbers.” 2012. Web. 14 Aug 2020.

Vancouver:

Guay-Paquet M. Algebraic Methods and Monotone Hurwitz Numbers. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10012/7005.

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

Council of Science Editors:

Guay-Paquet M. Algebraic Methods and Monotone Hurwitz Numbers. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/7005

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


University of Pretoria

15. Cochrane, Wolf. In silico synthesis of analogous lead libraries for drug design by molecular enumeration.

Degree: Biochemistry, 2008, University of Pretoria

 The current costs of drug discovery are extremely high and need to be addressed if diseases such as AIDS and malaria are to be combated.… (more)

Subjects/Keywords: Drugs; In silico; Enumeration; Liglib; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cochrane, W. (2008). In silico synthesis of analogous lead libraries for drug design by molecular enumeration. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/24052

Chicago Manual of Style (16th Edition):

Cochrane, Wolf. “In silico synthesis of analogous lead libraries for drug design by molecular enumeration.” 2008. Masters Thesis, University of Pretoria. Accessed August 14, 2020. http://hdl.handle.net/2263/24052.

MLA Handbook (7th Edition):

Cochrane, Wolf. “In silico synthesis of analogous lead libraries for drug design by molecular enumeration.” 2008. Web. 14 Aug 2020.

Vancouver:

Cochrane W. In silico synthesis of analogous lead libraries for drug design by molecular enumeration. [Internet] [Masters thesis]. University of Pretoria; 2008. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/2263/24052.

Council of Science Editors:

Cochrane W. In silico synthesis of analogous lead libraries for drug design by molecular enumeration. [Masters Thesis]. University of Pretoria; 2008. Available from: http://hdl.handle.net/2263/24052


University of Pretoria

16. [No author]. In silico synthesis of analogous lead libraries for drug design by molecular enumeration .

Degree: 2008, University of Pretoria

 The current costs of drug discovery are extremely high and need to be addressed if diseases such as AIDS and malaria are to be combated.… (more)

Subjects/Keywords: Drugs; In silico; Enumeration; Liglib; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2008). In silico synthesis of analogous lead libraries for drug design by molecular enumeration . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-04212008-135220/

Chicago Manual of Style (16th Edition):

author], [No. “In silico synthesis of analogous lead libraries for drug design by molecular enumeration .” 2008. Masters Thesis, University of Pretoria. Accessed August 14, 2020. http://upetd.up.ac.za/thesis/available/etd-04212008-135220/.

MLA Handbook (7th Edition):

author], [No. “In silico synthesis of analogous lead libraries for drug design by molecular enumeration .” 2008. Web. 14 Aug 2020.

Vancouver:

author] [. In silico synthesis of analogous lead libraries for drug design by molecular enumeration . [Internet] [Masters thesis]. University of Pretoria; 2008. [cited 2020 Aug 14]. Available from: http://upetd.up.ac.za/thesis/available/etd-04212008-135220/.

Council of Science Editors:

author] [. In silico synthesis of analogous lead libraries for drug design by molecular enumeration . [Masters Thesis]. University of Pretoria; 2008. Available from: http://upetd.up.ac.za/thesis/available/etd-04212008-135220/


Oregon State University

17. 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 August 14, 2020. http://hdl.handle.net/1957/16827.

MLA Handbook (7th Edition):

Maxwell, Mark M. “Asymptotic enumeration for combinatorial structures.” 1994. Web. 14 Aug 2020.

Vancouver:

Maxwell MM. Asymptotic enumeration for combinatorial structures. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2020 Aug 14]. 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


University of Otago

18. Li, Jinge. The enumeration of subclasses of the 321-avoiding permutations .

Degree: University of Otago

 This thesis is dedicated to the enumeration of subclasses of 321-avoiding permutations, using a combination of theoretical and experimental investigations. The thesis is organised as… (more)

Subjects/Keywords: permutation; patterns; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, J. (n.d.). The enumeration of subclasses of the 321-avoiding permutations . (Masters Thesis). University of Otago. Retrieved from http://hdl.handle.net/10523/7601

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16th Edition):

Li, Jinge. “The enumeration of subclasses of the 321-avoiding permutations .” Masters Thesis, University of Otago. Accessed August 14, 2020. http://hdl.handle.net/10523/7601.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7th Edition):

Li, Jinge. “The enumeration of subclasses of the 321-avoiding permutations .” Web. 14 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Li J. The enumeration of subclasses of the 321-avoiding permutations . [Internet] [Masters thesis]. University of Otago; [cited 2020 Aug 14]. Available from: http://hdl.handle.net/10523/7601.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Li J. The enumeration of subclasses of the 321-avoiding permutations . [Masters Thesis]. University of Otago; Available from: http://hdl.handle.net/10523/7601

Note: this citation may be lacking information needed for this citation format:
No year of publication.


Brigham Young University

19. Morgan, Wiley Spencer. Increasing the Computational Efficiency of Combinatoric Searches.

Degree: MS, 2016, Brigham Young University

 A new algorithm for the enumeration of derivative superstructures of a crystal is presented. The algorithm will help increase the efficiency of computational material design… (more)

Subjects/Keywords: enumeration; algorithm; combinatorics; Astrophysics and Astronomy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morgan, W. S. (2016). Increasing the Computational Efficiency of Combinatoric Searches. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7528&context=etd

Chicago Manual of Style (16th Edition):

Morgan, Wiley Spencer. “Increasing the Computational Efficiency of Combinatoric Searches.” 2016. Masters Thesis, Brigham Young University. Accessed August 14, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7528&context=etd.

MLA Handbook (7th Edition):

Morgan, Wiley Spencer. “Increasing the Computational Efficiency of Combinatoric Searches.” 2016. Web. 14 Aug 2020.

Vancouver:

Morgan WS. Increasing the Computational Efficiency of Combinatoric Searches. [Internet] [Masters thesis]. Brigham Young University; 2016. [cited 2020 Aug 14]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7528&context=etd.

Council of Science Editors:

Morgan WS. Increasing the Computational Efficiency of Combinatoric Searches. [Masters Thesis]. Brigham Young University; 2016. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7528&context=etd


California State University – San Bernardino

20. Gomez, David R, Jr. SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS.

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

  In this thesis we have investigated permutation and monomial progenitors of the form p^*n:N (p=2,3,5,...) and p^*n:_m N (p=3,5,7,...) respectively. We have discovered new… (more)

Subjects/Keywords: symmetric presentations; double coset enumeration; progenitor; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gomez, David R, J. (2014). SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/96

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):

Gomez, David R, Jr. “SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS.” 2014. Thesis, California State University – San Bernardino. Accessed August 14, 2020. https://scholarworks.lib.csusb.edu/etd/96.

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

MLA Handbook (7th Edition):

Gomez, David R, Jr. “SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS.” 2014. Web. 14 Aug 2020.

Vancouver:

Gomez, David R J. SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2020 Aug 14]. Available from: https://scholarworks.lib.csusb.edu/etd/96.

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

Council of Science Editors:

Gomez, David R J. SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS. [Thesis]. California State University – San Bernardino; 2014. Available from: https://scholarworks.lib.csusb.edu/etd/96

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


Georgia State University

21. Cleaton, Julie M. Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti.

Degree: MPH, Public Health, 2017, Georgia State University

  INTRODUCTION: Sight-resight studies are performed to estimate population sizes, in this case dog populations in rabies endemic areas. AIM: This study compares one- and… (more)

Subjects/Keywords: rabies; population estimation; enumeration; dogs; Lincoln-Petersen

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cleaton, J. M. (2017). Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/iph_theses/535

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):

Cleaton, Julie M. “Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti.” 2017. Thesis, Georgia State University. Accessed August 14, 2020. https://scholarworks.gsu.edu/iph_theses/535.

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

MLA Handbook (7th Edition):

Cleaton, Julie M. “Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti.” 2017. Web. 14 Aug 2020.

Vancouver:

Cleaton JM. Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti. [Internet] [Thesis]. Georgia State University; 2017. [cited 2020 Aug 14]. Available from: https://scholarworks.gsu.edu/iph_theses/535.

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

Council of Science Editors:

Cleaton JM. Comparing Sight-Resight Methods for Dog Populations: Analysis of 2015 and 2016 Rabies Vaccination Campaign Data from Haiti. [Thesis]. Georgia State University; 2017. Available from: https://scholarworks.gsu.edu/iph_theses/535

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


University of Illinois – Urbana-Champaign

22. Liu, Hong. Extremal graph theory: supersaturation and enumeration.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

 In this thesis, we study supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with Balogh, we disprove a conjecture of Erdos and Tuza… (more)

Subjects/Keywords: Supersaturation; Enumeration; Typical Structure; Extremal Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, H. (2015). Extremal graph theory: supersaturation and enumeration. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89148

Chicago Manual of Style (16th Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 14, 2020. http://hdl.handle.net/2142/89148.

MLA Handbook (7th Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Web. 14 Aug 2020.

Vancouver:

Liu H. Extremal graph theory: supersaturation and enumeration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/2142/89148.

Council of Science Editors:

Liu H. Extremal graph theory: supersaturation and enumeration. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89148


University of Illinois – Urbana-Champaign

23. Xie, Shunping. Towards characterizing the solution space of the 1-Dollo Phylogeny problem.

Degree: MS, Computer Science, 2019, University of Illinois – Urbana-Champaign

 Cancer cells may mutate multiple times, from a normal state to a mutated state and vice versa. Given our sequenced data, we can model the… (more)

Subjects/Keywords: 1-Dollo phylogeny; Skeleton; Enumeration algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, S. (2019). Towards characterizing the solution space of the 1-Dollo Phylogeny problem. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/104916

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):

Xie, Shunping. “Towards characterizing the solution space of the 1-Dollo Phylogeny problem.” 2019. Thesis, University of Illinois – Urbana-Champaign. Accessed August 14, 2020. http://hdl.handle.net/2142/104916.

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

MLA Handbook (7th Edition):

Xie, Shunping. “Towards characterizing the solution space of the 1-Dollo Phylogeny problem.” 2019. Web. 14 Aug 2020.

Vancouver:

Xie S. Towards characterizing the solution space of the 1-Dollo Phylogeny problem. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/2142/104916.

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

Council of Science Editors:

Xie S. Towards characterizing the solution space of the 1-Dollo Phylogeny problem. [Thesis]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/104916

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


University of Minnesota

24. Douvropoulos, Theodosios. Applications of geometric techniques in Coxeter-Catalan combinatorics.

Degree: PhD, Mathematics, 2017, University of Minnesota

 In the seminal work [Bes 15], Bessis gave a geometric interpretation of the noncrossing lattice NC(W)​​ associated to a well-generated complex reflection group W​​. He… (more)

Subjects/Keywords: Catalan; Combinatorics; Coxeter; Enumeration; Group Theory; Topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Douvropoulos, T. (2017). Applications of geometric techniques in Coxeter-Catalan combinatorics. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/191373

Chicago Manual of Style (16th Edition):

Douvropoulos, Theodosios. “Applications of geometric techniques in Coxeter-Catalan combinatorics.” 2017. Doctoral Dissertation, University of Minnesota. Accessed August 14, 2020. http://hdl.handle.net/11299/191373.

MLA Handbook (7th Edition):

Douvropoulos, Theodosios. “Applications of geometric techniques in Coxeter-Catalan combinatorics.” 2017. Web. 14 Aug 2020.

Vancouver:

Douvropoulos T. Applications of geometric techniques in Coxeter-Catalan combinatorics. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/11299/191373.

Council of Science Editors:

Douvropoulos T. Applications of geometric techniques in Coxeter-Catalan combinatorics. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/191373


University of Guelph

25. Infante, Elizabeth. Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting.

Degree: MS, Department of Psychology, 2019, University of Guelph

 Emotional valence (un/pleasantness) has been found to alter attention in a number of paradigms. Despite this, valence effects have not been detected during simple enumeration(more)

Subjects/Keywords: emotion; enumeration; subitizing; counting; attention; valence; arousal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Infante, E. (2019). Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14754

Chicago Manual of Style (16th Edition):

Infante, Elizabeth. “Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting.” 2019. Masters Thesis, University of Guelph. Accessed August 14, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14754.

MLA Handbook (7th Edition):

Infante, Elizabeth. “Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting.” 2019. Web. 14 Aug 2020.

Vancouver:

Infante E. Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting. [Internet] [Masters thesis]. University of Guelph; 2019. [cited 2020 Aug 14]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14754.

Council of Science Editors:

Infante E. Attention, Emotion, and Enumeration: The influence of emotional valence and arousal on subitizing and counting. [Masters Thesis]. University of Guelph; 2019. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/14754


Brigham Young University

26. Rosenbrock, Conrad Waldhar. Machine Learning to Discover and Optimize Materials.

Degree: PhD, 2017, Brigham Young University

 For centuries, scientists have dreamed of creating materials by design. Rather than discovery by accident, bespoke materials could be tailored to fulfill specific technological needs.… (more)

Subjects/Keywords: materials discovery; machine learning; grain boundaries; derivative structure enumeration; Polya enumeration theorem; monte carlo structure identification; order parameters; Astrophysics and Astronomy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rosenbrock, C. W. (2017). Machine Learning to Discover and Optimize Materials. (Doctoral Dissertation). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7651&context=etd

Chicago Manual of Style (16th Edition):

Rosenbrock, Conrad Waldhar. “Machine Learning to Discover and Optimize Materials.” 2017. Doctoral Dissertation, Brigham Young University. Accessed August 14, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7651&context=etd.

MLA Handbook (7th Edition):

Rosenbrock, Conrad Waldhar. “Machine Learning to Discover and Optimize Materials.” 2017. Web. 14 Aug 2020.

Vancouver:

Rosenbrock CW. Machine Learning to Discover and Optimize Materials. [Internet] [Doctoral dissertation]. Brigham Young University; 2017. [cited 2020 Aug 14]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7651&context=etd.

Council of Science Editors:

Rosenbrock CW. Machine Learning to Discover and Optimize Materials. [Doctoral Dissertation]. Brigham Young University; 2017. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7651&context=etd


Iowa State University

27. Mukherjee, Arko Provo. Mining dense substructures from large deterministic and probabilistic graphs.

Degree: 2015, Iowa State University

 Graphs represent relationships. Some relationships can be represented as a deterministic graph while others can only be represented by using probabilities. Mining dense structures from… (more)

Subjects/Keywords: Computer Engineering; Graph Mining; Hadoop; MapReduce; Maximal Biclique Enumeration; Maximal Clique Enumeration; Uncertain Graphs; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mukherjee, A. P. (2015). Mining dense substructures from large deterministic and probabilistic graphs. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/14611

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):

Mukherjee, Arko Provo. “Mining dense substructures from large deterministic and probabilistic graphs.” 2015. Thesis, Iowa State University. Accessed August 14, 2020. https://lib.dr.iastate.edu/etd/14611.

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

MLA Handbook (7th Edition):

Mukherjee, Arko Provo. “Mining dense substructures from large deterministic and probabilistic graphs.” 2015. Web. 14 Aug 2020.

Vancouver:

Mukherjee AP. Mining dense substructures from large deterministic and probabilistic graphs. [Internet] [Thesis]. Iowa State University; 2015. [cited 2020 Aug 14]. Available from: https://lib.dr.iastate.edu/etd/14611.

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

Council of Science Editors:

Mukherjee AP. Mining dense substructures from large deterministic and probabilistic graphs. [Thesis]. Iowa State University; 2015. Available from: https://lib.dr.iastate.edu/etd/14611

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


Texas A&M University

28. Rahman, Mehnaz. An Iterative Soft Decision Based LR-Aided MIMO Detector.

Degree: PhD, Computer Engineering, 2016, Texas A&M University

 The demand for wireless and high-rate communication system is increasing gradually and multiple-input-multiple-output (MIMO) is one of the feasible solutions to accommodate the growing demand… (more)

Subjects/Keywords: MIMO; K-best decoder; lattice reduction; SE enumeration; VLSI Implementation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahman, M. (2016). An Iterative Soft Decision Based LR-Aided MIMO Detector. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/187374

Chicago Manual of Style (16th Edition):

Rahman, Mehnaz. “An Iterative Soft Decision Based LR-Aided MIMO Detector.” 2016. Doctoral Dissertation, Texas A&M University. Accessed August 14, 2020. http://hdl.handle.net/1969.1/187374.

MLA Handbook (7th Edition):

Rahman, Mehnaz. “An Iterative Soft Decision Based LR-Aided MIMO Detector.” 2016. Web. 14 Aug 2020.

Vancouver:

Rahman M. An Iterative Soft Decision Based LR-Aided MIMO Detector. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/1969.1/187374.

Council of Science Editors:

Rahman M. An Iterative Soft Decision Based LR-Aided MIMO Detector. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/187374

29. Meng, Jie. Kernelization and Enumeration: New Approaches to Solving Hard Problems.

Degree: PhD, Computer Science, 2011, Texas A&M University

 NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However… (more)

Subjects/Keywords: Kernelization; Enumeration; Parameterized complexity

…2. Enumeration . . . . . . . . . . . . . . . . . . . II . . . . . . . . . 1 4 4 5 6 9… …2. The enumerating algorithm . . . . . . . . . . . . . . . . . D. Effective enumeration… …2. The enumerating algorithm . . . . . . . . . . . . . . . . . E. Effective enumeration… …x29;𝑛𝑘 ) by trivial enumeration algorithms, it has shown that they are unlikely to be… …Enumeration In practice, many problems seek a set of good solutions instead of a good solution… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meng, J. (2011). Kernelization and Enumeration: New Approaches to Solving Hard Problems. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845

Chicago Manual of Style (16th Edition):

Meng, Jie. “Kernelization and Enumeration: New Approaches to Solving Hard Problems.” 2011. Doctoral Dissertation, Texas A&M University. Accessed August 14, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845.

MLA Handbook (7th Edition):

Meng, Jie. “Kernelization and Enumeration: New Approaches to Solving Hard Problems.” 2011. Web. 14 Aug 2020.

Vancouver:

Meng J. Kernelization and Enumeration: New Approaches to Solving Hard Problems. [Internet] [Doctoral dissertation]. Texas A&M University; 2011. [cited 2020 Aug 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845.

Council of Science Editors:

Meng J. Kernelization and Enumeration: New Approaches to Solving Hard Problems. [Doctoral Dissertation]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845


Université de Lorraine

30. Blind, Sarah. Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes.

Degree: Docteur es, Informatique, 2019, Université de Lorraine

Cette thèse est une étude, d’un point de vue algorithmique, de la complexité de la résolution de certains problèmes d’énumération dans les graphes. Les algorithmes… (more)

Subjects/Keywords: Énumeration; Graphes; Complexité; Enumeration; Graph; Complexity; 004; 511.62

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blind, S. (2019). Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2019LORR0323

Chicago Manual of Style (16th Edition):

Blind, Sarah. “Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes.” 2019. Doctoral Dissertation, Université de Lorraine. Accessed August 14, 2020. http://www.theses.fr/2019LORR0323.

MLA Handbook (7th Edition):

Blind, Sarah. “Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes.” 2019. Web. 14 Aug 2020.

Vancouver:

Blind S. Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes. [Internet] [Doctoral dissertation]. Université de Lorraine; 2019. [cited 2020 Aug 14]. Available from: http://www.theses.fr/2019LORR0323.

Council of Science Editors:

Blind S. Output-sensitive algorithms for enumeration problems in graphs : Algorithmes "output-sensitifs" pour les problèmes d’énumération dans les graphes. [Doctoral Dissertation]. Université de Lorraine; 2019. Available from: http://www.theses.fr/2019LORR0323

[1] [2] [3] [4] [5] [6] [7]

.