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 +publisher:"University of North Texas" +contributor:("Brand, Neal E."). Showing records 1 – 22 of 22 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. McWhorter, Samuel P. Fundamental Issues in Support Vector Machines.

Degree: 2014, University of North Texas

 This dissertation considers certain issues in support vector machines (SVMs), including a description of their construction, aspects of certain exponential kernels used in some SVMs,… (more)

Subjects/Keywords: Support vector machines; radial basis function kernel; exponential kernel; elementary proof; Support vector machines.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McWhorter, S. P. (2014). Fundamental Issues in Support Vector Machines. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc500155/

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

McWhorter, Samuel P. “Fundamental Issues in Support Vector Machines.” 2014. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc500155/.

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

MLA Handbook (7th Edition):

McWhorter, Samuel P. “Fundamental Issues in Support Vector Machines.” 2014. Web. 11 Aug 2020.

Vancouver:

McWhorter SP. Fundamental Issues in Support Vector Machines. [Internet] [Thesis]. University of North Texas; 2014. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc500155/.

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

Council of Science Editors:

McWhorter SP. Fundamental Issues in Support Vector Machines. [Thesis]. University of North Texas; 2014. Available from: https://digital.library.unt.edu/ark:/67531/metadc500155/

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


University of North Texas

2. Green, Michael Douglas, 1965-. Manifolds, Vector Bundles, and Stiefel-Whitney Classes.

Degree: 1990, University of North Texas

 The problem of embedding a manifold in Euclidean space is considered. Manifolds are introduced in Chapter I along with other basic definitions and examples. Chapter… (more)

Subjects/Keywords: manifolds; vector bundles; Stiefel-Whitney classes; Euclidean space; Manifolds (Mathematics); Vector bundles.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Green, Michael Douglas, 1. (1990). Manifolds, Vector Bundles, and Stiefel-Whitney Classes. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc504181/

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

Green, Michael Douglas, 1965-. “Manifolds, Vector Bundles, and Stiefel-Whitney Classes.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc504181/.

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

MLA Handbook (7th Edition):

Green, Michael Douglas, 1965-. “Manifolds, Vector Bundles, and Stiefel-Whitney Classes.” 1990. Web. 11 Aug 2020.

Vancouver:

Green, Michael Douglas 1. Manifolds, Vector Bundles, and Stiefel-Whitney Classes. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc504181/.

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

Council of Science Editors:

Green, Michael Douglas 1. Manifolds, Vector Bundles, and Stiefel-Whitney Classes. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc504181/

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


University of North Texas

3. Butler, Joe R. The Torus Does Not Have a Hyperbolic Structure.

Degree: 1992, University of North Texas

 Several basic topics from Algebraic Topology, including fundamental group and universal covering space are shown. The hyperbolic plane is defined, including its metric and show… (more)

Subjects/Keywords: Algebraic Topology; hyperbolic plane; hyperbolic surface; two hole torus; Torus (Geometry); Geometry, Hyperbolic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Butler, J. R. (1992). The Torus Does Not Have a Hyperbolic Structure. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc500333/

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

Butler, Joe R. “The Torus Does Not Have a Hyperbolic Structure.” 1992. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc500333/.

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

MLA Handbook (7th Edition):

Butler, Joe R. “The Torus Does Not Have a Hyperbolic Structure.” 1992. Web. 11 Aug 2020.

Vancouver:

Butler JR. The Torus Does Not Have a Hyperbolic Structure. [Internet] [Thesis]. University of North Texas; 1992. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc500333/.

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

Council of Science Editors:

Butler JR. The Torus Does Not Have a Hyperbolic Structure. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc500333/

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


University of North Texas

4. Naughton, Gerard P. (Gerard Peter). Haar Measure on the Cantor Ternary Set.

Degree: 1990, University of North Texas

 The purpose of this thesis is to examine certain questions concerning the Cantor ternary set. The second chapter deals with proving that the Cantor ternary… (more)

Subjects/Keywords: Cantor ternary set; Haar integrals; Haar measures; Cantor sets.; Integrals, Haar.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naughton, G. P. (. P. (1990). Haar Measure on the Cantor Ternary Set. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc504018/

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

Naughton, Gerard P (Gerard Peter). “Haar Measure on the Cantor Ternary Set.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc504018/.

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

MLA Handbook (7th Edition):

Naughton, Gerard P (Gerard Peter). “Haar Measure on the Cantor Ternary Set.” 1990. Web. 11 Aug 2020.

Vancouver:

Naughton GP(P. Haar Measure on the Cantor Ternary Set. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc504018/.

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

Council of Science Editors:

Naughton GP(P. Haar Measure on the Cantor Ternary Set. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc504018/

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


University of North Texas

5. Simmons, Charlotte. Hyperspaces of Continua.

Degree: 1990, University of North Texas

 Several properties of Hausdorff continua are considered in this paper. However, the major emphasis is on developing the properties of the hyperspaces 2x and C(X)… (more)

Subjects/Keywords: Hausdorff continua; hyperspaces of continua; Hyperspace.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simmons, C. (1990). Hyperspaces of Continua. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc504208/

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

Simmons, Charlotte. “Hyperspaces of Continua.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc504208/.

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

MLA Handbook (7th Edition):

Simmons, Charlotte. “Hyperspaces of Continua.” 1990. Web. 11 Aug 2020.

Vancouver:

Simmons C. Hyperspaces of Continua. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc504208/.

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

Council of Science Editors:

Simmons C. Hyperspaces of Continua. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc504208/

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


University of North Texas

6. Dobson, Edward T. (Edward Tauscher). Ádám's Conjecture and Its Generalizations.

Degree: 1990, University of North Texas

 This paper examines idam's conjuecture and some of its generalizations. In terms of Adam's conjecture, we prove Alspach and Parson's results f or Zpq and… (more)

Subjects/Keywords: Ádám's conjecture; CI-groups; Isomorphisms (Mathematics); Polynomials.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dobson, E. T. (. T. (1990). Ádám's Conjecture and Its Generalizations. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc504440/

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

Dobson, Edward T (Edward Tauscher). “Ádám's Conjecture and Its Generalizations.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc504440/.

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

MLA Handbook (7th Edition):

Dobson, Edward T (Edward Tauscher). “Ádám's Conjecture and Its Generalizations.” 1990. Web. 11 Aug 2020.

Vancouver:

Dobson ET(T. Ádám's Conjecture and Its Generalizations. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc504440/.

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

Council of Science Editors:

Dobson ET(T. Ádám's Conjecture and Its Generalizations. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc504440/

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


University of North Texas

7. Stark, William D. (William David). Homotopies and Deformation Retracts.

Degree: 1990, University of North Texas

 This paper introduces the background concepts necessary to develop a detailed proof of a theorem by Ralph H. Fox which states that two topological spaces… (more)

Subjects/Keywords: homotopies; deformation retracts; mapping cylinders; Homotopy theory.; Retracts, Theory of.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stark, W. D. (. D. (1990). Homotopies and Deformation Retracts. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc504325/

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

Stark, William D (William David). “Homotopies and Deformation Retracts.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc504325/.

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

MLA Handbook (7th Edition):

Stark, William D (William David). “Homotopies and Deformation Retracts.” 1990. Web. 11 Aug 2020.

Vancouver:

Stark WD(D. Homotopies and Deformation Retracts. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc504325/.

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

Council of Science Editors:

Stark WD(D. Homotopies and Deformation Retracts. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc504325/

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


University of North Texas

8. Muller, Kimberly (Kimberly Orisja). Polish Spaces and Analytic Sets.

Degree: 1997, University of North Texas

 A Polish space is a separable topological space that can be metrized by means of a complete metric. A subset A of a Polish space… (more)

Subjects/Keywords: Polish spaces; Analytic sets; non-Borel; Polish spaces (Mathematics); Analytic sets.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Muller, K. (. O. (1997). Polish Spaces and Analytic Sets. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277605/

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

Muller, Kimberly (Kimberly Orisja). “Polish Spaces and Analytic Sets.” 1997. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc277605/.

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

MLA Handbook (7th Edition):

Muller, Kimberly (Kimberly Orisja). “Polish Spaces and Analytic Sets.” 1997. Web. 11 Aug 2020.

Vancouver:

Muller K(O. Polish Spaces and Analytic Sets. [Internet] [Thesis]. University of North Texas; 1997. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277605/.

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

Council of Science Editors:

Muller K(O. Polish Spaces and Analytic Sets. [Thesis]. University of North Texas; 1997. Available from: https://digital.library.unt.edu/ark:/67531/metadc277605/

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


University of North Texas

9. Park, Hong Goo. Polynomial Isomorphisms of Cayley Objects Over a Finite Field.

Degree: 1989, University of North Texas

 In this dissertation the Bays-Lambossy theorem is generalized to GF(pn). The Bays-Lambossy theorem states that if two Cayley objects each based on GF(p) are isomorphic… (more)

Subjects/Keywords: Polynomials; Cayley objects; Isomorphisms (Mathematics); Finite fields (Algebra); Cayley algebras.; Polynomials.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, H. G. (1989). Polynomial Isomorphisms of Cayley Objects Over a Finite Field. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc331144/

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

Park, Hong Goo. “Polynomial Isomorphisms of Cayley Objects Over a Finite Field.” 1989. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc331144/.

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

MLA Handbook (7th Edition):

Park, Hong Goo. “Polynomial Isomorphisms of Cayley Objects Over a Finite Field.” 1989. Web. 11 Aug 2020.

Vancouver:

Park HG. Polynomial Isomorphisms of Cayley Objects Over a Finite Field. [Internet] [Thesis]. University of North Texas; 1989. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc331144/.

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

Council of Science Editors:

Park HG. Polynomial Isomorphisms of Cayley Objects Over a Finite Field. [Thesis]. University of North Texas; 1989. Available from: https://digital.library.unt.edu/ark:/67531/metadc331144/

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


University of North Texas

10. Hipp, James W. (James William), 1956-. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.

Degree: 1989, University of North Texas

 We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W3, and the 3-whirl W3(more)

Subjects/Keywords: combinatorial geometries; rings; mathematics; Combinatorial geometry.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hipp, James W. (James William), 1. (1989). The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc330849/

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

Hipp, James W. (James William), 1956-. “The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.” 1989. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc330849/.

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

MLA Handbook (7th Edition):

Hipp, James W. (James William), 1956-. “The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.” 1989. Web. 11 Aug 2020.

Vancouver:

Hipp, James W. (James William) 1. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. [Internet] [Thesis]. University of North Texas; 1989. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc330849/.

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

Council of Science Editors:

Hipp, James W. (James William) 1. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. [Thesis]. University of North Texas; 1989. Available from: https://digital.library.unt.edu/ark:/67531/metadc330849/

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


University of North Texas

11. Somporn Sutinuntopas. Applications of Graph Theory and Topology to Combinatorial Designs.

Degree: 1988, University of North Texas

 This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to… (more)

Subjects/Keywords: isomorphisms; affine designs; isomorphic designs; Tutte's theorem; Isomorphisms (Mathematics); Graph theory.; Topology.; Combinatorial designs and configurations.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sutinuntopas, S. (1988). Applications of Graph Theory and Topology to Combinatorial Designs. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc331968/

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

Sutinuntopas, Somporn. “Applications of Graph Theory and Topology to Combinatorial Designs.” 1988. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc331968/.

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

MLA Handbook (7th Edition):

Sutinuntopas, Somporn. “Applications of Graph Theory and Topology to Combinatorial Designs.” 1988. Web. 11 Aug 2020.

Vancouver:

Sutinuntopas S. Applications of Graph Theory and Topology to Combinatorial Designs. [Internet] [Thesis]. University of North Texas; 1988. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc331968/.

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

Council of Science Editors:

Sutinuntopas S. Applications of Graph Theory and Topology to Combinatorial Designs. [Thesis]. University of North Texas; 1988. Available from: https://digital.library.unt.edu/ark:/67531/metadc331968/

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


University of North Texas

12. Bozeman, Alan Kyle. Weakly Dense Subsets of Homogeneous Complete Boolean Algebras.

Degree: 1990, University of North Texas

 The primary result from this dissertation is following inequality: d(B) ≤ min(2^< wd(B),sup{λc(B): λ < wd(B)}) in ZFC, where B is a homogeneous complete Boolean… (more)

Subjects/Keywords: homogeneous complete Boolean algebras; weak density; cellularity; weakly dense sets; cardinal functions; Algebra, Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bozeman, A. K. (1990). Weakly Dense Subsets of Homogeneous Complete Boolean Algebras. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc330803/

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

Bozeman, Alan Kyle. “Weakly Dense Subsets of Homogeneous Complete Boolean Algebras.” 1990. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc330803/.

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

MLA Handbook (7th Edition):

Bozeman, Alan Kyle. “Weakly Dense Subsets of Homogeneous Complete Boolean Algebras.” 1990. Web. 11 Aug 2020.

Vancouver:

Bozeman AK. Weakly Dense Subsets of Homogeneous Complete Boolean Algebras. [Internet] [Thesis]. University of North Texas; 1990. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc330803/.

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

Council of Science Editors:

Bozeman AK. Weakly Dense Subsets of Homogeneous Complete Boolean Algebras. [Thesis]. University of North Texas; 1990. Available from: https://digital.library.unt.edu/ark:/67531/metadc330803/

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


University of North Texas

13. Simmons, Dayton C. (Dayton Cooper). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.

Degree: 1993, University of North Texas

 In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs… (more)

Subjects/Keywords: Markov chains; mathematics; Steinhaus graphs; Markov processes.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simmons, D. C. (. C. (1993). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277740/

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

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc277740/.

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

MLA Handbook (7th Edition):

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Web. 11 Aug 2020.

Vancouver:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/.

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

Council of Science Editors:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/

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


University of North Texas

14. Mao, Ai-sheng. A Theoretical Network Model and the Incremental Hypercube-Based Networks.

Degree: 1995, University of North Texas

 The study of multicomputer interconnection networks is an important area of research in parallel processing. We introduce vertex-symmetric Hamming-group graphs as a model to design… (more)

Subjects/Keywords: Hypercube networks (Computer networks); parallel processing; Hamming cubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mao, A. (1995). A Theoretical Network Model and the Incremental Hypercube-Based Networks. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277860/

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

Mao, Ai-sheng. “A Theoretical Network Model and the Incremental Hypercube-Based Networks.” 1995. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc277860/.

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

MLA Handbook (7th Edition):

Mao, Ai-sheng. “A Theoretical Network Model and the Incremental Hypercube-Based Networks.” 1995. Web. 11 Aug 2020.

Vancouver:

Mao A. A Theoretical Network Model and the Incremental Hypercube-Based Networks. [Internet] [Thesis]. University of North Texas; 1995. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277860/.

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

Council of Science Editors:

Mao A. A Theoretical Network Model and the Incremental Hypercube-Based Networks. [Thesis]. University of North Texas; 1995. Available from: https://digital.library.unt.edu/ark:/67531/metadc277860/

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


University of North Texas

15. Legge, Gaynor W. A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation.

Degree: 1992, University of North Texas

 This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event… (more)

Subjects/Keywords: artificial intelligence; computer science; discrete event simulators; Logic, Symbolic and mathematical.; Logic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Legge, G. W. (1992). A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278352/

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

Legge, Gaynor W. “A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation.” 1992. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc278352/.

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

MLA Handbook (7th Edition):

Legge, Gaynor W. “A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation.” 1992. Web. 11 Aug 2020.

Vancouver:

Legge GW. A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation. [Internet] [Thesis]. University of North Texas; 1992. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278352/.

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

Council of Science Editors:

Legge GW. A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc278352/

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


University of North Texas

16. Halverson, Ranette Hudson. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.

Degree: 1993, University of North Texas

 The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner.… (more)

Subjects/Keywords: Algorithms.; Parallel processing (Electronic computers); parallel algorithm; parentheses matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halverson, R. H. (1993). Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278153/

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

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

MLA Handbook (7th Edition):

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Web. 11 Aug 2020.

Vancouver:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

Council of Science Editors:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/

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


University of North Texas

17. Lim, Daekeun. Cycles and Cliques in Steinhaus Graphs.

Degree: 1994, University of North Texas

 In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order… (more)

Subjects/Keywords: Steinhaus graphs; mathematics; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lim, D. (1994). Cycles and Cliques in Steinhaus Graphs. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278469/

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

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc278469/.

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

MLA Handbook (7th Edition):

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Web. 11 Aug 2020.

Vancouver:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Internet] [Thesis]. University of North Texas; 1994. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/.

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

Council of Science Editors:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Thesis]. University of North Texas; 1994. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/

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


University of North Texas

18. Khafizov, Farid T. Descriptions and Computation of Ultrapowers in L(R).

Degree: 1995, University of North Texas

 The results from this dissertation are an exact computation of ultrapowers by measures on cardinals \alephn, n∈ w, in L(\IR), and a proof that ordinals… (more)

Subjects/Keywords: ultrapowers; mathematics; Cardinal numbers.; Set theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khafizov, F. T. (1995). Descriptions and Computation of Ultrapowers in L(R). (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277867/

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

Khafizov, Farid T. “Descriptions and Computation of Ultrapowers in L(R).” 1995. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc277867/.

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

MLA Handbook (7th Edition):

Khafizov, Farid T. “Descriptions and Computation of Ultrapowers in L(R).” 1995. Web. 11 Aug 2020.

Vancouver:

Khafizov FT. Descriptions and Computation of Ultrapowers in L(R). [Internet] [Thesis]. University of North Texas; 1995. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277867/.

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

Council of Science Editors:

Khafizov FT. Descriptions and Computation of Ultrapowers in L(R). [Thesis]. University of North Texas; 1995. Available from: https://digital.library.unt.edu/ark:/67531/metadc277867/

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


University of North Texas

19. Sarkar, Falguni. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.

Degree: 1996, University of North Texas

 Discrete event simulation is an important tool for modeling and analysis. Some of the simulation applications such as telecommunication network performance, VLSI logic circuits design,… (more)

Subjects/Keywords: Computer simulation.; Discrete-time systems.; discrete event simulation; logical processes; parallel discrete event simulation; global virtual time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sarkar, F. (1996). Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc279308/

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

Sarkar, Falguni. “Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.” 1996. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc279308/.

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

MLA Handbook (7th Edition):

Sarkar, Falguni. “Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation.” 1996. Web. 11 Aug 2020.

Vancouver:

Sarkar F. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. [Internet] [Thesis]. University of North Texas; 1996. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc279308/.

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

Council of Science Editors:

Sarkar F. Rollback Reduction Techniques Through Load Balancing in Optimistic Parallel Discrete Event Simulation. [Thesis]. University of North Texas; 1996. Available from: https://digital.library.unt.edu/ark:/67531/metadc279308/

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


University of North Texas

20. Sen, Sanjoy Kumar. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.

Degree: 1997, University of North Texas

 The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is… (more)

Subjects/Keywords: mobile computing; wireless computing; bandwidth; Mobile computing.; Wireless communication systems.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sen, S. K. (1997). Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278885/

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

Sen, Sanjoy Kumar. “Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.” 1997. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc278885/.

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

MLA Handbook (7th Edition):

Sen, Sanjoy Kumar. “Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing.” 1997. Web. 11 Aug 2020.

Vancouver:

Sen SK. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. [Internet] [Thesis]. University of North Texas; 1997. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278885/.

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

Council of Science Editors:

Sen SK. Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing. [Thesis]. University of North Texas; 1997. Available from: https://digital.library.unt.edu/ark:/67531/metadc278885/

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


University of North Texas

21. Yoon, Young-jin. Characterizations of Some Combinatorial Geometries.

Degree: 1992, University of North Texas

 We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be… (more)

Subjects/Keywords: Combinatorial geometry.; combinatorial geometry; partition lattices; projective geometries

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yoon, Y. (1992). Characterizations of Some Combinatorial Geometries. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277894/

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

Yoon, Young-jin. “Characterizations of Some Combinatorial Geometries.” 1992. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc277894/.

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

MLA Handbook (7th Edition):

Yoon, Young-jin. “Characterizations of Some Combinatorial Geometries.” 1992. Web. 11 Aug 2020.

Vancouver:

Yoon Y. Characterizations of Some Combinatorial Geometries. [Internet] [Thesis]. University of North Texas; 1992. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277894/.

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

Council of Science Editors:

Yoon Y. Characterizations of Some Combinatorial Geometries. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc277894/

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


University of North Texas

22. Tejada, Débora. Universal Branched Coverings.

Degree: 1993, University of North Texas

 In this paper, the study of k-fold branched coverings for which the branch set is a stratified set is considered. First of all, the existence… (more)

Subjects/Keywords: k-fold branched coverings; mathematics; CW-complexes; Brown's Representability Theorem; Covering spaces (Topology)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tejada, D. (1993). Universal Branched Coverings. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc279340/

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

Tejada, Débora. “Universal Branched Coverings.” 1993. Thesis, University of North Texas. Accessed August 11, 2020. https://digital.library.unt.edu/ark:/67531/metadc279340/.

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

MLA Handbook (7th Edition):

Tejada, Débora. “Universal Branched Coverings.” 1993. Web. 11 Aug 2020.

Vancouver:

Tejada D. Universal Branched Coverings. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Aug 11]. Available from: https://digital.library.unt.edu/ark:/67531/metadc279340/.

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

Council of Science Editors:

Tejada D. Universal Branched Coverings. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc279340/

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

.