504
Bibliographie
237. R.T. Smythe, H. Mahmoud, A survey of recursive trees. Theor. Probab. Math. Stat. 51, 1–27
(1995)
238. M. Sorensen, P. Urzyczyn, Lectures on the Curry-Howard Isomorphism (Elsevier, New York,
1998)
239. W. Szpankowski, Average Case Analysis of Algorithms on Sequences (Wiley, New York,
2001)
240. L. Takács, On the total height of random rooted binary trees. J. Comb. Theory (B) 61,
155–166 (1994)
241. R.E. Tarjan, Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225
(1975)
242. B. Tsybakov, V. Mikhailov, Free synchronous packet access in a broadcast channel with
feedback. Probl. Inf. Transm. 14, 259–280 (1979)
243. K. Uchiyama, Spatial growth of a branching process of particles living in R d . Ann. Probab.
10(no 4), 896–918 (1982)
244. E. Ukkonen, On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)
245. B. Vallée, Dynamical sources in information theory: fundamental intervals and word prefixes.
Algorithmica 29(1), 262–306 (2001)
246. B. Vallée, J. Clément, J.A. Fill, P. Flajolet, The number of symbol comparisons in quicksort
and quickselect, in ICALP 2009, ed. by S. Albers et al. Part I, LNCS, vol. 5555 (Springer,
Berlin, 2009), pp. 750–763
247. P. Weiner, Linear pattern matching algorithm, in IEEE 14th Annual Symposium on Switching
and Automata Theory (1973), pp. 1–11
248. D. Welsh, Codes and Cryptography (Oxford University Press, Oxford, 1990)
249. J. West, Generating trees and the Catalan and Schröder numbers. Discret. Math. 157, 363–374
(1995)
250. J.W.J. Williams. Algorithm-232-heapsort. Commun. ACM 7(6), 347–348 (1964)
251. D. Williams, Probability with Martingales. Cambridge Mathematical Textbooks (Cambridge
University Press, Cambridge, 1991)
252. A. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences.
Random Struct. Algoritm. 10, 453–485 (1997)
253. W. Wu, Packet Forwarding Technologies (Auerbach Publications, New York, 2007)
254. A. Yao, On random 2–3 trees. Acta Inform. 9, 159–170 (1978)
Bibliographie
237. R.T. Smythe, H. Mahmoud, A survey of recursive trees. Theor. Probab. Math. Stat. 51, 1–27
(1995)
238. M. Sorensen, P. Urzyczyn, Lectures on the Curry-Howard Isomorphism (Elsevier, New York,
1998)
239. W. Szpankowski, Average Case Analysis of Algorithms on Sequences (Wiley, New York,
2001)
240. L. Takács, On the total height of random rooted binary trees. J. Comb. Theory (B) 61,
155–166 (1994)
241. R.E. Tarjan, Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225
(1975)
242. B. Tsybakov, V. Mikhailov, Free synchronous packet access in a broadcast channel with
feedback. Probl. Inf. Transm. 14, 259–280 (1979)
243. K. Uchiyama, Spatial growth of a branching process of particles living in R d . Ann. Probab.
10(no 4), 896–918 (1982)
244. E. Ukkonen, On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)
245. B. Vallée, Dynamical sources in information theory: fundamental intervals and word prefixes.
Algorithmica 29(1), 262–306 (2001)
246. B. Vallée, J. Clément, J.A. Fill, P. Flajolet, The number of symbol comparisons in quicksort
and quickselect, in ICALP 2009, ed. by S. Albers et al. Part I, LNCS, vol. 5555 (Springer,
Berlin, 2009), pp. 750–763
247. P. Weiner, Linear pattern matching algorithm, in IEEE 14th Annual Symposium on Switching
and Automata Theory (1973), pp. 1–11
248. D. Welsh, Codes and Cryptography (Oxford University Press, Oxford, 1990)
249. J. West, Generating trees and the Catalan and Schröder numbers. Discret. Math. 157, 363–374
(1995)
250. J.W.J. Williams. Algorithm-232-heapsort. Commun. ACM 7(6), 347–348 (1964)
251. D. Williams, Probability with Martingales. Cambridge Mathematical Textbooks (Cambridge
University Press, Cambridge, 1991)
252. A. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences.
Random Struct. Algoritm. 10, 453–485 (1997)
253. W. Wu, Packet Forwarding Technologies (Auerbach Publications, New York, 2007)
254. A. Yao, On random 2–3 trees. Acta Inform. 9, 159–170 (1978)