Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for computing the Voronoi diagram of a convex polygon
+Normal rank
@@ Property / cites work @@
+On the average number of rebalancing operations in weight-balanced trees
+Normal rank
@@ Property / cites work @@
+Fractional cascading. I: A data structuring technique
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic fractional cascading
@@ Property / cites work: Dynamic fractional cascading / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamization of order decomposable set problems
@@ Property / cites work: Dynamization of order decomposable set problems / rank @@
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037412
@@ Property / cites work: Q4037412 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138881
@@ Property / cites work: Q3138881 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the all-nearest-neighbors problem
+Normal rank