On the cell probe complexity of polynomial evaluation (Q673647): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(95)80032-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2144518319
@@ Property / OpenAlex ID: W2144518319 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for finding predecessors in Yao's cell probe model
+Normal rank
@@ Property / cites work @@
+Hash functions for priority queues
@@ Property / cites work: Hash functions for priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+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 @@
+Complexity models for incremental computation
@@ Property / cites work: Complexity models for incremental computation / rank @@
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank