Mathematics Commons^™

Atamm Multicomputer System Design, William Robert Tymchyshyn

Electrical & Computer Engineering Theses & Dissertations

The Algorithm To Architecture Mapping Model, or ATAMM, is a graph theoretic design methodology that has been created to resolve design and performance issues involved with concurrent processing. Petri-net marked graphs are used to represent the computational environment.

This thesis describes the development of a multicomputer system which will operate within the bounds specified by the ATAMM model. The system is first designed and implemented using the framework of standard multicomputer design theory. A validation is then performed by the comparison of the system's computational performance to results predicted by ATAMM. This validation is shown to be successful for three …

The Reconstruction Conjecture In Graph Theory, Susan M. Loveland

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In this paper we show that specific classes of graphs are reconstructible; we explore the relationship between the reconstruction and edge-reconstruction conjectures; we prove that several classes of graphs are actually Harary to the reconstructible; and we give counterexamples reconstruction and edge-reconstruction conjectures for infinite graphs.

On Monotone Formulae With Restricted Depth, Maria M. Klawe, Wolfgang J. Paul, Nicholas J. Pippenger, Mihalis Yannakakis

All HMC Faculty Publications and Research

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with Π_k-formulae of size n for which every Σ_k-formula has size exp Ω(n^1/(k-1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a Σ_k-formula of size exp O(n^1/(k-1)). Thus our hierarchy theorem is the best possible.