메뉴 건너뛰기
Journal of Computer and System Sciences
Volumn 18, Issue 2, 1979, Pages 143-154
Universal classes of hash functions
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTER PROGRAMMING;
EID: 0018456171     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(79)90044-8     Document Type: Article
Times cited : (1769)
References (11)
  • 2
    • 84915579947 scopus 로고    scopus 로고
    • R. FAGIN, J. NIEVERGELT, N. PIPPENGER, AND H. R. STRONG, “Extendible Hashing: A Fast Access Method for Dynamic Files,” IBM Research Report RJ 2305.
  • 4
    • 84915579946 scopus 로고    scopus 로고
    • 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
    • 84915579945 scopus 로고    scopus 로고
    • 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.
  • 7
    • 84915579944 scopus 로고    scopus 로고
    • G. MARKOWSKY, J. L. CARTER, AND M. N. WEGMAN, Analysis of a universal class of hash functions, in “Proceedings of the Seventh Mathematical Foundations of Computer Science Conference”, Lecture Notes in Computer Science, Vol. 64, Springer-Verlag, Berlin.
  • 10
    • 84915579943 scopus 로고    scopus 로고
    • D. H. A. SMITH, private communication.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.