Author:
Carter J.Lawrence,Wegman Mark N.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference11 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. R. FAGIN, J. NIEVERGELT, N. PIPPENGER, AND H. R. STRONG, “Extendible Hashing: A Fast Access Method for Dynamic Files,” IBM Research Report RJ 2305.
3. Computational complexity of probabilistic Turing machines;Gill,1974
4. E. Goto, Y. Kanada, Hashing lemmas on time complexities with applications to formula manipulation, in “Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation,” Yorktown Heights, N. Y., pp. 149–153.
5. F. GUSTAVSON AND D. Y. Y. YUN, Arithmetic complexity of unordered or sparse polynomials, in “Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation,” Yorktown Heights, N. Y., pp. 154–159.
Cited by
1314 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献