default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLjuben R. Mutafchiev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Ljuben R. Mutafchiev, Steven Finch:
On the deepest cycle of a random mapping. J. Comb. Theory, Ser. A 206: 105875 (2024)- 2020
- [j13]Ljuben R. Mutafchiev, Mladen Savov
:
On the maximal multiplicity of block sizes in a random set partition. Random Struct. Algorithms 56(3): 867-891 (2020)
2010 – 2019
- 2018
- [c2]Ljuben R. Mutafchiev:
On the largest part size and its multiplicity of a random integer partition. GASCom 2018: 187-194 - 2017
- [j12]Ljuben R. Mutafchiev:
An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics. Electron. Notes Discret. Math. 61: 893-899 (2017) - 2016
- [j11]Ljuben R. Mutafchiev:
On the Distribution of the Number of Goldbach Partitions of a Randomly Chosen Positive Even Integer. Electron. Notes Discret. Math. 54: 3-8 (2016) - 2015
- [j10]Ljuben R. Mutafchiev:
A Note on Goldbach Partitions of Large Even Integers. Electron. J. Comb. 22(1): 1 (2015) - 2013
- [j9]Ljuben R. Mutafchiev:
The Size of the Largest Part of Random Weighted Partitions of Large Integers. Comb. Probab. Comput. 22(3): 433-454 (2013) - [c1]Olivier Bodini, Philippe Duchon, Alice Jacquot, Ljuben R. Mutafchiev:
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. DGCI 2013: 95-106 - [i1]Olivier Bodini, Alice Jacquot, Philippe Duchon, Ljuben R. Mutafchiev:
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. CoRR abs/1306.2108 (2013) - 2011
- [j8]Ljuben R. Mutafchiev:
Limit Theorems for the Number of Parts in a Random Weighted Partition. Electron. J. Comb. 18(1) (2011)
1990 – 1999
- 1998
- [j7]Ljuben R. Mutafchiev:
The largest tree in certain models of random forests. Random Struct. Algorithms 13(3-4): 211-228 (1998) - 1997
- [j6]Ljuben R. Mutafchiev:
Limiting Distributions for the Number of Distinct Component Sizes in Relational Structures. J. Comb. Theory A 79(1): 1-35 (1997) - 1996
- [j5]Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev:
Predecessors in Random Mappings. Comb. Probab. Comput. 5: 317-335 (1996) - 1994
- [j4]Jerzy Jaworski, Ljuben R. Mutafchiev:
The Largest Connected in a Random Mapping. Random Struct. Algorithms 5(1): 73-94 (1994) - 1993
- [j3]Ljuben R. Mutafchiev:
Large Trees in a Random Mapping Pattern. Eur. J. Comb. 14(4): 341-349 (1993) - 1992
- [j2]Ljuben R. Mutafchiev:
Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures. Random Struct. Algorithms 3(4): 403-426 (1992)
1980 – 1989
- 1988
- [j1]Ljuben R. Mutafchiev:
Limit theorem concerning random mapping patterns. Comb. 8(4): 345-356 (1988)
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 2025-01-21 00:06 CET 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:
