Zobrazeno 1 - 10
of 382
pro vyhledávání: '"And, Luc Devroye"'
Publikováno v:
Algorithms, Vol 16, Iss 11, p 500 (2023)
Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load facto
Externí odkaz:
https://doaj.org/article/8970adcb6f0f4c0d950c6cc9afae9351
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Analysis of Algorithms (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
Externí odkaz:
https://doaj.org/article/e1cfe43e361746acb0ac3c29040d1d91
Publikováno v:
Combinatorics, Probability and Computing. 32:68-90
We study several parameters of a random Bienaymé–Galton–Watson tree $T_n$ of size $n$ defined in terms of an offspring distribution $\xi$ with mean $1$ and nonzero finite variance $\sigma ^2$ . Let $f(s)=\mathbb{E}\{s^\xi \}$ be the generating f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f70d4018f7ad13e133707fe39aebe73d
https://doi.org/10.1017/s0963548322000128
https://doi.org/10.1017/s0963548322000128
Autor:
Laszlo Gyofi, Luc Devroye
Publikováno v:
IEEE Transactions on Information Theory. 68:1178-1185
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea617031ffe9b65ebb0bca7d487f233b
https://doi.org/10.1109/tit.2021.3127938
https://doi.org/10.1109/tit.2021.3127938
Publikováno v:
Random Structures & Algorithms. 61:520-542
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a294db9bc8b0773be2da85227488bd5
https://doi.org/10.1002/rsa.21072
https://doi.org/10.1002/rsa.21072
Publikováno v:
Entropy, Vol 21, Iss 1, p 92 (2019)
We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann’s rejection algorithm is turned into a distributed sampling communication protocol. We st
Externí odkaz:
https://doaj.org/article/452bd8771e0346b59766de39b2a9ad71
Autor:
Luc Devroye
Publikováno v:
Mathematics and Computers in Simulation. 181:51-56
We provide a uniformly efficient and simple random variate generator for the truncated negative gamma distribution restricted to any interval.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18b0073d4d9cd9bb38680bdeea097eaa
https://doi.org/10.1016/j.matcom.2020.09.005
https://doi.org/10.1016/j.matcom.2020.09.005
Publikováno v:
Random Structures & Algorithms. 57:304-316
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random element $U$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f964f01c9020822450e6b5a848bc400
https://doi.org/10.1002/rsa.20921
https://doi.org/10.1002/rsa.20921
Autor:
Luc Devroye, James King
Publikováno v:
Journal of Computational Geometry, Vol 6, Iss 1 (2015)
Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary
Externí odkaz:
https://doaj.org/article/c38bbf47533a4ad395f87f82cf228e15
Autor:
David Avis, Luc Devroye
Publikováno v:
Algorithmica. 82:1329-1345
Recently Avis and Jordan have demonstrated the efficiency of a simple technique called budgeting for the parallelization of a number of tree search algorithms. The idea is to limit the amount of work that a processor performs before it terminates its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::243739a7a181fa65bd6fc5b25d746194
https://doi.org/10.1007/s00453-019-00645-x
https://doi.org/10.1007/s00453-019-00645-x