메뉴 건너뛰기




Volumn Part F129452, Issue , 1996, Pages 509-518

Non-expansive hashing

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; DATA STORAGE EQUIPMENT; INFORMATION RETRIEVAL SYSTEMS; MEMBERSHIP FUNCTIONS; REAL TIME SYSTEMS; SET THEORY; STORAGE ALLOCATION (COMPUTER);

EID: 0029703221     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237999     Document Type: Conference Paper
Times cited : (25)

References (9)
  • 5
    • 0021467937 scopus 로고
    • Storing a sparse table with 0 (1) worst case access time
    • July
    • Fredman M. L., Komlos J., Szemeredi E., Storing a Sparse Table with 0 (1) Worst Case Access Time. Journal of the ACM, Vol. 31, No. 3, July 1984, p. 538-544.
    • (1984) Journal of the ACM , vol.31 , Issue.3 , pp. 538-544
    • Fredman, M.L.1    Komlos, J.2    Szemeredi, E.3
  • 7
    • 0004204612 scopus 로고
    • MIT Press, Cambridge, Massachusetts
    • Kanerva P., Sparse Distributed Memory, MIT Press, Cambridge, Massachusetts, 1988, p. 12.
    • (1988) Sparse Distributed Memory , pp. 12
    • Kanerva, P.1
  • 8
    • 0004290881 scopus 로고
    • MIT Press, Cambridge, Massachusetts
    • Minsky M. and Papert S., Perceptrons, MIT Press, Cambridge, Massachusetts, 1969, p. 222-225.
    • (1969) Perceptrons , pp. 222-225
    • Minsky, M.1    Papert, S.2


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