On the cell probe complexity of polynomial evaluation
- 10 July 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 143 (1) , 167-174
- https://doi.org/10.1016/0304-3975(95)80032-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Complexity models for incremental computationTheoretical Computer Science, 1994
- Lower bounds for union-split-find related problems on random access machinesPublished by Association for Computing Machinery (ACM) ,1994
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- A lower bound for finding predecessors in Yao's cell probe modelCombinatorica, 1988
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Should Tables Be Sorted?Journal of the ACM, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970
- METHODS OF COMPUTING VALUES OF POLYNOMIALSRussian Mathematical Surveys, 1966