Publikationsliste für
Bernhard Gittenberger
als Autorin / Autor bzw. wesentlich beteiligte Person
126 Datensätze (2002 - 2021)
Bücher und Buch-Herausgaben
M. Drmota, P. Flajolet, D. Gardy, B. Gittenberger (Hrg.):
"Mathematics and Computer Science III";
Birkhäuser,
2004,
ISBN: 3-7643-7128-5.
M. Drmota, B. Gittenberger (Hrg.):
"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,
2010,
602 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2007,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2010,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer (Hrg.):
"Mathematik für Informatik. Vierte erweiterte Auflage";
Heldermann Verlag,
2014,
ISBN: 978-3-88538-117-4;
470 S.
Zeitschriftenartikel
A. Asinowski, A. Bacher, C. Banderier, B. Gittenberger:
"Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata";
Algorithmica,
82
(2020),
3;
S. 386
- 428.
O. Bodini, D. Gardy, B. Gittenberger, A. Jacquot:
"Enumeration of generalized BCI lambda-terms.";
Electronic Journal of Combinatorics,
20
(2013),
4;
23 S.
O. Bodini, A. Genitrini, B. Gittenberger, S. Wagner:
"On the number of increasing trees with label repetitions";
Discrete Mathematics,
343
(2020),
8;
12 S.
O. Bodini, B. Gittenberger, Z. Golebiewski:
"Enumerating Lambda Terms by Weighted Length of their De Bruijn Representation";
Discrete Applied Mathematics,
239
(2018),
S. 45
- 61.
B. Chauvin, P. Flajolet, D. Gardy, B. Gittenberger:
"And/Or trees revisited";
Combinatorics, Probability and Computing,
13
(2004),
S. 475
- 497.
G. Collet, E. De Panafieu, D. Gardy, B. Gittenberger, V. Ravelomanana:
"Threshold functions for small subgraphs in simple graphs and multigraphs";
European Journal of Combinatorics,
88
(2020),
103113;
44 S.
V. Daxner, A. Genitrini, B. Gittenberger, C. Mailler:
"The relation between tree size complexity and probability for Boolean functions generated by uniform random trees";
Applicable Analysis and Discrete Mathematics,
10
(2016),
S. 408
- 446.
Zusätzliche Informationen
E. De Panafieu, D. Gardy, B. Gittenberger, M. Kuba:
"2-XOR revisited: satisfiability and probabilities of functions";
Algorithmica,
76
(2016),
4;
S. 1035
- 1076.
Zusätzliche Informationen
M. Drmota, D. Gardy, B. Gittenberger:
"General urn models with several types of balls and Gaussian limiting fields";
Random Structures and Algorithms,
24/1
(2004),
S. 75
- 103.
M. Drmota, B. Gittenberger:
"The shape of unlabeled rooted random trees";
European Journal of Combinatorics,
31
(2010),
S. 2028
- 2063.
M. Drmota, B. Gittenberger:
"The width of Galton-Watson trees conditioned by the size";
Discrete Mathematics & Theoretical Computer Science,
6/2
(2004),
S. 387
- 400.
M. Drmota, B. Gittenberger, T. Klausner:
"Extended Admissible Functions and Gaussian Limiting Distributions";
Mathematics of Computation,
74
(2005),
252;
S. 1953
- 1966.
M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger, M. Ward:
"On the shape of the fringe of various types of random trees";
Mathematical Methods in the Applied Sciences,
32
(2009),
S. 1207
- 1245.
H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger:
"Complexity and limiting ration of Boolean functions";
Lecture Notes in Computer Science,
5162
(2008),
S. 347
- 362.
H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger:
"The fraction of large random trees representing a given Boolean function in implicational logic";
Random Structures and Algorithms,
40
(2012),
3;
S. 317
- 349.
M. Fuchs, B. Gittenberger, M. Mansouri:
"Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks.";
Australasian Journal of Combinatorics,
73
(2019),
2;
S. 385
- 423.
M. Fuchs, M. Mansouri, B. Gittenberger:
"Counting phylogenetic networks with few reticulation vertices: exact enumeration and corrections.";
Australasian Journal of Combinatorics,
81
(2021),
2;
S. 257
- 282.
D. Gardy, O. Bodini, B. Gittenberger, Z. Golebiewski:
"On the Number of Unary-Binary Tree-like Structures with Restrictions on the Unary Height.";
Annals Of Combinatorics,
22
(2018),
1;
S. 45
- 91.
Zusätzliche Informationen
A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler:
"Associative and commutative tree representations for Boolean functions";
Theoretical Computer Science,
570
(2015),
S. 70
- 101.
Zusätzliche Informationen
A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler:
"Erratum to: Probabilities of Boolean functions given by random implicational formulas";
Electronic Journal of Combinatorics,
19 (2)
(2014),
S. 6.
Zusätzliche Informationen
A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler:
"Probabilities of Boolean functions given by random implicational formulas";
Electronic Journal of Combinatorics,
19
(2012),
2;
20 S.
B. Gittenberger:
"A note on State spaces of the snake and its tour - Convergence of the discrete snake by J.-F. Marckert and A Mokkadem";
Journal of Theoretical Probability,
16
(2003),
4;
S. 1063
- 1067.
B. Gittenberger:
"Nodes of large degree in random trees and forests";
Random Structures and Algorithms,
28
(2006),
3;
S. 374
- 385.
B. Gittenberger, G. Collet, E. De Panafieu, D. Gardy:
"Threshold Functions for Small Subgraphs: an Analytic Approach";
Electronic Notes in Discrete Mathematics,
61
(2017),
S. 271
- 277.
B. Gittenberger, E. Jin, M. Wallner:
"On the Shape of Random P'olya Structures";
Discrete Mathematics,
341
(2018),
4;
S. 896
- 911.
Zusätzliche Informationen
B. Gittenberger, V. Kraus:
"Degree profile of random Pólya trees";
Journal of Combinatorial Theory Series A,
119
(2012),
7;
S. 1528
- 1557.
B. Gittenberger, I. Larcher:
"Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels.";
Electronic Journal of Combinatorics,
26
(2019),
4;
S. 1
- 44.
B. Gittenberger, G. Louchard:
"Reflected Brownian bridge local time conditioned on its local time at the origin";
Statistics & Probability Letters,
68/1
(2004),
S. 51
- 60.
B. Gittenberger, J. Mandlburger:
"Hayman admissible functions in several variables";
Electronic Journal of Combinatorics,
13
(2006).
M. Wallner, B. Gittenberger, A. Genitrini, M. Kauers:
"Asymptotic Enumeration of Compacted Binary Trees of Bounded Right Height";
Journal of Combinatorial Theory Series A,
172
(2020),
105177.
Zusätzliche Informationen
Buchbeiträge
E. De Panafieu, D. Gardy, B. Gittenberger, M. Kuba:
"Probabilities of 2-XOR functions";
in: "LATIN 2014: Theoretical Informatics",
A. Pardo, A. Viola (Hrg.);
Springer Verlag Berlin-Heidelberg,
Berlin-Heidelberg, Germany,
2014,
ISBN: 978-3-642-54422-4,
S. 454
- 465.
Zusätzliche Informationen
M. Drmota, B. Gittenberger:
"Analytic combinatorics on random graphs";
in: "Analysis of Complex Networks",
M. Dehmer, F. Emmert-Streib (Hrg.);
Wiley-VCH,
2009,
ISBN: 978-3-527-32345-6,
S. 425
- 448.
Beiträge in Tagungsbänden
A. Asinowski, A. Bacher, C. Banderier, B. Gittenberger:
"Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem";
in: "Leibniz International Proceedings in Informatics 110 - AofA 2018",
110;
herausgegeben von: Schloss Dagstuhl;
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs),
2018,
S. 1
- 14.
A. Asinowski, A. Bacher, C. Banderier, B. Gittenberger:
"Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects";
in: "Language and Automata Theory and Applications, 12th International Conference",
10792;
herausgegeben von: Lecture Notes in Computer Science;
Springer,
2018,
S. 195
- 206.
C. Banderier, B. Gittenberger:
"Analytic combinatorics of lattice paths: enumeration and asymptotics for the area";
in: "Proceedings of the 4th Colloquium of Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
Nancy,
2006,
S. 345
- 355.
O. Bodini, D. Gardy, B. Gittenberger:
"Lambda-terms of bounded unary height";
in: "2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)",
SIAM,
2011,
S. 23
- 32.
O. Bodini, B. Gittenberger:
"On the number of $BCK(2)$ lambda-terms";
in: "Proceedings of the 11th Workshop on Analytic Algorithmics and Combinatorics",
herausgegeben von: ANALCO 14, Curran Associates Inc.;
SIAM - Society for Industrial and Applied Mathematics,
Philadelphia, USA,
2014,
ISBN: 978-1-62993-957-5,
S. 25
- 39.
M. Drmota, B. Gittenberger, R. Kutzelnigg:
"Combinatorial models for cooperation network";
in: "Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers (LNCS 5874/2009)",
Springer Verlag,
2009,
ISBN: 978-3-642-10216-5,
S. 206
- 217.
M. Drmota, B. Gittenberger, J. Morgenbesser:
"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)",
Discrete Mathematics and Theoretical Computer Science,
2012,
S. 453
- 478.
M. Drmota, B. Gittenberger, A. Panholzer:
"The degree distriution of thickened trees";
in: "Proceedings of the Fifth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
2008,
S. 149
- 162.
A. Genitrini, B. Gittenberger:
"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)",
Discrete Mathematics and Theoretical Computer Science,
2010,
ISSN: 1365-8050,
S. 305
- 318.
B. Gittenberger:
"On the number of Lambda terms with prescribed size of their De Bruijn representation";
in: "33rd Symposium on Theoretical Aspects of Computer Science",
40;
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs),
2016,
S. 1
- 13.
Zusätzliche Informationen
B. Gittenberger:
"On the Profile of Random Forests";
in: "Trends in Mathematics",
B. Chauvin, P. Flajolet, D. Gardy, A. Mokkadem (Hrg.);
Birkhäuser,
2002,
S. 279
- 293.
B. Gittenberger:
"The Profile of Unlabeled Trees";
in: "International Conference on the Analysis of Algorithms",
Discrete Mathematics and Theoretical Computer Science,
2005,
S. 167
- 172.
B. Gittenberger, V. Kraus:
"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)",
Discrete Mathematics and Theoretical Computer Science,
2012,
S. 141
- 154.
B. Gittenberger, I. Larcher:
"On the Number of Variables in Special Classes of Random Lambda-Terms";
in: "Leibniz International Proceedings in Informatics 110 - AofA 2018",
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs),
2018,
S. 1
- 14.
B. Gittenberger, A. Panholzer:
"Some results for monotonically labelled simply generated trees";
in: "International Conference on the Analysis",
Discrete Mathematics and Theoretical Computer Science,
2005,
S. 173
- 180.
B. Gittenberger, M. Wallner, Y. Jin:
"A note on the scaling limits of random Pólya trees";
in: "Proceedings of the Meeting on Analytical Algorithms and Combinatorics ANALCO 2017",
SIAM Society for Industrial and Applied Mathematics,
Barcelona,
2017,
S. 85
- 93.
Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag)
A. Bacher, C. Banderier, B. Gittenberger, A. Asinowski:
"Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem";
Vortrag: 29th International Conference on Probalistic, Combinatorial and Asymptotic Methods for the the Analysis of Algorithms (AofA 2018),
Uppsala, Schweden;
25.06.2018
- 29.06.2018.
O. Bodini, B. Gittenberger:
"On the number of $BCK(2)$ lambda-terms";
Vortrag: ANALCO 2014, Meeting on Analytic Algorithmics and Combinatorics,
Portland, USA;
05.01.2014
- 07.01.2014.
E. De Panafieu, D. Gardy, B. Gittenberger, C. Mailler:
"Probabilities of 2-XOR-functions";
Vortrag: LATIN 2014 - Latin American Theoretical Informatics Symposium,
Montevideo, Uruguay;
31.03.2014
- 04.04.2014.
A. Genitrini, B. Gittenberger, C. Mailler:
"No Shannon effect induced by And/Or trees";
Vortrag: AofA 2014,
Paris, France;
16.06.2014
- 20.06.2014.
B. Gittenberger:
"A generating functions approach for satisfiable expressions";
Vortrag: Journee Arbres Aleatoire et Algorithmes,
Versailles, France;
03.12.2007.
B. Gittenberger:
"A generation functions approach for satisfiable expressions";
Vortrag: Workshop on Computational Logic and Applications,
Krakow, Poland;
24.09.2007
- 25.09.2007.
B. Gittenberger:
"Analytic combinatorics of lambda terms";
Vortrag: Université Paris XIII,
Villetaneuse;
17.05.2016.
B. Gittenberger:
"Analytic Combinatorics: Complex-Analytic Methods and Applications";
Vortrag: Workshop on Analytic and Enumerative Aspects of Combinatorics,
Hsinchu, Taiwan (eingeladen);
27.10.2017
- 29.10.2017.
B. Gittenberger:
"Associative and commutative tree representations for Boolean functions";
Vortrag: 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013,
Cala Galdana, Menorca;
27.05.2013
- 31.05.2013.
B. Gittenberger:
"Associative and commutative tree representations for Boolean functions";
Vortrag: CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference,
St. Johns, Newfoundland;
10.06.2013
- 13.06.2013.
B. Gittenberger:
"Asymptotic enumeration of unary-binary-tree-like structures with restrictions on the unary height";
Vortrag: CSASC 2016 Barcelona,
Barcelona, Spain;
20.09.2016
- 23.09.2016.
B. Gittenberger:
"Boolean functions in the implicational fragment: On the number of Boolean expressions and its relation to the function complexity";
Vortrag: ÖMG-Tagung-CSASC 2011,
Krems;
25.09.2011
- 28.09.2011.
B. Gittenberger:
"Combinatorial models for cooperation networks";
Vortrag: 20th International Workshop on Combinatorial Algorithms (IWOCA) 2009,
Hradec nad Moravicí, Czech Republic;
29.06.2009
- 02.07.2009.
B. Gittenberger:
"Die Anzahl der Knoten großen Grades in Zufallsbäumen";
Vortrag: 16. ÖMG Kongreß,
Klagenfurt, Austria;
18.09.2005
- 23.09.2005.
B. Gittenberger:
"Enumerating Lambda Terms by Weighted length of their de Bruijn Representation";
Vortrag: 10th Workshop on Computational Logic and Applications,
Göteborg, Schweden;
18.05.2017
- 19.05.2017.
B. Gittenberger:
"Enumerating Lambda Terms by Weighted Length of their de Bruijn Respresentation";
Vortrag: Conference on the Analysis of Algorithms (AofA),
Princeton, USA (eingeladen);
19.06.2017
- 23.06.2017.
B. Gittenberger:
"Enumeration and asymptotics for the area of lattice paths";
Vortrag: 4th Colloquium on Mathematics and Computer Science,
Nancy, France;
18.09.2006
- 22.09.2006.
B. Gittenberger:
"Enumeration of Compacted Binary Trees with Height Restrictions";
Vortrag: ALEA in Europe Young Researchers' Workshop,
TU Wien;
09.12.2015
- 11.12.2015.
B. Gittenberger:
"Enumeration of generalized BCI λ terms";
Vortrag: AofA 2011 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms,
Bedlewo, Poland;
12.06.2011
- 18.06.2011.
B. Gittenberger:
"Enumeration of generalized BCI λ terms";
Vortrag: Combinatorics Conference in Lisboa (CCL 2011),
Lissabon, Portugal;
11.07.2011
- 15.07.2011.
B. Gittenberger:
"Enumeration of generalized BCI λ terms";
Vortrag: Kolloquium über Kombinatorik KolKom 2011,
Magdeburg, Germany;
11.11.2011
- 12.11.2011.
B. Gittenberger:
"Enumeration of generalized BCI lambda-terms";
Vortrag: 18th ÖMG Congress and Annual DMV Meeting,
Innsbruck;
23.09.2013
- 27.09.2013.
B. Gittenberger:
"Enumeration of lambda-terms with bounded unary height";
Vortrag: 8th. Workshop on Computational Logic and Applications,
Lyon, Frankreich (eingeladen);
23.03.2015
- 24.03.2015.
B. Gittenberger:
"Enumeration of Unary-Binary Tree-like Structures with Restrictions on the Unary Height";
Vortrag: National Chiao Tung University,
National Chiao Tung University, Hsinchu 300, Taiwan;
21.02.2017.
B. Gittenberger:
"Extended admissible functions";
Vortrag: Axiom Workshop 2006, RISC,
RISC Hagenberg, Austria;
28.04.2006.
B. Gittenberger:
"Fonctions booléennes aléatoires générées par expressions booléennes aléatores";
Vortrag: Université Paris XIII,
Villetaneuse, France;
29.10.2013.
B. Gittenberger:
"Hayman-admissible functions in several variables";
Vortrag: 12th Seminar on the Analysis of Algorithms,
Alden Biesen, Belgien;
02.07.2006
- 08.07.2006.
B. Gittenberger:
"Hayman-admissible functions in several variables";
Vortrag: Slovak-Austrian Mathematical Congress 2007,
Podbanske, Slovakia;
16.09.2007
- 21.09.2007.
B. Gittenberger:
"Infinite dimensional Gaussian limiting distributions in combinatorial enumeration problems";
Vortrag: Journées Boole, Université Pierre et Marie Curie,
Paris, France;
19.06.2013
- 21.06.2013.
B. Gittenberger:
"Infinite dimensional Gaussian limiting distributions in combinatorics";
Vortrag: Kolloquium über Kombinatorik , KolKom 2012,
Berlin, Germany;
16.11.2012
- 17.11.2012.
B. Gittenberger:
"Infinite dimensional Gaussian limiting distributions in combinatorics";
Vortrag: Combinatorial Probability and Statistical Mechanics Workshop,
London;
21.02.2013
- 23.02.2013.
B. Gittenberger:
"Infinite Systems of Functional Equations and Gaussian Limiting Distributions";
Vortrag: 10th Seminar on Analysis of Algorithms,
Berkeley, USA;
14.06.2004
- 18.06.2004.
B. Gittenberger:
"Infinite systems of functional equations and Gaussion limiting distributions";
Vortrag: 23rd International Meeting on Probablilistic Combinatorial, and Asymptotiv Methods in the Analysis of Algorithms, AofA2012,
Montreal, Canada;
18.06.2012
- 22.06.2012.
B. Gittenberger:
"Infinite systems of functional equations and Gaussion limiting distributions";
Vortrag: Université Paris XIII,
Villetaneuse, France;
25.09.2012.
B. Gittenberger:
"Observations and conjectures on the enumeration of lambda-terms";
Vortrag: Workshop on Lambda Terms and Logic,
Lyon, France;
17.11.2009
- 18.11.2009.
B. Gittenberger:
"On generalizations of Hayman admissibility";
Vortrag: University of Stellenbosch,
Stellenbosch. South Africa;
04.10.2006.
B. Gittenberger:
"On the complexity of Boolean functions represented by trees in implicational logic";
Vortrag: Colloquium on Combinatorics,
Saarbrücken, Germany;
12.11.2010
- 13.11.2010.
B. Gittenberger:
"On the complexity of Boolean functions represented by trees in implicational logic";
Vortrag: The 15th International Conference on RANDOM STRUCTURES AND ALGORITHMS,
Atlanta, USA;
24.05.2011
- 28.05.2011.
B. Gittenberger:
"On the Enumeration of Compacted Trees";
Vortrag: Symbolic Combinatorics Workshop at the SIAM Conference on Applied Algebraic Geometry,
Atlanta, USA (eingeladen);
31.07.2017
- 04.08.2017.
B. Gittenberger:
"On the moments of the area below lattice paths";
Vortrag: 20th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, A0fA 09,
Frejus, France;
14.06.2009
- 19.06.2009.
B. Gittenberger:
"On the number of lambda terms with prescribed size of their de Bruijn representation";
Vortrag: 9th. Workshop on Computational Logic and Applications,
Novi Sad;
26.05.2016
- 27.05.2016.
B. Gittenberger:
"On the number of unary-binary structures with bounded unary height";
Vortrag: Workshop "Probability, Trees and Algorithms",
Oberwolfach, Germany (eingeladen);
02.11.2014
- 08.11.2014.
B. Gittenberger:
"Quantitative logic, enriched trees, and enumeration";
Vortrag: INRIA,
Lille, France;
01.07.2011.
B. Gittenberger:
"Some shape characteristics of random Pólya trees";
Vortrag: Université Paris XIII,
Villetaneuse, France;
15.05.2012.
B. Gittenberger:
"The degree distribution of thickened trees";
Vortrag: Workshop on Network Formation Rules,
ARC Systems Research, Wien, Austria;
14.11.2007
- 15.11.2007.
B. Gittenberger:
"The degree distribution of thickened trees";
Vortrag: 5th Colloquium on Mathematics and Computer Science,
Blaubeuren, Germany;
22.09.2008
- 26.09.2008.
B. Gittenberger:
"The degree profile of random Pólya trees";
Vortrag: Boole Meeting, Université de Caen,
Caen, France;
29.05.2012
- 31.05.2012.
B. Gittenberger:
"The location of variables in lambda-terms with bounded De Bruijn levels";
Vortrag: SIAM Conf. on Applied Algebraic Geometry,
Universität Bern;
09.07.2019
- 13.07.2019.
B. Gittenberger:
"The number of nodes of large degree in random trees";
Vortrag: Journee Arbres Aleatoire et Algorithmes,
Versailles, France (eingeladen);
14.04.2005.
B. Gittenberger:
"The profile of random forests";
Vortrag: 8th Seminar on Analysis of Algorithms,
Strobl;
24.06.2002
- 29.06.2002.
B. Gittenberger:
"The profile of random forests and conditioned Brownian bridge local time";
Vortrag: Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities,
Versailles, Frankreich;
16.09.2002
- 19.09.2002.
B. Gittenberger:
"The profile of unlabeled trees";
Vortrag: International Conference on the Analysis of Algorithms,
Barcelona, Spain;
06.06.2005
- 10.06.2005.
B. Gittenberger:
"The shape of Polya trees";
Vortrag: Conference on Enumeration and Probabilistic Methods in Combinatorics,
Barcelona, Spain;
25.06.2007
- 29.06.2007.
B. Gittenberger:
"The shape of unlabeled rooted trees";
Vortrag: 2008 International Conference on the Analysis of Algorithms (AofA2008),
Maresias, Brazil (eingeladen);
12.04.2008
- 18.04.2008.
B. Gittenberger:
"Thickened trees - a new model for complex networks";
Vortrag: Université Versailles,
Versailles, France (eingeladen);
09.10.2008.
B. Gittenberger, O. Bodini, Z. Golebiewski:
"The Number of Lambda-Terms with given De Bruijn Size";
Vortrag: Joint FWF-MOST (Austrian-Taiwanese) Project,
National Chiao Tung University, Hsinchu, Taiwan (eingeladen);
27.03.2018.
B. Gittenberger, A. Genitrini, M. Wallner:
"Asymptotic enumeration of compacted trees with bounded right height";
Vortrag: Seminarvortrag,
National Taiwan University, Taipeh (eingeladen);
19.04.2019.
M. Wallner, B. Gittenberger, E. Jin:
"A note on the scaling limits of random Pólya trees";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien;
22.11.2016.
M. Wallner, B. Gittenberger, M. Kauers, A. Genitrini:
"Compacted binary trees";
Vortrag: SFB F50 Algorithmic and Enumerative Combinatorics status seminar,
Strobl (eingeladen);
27.11.2016
- 30.11.2016.
Dissertationen (eigene und begutachtete)
I. Larcher:
"Parameter studies on random trees and lambda terms";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, O. Bodini, M. Noy;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 12.06.2020.
J. Mandlburger:
"Die multivariate Sattelpunktmethode und Anwendungen in der abzählbaren Kombinatorik";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2006.
M. Mansouri:
"Combinatorial properties of phylogenetic networks";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, M. Drmota, H. Hwang;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 09.06.2020.
Zusätzliche Informationen
V. Roitner:
"Studies on several parameters in lattice paths";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, C. Banderier, A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 19.11.2020.
Zusätzliche Informationen
M. Wallner:
"Analytic Combinatorics of Lattice Paths and Tree-Like Structures";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2016.
M. Wallner:
"Combinatorics of Lattice Paths and Tree-like Objects";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, M. Drmota;
Institut für Diskrete Mathematik und Geometrie,
2017.
Zusätzliche Informationen
Diplom- und Master-Arbeiten (eigene und betreute)
G. Dürnle:
"Kombinatorik der Mustervermeidung in Permutationen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2018;
Abschlussprüfung: 11.05.2018.
T. Feierl:
"Hayman admissible functions and generalisations with applications in combinatorics";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2005.
M. Grossauer:
"Kombinatorik linearer Erweiterungen von endlichen Halbordnungen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2020;
Abschlussprüfung: 24.11.2020.
A. Januskovecz:
"Pólyasche Abzähltheorie und Anwendungen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2017.
I. Larcher:
"Enumeration of Lambda-Terms and Directed Acyclic Graphs";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2016.
N. Meyer:
"Vergleich von einfach erzeugten Bäumen und Pólyabäumen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2020;
Abschlussprüfung: 25.11.2020.
C. Ringelhahn:
"Boltzmann-Sampling von kombinatorischen Strukturen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2017.
G. Sedlitz:
"Abzählung von Automaten, formalen Sprachen und verwandten Strukturen";
Betreuer/in(nen): B. Gittenberger;
Institut für Diskrete Mathematik und Geometrie,
2017.
