Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2640
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jocković, Jelena | en_US |
dc.contributor.author | Mladenović, Pavle | en_US |
dc.date.accessioned | 2025-09-24T09:14:00Z | - |
dc.date.available | 2025-09-24T09:14:00Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/2640 | - |
dc.description.abstract | This paper deals with various extensions of the coupon collector’s problem which are obtained by changing the stopping criterion. Proving limit results in these cases may involve a number of technical difficulties. We give some new limit theorems related to this problem, and discuss possible generalizations. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Niš : Prirodno-matematički fakultet | en_US |
dc.title | New limit theorems for the coupon collector's problem | en_US |
dc.type | Conference Object | en_US |
dc.relation.conference | Srpski matematički kongres = Serbian Mathematical Congress (13 ; 2014 ; Vrnjačka Banja) | en_US |
dc.relation.publication | Book of Abstracts of 13th Serbian Mathematical Congress | en_US |
dc.identifier.url | http://tesla.pmf.ni.ac.rs/people/smak/book_of_abstracts.pdf | - |
dc.contributor.affiliation | Probability and Statistics | en_US |
dc.contributor.affiliation | Probability and Statistics | en_US |
dc.relation.isbn | 78-86-6275-026-6 | en_US |
dc.description.rank | M34 | en_US |
dc.relation.firstpage | 51 | en_US |
dc.relation.lastpage | 51 | en_US |
item.openairetype | Conference Object | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
crisitem.author.dept | Probability and Statistics | - |
crisitem.author.orcid | 0009-0009-8379-2341 | - |
Appears in Collections: | Research outputs |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.