default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuc Devroye
Person information
- affiliation: McGill University, Montreal, Canada
- award (2004): Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j140]Luc Devroye, Dimitrios Los
:
An asymptotically optimal algorithm for generating bin cardinalities. Math. Comput. Simul. 228: 147-155 (2025)- 2024
- [j139]Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo:
An Algorithm to Recover Shredded Random Matrices. SIAM J. Discret. Math. 38(3): 2509-2529 (2024) - [i37]Luc Devroye, Dimitrios Los:
An asymptotically optimal algorithm for generating bin cardinalities. CoRR abs/2404.07011 (2024) - 2023
- [j138]Ketan Dalal, Luc Devroye, Ebrahim Malalla:
Two-Way Linear Probing Revisited. Algorithms 16(11): 500 (2023) - [j137]Luc Devroye, Marcel K. Goh, Rosie Y. Zhao:
On the peel number and the leaf-height of Galton-Watson trees. Comb. Probab. Comput. 32(1): 68-90 (2023) - [i36]Simon Briend, Luc Devroye, Gábor Lugosi:
Broadcasting in random recursive dags. CoRR abs/2306.01727 (2023) - [i35]Ketan Dalal, Luc Devroye, Ebrahim Malalla:
Two-way Linear Probing Revisited. CoRR abs/2309.05308 (2023) - [i34]Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo:
An Algorithm to Recover Shredded Random Matrices. CoRR abs/2310.16715 (2023) - [i33]Caelan Atamanchuk, Luc Devroye, Gábor Lugosi:
A note on estimating the dimension from a random geometric graph. CoRR abs/2311.13059 (2023) - 2022
- [j136]Anna M. Brandenberger, Luc Devroye, Marcel K. Goh, Rosie Zhao:
Leaf multiplicity in a Bienaymé-Galton-Watson tree. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j135]Anna M. Brandenberger, Luc Devroye, Marcel K. Goh:
Root estimation in Galton-Watson trees. Random Struct. Algorithms 61(3): 520-542 (2022) - [j134]Luc Devroye, László Györfi:
On the Consistency of the Kozachenko-Leonenko Entropy Estimate. IEEE Trans. Inf. Theory 68(2): 1178-1185 (2022) - [i32]Nicolas Broutin, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Subtractive random forests. CoRR abs/2210.10544 (2022) - 2021
- [j133]Luc Devroye:
Random variate generation for the truncated negative gamma distribution. Math. Comput. Simul. 181: 51-56 (2021) - 2020
- [j132]David Avis, Luc Devroye:
An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. Algorithmica 82(5): 1329-1345 (2020) - [j131]Nicolas Broutin, Luc Devroye, Nicolas Fraiman:
Recursive functions on conditional Galton-Watson trees. Random Struct. Algorithms 57(2): 304-316 (2020) - [i31]Konrad Anand, Luc Devroye:
Probabilistic Analysis of RRT Trees. CoRR abs/2005.01242 (2020) - [i30]Luc Devroye, Silvio Lattanzi, Gábor Lugosi, Nikita Zhivotovskiy:
On Mean Estimation for Heteroscedastic Random Variables. CoRR abs/2010.11537 (2020)
2010 – 2019
- 2019
- [j130]Laurent Beaudou, Luc Devroye, Gena Hahn:
A lower bound on the size of an absorbing set in an arc-coloured tournament. Discret. Math. 342(1): 143-144 (2019) - [j129]Gilles Brassard, Luc Devroye, Claude Gravel:
Remote Sampling with Applications to General Entanglement Simulation. Entropy 21(1): 92 (2019) - [j128]Tommy Reddad, Luc Devroye:
On the discovery of the seed in uniform attachment trees. Internet Math. 2019 (2019) - [j127]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [c27]Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman:
k -cuts on a Path. CIAC 2019: 112-123 - [i29]Louigi Addario-Berry, Hannah Cairns, Luc Devroye, Celine Kerriou, Rivka Mitchell:
Hipster random walks. CoRR abs/1909.07367 (2019) - 2018
- [j126]Luc Devroye, Pat Morin:
A note on interference in random networks. Comput. Geom. 67: 2-10 (2018) - [c26]Luc Devroye:
OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture). AofA 2018: 1:1-1:1 - [i28]Luc Devroye, Abbas Mehrabian, Tommy Reddad:
The Minimax Learning Rate of Normal and Ising Undirected Graphical Models. CoRR abs/1806.06887 (2018) - [i27]Gilles Brassard, Luc Devroye, Claude Gravel:
Remote Sampling with Applications to General Entanglement Simulation. CoRR abs/1807.06649 (2018) - [i26]Luc Devroye, Tommy Reddad:
On the discovery of the seed in uniform attachment trees. CoRR abs/1810.00969 (2018) - [i25]Luc Devroye, Tommy Reddad:
Discrete minimax estimation with trees. CoRR abs/1812.06063 (2018) - 2017
- [j125]Luc Devroye, László Györfi, Gábor Lugosi, Harro Walk:
On the measure of Voronoi cells. J. Appl. Probab. 54(2): 394-408 (2017) - [j124]Benedikt Bauer, Luc Devroye, Michael Kohler, Adam Krzyzak, Harro Walk:
Nonparametric estimation of a function from noiseless observations at random points. J. Multivar. Anal. 160: 93-104 (2017) - [j123]Sébastien Bubeck, Luc Devroye, Gábor Lugosi:
Finding Adam in random growing trees. Random Struct. Algorithms 50(2): 158-172 (2017) - [j122]Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random. Random Struct. Algorithms 51(3): 428-458 (2017) - [j121]Luc Devroye, Claude Gravel:
The expected bit complexity of the von Neumann rejection algorithm. Stat. Comput. 27(3): 699-710 (2017) - [i24]Luc Devroye, Cecilia Holmgren, Henning Sulzbach:
The heavy path approach to Galton-Watson trees with an application to Apollonian networks. CoRR abs/1701.02527 (2017) - [i23]David Avis, Luc Devroye:
An analysis of budgeted parallel search on conditional Galton-Watson trees. CoRR abs/1703.10731 (2017) - [i22]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - [i21]Louigi Addario-Berry, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Local optima of the Sherrington-Kirkpatrick Hamiltonian. CoRR abs/1712.07775 (2017) - 2016
- [j120]Gilles Brassard, Luc Devroye, Claude Gravel:
Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution. IEEE Trans. Inf. Theory 62(2): 876-890 (2016) - 2015
- [j119]Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for Random IDs. Internet Math. 11(6): 572-587 (2015) - [j118]Ianik Plante, Luc Devroye:
On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes. J. Comput. Phys. 297: 515-529 (2015) - [j117]Louigi Addario-Berry, Shankar Bhamidi, Sébastien Bubeck, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Exceptional rotations of random graphs: a VC theory. J. Mach. Learn. Res. 16: 1893-1922 (2015) - [j116]Luc Devroye, James King:
Random hyperplane search trees in high dimensions. J. Comput. Geom. 6(1): 142-164 (2015) - [j115]Luc Devroye, Gábor Lugosi, Gergely Neu:
Random-Walk Perturbations for Online Combinatorial Optimization. IEEE Trans. Inf. Theory 61(7): 4099-4106 (2015) - [i20]Luc Devroye, Claude Gravel:
Sampling with arbitrary precision. CoRR abs/1502.02539 (2015) - [i19]Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random: full version. CoRR abs/1504.06238 (2015) - [i18]Luc Devroye, Claude Gravel:
The expected bit complexity of the von Neumann rejection algorithm. CoRR abs/1511.02273 (2015) - 2014
- [j114]Luc Devroye, Nicolas Fraiman:
The Random Connection Model on the Torus. Comb. Probab. Comput. 23(5): 796-804 (2014) - [j113]Ianik Plante, Luc Devroye, Francis A. Cucinotta:
Calculations of distance distributions and probabilities of binding by ligands between parallel plane membranes comprising receptors. Comput. Phys. Commun. 185(3): 697-707 (2014) - [j112]Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold of Bluetooth graphs. Random Struct. Algorithms 44(1): 45-66 (2014) - [j111]Luc Devroye, Nicolas Fraiman:
Connectivity of inhomogeneous random graphs. Random Struct. Algorithms 45(3): 408-420 (2014) - [j110]Luc Devroye:
Random variate generation for the generalized inverse Gaussian distribution. Stat. Comput. 24(2): 239-246 (2014) - [j109]Luc Devroye, Lancelot F. James:
On simulation and properties of the stable law. Stat. Methods Appl. 23(3): 307-343 (2014) - [j108]Luc Devroye, Lancelot F. James:
Rejoinder. Stat. Methods Appl. 23(3): 379-380 (2014) - [c25]Gérard Biau, Luc Devroye:
Cellular Tree Classifiers. ALT 2014: 8-17 - [c24]Gilles Brassard, Luc Devroye, Claude Gravel:
Exact Classical Simulation of the GHZ Distribution. TQC 2014: 7-23 - [i17]Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for random IDs. CoRR abs/1402.1191 (2014) - [i16]Nicolas Broutin, Luc Devroye, Gábor Lugosi:
Connectivity of sparse Bluetooth networks. CoRR abs/1402.3696 (2014) - [i15]Nicolas Broutin, Luc Devroye, Gábor Lugosi:
Almost optimal sparsification of random geometric graphs. CoRR abs/1403.1274 (2014) - [i14]Sébastien Bubeck, Luc Devroye, Gábor Lugosi:
Finding Adam in random growing trees. CoRR abs/1411.3317 (2014) - 2013
- [j107]Luc Devroye, Linda Farczadi:
Connectivity for line-of-sight networks in higher dimensions. Discret. Math. Theor. Comput. Sci. 15(2): 71-86 (2013) - [j106]Ianik Plante, Luc Devroye, Francis A. Cucinotta:
Random sampling of the Green's Functions for reversible reactions with an intermediate state. J. Comput. Phys. 242: 531-543 (2013) - [j105]Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian:
Transversals in Trees. J. Graph Theory 73(1): 32-43 (2013) - [j104]Luc Devroye, Tina Felber, Michael Kohler:
Estimation of a Density Using Real and Artificial Data. IEEE Trans. Inf. Theory 59(3): 1917-1928 (2013) - [c23]Luc Devroye, Paola G. Ferrario, László Györfi, Harro Walk:
Strong Universal Consistent Estimate of the Minimum Mean Squared Error. Empirical Inference 2013: 143-160 - [c22]Luc Devroye, Gábor Lugosi, Gergely Neu:
Prediction by random-walk perturbation. COLT 2013: 460-473 - [c21]Xing Shi Cai, Luc Devroye:
A Probabilistic Analysis of Kademlia Networks. ISAAC 2013: 711-721 - [i13]Gérard Biau, Luc Devroye:
Cellular Tree Classifiers. CoRR abs/1301.4679 (2013) - [i12]Luc Devroye, Gábor Lugosi, Gergely Neu:
Prediction by Random-Walk Perturbation. CoRR abs/1302.5797 (2013) - [i11]Luc Devroye, Claude Gravel:
Exact simulation for the GHZ distribution. CoRR abs/1303.5942 (2013) - [i10]Xing Shi Cai, Luc Devroye:
A Probabilistic Analysis of Kademlia Networks. CoRR abs/1309.5866 (2013) - 2012
- [j103]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012) - [j102]Gérard Biau, Luc Devroye, Vida Dujmovic, Adam Krzyzak:
An affine invariant k-nearest neighbor regression estimate. J. Multivar. Anal. 112: 24-34 (2012) - [j101]Luc Devroye, Omar Fawzi, Nicolas Fraiman:
Depth Properties of scaled attachment random recursive trees. Random Struct. Algorithms 41(1): 66-98 (2012) - [j100]Luc Devroye:
Simulating Size-constrained Galton-Watson Trees. SIAM J. Comput. 41(1): 1-11 (2012) - [c20]Luc Devroye, Pat Morin:
A Note on Interference in Random Networks. CCCG 2012: 193-198 - [c19]Gérard Biau, Adam Krzyzak, Luc Devroye, Vida Dujmovic:
An affine invariant k-nearest neighbor regression estimate. ISIT 2012: 1445-1447 - [i9]Luc Devroye, Pat Morin:
A Note on Interference in Random Point Sets. CoRR abs/1202.5945 (2012) - 2011
- [j99]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - [j98]Luc Devroye, Svante Janson:
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. Random Struct. Algorithms 38(4): 381-395 (2011) - [j97]Luc Devroye, Lancelot F. James:
The double CFTP method. ACM Trans. Model. Comput. Simul. 21(2): 10:1-10:20 (2011) - [i8]Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold for Bluetooth graphs. CoRR abs/1103.0351 (2011) - [i7]Luc Devroye, James King:
Random hyperplane search trees in high dimensions. CoRR abs/1106.0461 (2011) - 2010
- [j96]Nicolas Broutin, Luc Devroye, Erin McLeish:
Note on the Structure of Kruskal's Algorithm. Algorithmica 56(2): 141-159 (2010) - [j95]Gérard Biau, Luc Devroye:
On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification. J. Multivar. Anal. 101(10): 2499-2518 (2010) - [c18]Luc Devroye:
Complexity Questions in Non-Uniform Random Variate Generation. COMPSTAT 2010: 3-18 - [c17]Luc Devroye:
Classification and Trees. SSPR/SPR 2010: 40-44 - [i6]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i5]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010) - [i4]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010)
2000 – 2009
- 2009
- [j94]Luc Devroye, Ebrahim Malalla:
On the k-orientability of random graphs. Discret. Math. 309(6): 1476-1490 (2009) - [j93]Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009) - [j92]Luc Devroye, James King, Colin McDiarmid:
Random Hyperplane Search Trees. SIAM J. Comput. 38(6): 2411-2425 (2009) - [j91]Luc Devroye:
Random variate generation for exponentially and polynomially tilted stable distributions. ACM Trans. Model. Comput. Simul. 19(4): 18:1-18:20 (2009) - [c16]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167 - [i3]Luc Devroye, Joachim Gudmundsson, Pat Morin:
On the Expected Maximum Degree of Gabriel and Yao Graphs. CoRR abs/0905.3584 (2009) - [i2]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal. CoRR abs/0911.2484 (2009) - 2008
- [j90]Nicolas Broutin, Luc Devroye, Erin McLeish:
Weighted height of random trees. Acta Informatica 45(4): 237-277 (2008) - [j89]Nicolas Broutin, Luc Devroye:
An Analysis of the Height of Tries with Random Weights on the Edges. Comb. Probab. Comput. 17(2): 161-202 (2008) - [j88]Gérard Biau, Luc Devroye, Gábor Lugosi:
Consistency of Random Forests and Other Averaging Classifiers. J. Mach. Learn. Res. 9: 2015-2033 (2008) - [j87]Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle:
The height of increasing trees. Random Struct. Algorithms 32(4): 494-518 (2008) - [j86]Gérard Biau, Luc Devroye, Gábor Lugosi:
On the Performance of Clustering in Hilbert Spaces. IEEE Trans. Inf. Theory 54(2): 781-790 (2008) - 2007
- [j85]Prosenjit Bose, Luc Devroye:
On the stabbing number of a random Delaunay triangulation. Comput. Geom. 36(2): 89-105 (2007) - [c15]Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables. SODA 2007: 891-899 - 2006
- [j84]Nicolas Broutin, Luc Devroye:
Large Deviations for the Weighted Height of an Extended Class of Trees. Algorithmica 46(3-4): 271-297 (2006) - [j83]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discret. Math. 20(2): 412-427 (2006) - [c14]Luc Devroye:
Random Multivariate Search Trees. COLT 2006: 1 - [p2]Luc Devroye:
Chapter 4 Nonuniform Random Variate Generation. Simulation 2006: 83-121 - 2005
- [j82]Luc Devroye:
Universal Asymptotics for Random Tries and PATRICIA Trees. Algorithmica 42(1): 11-29 (2005) - [j81]Luc Devroye, Wojciech Szpankowski:
Probabilistic behavior of asymmetric level compressed tries. Random Struct. Algorithms 27(2): 185-200 (2005) - [j80]Zhi-Dong Bai, Luc Devroye, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Maxima in hypercubes. Random Struct. Algorithms 27(3): 290-309 (2005) - [j79]Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin McLeish:
Two-Way Chaining with Reassignment. SIAM J. Comput. 35(2): 327-340 (2005) - 2004
- [j78]Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Expected time analysis for Delaunay point location. Comput. Geom. 29(2): 61-89 (2004) - [j77]Luc Devroye, Carlos Zamora-Cura:
Expected worst-case partial match in random quadtries. Discret. Appl. Math. 141(1-3): 103-117 (2004) - [j76]Luc Devroye, Ralph Neininger:
Distances and Finger Search in Random Binary Search Trees. SIAM J. Comput. 33(3): 647-658 (2004) - [j75]Luc Devroye, Pat Morin, Alfredo Viola:
On Worst-Case Robin Hood Hashing. SIAM J. Comput. 33(4): 923-936 (2004) - [j74]Gérard Biau, Luc Devroye:
A note on density model size testing. IEEE Trans. Inf. Theory 50(3): 576-581 (2004) - 2003
- [j73]Luc Devroye, Pat Morin:
Cuckoo hashing: Further analysis. Inf. Process. Lett. 86(4): 215-219 (2003) - [j72]Luc Devroye, Ralph Neininger:
Random suffix search trees. Random Struct. Algorithms 23(4): 357-396 (2003) - 2002
- [j71]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geom. Appl. 12(6): 445-454 (2002) - [j70]Luc Devroye:
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees. SIAM J. Comput. 32(1): 152-171 (2002) - [j69]Luc Devroye, László Györfi, Gábor Lugosi:
A note on robust hypothesis testing. IEEE Trans. Inf. Theory 48(7): 2111-2114 (2002) - [c13]Luc Devroye:
Paul Erdös memorial lecture. CCCG 2002 - [c12]Luc Devroye:
Random Tries. ISAAC 2002: 635 - [c11]Prosenjit Bose, Luc Devroye, Pat Morin:
Succinct Data Structures for Approximating Convex Functions with Applications. JCDCG 2002: 97-107 - [c10]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN 2002: 479-493 - 2001
- [b3]Luc Devroye, Gábor Lugosi:
Combinatorial methods in density estimation. Springer series in statistics, Springer 2001, ISBN 978-0-387-95117-1, pp. I-XII, 1-208 - [j68]Philippe Chanzy, Luc Devroye, Carlos Zamora-Cura:
Analysis of range search for random k-d trees. Acta Informatica 37(4/5): 355-383 (2001) - [j67]Luc Devroye:
On the Probablistic Worst-Case Time of "Find". Algorithmica 31(3): 291-303 (2001) - [j66]Luc Devroye:
Analysis of random LC tries. Random Struct. Algorithms 19(3-4): 359-375 (2001) - 2000
- [j65]David Avis, Luc Devroye:
Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3-4): 137-143 (2000) - [j64]Luc Devroye, Jean Jabbour, Carlos Zamora-Cura:
Squarish k-d Trees. SIAM J. Comput. 30(5): 1678-1700 (2000) - [i1]Luc Devroye, James Allen Fill, Ralph Neininger:
Perfect simulation from the Quicksort limit distribution. CoRR math.PR/0005237 (2000)
1990 – 1999
- 1999
- [j63]Luc Devroye:
A Note on the Expected Time for Finding Maxima by List Algorithms. Algorithmica 23(2): 97-108 (1999) - [j62]Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger:
Properties of Random Triangulations and Trees. Discret. Comput. Geom. 22(1): 105-117 (1999) - [j61]András Antos, Luc Devroye, László Györfi:
Lower Bounds for Bayes Error Estimation. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 643-645 (1999) - [j60]Luc Devroye, Carlos Zamora-Cura:
On the complexity of branch-and-bound search for random trees. Random Struct. Algorithms 14(4): 309-327 (1999) - [j59]Luc Devroye:
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees. SIAM J. Comput. 28(4): 1215-1224 (1999) - [c9]Luc Devroye, Christophe Lemaire, Jean-Michel Moreau:
Fast delaunay point location with search structures. CCCG 1999 - 1998
- [j58]Luc Devroye, Ernst P. Mücke, Binhai Zhu:
A Note on Point Location in Delaunay Triangulations of Random Points. Algorithmica 22(4): 477-482 (1998) - [j57]Prosenjit Bose, Luc Devroye:
Intersections with random geometric objects. Comput. Geom. 10(3): 139-154 (1998) - [j56]Luc Devroye:
On the Richness of the Collection of Subtrees in Random Binary Search Trees. Inf. Process. Lett. 65(4): 195-199 (1998) - [j55]Luc Devroye, Amar Goudjil:
A study of random Weyl trees. Random Struct. Algorithms 12(3): 271-295 (1998) - [j54]David Avis, Bryan Beresford-Smith, Luc Devroye, Hossam A. ElGindy, Eric Guévremont, Ferran Hurtado, Binhai Zhu:
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. SIAM J. Comput. 28(1): 278-296 (1998) - [j53]Luc Devroye:
Universal Limit Laws for Depths in Random Trees. SIAM J. Comput. 28(2): 409-432 (1998) - 1997
- [j52]Luc Devroye:
Random Variate Generation for Multivariate Unimodal Densities. ACM Trans. Model. Comput. Simul. 7(4): 447-477 (1997) - [e1]Luc Devroye, Claude Chrisment:
Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications) - RIAO 1997, 5th International Conference, McGill University, Montreal, Canada, June 25-27, 1997. Proceedings. 1997 [contents] - 1996
- [b2]Luc Devroye, László Györfi, Gábor Lugosi:
A Probabilistic Theory of Pattern Recognition. Stochastic Modelling and Applied Probability 31, Springer 1996, ISBN 978-1-4612-6877-2, pp. 1-638 - [j51]Luc Devroye, Paul Kruszewski:
On the Horton-Strahler Number for Random Tries. RAIRO Theor. Informatics Appl. 30(5): 443-456 (1996) - [c8]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG 1996: 68-73 - [c7]Luc Devroye:
Random Variate Generation in One Line of Code. WSC 1996: 265-272 - 1995
- [j50]Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees. Inf. Process. Lett. 56(2): 95-99 (1995) - [j49]Luc Devroye, Gábor Lugosi:
Lower bounds in pattern recognition and learning. Pattern Recognit. 28(7): 1011-1018 (1995) - [j48]Luc Devroye, Jiang Lu:
The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags. Random Struct. Algorithms 7(1): 1-14 (1995) - [j47]Luc Devroye, J. M. Robson:
On the Generation of Random Binary Search Trees. SIAM J. Comput. 24(6): 1141-1156 (1995) - [j46]Luc Devroye, Bruce A. Reed:
On the Variance of the Height of Random Binary Search Trees. SIAM J. Comput. 24(6): 1157-1162 (1995) - [c6]Luc Devroye, Paul Kruszewski:
The Botanical Beauty of Random Binary Trees. GD 1995: 166-177 - 1994
- [j45]Luc Devroye, Binhai Zhu:
Intersections of random line segments. Int. J. Comput. Geom. Appl. 4(3): 261-274 (1994) - [j44]Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees. Inf. Process. Lett. 52(3): 155-159 (1994) - [j43]Luc Devroye:
On Random Cartesian Trees. Random Struct. Algorithms 5(2): 305-328 (1994) - 1993
- [j42]Luc Devroye:
On the Expected Height of Fringe-Balanced Trees. Acta Informatica 30(5): 459-466 (1993) - [j41]Luc Devroye, Godfried T. Toussaint:
Convex Hulls for Random Lines. J. Algorithms 14(3): 381-394 (1993) - 1992
- [j40]Luc Devroye:
A Note on the Probabilistic Analysis of Patricia Trees. Random Struct. Algorithms 3(2): 203-214 (1992) - [j39]Luc Devroye, Wojciech Szpankowski, Bonita Rais:
A Note on the Height of Suffix Trees. SIAM J. Comput. 21(1): 48-53 (1992) - [c5]Luc Devroye:
Generation of random objects. WSC 1992: 270-279 - 1991
- [j38]Luc Devroye:
Expected time analysis of a simple recursive Poisson random variate generator. Computing 46(2): 165-173 (1991) - [j37]Luc Devroye:
Limit Laws for Local Counters in Random Binary Search Tree. Random Struct. Algorithms 2(3): 303-316 (1991) - [j36]Luc Devroye:
Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence. SIAM J. Sci. Comput. 12(1): 107-126 (1991) - 1990
- [j35]Luc Devroye:
Coupled Samples in Simulation. Oper. Res. 38(1): 115-126 (1990) - [j34]Luc Devroye:
On the Height of Random m-ary Search Trees. Random Struct. Algorithms 1(2): 191-204 (1990) - [j33]Luc Devroye, Louise Laforest:
An Analysis of Random d-Dimensional Quad Trees. SIAM J. Comput. 19(5): 821-832 (1990)
1980 – 1989
- 1989
- [j32]Luc Devroye:
On Global Costs and Nyquist's Theorem in Random Variate Generation. Math. Oper. Res. 14(2): 224-236 (1989) - [c4]Luc Devroye:
Probabilistic Analysis of Algorithms and Data Structures. WADS 1989: 230 - 1988
- [j31]Luc Devroye:
Applications of the Theory of Records in the Study of Random Trees. Acta Informatica 26(1/2): 123-130 (1988) - [j30]Luc Devroye:
Automatic Pattern Recognition: A Study of the Probability of Error. IEEE Trans. Pattern Anal. Mach. Intell. 10(4): 530-543 (1988) - [c3]Luc Devroye:
Generating sums in constant average time. WSC 1988: 425-431 - 1987
- [j29]Luc Devroye:
Branching Processes in the Analysis of the Heights of Trees. Acta Informatica 24(3): 277-298 (1987) - [j28]Luc Devroye:
A simple generator for discrete log-concave distributions. Computing 39(1): 87-91 (1987) - 1986
- [b1]Luc Devroye:
Non-Uniform Random Variate Generation. Springer 1986, ISBN 978-1-4613-8645-2, pp. 1-843 - [j27]Luc Devroye:
Grid methods in simulation and random variate generation. Computing 37(1): 71-84 (1986) - [j26]Luc Devroye:
A note on the height of binary search trees. J. ACM 33(3): 489-498 (1986) - [c2]Luc Devroye:
Sample-based non-uniform random variate generation. WSC 1986: 260-265 - 1985
- [j25]Luc Devroye:
A Note on the Expected Time Required to Construct the Outer Layer. Inf. Process. Lett. 20(5): 255-257 (1985) - [j24]Luc Devroye:
The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform. J. Algorithms 6(1): 1-9 (1985) - [j23]Luc Devroye, Fred Machell:
Data Structures in Kernel Density Estimation. IEEE Trans. Pattern Anal. Mach. Intell. 7(3): 360-366 (1985) - 1984
- [j22]Luc Devroye:
A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort. Acta Informatica 21: 229-237 (1984) - [j21]Luc Devroye:
Random variate generation for unimodal and monotone densities. Computing 32(1): 43-68 (1984) - [j20]Luc Devroye:
A simple algorithm for generating random variates with a log-concave density. Computing 33(3-4): 247-257 (1984) - [j19]Luc Devroye:
Exponential Bounds for the Running Time of a Selection Algorithm. J. Comput. Syst. Sci. 29(1): 1-7 (1984) - 1983
- [j18]Jack A. Orenstein, T. H. Merrett, Luc Devroye:
Linear Sorting with O(log n) Processors. BIT 23(2): 170-180 (1983) - [j17]Luc Devroye:
Moment inequalities for random variables in computational geometry. Computing 30(2): 111-119 (1983) - 1982
- [j16]Luc Devroye:
A note on the average depth of tries. Computing 28(4): 367-371 (1982) - [j15]Luc Devroye:
Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size. IEEE Trans. Pattern Anal. Mach. Intell. 4(2): 154-157 (1982) - [p1]Luc Devroye, Terry J. Wagner:
8 Nearest neighbor methods in discrimination. Classification, Pattern Recognition and Reduction of Dimensionality 1982: 193-197 - 1981
- [j14]Luc Devroye, T. Klincsek:
Average time behavior of distributive sorting algorithms. Computing 26(1): 1-7 (1981) - [j13]Luc Devroye:
The computer generation of poisson random variables. Computing 26(3): 197-207 (1981) - [j12]Luc Devroye, Godfried T. Toussaint:
A note on linear expected time algorithms for finding convex hulls. Computing 26(4): 361-366 (1981) - [j11]Luc Devroye:
On the Inequality of Cover and Hart in Nearest Neighbor Discrimination. IEEE Trans. Pattern Anal. Mach. Intell. 3(1): 75-78 (1981) - [c1]Luc Devroye:
Recent results in non-uniform random variate generation. WSC 1981: 517-521 - 1980
- [j10]Luc Devroye:
A Note on Finding Convex Hulls Via Maximal Vectors. Inf. Process. Lett. 11(1): 53-56 (1980)
1970 – 1979
- 1979
- [j9]Luc Devroye:
Inequalities for the Completion Times of Stochastic PERT Networks. Math. Oper. Res. 4(4): 441-447 (1979) - [j8]Luc Devroye, Terry J. Wagner:
Distribution-free inequalities for the deleted and holdout error estimates. IEEE Trans. Inf. Theory 25(2): 202-207 (1979) - [j7]Luc Devroye, Terry J. Wagner:
Distribution-free performance bounds with the resubstitution error estimate (Corresp.). IEEE Trans. Inf. Theory 25(2): 208-210 (1979) - [j6]Luc Devroye, Terry J. Wagner:
Distribution-free performance bounds for potential function rules. IEEE Trans. Inf. Theory 25(5): 601-604 (1979) - 1978
- [j5]Luc Devroye:
Progressive global random search of continuous functions. Math. Program. 15(1): 330-342 (1978) - [j4]Luc Devroye:
The uniform convergence of nearest neighbor regression function estimators and their application in optimization. IEEE Trans. Inf. Theory 24(2): 142-151 (1978) - 1976
- [j3]Luc Devroye, Terry J. Wagner:
A distribution-free performance bound in error estimation (Corresp.). IEEE Trans. Inf. Theory 22(5): 586-587 (1976) - [j2]Luc Devroye:
On the Convergence of Statistical Search. IEEE Trans. Syst. Man Cybern. 6(1): 46-56 (1976) - [j1]Luc Devroye:
Probabilistic Search as a Strategy Selection Procedure. IEEE Trans. Syst. Man Cybern. 6(4): 315-321 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
