default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCecilia Holmgren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson:
Fringe Trees for Random Trees with Given Vertex Degrees. AofA 2024: 1:1-1:13- 2023
- [j12]Colin Desmarais, Cecilia Holmgren, Stephan Wagner:
Broadcasting-induced colorings of preferential attachment trees. Random Struct. Algorithms 63(2): 364-405 (2023) - 2022
- [j11]Gabriel Berzunza, Cecilia Holmgren:
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. Random Struct. Algorithms 60(4): 631-652 (2022) - [c8]Gabriel Berzunza Ojeda, Cecilia Holmgren:
Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees. AofA 2022: 3:1-3:14 - 2021
- [j10]Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The $k$-Cut Model in Deterministic and Random Trees. Electron. J. Comb. 28(1): 1 (2021) - [j9]Michael Fuchs
, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger:
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. 292: 64-71 (2021) - [c7]Cecilia Holmgren:
Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey. DGMM 2021: 20-57 - 2020
- [j8]Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman:
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Algorithmica 82(3): 589-615 (2020) - [j7]Colin Desmarais, Cecilia Holmgren:
Normal Limit Laws for Vertex Degrees in Randomly Grown Hooking Networks and Bipolar Networks. Electron. J. Comb. 27(2): 2 (2020) - [c6]Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The k-Cut Model in Conditioned Galton-Watson Trees. AofA 2020: 5:1-5:10 - [c5]Gabriel Berzunza Ojeda, Cecilia Holmgren:
Largest Clusters for Supercritical Percolation on Split Trees. AofA 2020: 6:1-6:10
2010 – 2019
- 2019
- [j6]Xing Shi Cai, Cecilia Holmgren:
Cutting Resilient Networks - Complete Binary Trees. Electron. J. Comb. 26(4): 4 (2019) - [j5]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28(3): 335-364 (2019) - [c4]Colin Desmarais, Cecilia Holmgren:
Degree distributions of generalized hooking networks. ANALCO 2019: 103-110 - [c3]Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman:
k -cuts on a Path. CIAC 2019: 112-123 - 2018
- [c2]Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman:
Permutations in Binary Trees and Split Trees. AofA 2018: 9:1-9:12 - [c1]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA 2018: 15:1-15:12 - [i3]Xing Shi Cai, Cecilia Holmgren:
Cutting resilient networks - complete binary trees. CoRR abs/1811.05673 (2018) - 2017
- [j4]Cecilia Holmgren, Tomas Juskevicius, Nathan Kettle:
Majority Bootstrap Percolation on G(n, p). Electron. J. Comb. 24(1): 1 (2017) - [j3]Cecilia Holmgren, Svante Janson, Matas Sileikis:
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. Electron. J. Comb. 24(2): 2 (2017) - [i2]Luc Devroye, Cecilia Holmgren, Henning Sulzbach:
The heavy path approach to Galton-Watson trees with an application to Apollonian networks. CoRR abs/1701.02527 (2017) - 2012
- [j2]Johan Björklund, Cecilia Holmgren:
Counterexamples to a monotonicity conjecture for the threshold pebbling number. Discret. Math. 312(15): 2401-2405 (2012) - 2011
- [i1]Nicolas Broutin, Cecilia Holmgren:
The total path length of split trees. CoRR abs/1102.2541 (2011) - 2010
- [j1]Cecilia Holmgren:
Random Records and Cuttings in Binary Search Trees. Comb. Probab. Comput. 19(3): 391-424 (2010)
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:52 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:
