# Browse Graduate Dissertations and Theses at Illinois by Title

• (1967)

application/pdf

PDF (14MB)
• (1967)

application/pdf

PDF (10MB)
• (1981)
Throughout this study the main objective has been to analyze the role and the impact of LDC's indebtedness in the light of the recent Brazilian experience. The theoretical basis for this analysis was set forth in Chapter ...

application/pdf

PDF (4MB)
• (1973)

application/pdf

PDF (6MB)
• (1960)

application/pdf

PDF (16MB)
• (1994)
In this thesis, we study the problem of spin and charge separation in condensed matter. We focus primarily on Mott insulators at half-filling. It is known that one dimensional strongly correlated electronic systems display ...

application/pdf

PDF (7MB)
• (1962)

application/pdf

PDF (1MB)
• (1956)

application/pdf

PDF (8MB)
• (2001)
The conclusions of this study are that the subjects involved in this study did not know how to practice effectively and, although they seemed to have the ability to use thinking skills did not use those skills consistently. ...

application/pdf

PDF (15MB)
• (1979)

application/pdf

PDF (7MB)
• (2012-02-01)
We consider a variety of problems in extremal graph and set theory. Given a property $\Gamma$ and a family of sets ${\mathcal F}$, let $f({\mathcal F},\Gamma)$ be the size of the largest subfamily of ${\mathcal F}$ ...

application/pdf

PDF (531kB)
• (1999)
What is the maximum number of edges in a multigraph on n vertices if every k-set spans at most r edges? We asymptotically determine this maximum for almost all k and r as n tends to infinity, thus giving a generalization ...

application/pdf

PDF (5MB)
• (2010-08-20)
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable. The {\it square} of $G$, written $G^2$, ...

application/pdf

PDF (484kB)
• (2003)
Let F be a family of translates of a fixed convex set in the plane, and let G be the intersection graph of F . We studied the chromatic number of the complement of G. We also studied the transversal number of F , ...

application/pdf

PDF (4MB)
• (1990)
This thesis has two goals. First, it provides a detailed treatment of the tone system of Jita, an Eastern Bantu language spoken in Northwestern Tanzania. Secondly, it examines recent theoretical issues in Bantu tonology, ...

application/pdf

PDF (17MB)
• (2014-09-16)
We study several problems in extremal graph theory. Chapter 2 studies Tuza's Conjecture, which states that if a graph G does not contain more than k edge-disjoint triangles, then G can be made triangle-free by deleting ...

application/pdf

PDF (589kB)
• (2011-08-25)
In the ﬁrst part of this thesis we generalize a theorem of Kiming and Olsson concerning the existence of Ramanujan-type congruences for a class of eta quotients. Speciﬁcally, we consider a class of generating functions ...

application/pdf

PDF (305kB)
• (2006)
Finally, we introduce a framework to study the development of efficient algorithms in systems with dependent tasks. We use it to identify the structure of the algorithms we designed, and a classification that may be useful ...

application/pdf

PDF (3MB)
• (1984)
Five disjoint problems are discussed. The first problem concerns the determination of optimal algorithms with respect to a new model for evaluating sorting algorithms. We did an exhaustive search for such algorithms. The ...

application/pdf

PDF (4MB)
• (1972)

application/pdf

PDF (6MB)