dblp.uni-trier.dewww.uni-trier.de

Luc Devroye Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
82EELuc Devroye, Joachim Gudmundsson, Pat Morin: On the Expected Maximum Degree of Gabriel and Yao Graphs CoRR abs/0905.3584: (2009)
81EELuc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009)
80EELuc Devroye, James King, Colin McDiarmid: Random Hyperplane Search Trees. SIAM J. Comput. 38(6): 2411-2425 (2009)
2008
79EENicolas Broutin, Luc Devroye, E. McLeish: Weighted height of random trees. Acta Inf. 45(4): 237-277 (2008)
78EENicolas Broutin, Luc Devroye: An Analysis of the Height of Tries with Random Weights on the Edges. Combinatorics, Probability & Computing 17(2): 161-202 (2008)
77EEGérard Biau, Luc Devroye, Gábor Lugosi: On the Performance of Clustering in Hilbert Spaces. IEEE Transactions on Information Theory 54(2): 781-790 (2008)
76EENicolas Broutin, Luc Devroye, E. McLeish, M. de la Salle: The height of increasing trees. Random Struct. Algorithms 32(4): 494-518 (2008)
2007
75EELuc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski: Multiple choice tries and distributed hash tables. SODA 2007: 891-899
74EEProsenjit Bose, Luc Devroye: On the stabbing number of a random Delaunay triangulation. Comput. Geom. 36(2): 89-105 (2007)
2006
73EELuc Devroye: Random Multivariate Search Trees. COLT 2006: 1
72EENicolas Broutin, Luc Devroye: Large Deviations for the Weighted Height of an Extended Class of Trees. Algorithmica 46(3-4): 271-297 (2006)
71EEProsenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discrete Math. 20(2): 412-427 (2006)
2005
70EELuc Devroye: Universal Asymptotics for Random Tries and PATRICIA Trees. Algorithmica 42(1): 11-29 (2005)
69EELuc Devroye, Wojciech Szpankowski: Probabilistic behavior of asymmetric level compressed tries. Random Struct. Algorithms 27(2): 185-200 (2005)
68EEZhi-Dong Bai, Luc Devroye, Hsien-Kuei Hwang, Tsung-Hsi Tsai: Maxima in hypercubes. Random Struct. Algorithms 27(3): 290-309 (2005)
67EEKetan Dalal, Luc Devroye, Ebrahim Malalla, Erin McLeis: Two-Way Chaining with Reassignment. SIAM J. Comput. 35(2): 327-340 (2005)
2004
66EELuc Devroye, Christophe Lemaire, Jean-Michel Moreau: Expected time analysis for Delaunay point location. Comput. Geom. 29(2): 61-89 (2004)
65EELuc Devroye, Carlos Zamora-Cura: Expected worst-case partial match in random quadtries. Discrete Applied Mathematics 141(1-3): 103-117 (2004)
64 Gérard Biau, Luc Devroye: A note on density model size testing. IEEE Transactions on Information Theory 20(3): 576-581 (2004)
63EELuc Devroye, Ralph Neininger: Distances and Finger Search in Random Binary Search Trees. SIAM J. Comput. 33(3): 647-658 (2004)
62EELuc Devroye, Pat Morin, Alfredo Viola: On Worst-Case Robin Hood Hashing. SIAM J. Comput. 33(4): 923-936 (2004)
2003
61EELuc Devroye, Pat Morin: Cuckoo hashing: Further analysis. Inf. Process. Lett. 86(4): 215-219 (2003)
60EELuc Devroye, Ralph Neininger: Random suffix search trees. Random Struct. Algorithms 23(4): 357-396 (2003)
2002
59EELuc Devroye: Paul Erdös memorial lecture. CCCG 2002
58EELuc Devroye: Random Tries. ISAAC 2002: 635
57EEProsenjit Bose, Luc Devroye, Pat Morin: Succinct Data Structures for Approximating Convex Functions with Applications. JCDCG 2002: 97-107
56EEProsenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick: On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN 2002: 479-493
55 Luc Devroye, László Györfi, Gábor Lugosi: A note on robust hypothesis testing. IEEE Transactions on Information Theory 48(7): 2111-2114 (2002)
54EEProsenjit Bose, Luc Devroye, William S. Evans: Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geometry Appl. 12(6): 445-454 (2002)
53EELuc Devroye: Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees. SIAM J. Comput. 32(1): 152-171 (2002)
2001
52EEPhilippe Chanzy, Luc Devroye, Carlos Zamora-Cura: Analysis of range search for random k-d trees. Acta Inf. 37(4/5): 355-383 (2001)
51EELuc Devroye: On the Probablistic Worst-Case Time of ``Find''. Algorithmica 31(3): 291-303 (2001)
50 Luc Devroye: Analysis of random LC tries. Random Struct. Algorithms 19(3-4): 359-375 (2001)
2000
49EELuc Devroye, James Allen Fill, Ralph Neininger: Perfect simulation from the Quicksort limit distribution CoRR math.PR/0005237: (2000)
48EEDavid Avis, Luc Devroye: Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3-4): 137-143 (2000)
47EELuc Devroye, Jean Jabbour, Carlos Zamora-Cura: Squarish k-d Trees. SIAM J. Comput. 30(5): 1678-1700 (2000)
1999
46EELuc Devroye, Christophe Lemaire, Jean-Michel Moreau: Fast delaunay point location with search structures. CCCG 1999
45EELuc Devroye: A Note on the Expected Time for Finding Maxima by List Algorithms. Algorithmica 23(2): 97-108 (1999)
44EELuc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger: Properties of Random Triangulations and Trees. Discrete & Computational Geometry 22(1): 105-117 (1999)
43EEAndrá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)
42 Luc Devroye, Carlos Zamora-Cura: On the complexity of branch-and-bound search for random trees. Random Struct. Algorithms 14(4): 309-327 (1999)
41 Luc Devroye: The Height and Size of Random Hash Trees and Random Pebbled Hash Trees. SIAM J. Comput. 28(4): 1215-1224 (1999)
1998
40EELuc Devroye, Ernst P. Mücke, Binhai Zhu: A Note on Point Location in Delaunay Triangulations of Random Points. Algorithmica 22(4): 477-482 (1998)
39 Prosenjit Bose, Luc Devroye: Intersections with random geometric objects. Comput. Geom. 10(3): 139-154 (1998)
38EELuc Devroye: On the Richness of the Collection of Subtrees in Random Binary Search Trees. Inf. Process. Lett. 65(4): 195-199 (1998)
37 Luc Devroye, Amar Goudjil: A study of random Weyl trees. Random Struct. Algorithms 12(3): 271-295 (1998)
36 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)
35 Luc Devroye: Universal Limit Laws for Depths in Random Trees. SIAM J. Comput. 28(2): 409-432 (1998)
1997
34 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 RIAO 1997
33EELuc Devroye: Random Variate Generation for Multivariate Unimodal Densities. ACM Trans. Model. Comput. Simul. 7(4): 447-477 (1997)
1996
32 Prosenjit Bose, Luc Devroye, William S. Evans: Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG 1996: 68-73
31EELuc Devroye: Random Variate Generation in One Line of Code. Winter Simulation Conference 1996: 265-272
30 Luc Devroye, Paul Kruszewski: On the Horton-Strahler Number for Random Tries. ITA 30(5): 443-456 (1996)
1995
29 Luc Devroye, Paul Kruszewski: The Botanical Beauty of Random Binary Trees. Graph Drawing 1995: 166-177
28EELuc Devroye, Paul Kruszewski: A Note on the Horton-Strahler Number for Random Trees. Inf. Process. Lett. 56(2): 95-99 (1995)
27EELuc Devroye, Gábor Lugosi: Lower bounds in pattern recognition and learning. Pattern Recognition 28(7): 1011-1018 (1995)
26 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)
25 Luc Devroye, J. M. Robson: On the Generation of Random Binary Search Trees. SIAM J. Comput. 24(6): 1141-1156 (1995)
24 Luc Devroye, Bruce A. Reed: On the Variance of the Height of Random Binary Search Trees. SIAM J. Comput. 24(6): 1157-1162 (1995)
1994
23 Luc Devroye, Paul Kruszewski: A Note on the Horton-Strahler Number for Random Trees. Inf. Process. Lett. 52(3): 155-159 (1994)
22 Luc Devroye, Binhai Zhu: Intersections of random line segments. Int. J. Comput. Geometry Appl. 4(3): 261-274 (1994)
21 Luc Devroye: On Random Cartesian Trees. Random Struct. Algorithms 5(2): 305-328 (1994)
1993
20 Luc Devroye: On the Expected Height of Fringe-Balanced Trees. Acta Inf. 30(5): 459-466 (1993)
19 Luc Devroye, Godfried T. Toussaint: Convex Hulls for Random Lines. J. Algorithms 14(3): 381-394 (1993)
1992
18EELuc Devroye: Generation of random objects. Winter Simulation Conference 1992: 270-279
17 Luc Devroye: A Note on the Probabilistic Analysis of Patricia Trees. Random Struct. Algorithms 3(2): 203-214 (1992)
16 Luc Devroye, Wojciech Szpankowski, Bonita Rais: A Note on the Height of Suffix Trees. SIAM J. Comput. 21(1): 48-53 (1992)
1991
15 Luc Devroye: Limit Laws for Local Counters in Random Binary Search Tree. Random Struct. Algorithms 2(3): 303-316 (1991)
1990
14 Luc Devroye: On the Height of Random m-ary Search Trees. Random Struct. Algorithms 1(2): 191-204 (1990)
13 Luc Devroye, Louise Laforest: An Analysis of Random d-Dimensional Quad Trees. SIAM J. Comput. 19(5): 821-832 (1990)
1989
12 Luc Devroye: Probabilistic Analysis of Algorithms and Data Structures. WADS 1989: 230
1988
11 Luc Devroye: Applications of the Theory of Records in the Study of Random Trees. Acta Inf. 26(1/2): 123-130 (1988)
10EELuc Devroye: Automatic Pattern Recognition: A Study of the Probability of Error. IEEE Trans. Pattern Anal. Mach. Intell. 10(4): 530-543 (1988)
1987
9 Luc Devroye: Branching Processes in the Analysis of the Heights of Trees. Acta Inf. 24(3): 277-298 (1987)
1986
8EELuc Devroye: A note on the height of binary search trees. J. ACM 33(3): 489-498 (1986)
1985
7 Luc Devroye: A Note on the Expected Time Required to Construct the Outer Layer. Inf. Process. Lett. 20(5): 255-257 (1985)
6 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)
1984
5 Luc Devroye: A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort. Acta Inf. 21: 229-237 (1984)
4 Luc Devroye: Exponential Bounds for the Running Time of a Selection Algorithm. J. Comput. Syst. Sci. 29(1): 1-7 (1984)
1983
3 Jack A. Orenstein, T. H. Merrett, Luc Devroye: Linear Sorting with O(log n) Processors. BIT 23(2): 170-180 (1983)
2EELuc Devroye: Moment inequalities for random variables in computational geometry. Computing 30(2): 111-119 (1983)
1980
1 Luc Devroye: A Note on Finding Convex Hulls Via Maximal Vectors. Inf. Process. Lett. 11(1): 53-56 (1980)

Coauthor Index

1András Antos [43]
2David Avis [36] [48]
3Zhi-Dong Bai [68]
4Bryan Beresford-Smith [36]
5Gérard Biau [64] [77]
6Prosenjit Bose [32] [39] [54] [56] [57] [71] [74]
7Nicolas Broutin [72] [76] [78] [79]
8Philippe Chanzy [52]
9Claude Chrisment [34]
10Ketan Dalal [67]
11Hossam A. ElGindy [36]
12William S. Evans [32] [54] [56] [71]
13James Allen Fill [49]
14Philippe Flajolet [44]
15Amar Goudjil [37]
16Joachim Gudmundsson [82]
17Eric Guévremont [36]
18László Györfi [43] [55]
19Ferran Hurtado [36] [44]
20Hsien-Kuei Hwang [68]
21Jean Jabbour [47]
22James King [80]
23David G. Kirkpatrick [56] [71]
24Paul Kruszewski [23] [28] [29] [30]
25Louise Laforest [13]
26Christophe Lemaire [46] [66]
27Jiang Lu [26]
28Gábor Lugosi [27] [55] [75] [77] [81]
29Ebrahim Malalla [67]
30Colin McDiarmid (Colin J. H. McDiarmid) [80]
31Erin McLeis [67]
32E. McLeish [76] [79]
33T. H. Merrett [3]
34Jean-Michel Moreau [46] [66]
35Pat Morin [57] [61] [62] [82]
36Ernst P. Mücke [40]
37Ralph Neininger [49] [60] [63]
38Marc Noy [44]
39Jack A. Orenstein [3]
40GaHyun Park [75] [81]
41Bonita Rais [16]
42Bruce A. Reed [24]
43J. M. Robson [25]
44M. de la Salle [76]
45William L. Steiger [44]
46Wojciech Szpankowski [16] [69] [75] [81]
47Godfried T. Toussaint [19]
48Tsung-Hsi Tsai [68]
49Alfredo Viola [62]
50Carlos Zamora-Cura [42] [47] [52] [65]
51Binhai Zhu [22] [36] [40]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)