Results 51 to 60 of about 647,966 (230)
Cryptography from Information Loss [PDF]
, 2020 © Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod. Reductions between problems, the mainstay of theoretical computer science, efficiently map an instance of one problem to an instance of another in such a way that ...
Ball, Marshall +6 more
core +3 more sources
On randomness in Hash functions [PDF]
, 2012 In the talk, we shall discuss quality measures for hash functions used in data structures and algorithms, and survey positive and negative results. (This talk is not about cryptographic hash functions.) For the analysis of algorithms involving hash ...
Dietzfelbinger, Martin
core +2 more sources
Quarterly Journal of the Royal Meteorological Society, EarlyView.This study proposes an approach to account for the spatial and temporal variability in the contribution of surface emissivity error in the data assimilation system by including the surface emissivity as an analysis variable and representing its errors in the ensemble‐based background error covariances matrix within an idealized ensemble‐variational ...
Zheng Qi Wang, Mark Buehner, Yi Huang
wiley +1 more source
Simple, compact and robust approximate string dictionary [PDF]
, 2014 This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$.
Belazzougui, Djamal, Chegrane, Ibrahim
core +1 more source
International Journal of Satellite Communications and Networking, Volume 43, Issue 3, Page 164-192, May/June 2025.ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci +7 more
wiley +1 more source
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force [PDF]
arXiv, 2023 A minimal perfect hash function (MPHF) maps a set S of n keys to the first n integers without collisions. There is a lower bound of n*log(e)=1.44n bits needed to represent an MPHF. This can be reached by a brute-force algorithm that tries e^n hash function seeds in expectation and stores the first seed leading to an MPHF.
arxiv
Balanced Families of Perfect Hash Functions and Their Applications [PDF]
, 2007 The construction of perfect hash functions is a well-studied topic. In this paper, this concept is generalized with the following definition. We say that a family of functions from $[n]$ to $[k]$ is a $\delta$-balanced $(n,k)$-family of perfect hash ...
Alon, Noga, Gutner, Shai
core +1 more source
Accounting &Finance, EarlyView.Abstract This study explores the practical impact of blockchain technology (BCT), which contrasts strongly with literature that has predominantly hypothesised BCT's potential to disrupt accounting practice. We interviewed 44 practitioners and academics with knowledge of BCT across 13 countries and industries.
Musbaudeen Titilope Oladejo +3 more
wiley +1 more source
К проблеме хеш-адресации без коллизий постоянного массива ключей [PDF]
, 2007 In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed.
Кузнецов, А. А. +1 more
core
Parallel Recursive State Compression for Free [PDF]
, 2011 This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors ...
A. Laarman +14 more
core +6 more sources