Bibliographie
1. G. Adel’son-Vel’skii, E. Landis, An algorithm for organisation of information. Dokl. Akad.
Nauk SSSR 146, 263–266 (1962). Traduction anglaise : Soviet Math. Dokl. 3, 1259–1263
2. A.V. Aho, N.J.A. Sloane, Some doubly exponential sequences. Fibonacci Q. 11, 429–437
(1970)
3. D. Aldous, The continuum random tree. i. Ann. Probab. 19(1), 1–28 (1991)
4. D. Aldous, The continuum random tree. ii: an overview, in Stochastic Analysis, ed. by
M. Barlow, N.H. Bingham (Cambridge University Press, Cambridge, 1991), pp. 23–70
5. D. Aldous, The continuum random tree. iii. Ann. Probab. 21(1), 248–289 (1993)
6. A. Apostolico, The myriad virtues of subword trees, in Combinatorial Algorithms on Words,
ed. by A. Apostolico, Z. Galil. NATO Advanced Science Institute Series. Series F: Computer
and Systems Sciences, vol. 12 (Springer, Berlin, 1985), pp. 85–96
7. A. Apostolico, M. Crochemore, M. Farach-Colton, Z. Galil, S. Muthukrishnan, 40 years of
suffix trees. Commun. ACM 59(4), 66–73 (2016)
8. C.R. Aragon, R.G. Seidel, Randomized search trees. In 30th Annual Symposium on
Foundations of Computer Science (1989), pp. 540–545
9. C.R. Aragon, R.G. Seidel, Randomized search trees. Algorithmica 16(4), 464–497 (1996)
10. S. Asmussen, H. Hering, Branching Processes (Birkhäuser, Basel, 1983)
11. K. Athreya, On a characteristic property of Pólya’s urn. Stud. Sci. Math. Hung. 4, 31–35
(1969)
12. K. Athreya, P. Ney, Branching Processes (Springer, Berlin, 1972)
13. M. Aumüller, M. Dietzfelbinger, Optimal partitioning for dual pivot quicksort, in Automata,
Languages and Programming. LNCS, vol. 7965 (Springer, Berlin, 2013), pp. 33–44
14. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps.
Generating functions for generating trees. Discret. Math. 246(1–3), 29–55 (2002)
15. P. Barbe, M. Ledoux, Probabilité. Collection : enseignement SUP-Maths (EDP Sciences, Les
Ulis, 2007)
16. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A methodology for plane tree enumeration.
Discret. Math. 180(1–3), 45–64 (1998)
17. E. Barcucci, A. Del Lungo, E. Pergola, Random generation of trees and other combinatorial
objects. Theor. Comput. Sci. 218(2), 219–232 (1999)
18. T. Bell, I.H. Witten, J.G. Cleary, Modelling for text compression. ACM Comput. Surv. 21(4),
557–591 (1989)
19. J.L. Bentley, R. Sedgewick, Fast algorithms for sorting and searching strings, in Proceedings
of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’97 (Society for
Industrial and Applied Mathematics, Philadelphia, 1997), pp. 360–369
© Springer Nature Switzerland AG 2018
B. Chauvin et al., Arbres pour l’Algorithmique, Mathématiques et Applications 83,
https://doi.org/10.1007/978-3-319-93725-0
495
1. G. Adel’son-Vel’skii, E. Landis, An algorithm for organisation of information. Dokl. Akad.
Nauk SSSR 146, 263–266 (1962). Traduction anglaise : Soviet Math. Dokl. 3, 1259–1263
2. A.V. Aho, N.J.A. Sloane, Some doubly exponential sequences. Fibonacci Q. 11, 429–437
(1970)
3. D. Aldous, The continuum random tree. i. Ann. Probab. 19(1), 1–28 (1991)
4. D. Aldous, The continuum random tree. ii: an overview, in Stochastic Analysis, ed. by
M. Barlow, N.H. Bingham (Cambridge University Press, Cambridge, 1991), pp. 23–70
5. D. Aldous, The continuum random tree. iii. Ann. Probab. 21(1), 248–289 (1993)
6. A. Apostolico, The myriad virtues of subword trees, in Combinatorial Algorithms on Words,
ed. by A. Apostolico, Z. Galil. NATO Advanced Science Institute Series. Series F: Computer
and Systems Sciences, vol. 12 (Springer, Berlin, 1985), pp. 85–96
7. A. Apostolico, M. Crochemore, M. Farach-Colton, Z. Galil, S. Muthukrishnan, 40 years of
suffix trees. Commun. ACM 59(4), 66–73 (2016)
8. C.R. Aragon, R.G. Seidel, Randomized search trees. In 30th Annual Symposium on
Foundations of Computer Science (1989), pp. 540–545
9. C.R. Aragon, R.G. Seidel, Randomized search trees. Algorithmica 16(4), 464–497 (1996)
10. S. Asmussen, H. Hering, Branching Processes (Birkhäuser, Basel, 1983)
11. K. Athreya, On a characteristic property of Pólya’s urn. Stud. Sci. Math. Hung. 4, 31–35
(1969)
12. K. Athreya, P. Ney, Branching Processes (Springer, Berlin, 1972)
13. M. Aumüller, M. Dietzfelbinger, Optimal partitioning for dual pivot quicksort, in Automata,
Languages and Programming. LNCS, vol. 7965 (Springer, Berlin, 2013), pp. 33–44
14. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps.
Generating functions for generating trees. Discret. Math. 246(1–3), 29–55 (2002)
15. P. Barbe, M. Ledoux, Probabilité. Collection : enseignement SUP-Maths (EDP Sciences, Les
Ulis, 2007)
16. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A methodology for plane tree enumeration.
Discret. Math. 180(1–3), 45–64 (1998)
17. E. Barcucci, A. Del Lungo, E. Pergola, Random generation of trees and other combinatorial
objects. Theor. Comput. Sci. 218(2), 219–232 (1999)
18. T. Bell, I.H. Witten, J.G. Cleary, Modelling for text compression. ACM Comput. Surv. 21(4),
557–591 (1989)
19. J.L. Bentley, R. Sedgewick, Fast algorithms for sorting and searching strings, in Proceedings
of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’97 (Society for
Industrial and Applied Mathematics, Philadelphia, 1997), pp. 360–369
© Springer Nature Switzerland AG 2018
B. Chauvin et al., Arbres pour l’Algorithmique, Mathématiques et Applications 83,
https://doi.org/10.1007/978-3-319-93725-0
495