B. Gittenberger: Publications

  1. A. Genitrini, B. Gittenberger, V. Kraus, and C. Mailler. Probabilities of Boolean functions given by random implicational formulas. Electronic Journal of Combinatorics (2012), to appear. [pdf].
  2. M. Drmota, B. Gittenberger, and J. Morgenbesser. Infinite systems of functional equations and Gaussian limiting distributions.. In Proceedings of the 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2012. to appear. [pdf].
  3. B. Gittenberger and V. Kraus. On the number of transversals in random trees. In Proceedings of the 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2012. to appear. [pdf].
  4. B. Gittenberger and V. Kraus. The degree profile of random Pólya trees. Journal of Combinatorial Theory, Ser. A 119 (2012), 1528-1557. [pdf].
  5. H. Fournier, D. Gardy, A. Genitrini, and B. Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms 40/3 (2012), 317-349. [pdf].
  6. O. Bodini, D. Gardy, and B. Gittenberger. Lambda terms of bounded unary height. In Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, pages 23-32, 2011.
  7. M. Drmota and B. Gittenberger. The shape of unlabeled rooted trees. European J. Combinat. 31 (2010), 2028-2063. [pdf].
  8. A. Genitrini and B. Gittenberger. No Shannon effect on probability distributions on Boolean functions induced by random expressions. DMTCS Proceedings AM (2010), 305-318. [pdf].
  9. M. Drmota, B. Gittenberger, and R. Kutzelnigg. Combinatorial models for cooperation networks. In Proceedings of the 20th International Workshop on Combinatorial Algorithms, volume 5874 of Lecture Notes in Comput. Sci., pages 206-217. Springer, 2009. [pdf].
  10. M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger, and M. D. Ward. On the shape of the fringe of various types of random trees. Mathematical Methods in the Applied Sciences 32 (2009), 1207-1245. [pdf].
  11. M. Drmota and B. Gittenberger. Chapter ''Analytic Combinatorics on Random Graphs''. In M. Dehmer and F. Emmert-Streib, editors, Analysis of Complex Networks, pages 425-448. Wiley-Blackwell, 2009.
  12. H. Fournier, D. Gardy, A. Genitrini, and B. Gittenberger. Complexity and limiting ratio of Boolean functions over implication. In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, volume 5162/2008 of Lecture Notes in Comput. Sci., pages 347-362. Springer, 2008. [pdf].
  13. M. Drmota, B. Gittenberger, and A. Panholzer. The degree distribution in thickened trees. In Proceedings of the 5th Colloquium of Mathematics and Computer Science, Discrete Math. Theor. Comput. Sci. Proc., AG, pages 153-166. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2008. [pdf].
  14. B. Gittenberger and J. Mandlburger. Hayman admissible functions in several variables. Electronic Journal of Combinatorics 13 (2006), Article 106, 29 pp. (electronic). [pdf].
  15. C. Banderier and B. Gittenberger. Analytic combinatorics of lattice paths: enumeration and asymptotics for the average area. In Proceedings of the 4th Colloquium of Mathematics and Computer Science, Discrete Math. Theor. Comput. Sci. Proc., AG, pages 345-355. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2006. [pdf].
  16. B. Gittenberger. Nodes of large degree in random trees and forests. Random Structures and Algorithms 28/3 (2006), 374-385. [pdf].
  17. B. Gittenberger and A. Panholzer. Some results for monotonically labelled simply generated trees. In 2005 International Conference on Analysis of Algorithms, Discrete Math. Theor. Comput. Sci. Proc., AD, pages 173-180. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2005. [pdf].
  18. B. Gittenberger. The profile of unlabeled trees. In 2005 International Conference on Analysis of Algorithms, Discrete Math. Theor. Comput. Sci. Proc., AD, pages 167-172. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2005. [pdf].
  19. M. Drmota, B. Gittenberger, and T. Klausner. Extended admissible functions and Gaussian limiting distributions. Mathematics of Computation 74 (2005), 1953-1966. [pdf].
  20. B. Chauvin, P. Flajolet, D. Gardy, and B. Gittenberger. And/or trees revisited. Combinatorics, Probability, and Computing 13 (2004), 475-497, special issue on analysis of algorithms. [pdf].
  21. M. Drmota and B. Gittenberger. The width of Galton-Watson trees conditioned by the size. Discrete Math. Theor. Comput. Sci. 6/2 (2004), 387-400 (electronic). [MR], [pdf].
  22. B. Gittenberger and G. Louchard. Reflected Brownian bridge local time conditioned on its local time at the origin. Statist. Probab. Lett. 68/1 (2004), 51-60. [MR], [pdf].
  23. M. Drmota, D. Gardy, and B. Gittenberger. General urn models with several types of balls and Gaussian limiting fields. Random Structures Algorithms 24/1 (2004), 75-103. [MR], [pdf].
  24. B. Gittenberger. A note on: ``State spaces of the snake and its tour-convergence of the discrete snake'' [J. Theoret. Probab. 16 (2003), no. 4, 1015-1046; [mr2033196] by J.-F. Marckert and A. Mokkadem. J. Theoret. Probab. 16/4 (2003), 1063-1067 (2004). [MR], [pdf].
  25. B. Gittenberger. On the profile of random forests. In Mathematics and computer science, II (Versailles, 2002), Trends Math., pages 279-293. Birkhäuser, Basel, 2002. [MR], [pdf].
  26. M. Drmota, D. Gardy, and B. Gittenberger. A unified presentation of some urn models. Algorithmica 29/1-2 (2001), 120-147, Average-case analysis of algorithms (Princeton, NJ, 1998). [MR], [pdf].
  27. B. Gittenberger and J. M. Thuswaldner. Asymptotic normality of b-additive functions on polynomial sequences in the Gaussian number field. J. Number Theory 84/2 (2000), 317-341. [MR], [pdf].
  28. B. Gittenberger. The number of descendants in simply generated random trees. In Mathematics and computer science (Versailles, 2000), Trends Math., pages 65-73. Birkhäuser, Basel, 2000. [MR], [pdf].
  29. B. Gittenberger and G. Louchard. On the local time density of the reflecting Brownian bridge. J. Appl. Math. Stochastic Anal. 13/2 (2000), 125-136. [MR], [pdf].
  30. B. Gittenberger and G. Louchard. The Brownian excursion multi-dimensional local time density. J. Appl. Probab. 36/2 (1999), 350-373. [MR], [pdf].
  31. B. Gittenberger. A note on a model in ruin theory using derivative securities. In Beiträge zur zahlentheoretischen Analysis, volume 338 of Grazer Math. Ber., pages 1-8. Karl-Franzens-Univ. Graz, Graz, 1999. [MR], [pdf].
  32. B. Gittenberger. On the contour of random trees. SIAM J. Discrete Math. 12/4 (1999), 434-458 (electronic). [MR], [pdf].
  33. M. Drmota and B. Gittenberger. Strata of random mappings-a combinatorial approach. Stochastic Process. Appl. 82/2 (1999), 157-171. [MR], [pdf].
  34. M. Drmota and B. Gittenberger. The distribution of nodes of given degree in random trees. J. Graph Theory 31/3 (1999), 227-253. [MR], [pdf].
  35. B. Gittenberger and J. M. Thuswaldner. The moments of the sum-of-digits function in number fields. Canad. Math. Bull. 42/1 (1999), 68-77. [MR], [pdf].
  36. B. Gittenberger. Convergence of branching processes to the local time of a Bessel process. In Proceedings of the Eighth International Conference ``Random Structures and Algorithms'' (Poznan, 1997), volume 13, pages 423-438, 1998. [MR], [pdf].
  37. B. Gittenberger. The dying Fibonacci tree. In Applications of Fibonacci numbers, Vol. 7 (Graz, 1996), pages 145-152. Kluwer Acad. Publ., Dordrecht, 1998. [MR], [pdf].
  38. B. Gittenberger. On the number of predecessors in constrained random mappings. Statist. Probab. Lett. 36/1 (1997), 29-34. [MR], [pdf].
  39. M. Drmota and B. Gittenberger. On the profile of random trees. Random Structures Algorithms 10/4 (1997), 421-451. [MR], [pdf].