336 search results - page 1 / 68 » Improved data structures for fully dynamic biconnectivity |
STOC
1994
ACM
13 years 9 months ago
1994
ACM
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
SCCC
2003
IEEE
13 years 10 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
JACM
2010
13 years 3 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...