Efficient searching using partial ordering (Q1151264): Difference between revisions

@@ Property / author @@
-Nancy A. Lynch
@@ Property / author: Nancy A. Lynch / rank @@
-Normal rank
@@ Property / author @@
-Andrew Chi-Chih Yao
@@ Property / author: Andrew Chi-Chih Yao / rank @@
-Normal rank
@@ Property / author @@
+Nancy A. Lynch
@@ Property / author: Nancy A. Lynch / rank @@
+Normal rank
@@ Property / author @@
+Andrew Chi-Chih Yao
@@ Property / author: Andrew Chi-Chih Yao / 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/0020-0190(81)90005-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2045807935
@@ Property / OpenAlex ID: W2045807935 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit data structures for fast search and update
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1151264