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:(regular trees). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Boise State University

1. Beserra, Kyle Douglas. On the Conjugacy Problem for Automorphisms of Trees.

Degree: 2016, Boise State University

 In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees. We expand on the results of Kechris, Louveau, and… (more)

Subjects/Keywords: invariant descriptive set theory; borel reducibility; graph theory; regular trees; Logic and Foundations; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beserra, K. D. (2016). On the Conjugacy Problem for Automorphisms of Trees. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1083

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

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Thesis, Boise State University. Accessed August 03, 2020. https://scholarworks.boisestate.edu/td/1083.

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

MLA Handbook (7th Edition):

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Web. 03 Aug 2020.

Vancouver:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Internet] [Thesis]. Boise State University; 2016. [cited 2020 Aug 03]. Available from: https://scholarworks.boisestate.edu/td/1083.

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

Council of Science Editors:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Thesis]. Boise State University; 2016. Available from: https://scholarworks.boisestate.edu/td/1083

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


Brno University of Technology

2. Soukup, Ondřej. Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation.

Degree: 2020, Brno University of Technology

 The present thesis introduces derivation trees for several different types of grammars in generalized Kuroda normal forms; namely, general, regular-controlled, and scattered context grammars and… (more)

Subjects/Keywords: Obecné gramatiky; regulárně řízené bezkontextové gramatiky; gramatiky s rozptýleným kontextem; spolupracující distribuované gramatické systémy; normalní formy; derivační stromy; omezené derivační stromy; bezkontextovost; bezkontextovost konečného indexu.; General grammars; regular-controlled context-free grammars; scattered context grammars; cooperating distributed grammar systems; normal forms; derivation trees; restricted derivation trees; context-freeness; context-freeness of finite index.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soukup, O. (2020). Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187311

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

Soukup, Ondřej. “Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation.” 2020. Thesis, Brno University of Technology. Accessed August 03, 2020. http://hdl.handle.net/11012/187311.

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

MLA Handbook (7th Edition):

Soukup, Ondřej. “Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation.” 2020. Web. 03 Aug 2020.

Vancouver:

Soukup O. Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Aug 03]. Available from: http://hdl.handle.net/11012/187311.

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

Council of Science Editors:

Soukup O. Formální modely distribuovaného výpočtu: Formal Models of Distributed Computation. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187311

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

3. Yahiaoui, Said. Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications.

Degree: Docteur es, Informatique, 2013, Université Claude Bernard – Lyon I

Dans cette thèse, nous nous intéressons aux aspects algorithmiques et applications de deux problèmes de graphes, à savoir, la coloration et les alliances. La première… (more)

Subjects/Keywords: Coloration Grundy; Graphes Réguliers; Coloration forte stricte; Appariement d’arbres; Alliances dans les graphes; Algorithmes auto-stabilisants; Algorithmes distribués; Grundy coloring; Regular graphs; Strict strong coloring; Matching trees; Graph alliances; Self-stabilizing algorithms; Distributed algorithms; 005.13

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yahiaoui, S. (2013). Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2013LYO10274

Chicago Manual of Style (16th Edition):

Yahiaoui, Said. “Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications.” 2013. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 03, 2020. http://www.theses.fr/2013LYO10274.

MLA Handbook (7th Edition):

Yahiaoui, Said. “Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications.” 2013. Web. 03 Aug 2020.

Vancouver:

Yahiaoui S. Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2013. [cited 2020 Aug 03]. Available from: http://www.theses.fr/2013LYO10274.

Council of Science Editors:

Yahiaoui S. Algorithmes et applications pour la coloration et les alliances dans les graphes : Graph colorings and alliances : algorithms and applications. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2013. Available from: http://www.theses.fr/2013LYO10274


Université Paris-Sud – Paris XI

4. Bettinelli, Jérémie. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.

Degree: Docteur es, Mathématiques, 2011, Université Paris-Sud – Paris XI

Au cours de ce travail, nous nous intéressons aux limites d'échelle de deux classes de cartes. Dans un premier temps, nous regardons les quadrangulations biparties… (more)

Subjects/Keywords: Cartes aléatoires; Arbres aléatoires; Limite d'échelle; Processus conditionnés; Convergence régulière; Topologie de Gromov; Dimension de Hausdorff; Arbre continu brownien; Espaces métriques aléatoires; Random maps; Random trees; Scaling limits; Conditioned processes; Regular convergence; Gromov topology; Hausdorff dimension; Brownian CRT; Random metric spaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bettinelli, J. (2011). Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112213

Chicago Manual of Style (16th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed August 03, 2020. http://www.theses.fr/2011PA112213.

MLA Handbook (7th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Web. 03 Aug 2020.

Vancouver:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2020 Aug 03]. Available from: http://www.theses.fr/2011PA112213.

Council of Science Editors:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112213

5. Guichard, Christelle. Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z).

Degree: Docteur es, Mathématiques, 2018, Université Grenoble Alpes (ComUE)

Dans ce mémoire de thèse, on étudie le morphisme de monoïde μdu monoïde libre sur l'alphabet des entiers nb,`a valeurs dans le groupe modulaire PSL2(zb),considéré… (more)

Subjects/Keywords: Nombres de Catalan; Groupe modulaire; Groupe des tresses à trois brins B3; Arbres 3-Réguliers; Abélianisé; Polygones convexes entiers; Catalan Numbers; Modular group; Braid group B3; 3-Regular trees; Abelianised; Integer convex polygons; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guichard, C. (2018). Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z). (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2018GREAM057

Chicago Manual of Style (16th Edition):

Guichard, Christelle. “Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z).” 2018. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed August 03, 2020. http://www.theses.fr/2018GREAM057.

MLA Handbook (7th Edition):

Guichard, Christelle. “Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z).” 2018. Web. 03 Aug 2020.

Vancouver:

Guichard C. Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z). [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2018. [cited 2020 Aug 03]. Available from: http://www.theses.fr/2018GREAM057.

Council of Science Editors:

Guichard C. Les nombres de Catalan et le groupe modulaire PSL2(Z) : Catalan Numbers and the modular group PSL2(Z). [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2018. Available from: http://www.theses.fr/2018GREAM057

.