Deganit Armon John Reif Department of Computer Science, Duke University...  Home/Search
Context Related
| duke.edu/~reif/paper/deg...wads.dyn.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/~reif/vita/vita (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave e#cient static (fixed input) algorithms for finding sphere separators of size s(n) = O(n d ) for a set of points in R . (Update)
Context of citations to this paper: More
...without using any information from the previous separator. Armon and Reif constructed a dynamic separator algorithm for planar graphs [3], but their algorithm is probabilistic (works in O(log 3 n) expected time per update) and it needs as an input the so called sphere...
Cited by: More
A Dynamic Algorithm for Maintaining Graph Partitions - Aleksandrov, Djidjev (Correct)
Active bibliography (related documents): More All
0.5: Graph Partitioning Models for Parallel Computing - Hendrickson, Kolda (1999) (Correct)
0.5: On Parallel Algorithms for Combinatorial Problems - Gomez (1993) (Correct)
0.3: A Decomposition of Multi-Dimensional Point Sets with.. - Callahan, Kosaraju (1992) (Correct)
Similar documents based on text: More All
0.3: Space and Time Efficient Implementations of Parallel Nested .. - Deganit Armon Duke (1992) (Correct)
0.2: Efficient Parallel Algorithms for Closest Point Problems - Peter Su (1994) (Correct)
0.1: Factors Affecting False Sharing on Page-Granularity Cache-Coherent .. - Khera (1994) (Correct)
BibTeX entry: (Update)
D. Armon and J. Reif. A dynamic separator algorithm. In Proc. 3rd Worksh. Algorithms and Data Structures, pages 107-118. Lecture Notes in Computer Science 709, Springer-Verlag, Berlin, 1993. http://citeseer.ist.psu.edu/armon93dynamic.html More
@inproceedings{ armon93dynamic,
author = "D. Armon and J. Reif",
title = "A dynamic separator algorithm",
booktitle = "Proc. 3rd Worksh. Algorithms and Data Structures",
publisher = "Lecture Notes in Computer Science 709, Springer-Verlag, Berlin",
pages = "107--118",
year = "1993",
url = "citeseer.ist.psu.edu/armon93dynamic.html" }
Citations (may not include all citations):218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
92 The design of dynamic data structures (context) - Overmars - 1983
75 Automatic mesh partitioning (context) - Miller, Teng et al. - 1993
63 Dynamic algorithms in computational geometry - Chiang, Tamassia - 1991
28 Separators for sphere-packings and nearest neighbor graphs (context) - Miller, Teng et al. - 1997
19 Planar graph decomposition and all pair shortest paths (context) - Frederickson - 1991
11 Optimal parallel algorithms for polygon and point-set proble.. (context) - Cole, Goodrich - 1988
9 Separator based parallel divide-and-conquer in computational.. (context) - Frieze, Miller et al. - 1992
9 An optimal algorithm for the all-nearest-neighbor problem (context) - PM - 1986
5 Extension of the parallel nested dissection algorithm to pat.. (context) - Pan, Reif - 1986
2 Spheres and Separators: A Unified Geometric Approach to Grap.. (context) - Teng - 1991
2 Miller A parallel algorithm for finding a separator in plana.. (context) - Gazit - 1987
1 Acceleration of minimum cost path calculations in graphs hav.. (context) - Pan, Reif - 1989
Documents on the same site (http://www.cs.duke.edu/~reif/vita/vita.html): More
Efficient Parallel Algorithms for Optical Computing with the.. - Reif, Tyagi (1990) (Correct)
Continuous Alternation: The Complexity of Pursuit in Continuous .. - Reif, Tate (1993) (Correct)
Energy Complexity of Optical Computations - Tyagi, Reif (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC