The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Luc Devroye: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  73. The spanning ratio of the Delaunay triangulation is greater than pi/2. [Citation Graph (, )][DBLP]


  74. Classification and Trees. [Citation Graph (, )][DBLP]


  75. Weighted height of random trees. [Citation Graph (, )][DBLP]


  76. Note on the Structure of Kruskal's Algorithm. [Citation Graph (, )][DBLP]


  77. Moment inequalities for random variables in computational geometry. [Citation Graph (, )][DBLP]


  78. On the Expected Maximum Degree of Gabriel and Yao Graphs [Citation Graph (, )][DBLP]


  79. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal [Citation Graph (, )][DBLP]


  80. Point Location in Disconnected Planar Subdivisions [Citation Graph (, )][DBLP]


  81. Odds-On Trees [Citation Graph (, )][DBLP]


  82. The dilation of the Delaunay triangulation is greater than π/2 [Citation Graph (, )][DBLP]


  83. An Analysis of the Height of Tries with Random Weights on the Edges. [Citation Graph (, )][DBLP]


  84. On the k-orientability of random graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002