Deganit Armon

Learn More
Nested dissection is a method for solving large sparse systems of linear equations. The method is inherently parallelizable and efficient algorithms for parallel nested dissection (PND) exist for various parallel architectures. Birkhoff and George showed that for a sparse grid graph, a parallel algorithm with n processors takes O(@ parallel time [1]. The(More)
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere separators of size s(n) = O(n d−1 d) for a set of points in R d. We present dynamic algorithms which maintain separators for a dynamically changing graph. Our algorithms answer(More)
  • 1