Results 31 to 40 of about 174,873,121 (310)
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
How often should you clean your room? [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Analysis of ...
Kimball Martin, Krishnan Shankar
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
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 +9 more sources
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
On the use of biased-randomized algorithms for solving non-smooth optimization problems
, 2020 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Juan A.A. +4 more
core +1 more source
07391 Abstracts Collection – Probabilistic Methods in the Design and Analysis of Algorithms [PDF]
, 2007 From 23.09.2007 to 28.09.2007, the Dagstuhl Seminar 07391 "Probabilistic Methods in the Design and Analysis of Algorithms''was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Teng, Shang-Hua +3 more
core +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
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
doaj +1 more source