Results 21 to 30 of about 818,608 (269)
Digital search trees with m trees: Level polynomials and insertion costs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Analysis of ...
Helmut Prodinger
doaj +1 more source
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Analysis of ...
Reinhard Kutzelnigg
doaj +1 more source
On subtrees of the representation tree in rational base numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.
Shigeki Akiyama +2 more
doaj +1 more source
An Analysis of the XSL Algorithm [PDF]
, 2005 The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for exploiting the structure of some types of block ciphers, for example the AES and Serpent.
Carlos Cid, Gaëtan Leurent
openaire +8 more sources
Arithmetics in β-numeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Julien Bernat
doaj +1 more source
Analysis of some parameters for random nodes in priority trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Alois Panholzer
doaj +1 more source
Leaf multiplicity in a Bienaym\'e-Galton-Watson tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\'e-Galton-Watson tree with critical offspring distribution $\xi$, conditioned on the ...
Anna M. Brandenberger +3 more
doaj +1 more source
Asymptotics of the occupancy scheme in a random environment and its applications to tries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been studied by ...
Silvia Businger
doaj +1 more source
The number of distinct adjacent pairs in geometrically distributed words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A sequence of geometric random variables of length $n$ is a sequence of $n$ independent and identically distributed geometric random variables ($\Gamma_1, \Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for $1~\leq~j~\leq~n$ with $p+q=
Margaret Archibald +5 more
doaj +1 more source
Analysis of a Greedy Reconstruction Algorithm [PDF]
SIAM Journal on Control and Optimization, 2021 A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of ...
Buchwald, Simon +2 more
openaire +3 more sources