An implicit data structure for searching a multikey table in logarithmic time (Q1186547): Difference between revisions

@@ Property / cites work @@
+Partial match retrieval in implicit data structures
+Normal rank
@@ Property / cites work @@
+Multidimensional binary search trees used for associative searching
+Normal rank
@@ Property / cites work @@
+A tradeoff between search and update time for the implicit dictionary problem
+Normal rank
@@ Property / cites work @@
+On Edge Coloring Bipartite Graphs
@@ Property / cites work: On Edge Coloring Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Using euler partitions to edge color bipartite multigraphs
+Normal rank
@@ Property / cites work @@
+On Representatives of Subsets
@@ Property / cites work: On Representatives of Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
+Normal rank
@@ Property / cites work @@
+Implicit data structures for fast search and update
+Normal rank
@@ Property / cites work @@
+Storing a sparse table
@@ Property / cites work: Storing a sparse table / rank @@
+Normal rank