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

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Florida

1. Rose, Daniel. Generating Permutations with an Output-Locked Two-Stack Machine.

Degree: 2012, University of Florida

 The problem of sorting and generating permutations with a stack has been studied since Knuth introduced it in 1968. While virtually everything one would want… (more)

Subjects/Keywords: Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rose, D. (2012). Generating Permutations with an Output-Locked Two-Stack Machine. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00061299

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

Rose, Daniel. “Generating Permutations with an Output-Locked Two-Stack Machine.” 2012. Thesis, University of Florida. Accessed September 17, 2019. http://ufdc.ufl.edu/AA00061299.

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

MLA Handbook (7th Edition):

Rose, Daniel. “Generating Permutations with an Output-Locked Two-Stack Machine.” 2012. Web. 17 Sep 2019.

Vancouver:

Rose D. Generating Permutations with an Output-Locked Two-Stack Machine. [Internet] [Thesis]. University of Florida; 2012. [cited 2019 Sep 17]. Available from: http://ufdc.ufl.edu/AA00061299.

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

Council of Science Editors:

Rose D. Generating Permutations with an Output-Locked Two-Stack Machine. [Thesis]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/AA00061299

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


Florida State University

2. Zerla, Fredric J. Theorems on multiple transitivity.

Degree: 1960, Florida State University

"The object of this paper is to present a number of theorems concerned with multiple transitivity in groups of permutations, culminating in a theorem of… (more)

Subjects/Keywords: Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zerla, F. J. (1960). Theorems on multiple transitivity. (Masters Thesis). Florida State University. Retrieved from http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;

Chicago Manual of Style (16th Edition):

Zerla, Fredric J. “Theorems on multiple transitivity.” 1960. Masters Thesis, Florida State University. Accessed September 17, 2019. http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;.

MLA Handbook (7th Edition):

Zerla, Fredric J. “Theorems on multiple transitivity.” 1960. Web. 17 Sep 2019.

Vancouver:

Zerla FJ. Theorems on multiple transitivity. [Internet] [Masters thesis]. Florida State University; 1960. [cited 2019 Sep 17]. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;.

Council of Science Editors:

Zerla FJ. Theorems on multiple transitivity. [Masters Thesis]. Florida State University; 1960. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;


Université du Québec à Montréal

3. Lavigne, Sébastien. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.

Degree: 2017, Université du Québec à Montréal

 Depuis quelques années, il y a un intérêt à vouloir trouver et construire des bijections entre l'ensemble des permutations indécomposables et les sous-groupes d'indice fini… (more)

Subjects/Keywords: Bijections; Permutations; Groupes libres; Hypercartes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lavigne, S. (2017). Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. (Thesis). Université du Québec à Montréal. Retrieved from http://www.archipel.uqam.ca/9934/1/M15033.pdf

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

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Thesis, Université du Québec à Montréal. Accessed September 17, 2019. http://www.archipel.uqam.ca/9934/1/M15033.pdf.

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

MLA Handbook (7th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Web. 17 Sep 2019.

Vancouver:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Internet] [Thesis]. Université du Québec à Montréal; 2017. [cited 2019 Sep 17]. Available from: http://www.archipel.uqam.ca/9934/1/M15033.pdf.

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

Council of Science Editors:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Thesis]. Université du Québec à Montréal; 2017. Available from: http://www.archipel.uqam.ca/9934/1/M15033.pdf

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


University of Victoria

4. Zhang, Fei. Sorting signed permutations by transpositions and reversals.

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

 Large scale comparative genetic mapping offers exciting prospects for understanding genomic evolution and has recently become of interest in computational molecular biology. The genome rearrangement… (more)

Subjects/Keywords: Permutations; Genomes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, F. (2008). Sorting signed permutations by transpositions and reversals. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/524

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

Zhang, Fei. “Sorting signed permutations by transpositions and reversals.” 2008. Thesis, University of Victoria. Accessed September 17, 2019. http://hdl.handle.net/1828/524.

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

MLA Handbook (7th Edition):

Zhang, Fei. “Sorting signed permutations by transpositions and reversals.” 2008. Web. 17 Sep 2019.

Vancouver:

Zhang F. Sorting signed permutations by transpositions and reversals. [Internet] [Thesis]. University of Victoria; 2008. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/1828/524.

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

Council of Science Editors:

Zhang F. Sorting signed permutations by transpositions and reversals. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/524

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


University of Waterloo

5. 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 September 17, 2019. 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. 17 Sep 2019.

Vancouver:

Chan ACS. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Sep 17]. 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


Université du Québec à Montréal

6. Lavigne, Sébastien. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.

Degree: 2017, Université du Québec à Montréal

 Depuis quelques années, il y a un intérêt à vouloir trouver et construire des bijections entre l'ensemble des permutations indécomposables et les sous-groupes d'indice fini… (more)

Subjects/Keywords: Bijections; Permutations; Groupes libres; Hypercartes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lavigne, S. (2017). Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/9934/1/M15033.pdf

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

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Thesis, Université du Québec à Montréal. Accessed September 17, 2019. http://archipel.uqam.ca/9934/1/M15033.pdf.

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

MLA Handbook (7th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Web. 17 Sep 2019.

Vancouver:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Internet] [Thesis]. Université du Québec à Montréal; 2017. [cited 2019 Sep 17]. Available from: http://archipel.uqam.ca/9934/1/M15033.pdf.

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

Council of Science Editors:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Thesis]. Université du Québec à Montréal; 2017. Available from: http://archipel.uqam.ca/9934/1/M15033.pdf

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


University of Southern California

7. Pantazis, Dimitrios. Statistical signal processing of magnetoencephalography data.

Degree: PhD, Electrical Engineering, 2006, University of Southern California

 Imaging approaches in MEG typically generate dynamic current density maps (CDMs) on the cortical surface, where the activation in each location is represented by a… (more)

Subjects/Keywords: magnetoencephalography; permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pantazis, D. (2006). Statistical signal processing of magnetoencephalography data. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6047

Chicago Manual of Style (16th Edition):

Pantazis, Dimitrios. “Statistical signal processing of magnetoencephalography data.” 2006. Doctoral Dissertation, University of Southern California. Accessed September 17, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6047.

MLA Handbook (7th Edition):

Pantazis, Dimitrios. “Statistical signal processing of magnetoencephalography data.” 2006. Web. 17 Sep 2019.

Vancouver:

Pantazis D. Statistical signal processing of magnetoencephalography data. [Internet] [Doctoral dissertation]. University of Southern California; 2006. [cited 2019 Sep 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6047.

Council of Science Editors:

Pantazis D. Statistical signal processing of magnetoencephalography data. [Doctoral Dissertation]. University of Southern California; 2006. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6047


Rutgers University

8. Pudwell, Lara Kristin. Enumeration schemes for pattern-avoiding words and permutations.

Degree: PhD, Mathematics, 2008, Rutgers University

Let p=p1...pn and q=q1...qm be permutations. We say that p contains q as a pattern if there are indices 1 [less than]= i1 [less than]… (more)

Subjects/Keywords: Permutations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pudwell, L. K. (2008). Enumeration schemes for pattern-avoiding words and permutations. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374

Chicago Manual of Style (16th Edition):

Pudwell, Lara Kristin. “Enumeration schemes for pattern-avoiding words and permutations.” 2008. Doctoral Dissertation, Rutgers University. Accessed September 17, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374.

MLA Handbook (7th Edition):

Pudwell, Lara Kristin. “Enumeration schemes for pattern-avoiding words and permutations.” 2008. Web. 17 Sep 2019.

Vancouver:

Pudwell LK. Enumeration schemes for pattern-avoiding words and permutations. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Sep 17]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374.

Council of Science Editors:

Pudwell LK. Enumeration schemes for pattern-avoiding words and permutations. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374

9. Vong, Vincent. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.

Degree: Docteur es, Informatique, 2014, Université Paris-Est

Cette thèse se situe au carrefour de la combinatoire et de l'algèbre. Elle se consacre d'une part à traduire des problèmes algébriques en des problèmes… (more)

Subjects/Keywords: Algèbres de hopf combinatoires; Permutations; Opérades; Combinatorial hopf algebras; Permutations; Operads

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vong, V. (2014). Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2014PEST1185

Chicago Manual of Style (16th Edition):

Vong, Vincent. “Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.” 2014. Doctoral Dissertation, Université Paris-Est. Accessed September 17, 2019. http://www.theses.fr/2014PEST1185.

MLA Handbook (7th Edition):

Vong, Vincent. “Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.” 2014. Web. 17 Sep 2019.

Vancouver:

Vong V. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. [Internet] [Doctoral dissertation]. Université Paris-Est; 2014. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2014PEST1185.

Council of Science Editors:

Vong V. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. [Doctoral Dissertation]. Université Paris-Est; 2014. Available from: http://www.theses.fr/2014PEST1185


University of Pennsylvania

10. Poh, Wei Quan Julius. Shape and Other Properties of 1324-Avoiding Permutations.

Degree: 2015, University of Pennsylvania

 Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerations for two of them were found by Gessel… (more)

Subjects/Keywords: 1324; avoiding; pattern; permutations; shape; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Poh, W. Q. J. (2015). Shape and Other Properties of 1324-Avoiding Permutations. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1950

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

Poh, Wei Quan Julius. “Shape and Other Properties of 1324-Avoiding Permutations.” 2015. Thesis, University of Pennsylvania. Accessed September 17, 2019. https://repository.upenn.edu/edissertations/1950.

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

MLA Handbook (7th Edition):

Poh, Wei Quan Julius. “Shape and Other Properties of 1324-Avoiding Permutations.” 2015. Web. 17 Sep 2019.

Vancouver:

Poh WQJ. Shape and Other Properties of 1324-Avoiding Permutations. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2019 Sep 17]. Available from: https://repository.upenn.edu/edissertations/1950.

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

Council of Science Editors:

Poh WQJ. Shape and Other Properties of 1324-Avoiding Permutations. [Thesis]. University of Pennsylvania; 2015. Available from: https://repository.upenn.edu/edissertations/1950

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

11. Widmer, Steven. Topics in word complexity : Autour de la Complexité des mots.

Degree: Docteur es, Mathématiques, 2010, Université Claude Bernard – Lyon I

Les principaux sujets d'intérêt de cette thèse concerneront deux notions de la complexité d'un mot infini : la complexité abélienne et la complexité de permutation.… (more)

Subjects/Keywords: Mots infinis; Complexités; Palindromes; Infinies permutations; Infinite words; Complexity; Palindrome; Infinite permutations; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Widmer, S. (2010). Topics in word complexity : Autour de la Complexité des mots. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2010LYO10287

Chicago Manual of Style (16th Edition):

Widmer, Steven. “Topics in word complexity : Autour de la Complexité des mots.” 2010. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed September 17, 2019. http://www.theses.fr/2010LYO10287.

MLA Handbook (7th Edition):

Widmer, Steven. “Topics in word complexity : Autour de la Complexité des mots.” 2010. Web. 17 Sep 2019.

Vancouver:

Widmer S. Topics in word complexity : Autour de la Complexité des mots. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2010. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2010LYO10287.

Council of Science Editors:

Widmer S. Topics in word complexity : Autour de la Complexité des mots. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2010. Available from: http://www.theses.fr/2010LYO10287


University of Miami

12. Hyatt, Matthew. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.

Degree: PhD, Mathematics (Arts and Sciences), 2011, University of Miami

 Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian polynomials.… (more)

Subjects/Keywords: Signed permutations; Colored permutations; Permutation statistics; Eulerian polynomials; Quasisymmetric functions; Symmetric functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hyatt, M. (2011). Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/609

Chicago Manual of Style (16th Edition):

Hyatt, Matthew. “Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.” 2011. Doctoral Dissertation, University of Miami. Accessed September 17, 2019. https://scholarlyrepository.miami.edu/oa_dissertations/609.

MLA Handbook (7th Edition):

Hyatt, Matthew. “Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.” 2011. Web. 17 Sep 2019.

Vancouver:

Hyatt M. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. [Internet] [Doctoral dissertation]. University of Miami; 2011. [cited 2019 Sep 17]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/609.

Council of Science Editors:

Hyatt M. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. [Doctoral Dissertation]. University of Miami; 2011. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/609

13. Nunge, Arthur. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.

Degree: Docteur es, Informatique, 2018, Université Paris-Est

Cette thèse se situe à l'interface de la combinatoire énumérative et algébrique et porte sur l'étude des probabilités du processus d'exclusion partiellement asymétrique (PASEP).Dans un… (more)

Subjects/Keywords: Combinatoire; Algèbre de Hopf; Bijections; Pasep; Permutations; Combinatorics; Hopf algebra; Bijections; Pasep; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nunge, A. (2018). Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2018PESC1116

Chicago Manual of Style (16th Edition):

Nunge, Arthur. “Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.” 2018. Doctoral Dissertation, Université Paris-Est. Accessed September 17, 2019. http://www.theses.fr/2018PESC1116.

MLA Handbook (7th Edition):

Nunge, Arthur. “Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.” 2018. Web. 17 Sep 2019.

Vancouver:

Nunge A. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. [Internet] [Doctoral dissertation]. Université Paris-Est; 2018. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2018PESC1116.

Council of Science Editors:

Nunge A. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. [Doctoral Dissertation]. Université Paris-Est; 2018. Available from: http://www.theses.fr/2018PESC1116

14. Sage, Marc. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.

Degree: Docteur es, Informatique, 2012, Université Paris-Est

Ce mémoire se veut une synthèse, destinée à la communauté combinatoricienne, de quelques outils développés pour aborder le problème d'Hurwitz ainsi qu'une présentation des résultats… (more)

Subjects/Keywords: Nombres d'Hurwitz; Factorisations transitives; Asymptotique; Formule ELSV; Permutations scindées; Multipartitions; Hurwitz numbers; Transitive factorisations; Asymptotics; ELSV formula; Split permutations; Multipartitions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sage, M. (2012). Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2012PEST1102

Chicago Manual of Style (16th Edition):

Sage, Marc. “Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.” 2012. Doctoral Dissertation, Université Paris-Est. Accessed September 17, 2019. http://www.theses.fr/2012PEST1102.

MLA Handbook (7th Edition):

Sage, Marc. “Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.” 2012. Web. 17 Sep 2019.

Vancouver:

Sage M. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. [Internet] [Doctoral dissertation]. Université Paris-Est; 2012. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2012PEST1102.

Council of Science Editors:

Sage M. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. [Doctoral Dissertation]. Université Paris-Est; 2012. Available from: http://www.theses.fr/2012PEST1102

15. Bahier, Valentin. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.

Degree: Docteur es, Mathématiques appliquées, 2018, Université Toulouse III – Paul Sabatier

Dans cette thèse, nous nous intéressons à des matrices aléatoires en lien avec des permutations. Nous abordons l'étude de leurs spectres de plusieurs manières, et… (more)

Subjects/Keywords: Matrices aléatoires; Permutations aléatoires; Valeurs propres; Processus ponctuels; Fluctuations asymptotiques; Random matrices; Random permutations; Point processes; Asymptotic fluctuations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bahier, V. (2018). Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2018TOU30069

Chicago Manual of Style (16th Edition):

Bahier, Valentin. “Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.” 2018. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed September 17, 2019. http://www.theses.fr/2018TOU30069.

MLA Handbook (7th Edition):

Bahier, Valentin. “Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.” 2018. Web. 17 Sep 2019.

Vancouver:

Bahier V. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2018. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2018TOU30069.

Council of Science Editors:

Bahier V. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2018. Available from: http://www.theses.fr/2018TOU30069

16. Korba, Anna. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.

Degree: Docteur es, Mathématiques appliquées, 2018, Paris Saclay

 Les données de classement, c.à. d. des listes ordonnées d'objets, apparaissent naturellement dans une grande variété de situations, notamment lorsque les données proviennent d’activités humaines… (more)

Subjects/Keywords: Statistiques; Apprentissage automatiques; Classements; Agrégation; Permutations; Comparaisons par paires; Statistics; Machine Learning; Ranking; Aggregation; Permutations; Pairwise comparisons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Korba, A. (2018). Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2018SACLT009

Chicago Manual of Style (16th Edition):

Korba, Anna. “Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.” 2018. Doctoral Dissertation, Paris Saclay. Accessed September 17, 2019. http://www.theses.fr/2018SACLT009.

MLA Handbook (7th Edition):

Korba, Anna. “Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.” 2018. Web. 17 Sep 2019.

Vancouver:

Korba A. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. [Internet] [Doctoral dissertation]. Paris Saclay; 2018. [cited 2019 Sep 17]. Available from: http://www.theses.fr/2018SACLT009.

Council of Science Editors:

Korba A. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. [Doctoral Dissertation]. Paris Saclay; 2018. Available from: http://www.theses.fr/2018SACLT009


The Ohio State University

17. Scrandis, Ann Bertha. Equally distributed permutation groups.

Degree: PhD, Graduate School, 1975, The Ohio State University

Subjects/Keywords: Mathematics; Permutation groups; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scrandis, A. B. (1975). Equally distributed permutation groups. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838

Chicago Manual of Style (16th Edition):

Scrandis, Ann Bertha. “Equally distributed permutation groups.” 1975. Doctoral Dissertation, The Ohio State University. Accessed September 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838.

MLA Handbook (7th Edition):

Scrandis, Ann Bertha. “Equally distributed permutation groups.” 1975. Web. 17 Sep 2019.

Vancouver:

Scrandis AB. Equally distributed permutation groups. [Internet] [Doctoral dissertation]. The Ohio State University; 1975. [cited 2019 Sep 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838.

Council of Science Editors:

Scrandis AB. Equally distributed permutation groups. [Doctoral Dissertation]. The Ohio State University; 1975. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486998966750838


Michigan Technological University

18. Davies, Joshua Thomas Agustin. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.

Degree: MS, Department of Mathematical Sciences, 2017, Michigan Technological University

  We begin with a discussion of the symmetricity of \maj over \des in pattern avoidance classes, and its relationship to \maj-Wilf equivalence. From this,… (more)

Subjects/Keywords: combinatorics; permutations; pattern avoidance; permutation statistics; Discrete Mathematics and Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davies, J. T. A. (2017). Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. (Masters Thesis). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etdr/328

Chicago Manual of Style (16th Edition):

Davies, Joshua Thomas Agustin. “Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.” 2017. Masters Thesis, Michigan Technological University. Accessed September 17, 2019. http://digitalcommons.mtu.edu/etdr/328.

MLA Handbook (7th Edition):

Davies, Joshua Thomas Agustin. “Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance.” 2017. Web. 17 Sep 2019.

Vancouver:

Davies JTA. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. [Internet] [Masters thesis]. Michigan Technological University; 2017. [cited 2019 Sep 17]. Available from: http://digitalcommons.mtu.edu/etdr/328.

Council of Science Editors:

Davies JTA. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance. [Masters Thesis]. Michigan Technological University; 2017. Available from: http://digitalcommons.mtu.edu/etdr/328


California State University – San Bernardino

19. Herrera, Diana. Homormophic Images and their Isomorphism Types.

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

  In this thesis we have presented original homomorphic images of permutations and monomial progenitors. In some cases we have used the double coset enumeration… (more)

Subjects/Keywords: homomorphic images of permutations and monomial progenitors; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Herrera, D. (2014). Homormophic Images and their Isomorphism Types. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/37

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

Herrera, Diana. “Homormophic Images and their Isomorphism Types.” 2014. Thesis, California State University – San Bernardino. Accessed September 17, 2019. http://scholarworks.lib.csusb.edu/etd/37.

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

MLA Handbook (7th Edition):

Herrera, Diana. “Homormophic Images and their Isomorphism Types.” 2014. Web. 17 Sep 2019.

Vancouver:

Herrera D. Homormophic Images and their Isomorphism Types. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2019 Sep 17]. Available from: http://scholarworks.lib.csusb.edu/etd/37.

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

Council of Science Editors:

Herrera D. Homormophic Images and their Isomorphism Types. [Thesis]. California State University – San Bernardino; 2014. Available from: http://scholarworks.lib.csusb.edu/etd/37

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


University of Manchester

20. Steele, Hugh Paul. Combinatorial arguments for linear logic full completeness.

Degree: PhD, 2013, University of Manchester

 We investigate categorical models of the unit-free multiplicative and multiplicative-additive fragments of linear logic by representing derivations as particular structures known as dinatural transformations. Suitable… (more)

Subjects/Keywords: 511; Linear Logic; Category Theory; Categorical Logic; Multilinear Algebra; Combinatorics; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steele, H. P. (2013). Combinatorial arguments for linear logic full completeness. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657

Chicago Manual of Style (16th Edition):

Steele, Hugh Paul. “Combinatorial arguments for linear logic full completeness.” 2013. Doctoral Dissertation, University of Manchester. Accessed September 17, 2019. https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657.

MLA Handbook (7th Edition):

Steele, Hugh Paul. “Combinatorial arguments for linear logic full completeness.” 2013. Web. 17 Sep 2019.

Vancouver:

Steele HP. Combinatorial arguments for linear logic full completeness. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2019 Sep 17]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657.

Council of Science Editors:

Steele HP. Combinatorial arguments for linear logic full completeness. [Doctoral Dissertation]. University of Manchester; 2013. Available from: https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657


University of California – San Diego

21. Pan, Ran. Block patterns in permutations and words and generalized clusters.

Degree: Mathematics, 2016, University of California – San Diego

 Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecutive patterns in permutations, words, and other combinatorial objects which isnow called… (more)

Subjects/Keywords: Mathematics; arrays; consecutive patterns; enumerative combinatorics; generalized clusters; permutations; words

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pan, R. (2016). Block patterns in permutations and words and generalized clusters. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/18w5s22b

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

Pan, Ran. “Block patterns in permutations and words and generalized clusters.” 2016. Thesis, University of California – San Diego. Accessed September 17, 2019. http://www.escholarship.org/uc/item/18w5s22b.

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

MLA Handbook (7th Edition):

Pan, Ran. “Block patterns in permutations and words and generalized clusters.” 2016. Web. 17 Sep 2019.

Vancouver:

Pan R. Block patterns in permutations and words and generalized clusters. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2019 Sep 17]. Available from: http://www.escholarship.org/uc/item/18w5s22b.

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

Council of Science Editors:

Pan R. Block patterns in permutations and words and generalized clusters. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/18w5s22b

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


University of Victoria

22. Parton, Kristin. PermuNim : an impartial game of permutation avoidance.

Degree: Dept. of Mathematics and Statistics, 2010, University of Victoria

 PermuNim is an impartial combinatorial game played on a board of squares where each player takes turns playing in rows and columns of the board… (more)

Subjects/Keywords: Permutations; Games; 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):

Parton, K. (2010). PermuNim : an impartial game of permutation avoidance. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2522

Chicago Manual of Style (16th Edition):

Parton, Kristin. “PermuNim : an impartial game of permutation avoidance.” 2010. Masters Thesis, University of Victoria. Accessed September 17, 2019. http://hdl.handle.net/1828/2522.

MLA Handbook (7th Edition):

Parton, Kristin. “PermuNim : an impartial game of permutation avoidance.” 2010. Web. 17 Sep 2019.

Vancouver:

Parton K. PermuNim : an impartial game of permutation avoidance. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/1828/2522.

Council of Science Editors:

Parton K. PermuNim : an impartial game of permutation avoidance. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2522


McGill University

23. Holton, D. A. (Derek Allan). On Redfield's enumeration methods : application of group theory to combinatorics.

Degree: PhD, Department of Mathematics., 1970, McGill University

Subjects/Keywords: Group theory.; Combinations.; Permutations.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holton, D. A. (. A. (1970). On Redfield's enumeration methods : application of group theory to combinatorics. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile67714.pdf

Chicago Manual of Style (16th Edition):

Holton, D A (Derek Allan). “On Redfield's enumeration methods : application of group theory to combinatorics.” 1970. Doctoral Dissertation, McGill University. Accessed September 17, 2019. http://digitool.library.mcgill.ca/thesisfile67714.pdf.

MLA Handbook (7th Edition):

Holton, D A (Derek Allan). “On Redfield's enumeration methods : application of group theory to combinatorics.” 1970. Web. 17 Sep 2019.

Vancouver:

Holton DA(A. On Redfield's enumeration methods : application of group theory to combinatorics. [Internet] [Doctoral dissertation]. McGill University; 1970. [cited 2019 Sep 17]. Available from: http://digitool.library.mcgill.ca/thesisfile67714.pdf.

Council of Science Editors:

Holton DA(A. On Redfield's enumeration methods : application of group theory to combinatorics. [Doctoral Dissertation]. McGill University; 1970. Available from: http://digitool.library.mcgill.ca/thesisfile67714.pdf


University of British Columbia

24. Fraser, Richard Evan James. Involutions of the Mathieu groups .

Degree: 1966, University of British Columbia

 The five Mathieu permutation groups M₁₁, M₁₂M₂₂,M₂₃ and M₂₄ are constructed and the involutions (elements of order two) of these groups are classified according to… (more)

Subjects/Keywords: Mathieu functions; Permutations; Involutes (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fraser, R. E. J. (1966). Involutions of the Mathieu groups . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/37943

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

Fraser, Richard Evan James. “Involutions of the Mathieu groups .” 1966. Thesis, University of British Columbia. Accessed September 17, 2019. http://hdl.handle.net/2429/37943.

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

MLA Handbook (7th Edition):

Fraser, Richard Evan James. “Involutions of the Mathieu groups .” 1966. Web. 17 Sep 2019.

Vancouver:

Fraser REJ. Involutions of the Mathieu groups . [Internet] [Thesis]. University of British Columbia; 1966. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/2429/37943.

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

Council of Science Editors:

Fraser REJ. Involutions of the Mathieu groups . [Thesis]. University of British Columbia; 1966. Available from: http://hdl.handle.net/2429/37943

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


University of Waterloo

25. El-Zein, Hicham. Space Efficient Data Structures and Algorithms in the Word-RAM Model.

Degree: 2018, University of Waterloo

 In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement… (more)

Subjects/Keywords: Algorithms; Data Structures; Space Efficient; Range Searching; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El-Zein, H. (2018). Space Efficient Data Structures and Algorithms in the Word-RAM Model. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13200

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

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Thesis, University of Waterloo. Accessed September 17, 2019. http://hdl.handle.net/10012/13200.

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

MLA Handbook (7th Edition):

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Web. 17 Sep 2019.

Vancouver:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/10012/13200.

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

Council of Science Editors:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13200

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


University of New South Wales

26. Millington , Scott Elliot. Floppy realism: a strategy for dissolving form and space in painting.

Degree: Art, 2012, University of New South Wales

 Floppiness proceeds from one of the most valuable properties of paint -­‐ its solubility. The liquid condition of paint resists describing stabilised forms and allows… (more)

Subjects/Keywords: Floppy Realism; Painting; Space; Form; Applications; Permutations; Giorgio Morandi; Mark Rothko

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Millington , S. E. (2012). Floppy realism: a strategy for dissolving form and space in painting. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52600 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11273/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Millington , Scott Elliot. “Floppy realism: a strategy for dissolving form and space in painting.” 2012. Masters Thesis, University of New South Wales. Accessed September 17, 2019. http://handle.unsw.edu.au/1959.4/52600 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11273/SOURCE01?view=true.

MLA Handbook (7th Edition):

Millington , Scott Elliot. “Floppy realism: a strategy for dissolving form and space in painting.” 2012. Web. 17 Sep 2019.

Vancouver:

Millington SE. Floppy realism: a strategy for dissolving form and space in painting. [Internet] [Masters thesis]. University of New South Wales; 2012. [cited 2019 Sep 17]. Available from: http://handle.unsw.edu.au/1959.4/52600 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11273/SOURCE01?view=true.

Council of Science Editors:

Millington SE. Floppy realism: a strategy for dissolving form and space in painting. [Masters Thesis]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/52600 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11273/SOURCE01?view=true


University of Minnesota

27. Dilks, Kevin. Involutions on Baxter Objects and q-Gamma Nonnegativity.

Degree: PhD, Mathematics, 2015, University of Minnesota

 Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with a natural involution. In this paper, we add… (more)

Subjects/Keywords: algebraic combinatorics; baxter permutations; combinatorics; gamma positivity; involutions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dilks, K. (2015). Involutions on Baxter Objects and q-Gamma Nonnegativity. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/182835

Chicago Manual of Style (16th Edition):

Dilks, Kevin. “Involutions on Baxter Objects and q-Gamma Nonnegativity.” 2015. Doctoral Dissertation, University of Minnesota. Accessed September 17, 2019. http://hdl.handle.net/11299/182835.

MLA Handbook (7th Edition):

Dilks, Kevin. “Involutions on Baxter Objects and q-Gamma Nonnegativity.” 2015. Web. 17 Sep 2019.

Vancouver:

Dilks K. Involutions on Baxter Objects and q-Gamma Nonnegativity. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/11299/182835.

Council of Science Editors:

Dilks K. Involutions on Baxter Objects and q-Gamma Nonnegativity. [Doctoral Dissertation]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/182835


University of Johannesburg

28. Shongwe, Thokozani Calvin. Synchronization with permutation codes and Reed-Solomon codes.

Degree: 2014, University of Johannesburg

D.Ing. (Electrical And Electronic Engineering)

We address the issue of synchronization, using sync-words (or markers), for encoded data. We focus on data that is encoded… (more)

Subjects/Keywords: Coding theory; Synchronization; Data transmission systems; Reed-Solomon codes; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shongwe, T. C. (2014). Synchronization with permutation codes and Reed-Solomon codes. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12157

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

Shongwe, Thokozani Calvin. “Synchronization with permutation codes and Reed-Solomon codes.” 2014. Thesis, University of Johannesburg. Accessed September 17, 2019. http://hdl.handle.net/10210/12157.

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

MLA Handbook (7th Edition):

Shongwe, Thokozani Calvin. “Synchronization with permutation codes and Reed-Solomon codes.” 2014. Web. 17 Sep 2019.

Vancouver:

Shongwe TC. Synchronization with permutation codes and Reed-Solomon codes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/10210/12157.

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

Council of Science Editors:

Shongwe TC. Synchronization with permutation codes and Reed-Solomon codes. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12157

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


University of Johannesburg

29. Ouahada, Khmaies Taher. Spectral shaping and distance mapping with permutation sequences.

Degree: 2012, University of Johannesburg

D.Ing.

In this thesis we combined two techniques, namely a spectral shaping technique and a distance-preserving mapping technique to design new codes with both special… (more)

Subjects/Keywords: Mappings (Mathematics); Error-correcting codes (Information theory); Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ouahada, K. T. (2012). Spectral shaping and distance mapping with permutation sequences. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4800

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

Ouahada, Khmaies Taher. “Spectral shaping and distance mapping with permutation sequences.” 2012. Thesis, University of Johannesburg. Accessed September 17, 2019. http://hdl.handle.net/10210/4800.

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

MLA Handbook (7th Edition):

Ouahada, Khmaies Taher. “Spectral shaping and distance mapping with permutation sequences.” 2012. Web. 17 Sep 2019.

Vancouver:

Ouahada KT. Spectral shaping and distance mapping with permutation sequences. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2019 Sep 17]. Available from: http://hdl.handle.net/10210/4800.

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

Council of Science Editors:

Ouahada KT. Spectral shaping and distance mapping with permutation sequences. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4800

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


University of Southern California

30. Ren, Haining. Convergence rate of i-cycles after an m-shelf shuffle.

Degree: PhD, Mathematics, 2015, University of Southern California

 Casino Shelf shufflers with m shelves induce permutations on n cards. In the case where m = 1, the permutations induced are unimodal permutations which… (more)

Subjects/Keywords: convergence rate; m-shelf shuffle; analytic combinatorics; unimodal permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ren, H. (2015). Convergence rate of i-cycles after an m-shelf shuffle. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/613540/rec/1650

Chicago Manual of Style (16th Edition):

Ren, Haining. “Convergence rate of i-cycles after an m-shelf shuffle.” 2015. Doctoral Dissertation, University of Southern California. Accessed September 17, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/613540/rec/1650.

MLA Handbook (7th Edition):

Ren, Haining. “Convergence rate of i-cycles after an m-shelf shuffle.” 2015. Web. 17 Sep 2019.

Vancouver:

Ren H. Convergence rate of i-cycles after an m-shelf shuffle. [Internet] [Doctoral dissertation]. University of Southern California; 2015. [cited 2019 Sep 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/613540/rec/1650.

Council of Science Editors:

Ren H. Convergence rate of i-cycles after an m-shelf shuffle. [Doctoral Dissertation]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/613540/rec/1650

[1] [2] [3] [4] [5]

.