THERE IS NO FAST SINGLE HASHING ALGORITHM

被引：4
|
作者：
AJTAI, M
KOMLOS, J
SZEMEREDI, E
机构：
来源：
INFORMATION PROCESSING LETTERS | 1978年 / 7卷 / 06期
关键词：
D O I：
10.1016/0020-0190(78)90014-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
下载
收藏
页码：270 / 273
页数：4
相关论文
共 50 条
  • [31] Distributed Fast Supervised Discrete Hashing
    Liu, Zhifeng
    Chen, Feng
    Duan, Shukai
    IEEE ACCESS, 2019, 7 : 90003 - 90011
  • [32] Fast and Powerful Hashing Using Tabulation
    Thorup, Mikkel
    COMMUNICATIONS OF THE ACM, 2017, 60 (07) : 94 - 101
  • [33] A fast and exact single pattern matching algorithm
    Fan, Hongbo
    Yao, Nianmin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2009, 46 (08): : 1341 - 1348
  • [34] A new fast single image dehazing algorithm
    Lou, Xiaolong
    Bi, Duyan
    Li, Quanhe
    Nan, Dong
    Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology), 2014, 45 (06): : 1854 - 1859
  • [35] A fast and accurate algorithm for single individual haplotyping
    Xie, Minzhu
    Wang, Jianxin
    Jiang, Tao
    BMC SYSTEMS BIOLOGY, 2012, 6
  • [36] A Fast Effective Single Image Dehazing Algorithm
    Liu J.-P.
    Huang B.-K.
    Wei G.
    1896, Chinese Institute of Electronics (45): : 1896 - 1901
  • [37] A fast algorithm for single motion image deblurring
    Liao, Yong Zhong
    Xing, Cai Zi
    He, Xiang Hua
    Sensors and Transducers, 2014, 171 (05): : 214 - 219
  • [38] Step diffraction algorithm based on single fast Fourier transform algorithm
    Hu Qi
    Wang Zhe
    Liu Hong-shun
    Xue Zhi-wen
    Deng Jia-chun
    CHINESE OPTICS, 2018, 11 (04): : 568 - 575
  • [39] A Fast and Memory-Efficient Spectral Library Search Algorithm Using Locality-Sensitive Hashing
    Wang, Lei
    Liu, Kaiyuan
    Li, Sujun
    Tang, Haixu
    PROTEOMICS, 2020, 20 (21-22)
  • [40] An alternative analysis of spiral hashing algorithm
    Soufiane, A
    Itokawa, T
    Nakamura, R
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (05) : 988 - 993
12345