On the public citation graph
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
0 signed · 33 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199612)9:4<379::aid-rsa3>3.0.co;2-uopenalex-snapshot
Analysis of a splitting process arising in probabilistic counting and other related algorithms
inferredcites →https://doi.org/10.1002/9781118032770openalex-snapshot
Average Case Analysis of Algorithms on Sequences
inferredcites →https://doi.org/10.1002/rsa.10008openalex-snapshot
Distinctness of compositions of an integer: A probabilistic analysis
inferredcites →https://doi.org/10.1007/3-540-51542-9_36openalex-snapshot
Skip lists: A probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.1007/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf01221717openalex-snapshot
Discrete limit distributions in the problem of balls falling in cells with arbitrary probabilities
inferredcites →https://doi.org/10.1007/bf02241658openalex-snapshot
Yet another application of a binomial recurrence order statistics
inferredcites →https://doi.org/10.1007/bf02243826openalex-snapshot
A result in order statistics related to probabilistic counting
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferredcites →https://doi.org/10.1016/j.ejc.2006.06.007openalex-snapshot
The number of distinct values in a geometrically distributed sample
inferredcites →https://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferredcites →https://doi.org/10.1137/1109034openalex-snapshot
Asymptotic Normality in the Classical Ball Problem
inferredcites →https://doi.org/10.1512/iumj.1968.17.17020openalex-snapshot
Central Limit Theorems for Certain Infinite Urn Schemes
inferredcites →https://doi.org/10.46298/dmtcs.3347openalex-snapshot
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00026-009-0004-2openalex-snapshot
The Asymmetric Leader Election Algorithm: Another Approach
inferred← citeshttps://doi.org/10.1007/s00453-006-0106-8openalex-snapshot
Asymptotics of the Moments of Extreme-Value Related Distribution Functions
inferred← citeshttps://doi.org/10.1016/j.aam.2007.05.002openalex-snapshot
On the variance of the number of occupied boxes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.012openalex-snapshot
On gaps and unoccupied urns in sequences of geometrically distributed random variables
inferred← citeshttps://doi.org/10.1214/ejp.v14-608openalex-snapshot
Small counts in the infinite occupancy scheme
inferred← citeshttps://doi.org/10.2298/aadm150619013fopenalex-snapshot
Limit behavior of maxima in geometric words representing set partitions
inferred← citeshttps://doi.org/10.23638/dmtcs-19-1-17openalex-snapshot
A class of symmetric difference-closed sets related to commuting involutions
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-13openalex-snapshot
The Adaptive sampling revisited
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-10openalex-snapshot
The number of distinct adjacent pairs in geometrically distributed words
inferred← citeshttps://doi.org/10.2478/s12175-008-0072-5openalex-snapshot
Advancing in the presence of a demon
inferred← citeshttps://doi.org/10.2989/16073606.2015.1023987openalex-snapshot
The asymmetric leader election algorithm: Number of survivors near the end of the game
inferred← citeshttps://doi.org/10.46298/dmtcs.527openalex-snapshot
Asymptotic results for silent elimination
inferred← citeshttps://doi.org/10.46298/dmtcs.580openalex-snapshot
The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
inferred← citeshttps://doi.org/10.46298/dmtcs.9293openalex-snapshot
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
inferred← citeshttps://doi.org/10.48550/arxiv.0809.4387openalex-snapshot
Small counts in the infinite occupancy scheme
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08043openalex-snapshot
The Adaptive Sampling Revisited
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.