Edward F. Grove

Binary Space Partitions for Fat Rectangles

We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in

Simple randomized mergesort on parallel disks

{\Bbb R}^3

Binary space partitions for fat rectangles

such that the aspect ratio of each rectangle in

Application-Controlled Paging for a Shared Cache

S

On the Global Character of the Difference Equation X n + 1 =

is at most

Online Perfect Matching and Mobile Computing

\alpha

Application-controlled paging for a shared cache

, for some constant

THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL

\alpha \geq 1

External-memory graph algorithms

. We present an

Load Balancing in the Lp Norm

n2^{O(\sqrt{\log n})}