In this paper we demonstrate that tradeoos can be made between parallelism and ll in nested dissection algorithms for Gaussian elimination, both in theory and in practice. We present a new \less parallel nested dissection" algorithm (LPND), and prove that, unlike the standard nested dissection algorithm, when applied to a chordal graph LPND nds a zero-ll elimination order. We have also implemen...