ANALYSIS OF RANDOM PROBING HASHING

被引：0
|
作者：
RAMAKRISHNA, MV
机构：
来源：
INFORMATION PROCESSING LETTERS | 1989年 / 31卷 / 02期
关键词：
D O I：
10.1016/0020-0190(89)90073-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：83 / 90
页数：8
相关论文
共 50 条
  • [11] String Hashing for Linear Probing
    Thorup, Mikkel
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 655 - 664
  • [12] HASHING WITH LINEAR PROBING AND FREQUENCY ORDERING
    LYON, G
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1978, 83 (05): : 445 - 447
  • [13] The Maximum Displacement for Linear Probing Hashing
    Petersson, Niclas
    COMBINATORICS PROBABILITY & COMPUTING, 2013, 22 (03): : 455 - 476
  • [14] Random Gray code and its performance analysis for image hashing
    Zhu, Guopu
    Kwong, Sam
    Huang, Jiwu
    Yang, Jianquan
    SIGNAL PROCESSING, 2011, 91 (09) : 2178 - 2193
  • [15] Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets
    Viola, Alfredo
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2010, 12 (02): : 307 - 332
  • [16] Random Maximum Margin Hashing
    Joly, Alexis
    Buisson, Olivier
    2011 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2011, : 873 - 880
  • [17] Asymptotic distribution for the cost of linear probing hashing
    Janson, S
    RANDOM STRUCTURES & ALGORITHMS, 2001, 19 (3-4) : 438 - 471
  • [18] A Unified Approach to Linear Probing Hashing with Buckets
    Janson, Svante
    Viola, Alfredo
    ALGORITHMICA, 2016, 75 (04) : 724 - 781
  • [19] A Unified Approach to Linear Probing Hashing with Buckets
    Svante Janson
    Alfredo Viola
    Algorithmica, 2016, 75 : 724 - 781
  • [20] Hashing algorithm with maximal average probing distance
    Luo, WB
    International Conference on Computing, Communications and Control Technologies, Vol 5, Proceedings, 2004, : 69 - 74
12345