default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Gittenberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j29]Bernhard Gittenberger, Zbigniew Golebiewski, Isabella Larcher, Malgorzata Sulkowska:
Counting Embeddings of Rooted Trees into Families of Rooted Trees. Electron. J. Comb. 29(3) (2022)- [j28]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima:
Compaction for two models of logarithmic-depth trees: Analysis and experiments. Random Struct. Algorithms 61(1): 31-61 (2022) - 2020
- [j27]Andrei Asinowski
, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata. Algorithmica 82(3): 386-428 (2020) - [j26]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner:
On the number of increasing trees with label repetitions. Discret. Math. 343(8): 111722 (2020) - [j25]Gwendal Collet, Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs in simple graphs and multigraphs. Eur. J. Comb. 88: 103113 (2020) - [j24]Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner:
Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory A 172: 105177 (2020) - 2019
- [j23]Michael Fuchs, Bernhard Gittenberger, Marefatollah Mansouri:
Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks. Australas. J Comb. 73: 385-423 (2019) - [j22]Bernhard Gittenberger, Isabella Larcher:
Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j21]Olivier Bodini, Bernhard Gittenberger, Zbigniew Golebiewski:
Enumerating lambda terms by weighted length of their De Bruijn representation. Discret. Appl. Math. 239: 45-61 (2018) - [j20]Bernhard Gittenberger, Emma Yu Jin, Michael Wallner:
On the shape of random Pólya structures. Discret. Math. 341(4): 896-911 (2018) - 2017
- [j19]Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs: an analytic approach. Electron. Notes Discret. Math. 61: 271-277 (2017) - 2016
- [j18]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
2-Xor Revisited: Satisfiability and Probabilities of Functions. Algorithmica 76(4): 1035-1076 (2016) - 2015
- [j17]Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler:
Associative and commutative tree representations for Boolean functions. Theor. Comput. Sci. 570: 70-101 (2015) - 2013
- [j16]Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Alice Jacquot:
Enumeration of Generalized BCI Lambda-terms. Electron. J. Comb. 20(4): 30 (2013) - 2012
- [j15]Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler:
Probabilities of Boolean Functions given by Random Implicational Formulas. Electron. J. Comb. 19(2): 37 (2012) - [j14]Bernhard Gittenberger, Veronika Kraus:
The degree profile of random Pólya trees. J. Comb. Theory A 119(7): 1528-1557 (2012) - [j13]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40(3): 317-349 (2012) - 2010
- [j12]Michael Drmota, Bernhard Gittenberger:
The shape of unlabeled rooted random trees. Eur. J. Comb. 31(8): 2028-2063 (2010) - 2006
- [j11]Bernhard Gittenberger, Johannes Mandlburger:
Hayman Admissible Functions in Several Variables. Electron. J. Comb. 13(1) (2006) - [j10]Bernhard Gittenberger:
Nodes of large degree in random trees and forests. Random Struct. Algorithms 28(3): 374-385 (2006) - 2005
- [j9]Michael Drmota, Bernhard Gittenberger, Thomas Klausner:
Extended admissible functions and Gaussian limiting distributions. Math. Comput. 74(252): 1953-1966 (2005) - 2004
- [j8]Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
And/Or Trees Revisited. Comb. Probab. Comput. 13(4-5): 475-497 (2004) - [j7]Michael Drmota, Bernhard Gittenberger:
The Width of Galton-Watson Trees Conditioned by the Size. Discret. Math. Theor. Comput. Sci. 6(2): 387-400 (2004) - [j6]Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
General urn models with several types of balls and Gaussian limiting fields. Random Struct. Algorithms 24(1): 75-103 (2004) - 2001
- [j5]Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
A Unified Presentation of Some Urn Models. Algorithmica 29(1): 120-147 (2001) - 1999
- [j4]Michael Drmota, Bernhard Gittenberger:
The distribution of nodes of given degree in random trees. J. Graph Theory 31(3): 227-253 (1999) - [j3]Bernhard Gittenberger:
On the Contour of Random Trees. SIAM J. Discret. Math. 12(4): 434-458 (1999) - 1998
- [j2]Bernhard Gittenberger:
Convergence of branching processes to the local time of a Bessel process. Random Struct. Algorithms 13(3-4): 423-438 (1998) - 1997
- [j1]Michael Drmota, Bernhard Gittenberger:
On the profile of random trees. Random Struct. Algorithms 10(4): 421-451 (1997)
Conference and Workshop Papers
- 2024
- [c11]Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, Noah A. Rosenberg:
Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. AofA 2024: 27:1-27:14 - 2018
- [c10]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem. AofA 2018: 10:1-10:14 - [c9]Bernhard Gittenberger, Isabella Larcher:
On the Number of Variables in Special Classes of Random Lambda-Terms. AofA 2018: 25:1-25:14 - [c8]Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. LATA 2018: 195-206 - 2017
- [c7]Bernhard Gittenberger, Emma Yu Jin, Michael Wallner:
A note on the scaling limits of random Pólya trees. ANALCO 2017: 85-93 - 2016
- [c6]Bernhard Gittenberger, Zbigniew Golebiewski:
On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation. STACS 2016: 40:1-40:13 - 2014
- [c5]Olivier Bodini, Bernhard Gittenberger:
On the asymptotic number of BCK(2)-terms. ANALCO 2014: 25-39 - [c4]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
Probabilities of 2-Xor Functions. LATIN 2014: 454-465 - 2011
- [c3]Olivier Bodini, Danièle Gardy, Bernhard Gittenberger:
Lambda-terms of Bounded Unary Height. ANALCO 2011: 23-32 - 2009
- [c2]Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg:
Combinatorial Models for Cooperation Networks. IWOCA 2009: 206-217 - 2008
- [c1]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS 2008: 347-362
Informal and Other Publications
- 2020
- [i4]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima:
Compaction for two models of logarithmic-depth trees: Analysis and Experiments. CoRR abs/2005.12997 (2020) - [i3]Bernhard Gittenberger, Zbigniew Golebiewski, Isabella Larcher, Malgorzata Sulkowska:
Counting embeddings of rooted trees into families of rooted trees. CoRR abs/2008.08312 (2020) - 2017
- [i2]Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner:
Asymptotic Enumeration of Compacted Binary Trees. CoRR abs/1703.10031 (2017) - 2015
- [i1]Bernhard Gittenberger, Zbigniew Golebiewski:
On the number of lambda terms with prescribed size of their De Bruijn representation. CoRR abs/1509.06139 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
