Data structures' maxima

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1006-1042

  Louchard, G ^a   Kenyon, Claire ^b   Schott, R ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIV LYON   (France)

^c INRIA   (France)

Author keywords

Brownian bridges; Data structures; Diffusion techniques; Probabilistic analysis of algorithms; Queuing theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; PROBABILITY; QUEUEING THEORY; RANDOM PROCESSES;

ALGORITHM COMPLEXITY ANALYSIS; BROWNIAN MOTIONS;

DATA STRUCTURES;

EID: 0031208243     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791196603     Document Type: Article

References (53)

1. M. ABRAMOWITZ AND I. A. STEGUN, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover, New York, 1965.
2. D. ALDOUS, Probability Approximations via the Poisson Clumping Heuristic, Springer-Verlag, Berlin, 1989.
3. D. ALDOUS, M. HOFRI, AND W. SZPANKOWSKI, Maximum size of a dynamic data structure: Hashing with lazy deletion revisited, SIAM J. Comput., 21 (1992), pp. 713-732.
4. C. W. ANDERSON, Extreme value theory for a class of discrete distributions with applications to some stochastic processes, J. Appl. Probab., 7 (1970), pp. 99-113.
5. S. M. HERMAN, Limiting distribution of the maximum of a diffusion process, Ann. Math. Statist., 35 (1964), pp. 319-329.
6. S. M. HERMAN, Sojourns and extremes of stationary processes, Ann. Probab., 10 (1982), pp. 1-46.
7. S. M. HERMAN, Sojourns and extremes of a diffusion process on a fixed interval, Adv. Appl. Probab., 14 (1982), pp. 811-832.
8. S. M. HERMAN, Sojourns and Extremes of Stochastic Processes, Wadsworth and Brooks, Belmont, CA, 1992.
9. P. BILLINSLEY, Convergence of Probability Measures, John Wiley, New York, 1968.
10. J. W. COHEN, The Single Server Queue, revised ed., North-Holland, Amsterdam, 1982.
11. D. R. COX AND H. D. MILLER, The Theory of Stochastic Processes, Chapman and Hall, London, 1965.
12. E. CSAKI, A. FÖLDES, AND P. SALMINEN, On the joint distribution of the maximum and its location for a linear diffusion, Ann. Inst. H. Poincaré Probab. Statist., 23 (1987), pp. 179-194.
13. H. E. DANIELS AND T. H. R. SKYRME, The maximum of a random walk whose mean path has a maximum, Adv. Appl. Probab., 17 (1985), pp. 85-99.
14. H. E. DANIELS, The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres, Adv. Appl. Probab., 21 (1989), pp. 315-333.
15. J. DURBIN, The first-passage density of a continuous Gaussian process to a general boundary, J. Appl. Probab., 22 (1985), pp. 99-122.
16. W. FELLER, Introduction to Probability Theory and Its Applications, Vol. II, John Wiley, New York, 1971.
17. P. FLAJOLET, J. FRANÇON, AND J. VUILLEMIN, Sequence of operations analysis for dynamic data structures, J. Algorithms, 1 (1980), pp. 111-141.
18. P. FLAJOLET AND H. PRODINGER, Register allocation for unary-binary trees, SIAM J. Comput., 15 (1986), pp. 629-640.
19. P. FLAJOLET AND J. M. STEYAERT, A branching process arising in dynamic hashing, trie searching and polynomial factorization, in Proc. 9th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 140, Springer-Verlag, Berlin, 1982, pp. 239-251.
20. P. FLAJOLET, Approximate counting: A detailed analysis, BIT, 25 (1985), pp. 113-134.
21. P. FLAJOLET, M. REGNIER, AND R. SEDGEWICK, Some uses of the Mellin integral transform in the analysis of algorithms, Rapport de Recherche 398, INRIA, Le Chesnay, France, 1985.
22. P. FLAJOLET, C. PUECH, AND J. VUILLEMIN, The analysis of simple list structures, Inform. Sci., 38 (1986), pp. 121-146.
23. P. FLAJOLET, AND A. ODLYZKO, Singularity analysis of generating functions, SIAM J. Discrete Math., 3 (1990), pp. 216-240.
24. J. FRANÇON, Combinatoire des structures de données, thèse de doctorat d'etat, Université de Strasbourg, Strasbourg, France, 1979.
25. J. FRANÇON, B. RANDRIANARIMANANA, AND R. SCHOTT, Analysis of dynamic algorithms in Knuth's Model, Theoret. Comput. Sci., 72 (1990), pp. 147-167.
26. C. C. HEYDE, On the growth of the maximum queue length in a stable queue, Oper. Res., 19 (1970), pp. 447-452.
27. D. L. IGLEHART, Limiting diffusion approximations for the many server queue and the repairman problem, J. Appl. Probab., 2 (1965), pp. 429-441.
28. D. L. IGLEHART, Weak convergence in queuing theory, Adv. Appl. Probab., 5 (1973), pp. 570-594.
29. D. L. IGLEHART, Weak convergence of compound stochastic process I, Stochastic Process. Appl., 1 (1973), pp. 11-31.
30. D. L. IGLEHART, Extreme values m the GI/G/1 queue, Ann. Math. Statist., 43 (1972), pp. 627-635.
31. D. JAESCHKE, The asymptotic distribution of the supremum of the standardized empirical distribution function on subintervals, Ann. Math. Statist., 7 (1979), pp. 108-115.
32. P. JACQUET, B. RAIS, AND W. SZPANKOWSKI, Compact suffix trees resemble particia tries: Limiting distribution of depth, SIAM J. Discrete Math., 6 (1993), pp. 197-213.
33. P. JACQUET AND W. SZPANKOWSKI, Analysis of digital tries with Markovian dependency, IEEE Trans. Inform. Theory, 37 (1991), pp. 1470-1475.
34. N. L. JOHNSON AND S. KOTZ, Distribution in Statistics: Continuous Univariate Distributions, John Wiley, New York, 1970.
35. J. KEILSON AND H. F. Ross, Passage Time Distributions for Gaussian Markov (Ornstein-Uhlenbeck) Statistical Processes, Selected Tables in Mathematical Statistics III, AMS, Providence, RI, 1975.
36. D. E. KNUTH, Deletions that preserve randomness, Trans. Software Engrg., SE-3 (1977), pp. 351-359.
37. M. R. LEADBETTER, G. LINDGREEN, AND H. ROOTZEN, Extremes and Related Properties of Random Sequences and Processes, Springer-Verlag, Berlin, 1983.
38. G. LOUCHARD, Brownian motion and algorithm complexity, BIT, 26 (1986), pp. 17-34.
39. G. LOUCHARD, Exact and asymptotic distributions in digital and binary search trees, Theoret. Inform. Appl., 21 (1987), pp. 479-496.
40. G. LOUCHARD, Random walks, Gaussian processes and list structures, Theoret. Comput. Sci., 53 (1987), pp. 99-124.
41. G. LOUCHARD, R. SCHOTT, AND B. RANDRIANARIMANANA, Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis, Theoret. Comput. Sci., 93 (1992), pp. 201-225.
42. G. LOUCHARD, Kac's formula, Levy's local time and Brownian excursion, J. Appl. Probab., 21 (1984), pp. 479-499.
43. G. LOUCHARD, Large finite population queuing systems, part I: The infinite server model, Comm. Statist. Stochastic Models, 4 (1988), pp. 473-505.
44. G. LOUCHARD AND R. SCHOTT, Probabilistic Analysis of Some Distributed Algorithms; Random Structures Algorithms, 2 (1991), pp. 151-186.
45. C. MATHIEU-KENYON AND J. S. VITTER, General methods for the analysis of the maximum size of dynamic data structures, SIAM J. Comput., 20 (1991), pp. 807-823.
46. J. MORRISON, L. A. SHEPP, AND C. J. VAN WYK, A queuing analysis of hashing with lazy deletion, SIAM J. Comput., 16 (1987), pp. 1155-1164.
47. B. RANDRIANARIMANANA, Complexité des structures de données dynamiques, thèse de doctorat, Université de Nancy 1, Vandoeuvre-lès-Nancy, France, 1989 (in French).
48. J. S. SADOWSKY AND W. SZPANKOWSKI, The probability of large queue lengths and waiting times in a heterogeneous multiserver queue, part I: Tight limits, Adv. Appl. Probab., 27 (1995), pp. 532-566.
49. J. S. SADOWSKY AND W. SZPANKOWSKI, Maximum queue length and waiting time revisited: GI/GI/c queue, Problems Engrg. Inform. Sci., 6 (1992), pp. 157-170.
50. P. SALMINEN, On the first hitting time and the last exit time for a Brownian motion to/from a moving boundary, Adv. Appl. Probab., 20 (1988), pp. 411-426.
51. R. F. SERFOZO, Extreme values of birth and death processes and queues, Stochastic Process. Appl., 27 (1988), pp. 291-306.
52. R. F. SERFORZO, Extreme values of queue length in M/G/1 and G/M/1 systems, Math. Oper. Res. 13 (1988), pp. 349-357.
53. C. J. VAN WYK AND J. S. VITTER, The complexity of hashing with lazy deletion, Algorithmica, 1 (1986), pp. 17-29.