Lower bounds for expected-case planar point location (Q2462734): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.comgeo.2007.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2084300808
@@ Property / OpenAlex ID: W2084300808 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721994
@@ Property / cites work: Q2721994 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768303
@@ Property / cites work: Q2768303 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple entropy-based algorithm for planar point location
+Normal rank
@@ Property / cites work @@
+Optimal Expected-Case Planar Point Location
@@ Property / cites work: Optimal Expected-Case Planar Point Location / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501857
@@ Property / cites work: Q5501857 / rank @@
+Normal rank
@@ Property / cites work @@
+Expected asymptotically optimal planar point location
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+A Best Possible Bound for The Weighted Path Length of Binary Search Trees
+Normal rank
@@ Property / cites work @@
+On the Exact Worst Case Query Complexity of Planar Point Location
+Normal rank
@@ Property / cites work @@
+Q4401020
@@ Property / cites work: Q4401020 / rank @@
+Normal rank