Results 21 to 30 of about 2,755,381 (193)
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
Systematic Analysis of Majorization in Quantum Algorithms [PDF]
, 2002 Motivated by the need to uncover some underlying mathematical structure of optimal quantum computation, we carry out a systematic analysis of a wide variety of quantum algorithms from the majorization theory point of view.
Latorre, Jose I. +2 more
core +2 more sources
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
Analysis of accelerated gossip algorithms [PDF]
Automatica, 2009 This paper investigates accelerated gossip algorithms for distributed computations in networks where shift-registers are utilized at each node. By using tools from matrix analysis, we prove the existence of the desired acceleration and establish the fastest rate of convergence in expectation for two-register symmetric gossip.
Liu, Ji +3 more
openaire +3 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