# Browse by Subject "Mathematics"

• (1991)
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties of these 1-factorizations are of interest; to study them, we develop results about the automorphism group of tensor products ...

application/pdf

PDF (3Mb)
• (1964)

application/pdf

PDF (758Kb)
• (1963)

application/pdf

PDF (2Mb)
• (1958)

application/pdf

PDF (2Mb)
• (1964)

application/pdf

PDF (857Kb)
• (1975)

application/pdf

PDF (11Mb)
• (1964)

application/pdf

PDF (1Mb)
• (1969)

application/pdf

PDF (2Mb)
• (1959)

application/pdf

PDF (1Mb)
• (1972)

application/pdf

PDF (2Mb)
• (1973)

application/pdf

PDF (2Mb)
• (1976)

application/pdf

PDF (2Mb)
• (1996)
The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear ...

application/pdf

PDF (3Mb)
• (1994)
Various physical design problems in Very Large Scale Integrated (VLSI) circuits and Field-Programmable Gate Arrays (FPGA) are studied in this thesis. Specifically, we study (1) the area minimization problem in floorplans ...

application/pdf

PDF (7Mb)
• (1993)

application/pdf

PDF (6Mb)
• (1970)

application/pdf

PDF (3Mb)
• (1963)

application/pdf

PDF (1Mb)
• (1979)

application/pdf

PDF (2Mb)
• (1984)
An (omega)-language is a set of infinite ((omega)-type) strings of symbols. We study the classes of (omega)-languages accepted by Turing Acceptors when infinite computations are allowed. There are various possible ...

application/pdf

PDF (2Mb)
• (1981)
Two algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are examined in order to account for the differences between the ideal and the machine-operator ...

application/pdf

PDF (5Mb)