In-place linear probing sort (Q5096812): Difference between revisions

@@ Property / cites work @@
+Ordered hash tables
@@ Property / cites work: Ordered hash tables / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Expected time bounds for selection
@@ Property / cites work: Expected time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816955
@@ Property / cites work: Q3816955 / rank @@
+Normal rank
@@ Property / cites work @@
+The analysis of linear probing sort by the use of a new mathematical transform
+Normal rank
@@ Property / cites work @@
+Sorting numbers in linear expected time and optimal extra space
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3796767
@@ Property / cites work: Q3796767 / rank @@
+Normal rank
@@ Property / cites work @@
+Internal Sorting by Radix Plus Sifting
@@ Property / cites work: Internal Sorting by Radix Plus Sifting / rank @@
+Normal rank