AAAAAA

   
Results: 1-10 |
Results: 10
Analysis of random LC tries
Authors: Devroye, L
Citation: L. Devroye, Analysis of random LC tries, RAND STR AL, 19(3-4), 2001, pp. 359-375
On the probablistic worst-case time of "Find"
Authors: Devroye, L
Citation: L. Devroye, On the probablistic worst-case time of "Find", ALGORITHMIC, 31(3), 2001, pp. 291-303
Analysis of range search for random k-d trees
Authors: Chanzy, P Devroye, L Zamora-Cura, C
Citation: P. Chanzy et al., Analysis of range search for random k-d trees, ACT INFORM, 37(4-5), 2001, pp. 355-383
Squarish k-d trees
Authors: Devroye, L Jabbour, J Zamora-Cura, C
Citation: L. Devroye et al., Squarish k-d trees, SIAM J COMP, 30(5), 2000, pp. 1678-1700
Estimating the number of vertices of a polyhedron
Authors: Avis, D Devroye, L
Citation: D. Avis et L. Devroye, Estimating the number of vertices of a polyhedron, INF PROCESS, 73(3-4), 2000, pp. 137-143
On the complexity of branch-and-bound search for random trees
Authors: Devroye, L Zamora-Cura, C
Citation: L. Devroye et C. Zamora-cura, On the complexity of branch-and-bound search for random trees, RAND STR AL, 14(4), 1999, pp. 309-327
Properties of random triangulations and trees
Authors: Devroye, L Flajolet, P Hurtado, F Noy, M Steiger, W
Citation: L. Devroye et al., Properties of random triangulations and trees, DISC COM G, 22(1), 1999, pp. 105-117
A note on the expected time for finding maxima by list algorithms
Authors: Devroye, L
Citation: L. Devroye, A note on the expected time for finding maxima by list algorithms, ALGORITHMIC, 23(2), 1999, pp. 97-108
Lower bounds for Bayes error estimation
Authors: Antos, A Devroye, L Gyorfi, L
Citation: A. Antos et al., Lower bounds for Bayes error estimation, IEEE PATT A, 21(7), 1999, pp. 643-645
The height and size of random hash trees and random pebbled hash trees
Authors: Devroye, L
Citation: L. Devroye, The height and size of random hash trees and random pebbled hash trees, SIAM J COMP, 28(4), 1999, pp. 1215-1224
Risultati: 1-10 |