2,171 research outputs found
Recommended from our members
GPERF : a perfect hash function generator
gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element lookup table and a pair of functions, phash and in_word_set. phash uniquely maps keywords in keyfile onto the range 0 .. k - 1, where k >/= n. If k = n, then phash is considered a minimal perfect hash function. in_word_set uses phash to determine whether a particular string of characters str occurs in the keyfile, using at most one string comparison.This paper describes the user-interface, options, features, algorithm design and implementation strategies incorporated in gperf. It also presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
This paper focuses on parallel hash functions based on tree modes of
operation for an inner Variable-Input-Length function. This inner function can
be either a single-block-length (SBL) and prefix-free MD hash function, or a
sponge-based hash function. We discuss the various forms of optimality that can
be obtained when designing parallel hash functions based on trees where all
leaves have the same depth. The first result is a scheme which optimizes the
tree topology in order to decrease the running time. Then, without affecting
the optimal running time we show that we can slightly change the corresponding
tree topology so as to minimize the number of required processors as well.
Consequently, the resulting scheme decreases in the first place the running
time and in the second place the number of required processors.Comment: Preprint version. Added citations, IEEE Transactions on Computers,
201
PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
In this paper we propose a simple and efficient data structure yielding a
perfect hashing of quite general arrays. The data structure is named phorma,
which is an acronym for perfectly hashable order restricted multidimensional
array.
Keywords: Perfect hash function, Digraph, Implicit enumeration,
Nijenhuis-Wilf combinatorial family.Comment: 12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete
Applied Mathematic
Quantum information with Gaussian states
Quantum optical Gaussian states are a type of important robust quantum states
which are manipulatable by the existing technologies. So far, most of the
important quantum information experiments are done with such states, including
bright Gaussian light and weak Gaussian light. Extending the existing results
of quantum information with discrete quantum states to the case of continuous
variable quantum states is an interesting theoretical job. The quantum Gaussian
states play a central role in such a case. We review the properties and
applications of Gaussian states in quantum information with emphasis on the
fundamental concepts, the calculation techniques and the effects of
imperfections of the real-life experimental setups.
Topics here include the elementary properties of Gaussian states and relevant
quantum information device, entanglement-based quantum tasks such as quantum
teleportation, quantum cryptography with weak and strong Gaussian states and
the quantum channel capacity, mathematical theory of quantum entanglement and
state estimation for Gaussian states.Comment: 170 pages. Minors of the published version are corrected and listed
in the Acknowledgement part of this versio
- …