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:(infinite graphs). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Texas A&M University

1. Weyand, Tracy Kathleen. Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator.

Degree: 2014, Texas A&M University

 In this dissertation, we analyze characteristics of eigenfunctions of the Schr?dinger operator on graphs. In particular, we are interested in the zeros of the eigenfunctions… (more)

Subjects/Keywords: Quantum graphs; Schrodinger operator on graphs; nodal count; zeros of eigenfunctions; magnetic Schrodinger operator; magnetic-nodal connection; dispersion relation; spectral band edges; infinite periodic graphs; Wronskian on graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weyand, T. K. (2014). Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153392

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

Weyand, Tracy Kathleen. “Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator.” 2014. Thesis, Texas A&M University. Accessed August 07, 2020. http://hdl.handle.net/1969.1/153392.

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

MLA Handbook (7th Edition):

Weyand, Tracy Kathleen. “Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator.” 2014. Web. 07 Aug 2020.

Vancouver:

Weyand TK. Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Aug 07]. Available from: http://hdl.handle.net/1969.1/153392.

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

Council of Science Editors:

Weyand TK. Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153392

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

2. Ancykutty, Joseph; Dr.Krishnamoorthy,A. On infinite graphs and related matrices.

Degree: mathematics, 2000, Cochin University of Science and Technology

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any… (more)

Subjects/Keywords: Graphs and Digraphs; Theory of rings; Adjacency matrix,; Infinite digraph; Arc adjacency operator

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ancykutty, J. D. K. (2000). On infinite graphs and related matrices. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/3142

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

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Thesis, Cochin University of Science and Technology. Accessed August 07, 2020. http://dyuthi.cusat.ac.in/purl/3142.

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

MLA Handbook (7th Edition):

Ancykutty, Joseph; Dr Krishnamoorthy,A. “On infinite graphs and related matrices.” 2000. Web. 07 Aug 2020.

Vancouver:

Ancykutty JDK. On infinite graphs and related matrices. [Internet] [Thesis]. Cochin University of Science and Technology; 2000. [cited 2020 Aug 07]. Available from: http://dyuthi.cusat.ac.in/purl/3142.

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

Council of Science Editors:

Ancykutty JDK. On infinite graphs and related matrices. [Thesis]. Cochin University of Science and Technology; 2000. Available from: http://dyuthi.cusat.ac.in/purl/3142

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

3. Vergara Soto, Ignacio. Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes.

Degree: Docteur es, Mathématiques, 2018, Lyon

Cette thèse porte sur des propriétés d'approximation généralisant la moyennabilité pour les groupes localement compacts. Ces propriétés sont définies à partir des multiplicateurs de certaines… (more)

Subjects/Keywords: Groupes localement compacts; Applications complètement bornées; Propriétés d'approximation de groupes; Multiplicateurs; Graphes infinis; Locally compact groups; Completely bounded maps; Approximation properties of groups; Multipliers; Infinite graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vergara Soto, I. (2018). Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2018LYSEN042

Chicago Manual of Style (16th Edition):

Vergara Soto, Ignacio. “Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes.” 2018. Doctoral Dissertation, Lyon. Accessed August 07, 2020. http://www.theses.fr/2018LYSEN042.

MLA Handbook (7th Edition):

Vergara Soto, Ignacio. “Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes.” 2018. Web. 07 Aug 2020.

Vancouver:

Vergara Soto I. Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes. [Internet] [Doctoral dissertation]. Lyon; 2018. [cited 2020 Aug 07]. Available from: http://www.theses.fr/2018LYSEN042.

Council of Science Editors:

Vergara Soto I. Multipliers and approximation properties of groups : Multiplicateurs et propriétés d'approximation de groupes. [Doctoral Dissertation]. Lyon; 2018. Available from: http://www.theses.fr/2018LYSEN042

4. Rennan Ferreira Dantas. Problemas de cÃdigo de identificaÃÃo em grades.

Degree: Master, 2014, Universidade Federal do Ceará

O problema do cÃdigo de identificaÃÃo foi introduzido em 1998 por Karpovsky com a finalidade de ajudar no diagnÃstico de falhas em sistemas computacionais com… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; CÃdigos de identificaÃÃo; Grade triangular; Grade quadrada; Grade infinita; Identifying codes; Triangular grids; Square grids; Infinite graphs; Sistemas de computaÃÃo em grade

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dantas, R. F. (2014). Problemas de cÃdigo de identificaÃÃo em grades. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14228 ;

Chicago Manual of Style (16th Edition):

Dantas, Rennan Ferreira. “Problemas de cÃdigo de identificaÃÃo em grades.” 2014. Masters Thesis, Universidade Federal do Ceará. Accessed August 07, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14228 ;.

MLA Handbook (7th Edition):

Dantas, Rennan Ferreira. “Problemas de cÃdigo de identificaÃÃo em grades.” 2014. Web. 07 Aug 2020.

Vancouver:

Dantas RF. Problemas de cÃdigo de identificaÃÃo em grades. [Internet] [Masters thesis]. Universidade Federal do Ceará 2014. [cited 2020 Aug 07]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14228 ;.

Council of Science Editors:

Dantas RF. Problemas de cÃdigo de identificaÃÃo em grades. [Masters Thesis]. Universidade Federal do Ceará 2014. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14228 ;

5. Penelle, Vincent. Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems.

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

Dans cette thèse, nous nous attachons à étudier des classes de graphes infinis et leurs propriétés, Notamment celles de vérification de modèles, d'accessibilité et de… (more)

Subjects/Keywords: Graphes infini; Décidabilité; Ordre supérieur; Arbre de pile; Systèmes à compteurs; Langage de traces; Infinite graphs; Decidability; Higher-Order; Stack tree; Counter systems; Traces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Penelle, V. (2015). Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1122

Chicago Manual of Style (16th Edition):

Penelle, Vincent. “Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed August 07, 2020. http://www.theses.fr/2015PESC1122.

MLA Handbook (7th Edition):

Penelle, Vincent. “Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems.” 2015. Web. 07 Aug 2020.

Vancouver:

Penelle V. Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2020 Aug 07]. Available from: http://www.theses.fr/2015PESC1122.

Council of Science Editors:

Penelle V. Réécriture d’arbres de piles et traces de systèmes à compteurs : Ground stack tree rewriting and traces of counter systems. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1122


Freie Universität Berlin

6. Frick, Stefanie. Stetige und höherdimensionale Ramsey-Theorie.

Degree: 2009, Freie Universität Berlin

 Der Gegenstand der vorliegenden Arbeit sind die unendliche Kombinatorik und die Ramsey-Theorie, wobei unter anderem einige Konsistenzresultate mit Hilfe von Forcing erzielt werden. Die Arbeit… (more)

Subjects/Keywords: Forcing; set theory; sacks forcing; infinite combinatorics; perfect sets; induced graphs; 500 Naturwissenschaften und Mathematik::510 Mathematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Frick, S. (2009). Stetige und höherdimensionale Ramsey-Theorie. (Thesis). Freie Universität Berlin. Retrieved from https://refubium.fu-berlin.de/handle/fub188/13605

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

Frick, Stefanie. “Stetige und höherdimensionale Ramsey-Theorie.” 2009. Thesis, Freie Universität Berlin. Accessed August 07, 2020. https://refubium.fu-berlin.de/handle/fub188/13605.

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

MLA Handbook (7th Edition):

Frick, Stefanie. “Stetige und höherdimensionale Ramsey-Theorie.” 2009. Web. 07 Aug 2020.

Vancouver:

Frick S. Stetige und höherdimensionale Ramsey-Theorie. [Internet] [Thesis]. Freie Universität Berlin; 2009. [cited 2020 Aug 07]. Available from: https://refubium.fu-berlin.de/handle/fub188/13605.

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

Council of Science Editors:

Frick S. Stetige und höherdimensionale Ramsey-Theorie. [Thesis]. Freie Universität Berlin; 2009. Available from: https://refubium.fu-berlin.de/handle/fub188/13605

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


Delft University of Technology

7. DeCorte, P.E.B. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.

Degree: 2015, Delft University of Technology

 This thesis is about maximum independent set and chromatic number problems on certain kinds of infinite graphs. A typical example comes from the Witsenhausen problem:… (more)

Subjects/Keywords: Eigenvalue method; Delsarte code bounds; Lovasz theta function; infinite graphs; harmonic analysis; orthogonality graph; Witsenhausen problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

DeCorte, P. E. B. (2015). The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c

Chicago Manual of Style (16th Edition):

DeCorte, P E B. “The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.” 2015. Doctoral Dissertation, Delft University of Technology. Accessed August 07, 2020. http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c.

MLA Handbook (7th Edition):

DeCorte, P E B. “The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.” 2015. Web. 07 Aug 2020.

Vancouver:

DeCorte PEB. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. [Internet] [Doctoral dissertation]. Delft University of Technology; 2015. [cited 2020 Aug 07]. Available from: http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c.

Council of Science Editors:

DeCorte PEB. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. [Doctoral Dissertation]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c

8. Vandomme, Elise. Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes.

Degree: Docteur es, Mathématiques, 2015, Université Grenoble Alpes (ComUE); Université de Liège

Cette dissertation se divise en deux parties, distinctes mais connexes, qui sont le reflet de la cotutelle. Nous étudions et résolvons des problèmes concernant d'une… (more)

Subjects/Keywords: Combinatoire des mots; Équivalence ℓ-abélienne; Régularité; Récurrence; Mots de retour abélien; Mots sturmiens; Théorie des graphes; Codes identifiants; Graphes sommet transitifs; Quadrangles généralisés; (r, a, b)-codes couvrants; Grille infinie; Combinatorics on words; ℓ-abelian equivalence; Regularity; Recurrence; Abelian return words; Sturmian words; Graph theory; Identifying codes; Vertex-transitive graphs; Generalized quadrangles; (r, a, b)-covering codes; Infinite grid; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vandomme, E. (2015). Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes. (Doctoral Dissertation). Université Grenoble Alpes (ComUE); Université de Liège. Retrieved from http://www.theses.fr/2015GREAM010

Chicago Manual of Style (16th Edition):

Vandomme, Elise. “Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes.” 2015. Doctoral Dissertation, Université Grenoble Alpes (ComUE); Université de Liège. Accessed August 07, 2020. http://www.theses.fr/2015GREAM010.

MLA Handbook (7th Edition):

Vandomme, Elise. “Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes.” 2015. Web. 07 Aug 2020.

Vancouver:

Vandomme E. Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); Université de Liège; 2015. [cited 2020 Aug 07]. Available from: http://www.theses.fr/2015GREAM010.

Council of Science Editors:

Vandomme E. Contributions to combinatorics on words in an abelian context and covering problems in graphs : Contributions à la combinatoire des mots dans un contexte abélien et aux problèmes de couvertures dans les graphes. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); Université de Liège; 2015. Available from: http://www.theses.fr/2015GREAM010


University of Victoria

9. Funk, Daryl J. A compactness theorem for Hamilton circles in infinite graphs.

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

 The problem of defining cycles in infinite graphs has received much attention in the literature. Diestel and Kuhn have proposed viewing a graph as 1-complex,… (more)

Subjects/Keywords: Graph Theory; Infinite graphs; Topological graph theory; Hamiltonicity; Hamilton circle; line graph; claw-free graph; square graph; UVic Subject Index::Sciences and Engineering::Mathematics::Pure mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Funk, D. J. (2009). A compactness theorem for Hamilton circles in infinite graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/1369

Chicago Manual of Style (16th Edition):

Funk, Daryl J. “A compactness theorem for Hamilton circles in infinite graphs.” 2009. Masters Thesis, University of Victoria. Accessed August 07, 2020. http://hdl.handle.net/1828/1369.

MLA Handbook (7th Edition):

Funk, Daryl J. “A compactness theorem for Hamilton circles in infinite graphs.” 2009. Web. 07 Aug 2020.

Vancouver:

Funk DJ. A compactness theorem for Hamilton circles in infinite graphs. [Internet] [Masters thesis]. University of Victoria; 2009. [cited 2020 Aug 07]. Available from: http://hdl.handle.net/1828/1369.

Council of Science Editors:

Funk DJ. A compactness theorem for Hamilton circles in infinite graphs. [Masters Thesis]. University of Victoria; 2009. Available from: http://hdl.handle.net/1828/1369


University of South Australia

10. Gallasch, Guy Edward. Parametric verification of the class of stop-and-wait protocols.

Degree: 2007, University of South Australia

 This thesis investigates a method for tackling the verification of parametric systems, systems whose behaviour may depend on the value of one or more parameters.… (more)

Subjects/Keywords: stop and wait protocols; infinite families; 280402 Mathematical Logic and Formal Languages; 280210 Simulation and Modelling; 291704 Computer Communications Networks; parametric verification; parametric reachability graphs; parametric automata; coloured petri nets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gallasch, G. E. (2007). Parametric verification of the class of stop-and-wait protocols. (Thesis). University of South Australia. Retrieved from http://arrow.unisa.edu.au:8081/1959.8/29552 ; http://arrow.unisa.edu.au/vital/access/manager/Repository/unisa:28410

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

Gallasch, Guy Edward. “Parametric verification of the class of stop-and-wait protocols.” 2007. Thesis, University of South Australia. Accessed August 07, 2020. http://arrow.unisa.edu.au:8081/1959.8/29552 ; http://arrow.unisa.edu.au/vital/access/manager/Repository/unisa:28410.

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

MLA Handbook (7th Edition):

Gallasch, Guy Edward. “Parametric verification of the class of stop-and-wait protocols.” 2007. Web. 07 Aug 2020.

Vancouver:

Gallasch GE. Parametric verification of the class of stop-and-wait protocols. [Internet] [Thesis]. University of South Australia; 2007. [cited 2020 Aug 07]. Available from: http://arrow.unisa.edu.au:8081/1959.8/29552 ; http://arrow.unisa.edu.au/vital/access/manager/Repository/unisa:28410.

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

Council of Science Editors:

Gallasch GE. Parametric verification of the class of stop-and-wait protocols. [Thesis]. University of South Australia; 2007. Available from: http://arrow.unisa.edu.au:8081/1959.8/29552 ; http://arrow.unisa.edu.au/vital/access/manager/Repository/unisa:28410

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


ETH Zürich

11. Windisch, David. Random walks, disconnection and random interlacements.

Degree: 2009, ETH Zürich

Subjects/Keywords: RANDOM WALKS (WAHRSCHEINLICHKEITSRECHNUNG); UNENDLICHE GRAPHEN (GRAPHENTHEORIE); GRAPHENZERLEGUNG (GRAPHENTHEORIE); RANDOM WALKS (PROBABILITY THEORY); INFINITE GRAPHS (GRAPH THEORY); GRAPH PARTITIONING (GRAPH THEORY); info:eu-repo/classification/ddc/510; info:eu-repo/classification/ddc/510; Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Windisch, D. (2009). Random walks, disconnection and random interlacements. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/151294

Chicago Manual of Style (16th Edition):

Windisch, David. “Random walks, disconnection and random interlacements.” 2009. Doctoral Dissertation, ETH Zürich. Accessed August 07, 2020. http://hdl.handle.net/20.500.11850/151294.

MLA Handbook (7th Edition):

Windisch, David. “Random walks, disconnection and random interlacements.” 2009. Web. 07 Aug 2020.

Vancouver:

Windisch D. Random walks, disconnection and random interlacements. [Internet] [Doctoral dissertation]. ETH Zürich; 2009. [cited 2020 Aug 07]. Available from: http://hdl.handle.net/20.500.11850/151294.

Council of Science Editors:

Windisch D. Random walks, disconnection and random interlacements. [Doctoral Dissertation]. ETH Zürich; 2009. Available from: http://hdl.handle.net/20.500.11850/151294

.