Before revision: In the limited-workspace model , we assume that the input of size n lies in a random access read-only memory .
After revision: We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set S of n point-sites in the plane. More precisely , we assume that the input of size n lies in a random access read-only memory .