On data structures and asymmetric communication complexity (Q1273860): Difference between revisions

@@ Property / cites work @@
+Q4252751
@@ Property / cites work: Q4252751 / rank @@
+Normal rank
@@ Property / cites work @@
+On the difficulty of range searching
@@ Property / cites work: On the difficulty of range searching / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for finding predecessors in Yao's cell probe model
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: I. The reporting case
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Q4281568
@@ Property / cites work: Q4281568 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for union-split-find related problems on random access machines
+Normal rank
@@ Property / cites work @@
+On the cell probe complexity of polynomial evaluation
+Normal rank
@@ Property / cites work @@
+Q4284623
@@ Property / cites work: Q4284623 / rank @@
+Normal rank
@@ Property / cites work @@
+Rounds in Communication Complexity Revisited
@@ Property / cites work: Rounds in Communication Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Partial-Match Retrieval Algorithms
@@ Property / cites work: Partial-Match Retrieval Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank