default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalwina J. Luczak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j13]Remco van der Hofstad
, Svante Janson, Malwina J. Luczak:
Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms 55(1): 3-55 (2019)- 2017
- [j12]Graham R. Brightwell, Svante Janson, Malwina J. Luczak:
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51(4): 565-586 (2017) - 2014
- [j11]Svante Janson, Malwina J. Luczak, Peter Windridge:
Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Struct. Algorithms 45(4): 726-763 (2014) - 2012
- [j10]Graham R. Brightwell, Malwina J. Luczak:
Order-Invariant Measures on Fixed Causal Sets. Comb. Probab. Comput. 21(3): 330-357 (2012) - 2010
- [j9]Remco van der Hofstad, Malwina J. Luczak, Joel Spencer:
The second largest component in the supercritical 2D Hamming graph. Random Struct. Algorithms 36(1): 80-89 (2010)
2000 – 2009
- 2009
- [j8]Svante Janson, Malwina J. Luczak:
A new approach to the giant component problem. Random Struct. Algorithms 34(2): 197-216 (2009) - 2007
- [j7]Svante Janson, Malwina J. Luczak:
A simple solution to the k-core problem. Random Struct. Algorithms 30(1-2): 50-62 (2007) - 2006
- [j6]Malwina J. Luczak, Tomasz Luczak:
The phase transition in the cluster-scaled model of a random graph. Random Struct. Algorithms 28(2): 215-246 (2006) - 2004
- [j5]Malwina J. Luczak, Peter Winkler:
Building uniformly random subtrees. Random Struct. Algorithms 24(4): 420-443 (2004) - 2003
- [j4]Malwina J. Luczak, Colin J. H. McDiarmid:
Concentration for locally acting permutations. Discret. Math. 265(1-3): 159-171 (2003) - 2002
- [j3]Malwina J. Luczak, Steven D. Noble:
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 121(1-3): 307-315 (2002) - 2001
- [j2]Malwina J. Luczak, Steven D. Noble:
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 113(2-3): 243-253 (2001) - [j1]Malwina J. Luczak, Colin McDiarmid:
Bisecting sparse random graphs. Random Struct. Algorithms 18(1): 31-38 (2001)
1990 – 1999
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-04-24 23:04 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:
