MAC Memos (1963  1974)
Project MAC memos overlap with and also appear in AI Lab and Laboratory for Computer Science publications
Recent Submissions

Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
(197511)A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average ... 
Steamoriented Computation in Recursive Data Flow Schemas
(197510)In this thesis we present a parallel programming language based on a parallel computation model known as data flow schemas. Syntactically, the language resembles programming languages such as Algol 60, but does not have ... 
Computational Complexity of the Word Problem for Commutative Semigroups
(197510)We analyze the computational complexity of some decision problems for commutative semigroups in terms of time and space on a Turing machine. The main result we present is that any decision procedure for the word problemm ...