Non-oblivious hashing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 367-376

  Fiat, Amos ^a   Naor, Moni ^a   Schmidt, Jeanette P ^b   Siegel, Alan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

LINEAR SPACES; LOGARITHMIC TIME; LOOKUPS; LOWER BOUNDS; NEAREST NEIGHBORS; UPPER BOUND;

PROBES;

EID: 0346195541     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62248     Document Type: Conference Paper

References (0)