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


Florida State University

1. 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 January 17, 2021. http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;.

MLA Handbook (7th Edition):

Zerla, Fredric J. “Theorems on multiple transitivity.” 1960. Web. 17 Jan 2021.

Vancouver:

Zerla FJ. Theorems on multiple transitivity. [Internet] [Masters thesis]. Florida State University; 1960. [cited 2021 Jan 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 ;

2. Griffin, Patricia Anne. On the orderly listing of permutations.

Degree: 1969, NC Docks

 D.H. Lehmer states that by an orderly listing of permutations is meant a generation for which it is possible to obtain the k th permutation… (more)

Subjects/Keywords: Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Griffin, P. A. (1969). On the orderly listing of permutations. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.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):

Griffin, Patricia Anne. “On the orderly listing of permutations.” 1969. Thesis, NC Docks. Accessed January 17, 2021. http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf.

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

MLA Handbook (7th Edition):

Griffin, Patricia Anne. “On the orderly listing of permutations.” 1969. Web. 17 Jan 2021.

Vancouver:

Griffin PA. On the orderly listing of permutations. [Internet] [Thesis]. NC Docks; 1969. [cited 2021 Jan 17]. Available from: http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf.

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

Council of Science Editors:

Griffin PA. On the orderly listing of permutations. [Thesis]. NC Docks; 1969. Available from: http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf

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

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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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


Université du Québec à Montréal

4. 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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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 Victoria

5. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Zhang F. Sorting signed permutations by transpositions and reversals. [Internet] [Thesis]. University of Victoria; 2008. [cited 2021 Jan 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


Texas State University – San Marcos

6. Wilson, Samuel N. Power domination on permutation graphs.

Degree: MS, Mathematics, 2013, Texas State University – San Marcos

 For the purposes of monitoring power networks, power companies use devices known as phase measurement units (PMUs); these monitor the waveform of the various nodes… (more)

Subjects/Keywords: Domination; Graph theory; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilson, S. N. (2013). Power domination on permutation graphs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12824

Chicago Manual of Style (16th Edition):

Wilson, Samuel N. “Power domination on permutation graphs.” 2013. Masters Thesis, Texas State University – San Marcos. Accessed January 17, 2021. https://digital.library.txstate.edu/handle/10877/12824.

MLA Handbook (7th Edition):

Wilson, Samuel N. “Power domination on permutation graphs.” 2013. Web. 17 Jan 2021.

Vancouver:

Wilson SN. Power domination on permutation graphs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2013. [cited 2021 Jan 17]. Available from: https://digital.library.txstate.edu/handle/10877/12824.

Council of Science Editors:

Wilson SN. Power domination on permutation graphs. [Masters Thesis]. Texas State University – San Marcos; 2013. Available from: https://digital.library.txstate.edu/handle/10877/12824


Texas State University – San Marcos

7. Wash, Kirsti A. On the bounds of the domination number of permutation graphs.

Degree: MS, Mathematics, 2009, Texas State University – San Marcos

No abstract prepared. Advisors/Committee Members: Gu, Weizhen (advisor).

Subjects/Keywords: Domination; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wash, K. A. (2009). On the bounds of the domination number of permutation graphs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12740

Chicago Manual of Style (16th Edition):

Wash, Kirsti A. “On the bounds of the domination number of permutation graphs.” 2009. Masters Thesis, Texas State University – San Marcos. Accessed January 17, 2021. https://digital.library.txstate.edu/handle/10877/12740.

MLA Handbook (7th Edition):

Wash, Kirsti A. “On the bounds of the domination number of permutation graphs.” 2009. Web. 17 Jan 2021.

Vancouver:

Wash KA. On the bounds of the domination number of permutation graphs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2009. [cited 2021 Jan 17]. Available from: https://digital.library.txstate.edu/handle/10877/12740.

Council of Science Editors:

Wash KA. On the bounds of the domination number of permutation graphs. [Masters Thesis]. Texas State University – San Marcos; 2009. Available from: https://digital.library.txstate.edu/handle/10877/12740


University of Southern California

8. 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/6056

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Pantazis, Dimitrios. “Statistical signal processing of magnetoencephalography data.” 2006. Web. 17 Jan 2021.

Vancouver:

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

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/6056


University of Waterloo

9. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

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


Rutgers University

10. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Pudwell LK. Enumeration schemes for pattern-avoiding words and permutations. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2021 Jan 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

11. 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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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 Delaware

12. Castillo, Chris. A method for constructing groups of permutation polynomials and its application to projective geometry.

Degree: PhD, University of Delaware, Department of Mathematical Sciences, 2015, University of Delaware

 This dissertation presents original work on permutation polynomials over finite fields. From a consideration of the proof of Cayley's theorem, it is clear that any… (more)

Subjects/Keywords: Permutations.; Polynomials.; Finite fields (Algebra); Cayley algebras.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Castillo, C. (2015). A method for constructing groups of permutation polynomials and its application to projective geometry. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17430

Chicago Manual of Style (16th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Doctoral Dissertation, University of Delaware. Accessed January 17, 2021. http://udspace.udel.edu/handle/19716/17430.

MLA Handbook (7th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Web. 17 Jan 2021.

Vancouver:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2021 Jan 17]. Available from: http://udspace.udel.edu/handle/19716/17430.

Council of Science Editors:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17430


University of Pennsylvania

13. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Poh WQJ. Shape and Other Properties of 1324-Avoiding Permutations. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2021 Jan 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

14. Johnson, Emily Nance. Permutation tests for mixed paired and two-sample designs.

Degree: 2018, NC Docks

 In this thesis we propose permutation tests of previously developed statistics for the case of mixed paired and two-sample data. We also explore the different… (more)

Subjects/Keywords: Permutations; Nonparametric statistics; Missing observations (Statistics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, E. N. (2018). Permutation tests for mixed paired and two-sample designs. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.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):

Johnson, Emily Nance. “Permutation tests for mixed paired and two-sample designs.” 2018. Thesis, NC Docks. Accessed January 17, 2021. http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf.

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

MLA Handbook (7th Edition):

Johnson, Emily Nance. “Permutation tests for mixed paired and two-sample designs.” 2018. Web. 17 Jan 2021.

Vancouver:

Johnson EN. Permutation tests for mixed paired and two-sample designs. [Internet] [Thesis]. NC Docks; 2018. [cited 2021 Jan 17]. Available from: http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf.

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

Council of Science Editors:

Johnson EN. Permutation tests for mixed paired and two-sample designs. [Thesis]. NC Docks; 2018. Available from: http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf

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

15. 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 January 17, 2021. http://www.theses.fr/2010LYO10287.

MLA Handbook (7th Edition):

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

Vancouver:

Widmer S. Topics in word complexity : Autour de la Complexité des mots. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2010. [cited 2021 Jan 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

16. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Hyatt M. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. [Internet] [Doctoral dissertation]. University of Miami; 2011. [cited 2021 Jan 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

17. 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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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


Universidade Estadual de Campinas

18. Silva, Jordan Lambert, 1989-. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.

Degree: 2017, Universidade Estadual de Campinas

 Abstract: This thesis presents combinatorial aspects related to topology/geometry of Schubert varieties. The first problem consists to obtain an explicit formula to compute the coefficients… (more)

Subjects/Keywords: Schubert, Variedades de; Topologia algébrica; Permutações (Matemática); Permutações evitando padrões (Matemática); Schubert varieties; Algebraic topology; Permutations (Mathematics); Pattern-avoiding permutations (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, Jordan Lambert, 1. (2017). Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848

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

Silva, Jordan Lambert, 1989-. “Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.” 2017. Thesis, Universidade Estadual de Campinas. Accessed January 17, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848.

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

MLA Handbook (7th Edition):

Silva, Jordan Lambert, 1989-. “Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.” 2017. Web. 17 Jan 2021.

Vancouver:

Silva, Jordan Lambert 1. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Jan 17]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848.

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

Council of Science Editors:

Silva, Jordan Lambert 1. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848

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

19. 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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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

20. 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 January 17, 2021. 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 Jan 2021.

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 2021 Jan 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

21. 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, Université Paris-Saclay (ComUE)

 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). Université Paris-Saclay (ComUE). 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, Université Paris-Saclay (ComUE). Accessed January 17, 2021. 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 Jan 2021.

Vancouver:

Korba A. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2021 Jan 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]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLT009


University of California – San Diego

22. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Pan R. Block patterns in permutations and words and generalized clusters. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2021 Jan 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


Universidade Estadual de Campinas

23. Garcia, Heitor Amaral, 1991-. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.

Degree: 2017, Universidade Estadual de Campinas

 Abstract: In this dissertation several Combinatorial Analysis problems (permutations, arrangements and combinations) will be solved without the use of formulas, in a natural and logical… (more)

Subjects/Keywords: Análise combinatória; Combinações (Matemática); Permutações (Matemática); Combinatorial analysis; Combinations; Permutations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garcia, Heitor Amaral, 1. (2017). O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395

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

Garcia, Heitor Amaral, 1991-. “O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.” 2017. Thesis, Universidade Estadual de Campinas. Accessed January 17, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395.

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

MLA Handbook (7th Edition):

Garcia, Heitor Amaral, 1991-. “O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.” 2017. Web. 17 Jan 2021.

Vancouver:

Garcia, Heitor Amaral 1. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Jan 17]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395.

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

Council of Science Editors:

Garcia, Heitor Amaral 1. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395

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

24. 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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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 January 17, 2021. 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 Jan 2021.

Vancouver:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Jan 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 Johannesburg

25. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Shongwe TC. Synchronization with permutation codes and Reed-Solomon codes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Jan 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

26. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Ouahada KT. Spectral shaping and distance mapping with permutation sequences. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Jan 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


California State University – San Bernardino

27. 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 https://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 January 17, 2021. https://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 Jan 2021.

Vancouver:

Herrera D. Homormophic Images and their Isomorphism Types. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2021 Jan 17]. Available from: https://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: https://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 Manitoba

28. Al-Meanazel, Ayat. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.

Degree: Statistics, 2015, University of Manitoba

 The distribution theory of runs and patterns has a long and rich history. In this dissertation we study the distribution of some run-related statistics in… (more)

Subjects/Keywords: Permutations; Multi-sets; Markov chain; Longest Increasing Subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Meanazel, A. (2015). The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/30872

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

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Thesis, University of Manitoba. Accessed January 17, 2021. http://hdl.handle.net/1993/30872.

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

MLA Handbook (7th Edition):

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Web. 17 Jan 2021.

Vancouver:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1993/30872.

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

Council of Science Editors:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/30872

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


University of Adelaide

29. Dansie, B. R. (Brenton Ronald). The analysis of permutations / by B.R. Dansie.

Degree: 1988, University of Adelaide

Subjects/Keywords: 519.5 20; Permutations.; Mathematical statistics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dansie, B. R. (. R. (1988). The analysis of permutations / by B.R. Dansie. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/18613

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

Dansie, B R (Brenton Ronald). “The analysis of permutations / by B.R. Dansie.” 1988. Thesis, University of Adelaide. Accessed January 17, 2021. http://hdl.handle.net/2440/18613.

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

MLA Handbook (7th Edition):

Dansie, B R (Brenton Ronald). “The analysis of permutations / by B.R. Dansie.” 1988. Web. 17 Jan 2021.

Vancouver:

Dansie BR(R. The analysis of permutations / by B.R. Dansie. [Internet] [Thesis]. University of Adelaide; 1988. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/2440/18613.

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

Council of Science Editors:

Dansie BR(R. The analysis of permutations / by B.R. Dansie. [Thesis]. University of Adelaide; 1988. Available from: http://hdl.handle.net/2440/18613

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


University of Manchester

30. 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 January 17, 2021. 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 Jan 2021.

Vancouver:

Steele HP. Combinatorial arguments for linear logic full completeness. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2021 Jan 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

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

.