An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649): Difference between revisions

@@ Property / cites work @@
+Partial match retrieval in implicit data structures
+Normal rank
@@ Property / cites work @@
+Min-max heaps and generalized priority queues
@@ Property / cites work: Min-max heaps and generalized priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+A tradeoff between search and update time for the implicit dictionary problem
+Normal rank
@@ Property / cites work @@
+Partially Ordered Sets
@@ Property / cites work: Partially Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit Data Structures for the Dictionary Problem
+Normal rank
@@ Property / cites work @@
+A pointer-free data structure for merging heaps and min-max heaps
+Normal rank
@@ Property / cites work @@
+Q3783593
@@ Property / cites work: Q3783593 / rank @@
+Normal rank
@@ Property / cites work @@
+On locally presented posets
@@ Property / cites work: On locally presented posets / rank @@
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / 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