Skip lift: a probabilistic alternative to red-black trees (Q450539): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+P05
@@ Property / Mathematics Subject Classification ID: 68P05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6082040
@@ Property / zbMATH DE Number: 6082040 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+data structure
@@ Property / zbMATH Keywords: data structure / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dictionary
@@ Property / zbMATH Keywords: dictionary / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+skip list
@@ Property / zbMATH Keywords: skip list / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+finger search
@@ Property / zbMATH Keywords: finger search / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2011.12.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2180616177
@@ Property / OpenAlex ID: W2180616177 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized search trees
@@ Property / cites work: Randomized search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Biased skip lists
@@ Property / cites work: Biased skip lists / rank @@
+Normal rank
@@ Property / cites work @@
+Organization and maintenance of large ordered indexes
+Normal rank
@@ Property / cites work @@
+Biased Search Trees
@@ Property / cites work: Biased Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579430
@@ Property / cites work: Q3579430 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal finger search trees in the pointer machine
+Normal rank
@@ Property / cites work @@
+Q4418657
@@ Property / cites work: Q4418657 / rank @@
+Normal rank
@@ Property / cites work @@
+Power balance and apportionment algorithms for the United States Congress
+Normal rank
@@ Property / cites work @@
+Two New Kinds of Biased Search Trees
@@ Property / cites work: Two New Kinds of Biased Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
+Normal rank
@@ Property / cites work @@
+Rank-Balanced Trees
@@ Property / cites work: Rank-Balanced Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A balanced search tree O(1) worst-case update time
+Normal rank
@@ Property / cites work @@
+Randomized binary search trees
@@ Property / cites work: Randomized binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763422
@@ Property / cites work: Q4763422 / rank @@
+Normal rank
@@ Property / cites work @@
+Updating a balanced search tree in 0(1) rotations
@@ Property / cites work: Updating a balanced search tree in 0(1) rotations / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:450539