![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Benedikt Stufler
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j12]Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. Electron. J. Comb. 30(3) (2023) - [j11]Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler:
Exact-Size Sampling of Enriched Trees in Linear Time. SIAM J. Comput. 52(5): 1097-1131 (2023) - 2022
- [j10]Benedikt Stufler:
A branching process approach to level-k phylogenetic networks. Random Struct. Algorithms 61(2): 397-421 (2022) - 2021
- [j9]Benedikt Stufler:
Asymptotic Properties of Random Unlabelled Block-Weighted Graphs. Electron. J. Comb. 28(4) (2021) - [j8]Benedikt Stufler:
Graphon convergence of random cographs. Random Struct. Algorithms 59(3): 464-491 (2021) - 2020
- [j7]Benedikt Stufler:
Unlabelled Gibbs partitions. Comb. Probab. Comput. 29(2): 293-309 (2020) - [j6]Emma Yu Jin
, Benedikt Stufler:
Graph limits of random unlabelled k-trees. Comb. Probab. Comput. 29(5): 722-746 (2020) - [c2]Michael Drmota
, Marc Noy
, Benedikt Stufler
:
Cut Vertices in Random Planar Maps. AofA 2020: 10:1-10:18
2010 – 2019
- 2019
- [j5]Michael Drmota, Emma Yu Jin
, Benedikt Stufler:
Graph limits of random graphs from a subset of connected k-trees. Random Struct. Algorithms 55(1): 125-152 (2019) - [j4]Benedikt Stufler:
The continuum random tree is the scaling limit of unlabeled unrooted trees. Random Struct. Algorithms 55(2): 496-528 (2019) - [j3]Sigurdur Örn Stefánsson, Benedikt Stufler:
Geometry of large Boltzmann outerplanar maps. Random Struct. Algorithms 55(3): 742-771 (2019) - 2018
- [j2]Benedikt Stufler:
Random Enriched Trees with Applications to Random Graphs. Electron. J. Comb. 25(3): 3 (2018) - [j1]Benedikt Stufler:
Gibbs partitions: The convergent case. Random Struct. Algorithms 53(3): 537-558 (2018) - [c1]Benedikt Stufler:
Local Limits of Large Galton-Watson Trees Rerooted at a Random Vertex. AofA 2018: 34:1-34:11
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint