Data types as algorithms
Decision support based methods to facilitate 3D volumetric locking in a new peer to peer based spatial database system
Design and implementation of the query language interpreter for bibliographic data retrieval.
Detecting the morphic images of a word : improving the general algorithm
Deux constructions équivalentes d'un jeu d'arrangements pour les fichiers inverses multi-indices
Deux problèmes d'analyse d'algorithmes
Discovery of functional and approximate functional dependencies in relational databases.
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...
Dynamic Point Location in Arrangements of Hyperplanes.
Dynamic programming for reduced NFAs for approximate string and sequence matching
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient algorithms on the Moore family associated to an implicational system.
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
Efficient string matching on packed texts
Encryption schemes using finite frames and Hadamard arrays.
e-Nets and Simplex Range Queries.
Entity-relationship-attribute designs and sketches.
Estimation of tolerance relation on the basis of multiple pairwise comparisons with random errors
Evaluating scientific products by means of citation-based models: a first analysis and validation.
Exact and asymptotic distributions in digital and binary search trees