Gittenberger, B., Gołębiewski, Z., Larcher, I., & Sulkowska, M. (2023). Protection numbers in simply generated trees and Pólya trees. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS. https://doi.org/10.2298/AADM190329010G ( reposiTUm)

Gittenberger, B., Gołębiewski, Z., Larcher, I., & Sulkowska, M. (2022). Counting Embeddings of Rooted Trees into Families of Rooted Trees. Electronic Journal of Combinatorics, 29(3), Article P3.52. https://doi.org/10.37236/10760 ( reposiTUm)

Fuchs, M., Mansouri, M., & Gittenberger, B. (2021). Counting phylogenetic networks with few reticulation vertices: exact enumeration and corrections. Australasian Journal of Combinatorics, 81(2), 257–282. http://hdl.handle.net/20.500.12708/138479 ( reposiTUm)

Bodini, O., Genitrini, A., Gittenberger, B., Larcher, I., & Naima, M. (2021). Compaction for two models of logarithmic‐depth trees: Analysis and experiments. Random Structures and Algorithms, 61(1), 31–61. https://doi.org/10.1002/rsa.21056 ( reposiTUm)

Genitrini, A., Gittenberger, B., Genitrini, A., Kauers, M., & Wallner, M. (2020). Asymptotic enumeration of compacted binary trees of bounded right height. Journal of Combinatorial Theory, Series A, 172, Article 105177. https://doi.org/10.1016/j.jcta.2019.105177 ( reposiTUm)

Gittenberger, B., Jin, E. Y., & Wallner, M. (2018). On the Shape of Random P’olya Structures. Discrete Mathematics, 341(4), 896–911. https://doi.org/10.1016/j.disc.2017.12.016 ( reposiTUm)

Bodini, O., Gardy, D., Gittenberger, B., & Golebiewski, Z. (2018). On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height. Annals of Combinatorics, 22, 45–91. https://doi.org/10.1007/s00026-018-0371-7 ( reposiTUm)

Collet, G., De Panafieu, E., Gardy, D., Gittenberger, B., & Ravelomanana, V. (2017). Threshold Functions for Small Subgraphs: an Analytic Approach. Electronic Notes in Discrete Mathematics, 61, 271–277. https://doi.org/10.1016/j.endm.2017.06.048 ( reposiTUm)

Genitrini, A., Gittenberger, B., Kraus, V., & Mailler, C. (2015). Associative and commutative tree representations for Boolean functions. Theoretical Computer Science, 570, 70–101. https://doi.org/10.1016/j.tcs.2014.12.025 ( reposiTUm)

Genitrini, A., Gittenberger, B., Kraus, V., & Mailler, C. (2014). Erratum to: Probabilities of Boolean functions given by random implicational formulas. Electronic Journal of Combinatorics, 19 (2), 6. http://hdl.handle.net/20.500.12708/157684 ( reposiTUm)

Genitrini, A., Gittenberger, B., & Mailler, C. (2014). No Shannon effect induced by And/Or trees. Discrete Mathematics & Theoretical Computer Science. http://hdl.handle.net/20.500.12708/168398 ( reposiTUm)

Bodini, O., Gardy, D., Gittenberger, B., & Jacquot, A. (2013). Enumeration of generalized BCI lambda-terms. Electronic Journal of Combinatorics, 20(4), 23. http://hdl.handle.net/20.500.12708/155801 ( reposiTUm)

Genitrini, A., Gittenberger, B., Kraus, V., & Mailler, C. (2012). Probabilities of Boolean functions given by random implicational formulas. Electronic Journal of Combinatorics, 19(2), 20. http://hdl.handle.net/20.500.12708/164030 ( reposiTUm)

Gittenberger, B., & Kraus, V. (2012). Degree profile of random Pólya trees. JOURNAL OF COMBINATORIAL THEORY SERIES A, 119(7), 1528–1557. https://doi.org/10.1016/j.jcta.2012.04.007 ( reposiTUm)

Fournier, H., Gardy, D., Genitrini, A., & Gittenberger, B. (2012). The fraction of large random trees representing a given Boolean function in implicational logic. RANDOM STRUCTURES & ALGORITHMS, 40(3), 317–349. http://hdl.handle.net/20.500.12708/163991 ( reposiTUm)

Drmota, M., & Gittenberger, B. (2010). The shape of unlabeled rooted random trees. European Journal of Combinatorics, 31(8), 2028–2063. https://doi.org/10.1016/j.ejc.2010.05.011 ( reposiTUm)

Drmota, M., Gittenberger, B., Panholzer, A., Prodinger, H., & Ward, M. D. (2009). On the shape of the fringe of various types of random trees. Mathematical Methods in the Applied Sciences, 32, 1207–1245. http://hdl.handle.net/20.500.12708/165681 ( reposiTUm)

Fournier, H., Gardy, D., Genitrini, A., & Gittenberger, B. (2008). Complexity and limiting ration of Boolean functions. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-85238-4 ( reposiTUm)

Gittenberger, B., & Mandlburger, J. (2006). Hayman admissible functions in several variables. Electronic Journal of Combinatorics, 13. http://hdl.handle.net/20.500.12708/172085 ( reposiTUm)

Gittenberger, B. (2006). Nodes of large degree in random trees and forests. Random Structures and Algorithms, 28(3), 374–385. http://hdl.handle.net/20.500.12708/172075 ( reposiTUm)

Drmota, M., Gittenberger, B., & Klausner, T. (2005). Extended Admissible Functions and Gaussian Limiting Distributions. Mathematics of Computation, 74(252), 1953–1966. http://hdl.handle.net/20.500.12708/171902 ( reposiTUm)

Agranat-Tamir, L., Fuchs, M., Gittenberger, B., & Rosenberg, N. (2024). Asymptotic enumeration of rooted binary unlabeled galled treeswith a fixed number of galls. In C. Mailler & S. Wild (Eds.), 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024) (pp. 1–14). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/lipics.aofa.2024.27 ( reposiTUm)

Asinowski, A., Bacher, A., Banderier, C., & Gittenberger, B. (2018). Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges’s Theorem. In J. A. Fill & M. D. Ward (Eds.), 29th International Conference on Probabilistic,  Combinatorial and Asymptotic Methods for the Analysis of Algorithms  (AofA 2018) (pp. 10:1-10:14). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.AofA.2018.10 ( reposiTUm)

Gittenberger, B., & Larcher, I. (2018). On the Number of Variables in Special Classes of Random Lambda-Terms. In J. A. Fill & M. D. Ward (Eds.), 29th International Conference on Probabilistic,  Combinatorial and Asymptotic Methods for the Analysis of Algorithms  (AofA 2018) (pp. 25:1-25:14). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.AofA.2018.25 ( reposiTUm)

Asinowski, A., Bacher, A., Banderier, C., & Gittenberger, B. (2018). Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. In Language and Automata Theory and Applications : 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings (pp. 195–206). Springer. https://doi.org/10.1007/978-3-319-77313-1_15 ( reposiTUm)

Gittenberger, B., Wallner, M., & Jin, Y. (2017). A note on the scaling limits of random Pólya trees. In 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974775.8 ( reposiTUm)

Gittenberger, B. (2016). On the number of Lambda terms with prescribed size of their De Bruijn representation. In 33rd Symposium on Theoretical Aspects of Computer Science (pp. 1–13). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). http://hdl.handle.net/20.500.12708/41504 ( reposiTUm)

Bodini, O., & Gittenberger, B. (2014). On the asymptotic number of BCK(2)-terms. In M. Drmota (Ed.), 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (pp. 25–39). SIAM - Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973204.3 ( reposiTUm)

Gittenberger, B., & Kraus, V. (2012). On the number of transversals in random trees. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12) (pp. 141–154). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41144 ( reposiTUm)

Drmota, M., Gittenberger, B., & Morgenbesser, J. (2012). Infinite systems of functional equations and Gaussian limiting distributions. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12) (pp. 453–478). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41145 ( reposiTUm)

Bodini, O., Gardy, D., & Gittenberger, B. (2011). Lambda-terms of bounded unary height. In 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (pp. 23–32). SIAM. http://hdl.handle.net/20.500.12708/41075 ( reposiTUm)

Kraus, V. (2010). Workshop on Dialogues, Inference, and Proof - Logical and Empirical Perspectives. In M. Drmota & B. Gittenberger (Eds.), 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10) (pp. 453–472). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41046 ( reposiTUm)

Genitrini, A., & Gittenberger, B. (2010). No Shannon effect on probability distributions on Boolean functions induced by random expressions. In 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10) (pp. 305–318). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40988 ( reposiTUm)

Drmota, M., Gittenberger, B., & Kutzelnigg, R. (2009). Combinatorial Models for Cooperation Networks. In Combinatorial Algorithms (pp. 206–217). Springer Verlag. https://doi.org/10.1007/978-3-642-10217-2_22 ( reposiTUm)

Drmota, M., Gittenberger, B., & Panholzer, A. (2008). The degree distriution of thickened trees. In Proceedings of the Fifth Colloquium on Mathematics and Computer Science (pp. 149–162). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40800 ( reposiTUm)

Banderier, C., & Gittenberger, B. (2006). Analytic combinatorics of lattice paths: enumeration and asymptotics for the area. In Proceedings of the 4th Colloquium of Mathematics and Computer Science (pp. 345–355). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40643 ( reposiTUm)

Gittenberger, B., & Panholzer, A. (2005). Some results for monotonically labelled simply generated trees. In International Conference on the Analysis (pp. 173–180). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40577 ( reposiTUm)

Gittenberger, B. (2005). The Profile of Unlabeled Trees. In International Conference on the Analysis of Algorithms (pp. 167–172). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40576 ( reposiTUm)

De Panafieu, E., Gardy, D., Gittenberger, B., & Kuba, M. (2014). Probabilities of 2-XOR functions. In A. Pardo & A. Viola (Eds.), LATIN 2014: Theoretical Informatics (pp. 454–465). Springer Verlag Berlin-Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_40 ( reposiTUm)

Drmota, M., & Gittenberger, B. (2009). Analytic combinatorics on random graphs. In M. Dehmer & F. Emmert-Streib (Eds.), Analysis of Complex Networks (pp. 425–448). Wiley-VCH. http://hdl.handle.net/20.500.12708/26367 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (Eds.). (2014). Mathematik für Informatik. Vierte erweiterte Auflage. Heldermann Verlag. http://hdl.handle.net/20.500.12708/23874 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2010). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/176068 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2007). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/22176 ( reposiTUm)

Drmota, M., & Gittenberger, B. (Eds.). (2010). Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/23237 ( reposiTUm)

Gittenberger, B., & Fuchs, M. (2023, August 22). On the Sackin index of galled trees [Conference Presentation]. ICIAM 2023, Tokyo, Japan. ( reposiTUm)

Gittenberger, B. (2023, September 8). The distribution of the Sackin index in galled trees [Presentation]. Workshop on Foundations of Phylogenetic Networks 2023, Singapore, Singapore. http://hdl.handle.net/20.500.12708/189854 ( reposiTUm)

Gittenberger, B., & Fuchs, M. (2023, September 4). Distributional properties of the Sackin index in galled trees [Conference Presentation]. One-Day Workshop on Combinatorial and Stochastic Phylogenetics 2023, Taipei, Taiwan (Province of China). ( reposiTUm)

Gittenberger, B., Genitrini, A., & Wallner, M. (2019). Asymptotic enumeration of compacted trees with bounded right height. Seminarvortrag, Regensburg, Germany. http://hdl.handle.net/20.500.12708/122973 ( reposiTUm)

Gittenberger, B. (2019). The location of variables in lambda-terms with bounded De Bruijn levels. SIAM Conf. on Applied Algebraic Geometry, Universität Bern, Switzerland. http://hdl.handle.net/20.500.12708/122974 ( reposiTUm)

Bacher, A., Banderier, C., Gittenberger, B., & Asinowski, A. (2018). Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges’s Theorem. 29th International Conference on Probalistic, Combinatorial and Asymptotic Methods for the the Analysis of Algorithms (AofA 2018), Uppsala, Sweden. http://hdl.handle.net/20.500.12708/122596 ( reposiTUm)

Gittenberger, B., Bodini, O., & Golebiewski, Z. (2018). The Number of Lambda-Terms with given De Bruijn Size. Joint FWF-MOST (Austrian-Taiwanese) Project, Hsinchu, Taiwan (Province of China). http://hdl.handle.net/20.500.12708/122589 ( reposiTUm)

Gittenberger, B. (2017). Enumerating Lambda Terms by Weighted length of their de Bruijn Representation. 10th Workshop on Computational Logic and Applications, Göteborg, Sweden. http://hdl.handle.net/20.500.12708/122130 ( reposiTUm)

Gittenberger, B. (2017). Enumeration of Unary-Binary Tree-like Structures with Restrictions on the Unary Height. National Chiao Tung University, Hsinchu, Taiwan (Province of China). http://hdl.handle.net/20.500.12708/122129 ( reposiTUm)

Gittenberger, B. (2017). Enumerating Lambda Terms by Weighted Length of their de Bruijn Respresentation. Conference on the Analysis of Algorithms (AofA), Princeton, United States of America (the). http://hdl.handle.net/20.500.12708/122131 ( reposiTUm)

Gittenberger, B. (2017). On the Enumeration of Compacted Trees. Symbolic Combinatorics Workshop at the SIAM Conference on Applied Algebraic Geometry, Atlanta, United States of America (the). http://hdl.handle.net/20.500.12708/122132 ( reposiTUm)

Gittenberger, B. (2017). Analytic Combinatorics: Complex-Analytic Methods and Applications. Workshop on Analytic and Enumerative Aspects of Combinatorics, Hsinchu, Taiwan (Province of China). http://hdl.handle.net/20.500.12708/122134 ( reposiTUm)

Wallner, M., Gittenberger, B., & Jin, E. Y. (2016). A note on the scaling limits of random Pólya trees. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/121641 ( reposiTUm)

Gittenberger, B. (2016). Analytic combinatorics of lambda terms. Université Paris XIII, Paris, France. http://hdl.handle.net/20.500.12708/121688 ( reposiTUm)

Gittenberger, B. (2016). Asymptotic enumeration of unary-binary-tree-like structures with restrictions on the unary height. CSASC 2016 Barcelona, Barcelona, Spain. http://hdl.handle.net/20.500.12708/121782 ( reposiTUm)

Gittenberger, B. (2016). On the number of lambda terms with prescribed size of their de Bruijn representation. 9th. Workshop on Computational Logic and Applications, Novi Sad, Serbia. http://hdl.handle.net/20.500.12708/121781 ( reposiTUm)

Wallner, M., Gittenberger, B., Kauers, M., & Genitrini, A. (2016). Compacted binary trees. SFB F50 Algorithmic and Enumerative Combinatorics status seminar, Strobl, Austria. http://hdl.handle.net/20.500.12708/121655 ( reposiTUm)

Gittenberger, B. (2015). Enumeration of lambda-terms with bounded unary height. 8th. Workshop on Computational Logic and Applications, Lyon, France. http://hdl.handle.net/20.500.12708/121200 ( reposiTUm)

Gittenberger, B. (2015). Enumeration of Compacted Binary Trees with Height Restrictions. ALEA in Europe Young Researchers’ Workshop, Bath, United Kingdom of Great Britain and Northern Ireland (the). http://hdl.handle.net/20.500.12708/122133 ( reposiTUm)

De Panafieu, E., Gardy, D., Gittenberger, B., & Mailler, C. (2014). Probabilities of 2-XOR-functions. LATIN 2014 - Latin American Theoretical Informatics Symposium, Montevideo, Uruguay. http://hdl.handle.net/20.500.12708/120902 ( reposiTUm)

Bodini, O., & Gittenberger, B. (2014). On the number of $BCK(2)$ lambda-terms. ANALCO 2014, Meeting on Analytic Algorithmics and Combinatorics, Portland, United States of America (the). http://hdl.handle.net/20.500.12708/120914 ( reposiTUm)

Gittenberger, B. (2014). On the number of unary-binary structures with bounded unary height. Workshop “Probability, Trees and Algorithms,” Oberwolfach, Germany. http://hdl.handle.net/20.500.12708/120900 ( reposiTUm)

Genitrini, A., Gittenberger, B., & Mailler, C. (2014). No Shannon effect induced by And/Or trees. AofA 2014, Paris, France. http://hdl.handle.net/20.500.12708/120901 ( reposiTUm)

Gittenberger, B. (2013). Enumeration of generalized BCI lambda-terms. 18th ÖMG Congress and Annual DMV Meeting, Universität Innsbruck, Austria. http://hdl.handle.net/20.500.12708/120422 ( reposiTUm)

Gittenberger, B. (2013). Associative and commutative tree representations for Boolean functions. CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference, St. Johns, Canada. http://hdl.handle.net/20.500.12708/120418 ( reposiTUm)

Gittenberger, B. (2013). Infinite dimensional Gaussian limiting distributions in combinatorics. Combinatorial Probability and Statistical Mechanics Workshop, London, United Kingdom of Great Britain and Northern Ireland (the). http://hdl.handle.net/20.500.12708/120324 ( reposiTUm)

Gittenberger, B. (2013). Associative and commutative tree representations for Boolean functions. 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013, Cala Galdana, Menorca, Spain. http://hdl.handle.net/20.500.12708/120416 ( reposiTUm)

Gittenberger, B. (2013). Infinite dimensional Gaussian limiting distributions in combinatorial enumeration problems. Journées Boole, Université Pierre et Marie Curie, Paris, France. http://hdl.handle.net/20.500.12708/120421 ( reposiTUm)

Gittenberger, B. (2013). Fonctions booléennes aléatoires générées par expressions booléennes aléatores. Université Paris XIII, Paris, France. http://hdl.handle.net/20.500.12708/120425 ( reposiTUm)

Gittenberger, B. (2012). Infinite dimensional Gaussian limiting distributions in combinatorics. Kolloquium über Kombinatorik , KolKom 2012, Berlin, Germany, EU. http://hdl.handle.net/20.500.12708/120103 ( reposiTUm)

Gittenberger, B. (2012). Infinite systems of functional equations and Gaussion limiting distributions. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/120102 ( reposiTUm)

Gittenberger, B. (2012). The degree profile of random Pólya trees. Boole Meeting, Université de Caen, Caen, France, EU. http://hdl.handle.net/20.500.12708/120100 ( reposiTUm)

Gittenberger, B. (2012). Some shape characteristics of random Pólya trees. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/120099 ( reposiTUm)

Gittenberger, B. (2012). Infinite systems of functional equations and Gaussion limiting distributions. 23rd International Meeting on Probablilistic Combinatorial, and Asymptotiv Methods in the Analysis of Algorithms, AofA2012, Montreal, Canada. http://hdl.handle.net/20.500.12708/120101 ( reposiTUm)

Gittenberger, B. (2011). Enumeration of generalized BCI λ terms. Combinatorics Conference in Lisboa (CCL 2011), Lissabon, Portugal, EU. http://hdl.handle.net/20.500.12708/119803 ( reposiTUm)

Gittenberger, B. (2011). Boolean functions in the implicational fragment: On the number of Boolean expressions and its relation to the function complexity. ÖMG-Tagung-CSASC 2011, Krems, Austria. http://hdl.handle.net/20.500.12708/119808 ( reposiTUm)

Gittenberger, B. (2011). On the complexity of Boolean functions represented by trees in implicational logic. The 15th International Conference on RANDOM STRUCTURES AND ALGORITHMS, Atlanta, USA, Non-EU. http://hdl.handle.net/20.500.12708/119790 ( reposiTUm)

Gittenberger, B. (2011). Enumeration of generalized BCI λ terms. AofA 2011 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Bedlewo, Poland, EU. http://hdl.handle.net/20.500.12708/119792 ( reposiTUm)

Gittenberger, B. (2011). Quantitative logic, enriched trees, and enumeration. INRIA, Rocquencourt, Austria. http://hdl.handle.net/20.500.12708/119795 ( reposiTUm)

Gittenberger, B. (2011). Enumeration of generalized BCI λ terms. Kolloquium über Kombinatorik KolKom 2011, Magdeburg, Germany, EU. http://hdl.handle.net/20.500.12708/119813 ( reposiTUm)

Gittenberger, B. (2010). On the complexity of Boolean functions represented by trees in implicational logic. Colloquium on Combinatorics, Saarbrücken, Germany, EU. http://hdl.handle.net/20.500.12708/119479 ( reposiTUm)

Gittenberger, B. (2009). Observations and conjectures on the enumeration of lambda-terms. Workshop on Lambda Terms and Logic, Lyon, France, EU. http://hdl.handle.net/20.500.12708/119304 ( reposiTUm)

Gittenberger, B. (2009). On the moments of the area below lattice paths. 20th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, A0fA 09, Frejus, France, EU. http://hdl.handle.net/20.500.12708/119302 ( reposiTUm)

Gittenberger, B. (2009). Combinatorial models for cooperation networks. 20th International Workshop on Combinatorial Algorithms (IWOCA) 2009, Hradec nad Moravicí, Czech Republic, EU. http://hdl.handle.net/20.500.12708/119303 ( reposiTUm)

Gittenberger, B. (2008). The shape of unlabeled rooted trees. 2008 International Conference on the Analysis of Algorithms (AofA2008), Maresias, Brazil, Non-EU. http://hdl.handle.net/20.500.12708/118718 ( reposiTUm)

Gittenberger, B. (2008). The degree distribution of thickened trees. 5th Colloquium on Mathematics and Computer Science, Blaubeuren, Germany, EU. http://hdl.handle.net/20.500.12708/118719 ( reposiTUm)

Gittenberger, B. (2008). Thickened trees - a new model for complex networks. Université Versailles, Versailles, France, EU. http://hdl.handle.net/20.500.12708/118720 ( reposiTUm)

Gittenberger, B. (2007). Hayman-admissible functions in several variables. Slovak-Austrian Mathematical Congress 2007, Podbanske, Slovakia, EU. http://hdl.handle.net/20.500.12708/118234 ( reposiTUm)

Gittenberger, B. (2007). The shape of Polya trees. Conference on Enumeration and Probabilistic Methods in Combinatorics, Barcelona, Spain, EU. http://hdl.handle.net/20.500.12708/118372 ( reposiTUm)

Gittenberger, B. (2007). A generation functions approach for satisfiable expressions. Workshop on Computational Logic and Applications, Krakow, Poland, EU. http://hdl.handle.net/20.500.12708/118373 ( reposiTUm)

Gittenberger, B. (2007). The degree distribution of thickened trees. Workshop on Network Formation Rules, ARC Systems Research, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118374 ( reposiTUm)

Gittenberger, B. (2007). A generating functions approach for satisfiable expressions. Journee Arbres Aleatoire et Algorithmes, Versailles, France, Austria. http://hdl.handle.net/20.500.12708/118375 ( reposiTUm)

Gittenberger, B. (2006). Extended admissible functions. Axiom Workshop 2006, RISC, RISC Hagenberg, Austria, Austria. http://hdl.handle.net/20.500.12708/117916 ( reposiTUm)

Gittenberger, B. (2006). Enumeration and asymptotics for the area of lattice paths. 4th Colloquium on Mathematics and Computer Science, Nancy, France, EU. http://hdl.handle.net/20.500.12708/117918 ( reposiTUm)

Gittenberger, B. (2006). Hayman-admissible functions in several variables. 12th Seminar on the Analysis of Algorithms, Alden Biesen, Belgien, EU. http://hdl.handle.net/20.500.12708/117917 ( reposiTUm)

Gittenberger, B. (2006). On generalizations of Hayman admissibility. University of Stellenbosch, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/117919 ( reposiTUm)

Gittenberger, B. (2005). The profile of unlabeled trees. International Conference on the Analysis of Algorithms 2005, Barcelona, Spain. http://hdl.handle.net/20.500.12708/117576 ( reposiTUm)

Gittenberger, B. (2005). The number of nodes of large degree in random trees. Journee Arbres Aleatoire et Algorithmes, Versailles, France, Austria. http://hdl.handle.net/20.500.12708/117575 ( reposiTUm)

Gittenberger, B. (2005). Die Anzahl der Knoten großen Grades in Zufallsbäumen. 16. ÖMG Kongreß, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/117577 ( reposiTUm)

Gittenberger, B. (2004). Infinite Systems of Functional Equations and Gaussian Limiting Distributions. 10th Seminar on Analysis of Algorithms, Berkeley, USA, Austria. http://hdl.handle.net/20.500.12708/117268 ( reposiTUm)

Gittenberger, B. (2002). The profile of random forests and conditioned Brownian bridge local time. Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Versailles, Frankreich, Austria. http://hdl.handle.net/20.500.12708/116135 ( reposiTUm)

Gittenberger, B. (2002). The profile of random forests. 8th Seminar on Analysis of Algorithms, Strobl, Austria, Austria. http://hdl.handle.net/20.500.12708/116134 ( reposiTUm)

Gittenberger, B. (2001). Asymptotic distributions for characteristics of Random Trees, forests and mappings [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179038 ( reposiTUm)