On the public citation graph
A result in order statistics related to probabilistic counting
0 signed · 50 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.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-55719-9_75openalex-snapshot
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_16openalex-snapshot
Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf01694204openalex-snapshot
Handbuch der Theorie der Gammafunktion
inferredcites →https://doi.org/10.1007/bf02241658openalex-snapshot
Yet another application of a binomial recurrence order statistics
inferredcites →https://doi.org/10.1007/bfb0078601openalex-snapshot
Über Längste 1-Teilfolgen In 0-1-Folgen
inferredcites →https://doi.org/10.1007/bfb0096984openalex-snapshot
On the analysis of 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.1112/s0025579300006409openalex-snapshot
On some applications of formulae of Ramanujan in the analysis of algorithms
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex 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/10719839_45openalex-snapshot
Run Statistics for Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.1007/11780823_25openalex-snapshot
Approximate Top-k Queries in Sensor Networks
inferred← citeshttps://doi.org/10.1007/11945529_17openalex-snapshot
Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_35openalex-snapshot
The Number of Descents in Samples of Geometric Random Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_14openalex-snapshot
The Effect of Forgetting on the Performance of a Synchronizer
inferred← citeshttps://doi.org/10.1007/bf01178735openalex-snapshot
The path length of random skip lists
inferred← citeshttps://doi.org/10.1007/s00026-001-8010-zopenalex-snapshot
Combinatorics of Geometrically Distributed Random Variables: Inversions and a Parameter of Knuth
inferred← citeshttps://doi.org/10.1007/s13370-011-0027-9openalex-snapshot
Consecutive records in geometrically distributed words
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00141-iopenalex-snapshot
Combinatorics of geometrically distributed random variables: Left-to-right maxima
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.06.007openalex-snapshot
The number of distinct values in a geometrically distributed sample
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.07.015openalex-snapshot
Fault tolerant aggregation in heterogeneous sensor networks
inferred← citeshttps://doi.org/10.1016/j.peva.2015.08.002openalex-snapshot
The effect of forgetting on the performance of a synchronizer
inferred← citeshttps://doi.org/10.1016/j.phycom.2018.05.011openalex-snapshot
Reliability benefit of network coding and cooperative communication
inferred← citeshttps://doi.org/10.1016/j.spl.2008.11.008openalex-snapshot
The average position of the dth maximum in a sample of geometric random variables
inferred← citeshttps://doi.org/10.1016/j.spl.2014.11.023openalex-snapshot
Descents following maximal values in samples of geometric random variables
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.032openalex-snapshot
A note on efficient aggregate queries in sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.006openalex-snapshot
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00641-2openalex-snapshot
Combinatorics of geometrically distributed random variables: run statistics
inferred← citeshttps://doi.org/10.1017/s0963548397002939openalex-snapshot
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution
inferred← citeshttps://doi.org/10.1111/j.1467-9469.2010.00727.xopenalex-snapshot
A Statistical Analysis of Probabilistic Counting Algorithms
inferred← citeshttps://doi.org/10.1145/1011767.1011809openalex-snapshot
A note on efficient aggregate queries in sensor networks
inferred← citeshttps://doi.org/10.1198/000313004x5509openalex-snapshot
Tunable Approximations for the Mean and Variance of the Maximum of Heterogeneous Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.1214/aoap/1034968150openalex-snapshot
The number of winners in a discrete geometrically distributed sample
inferred← citeshttps://doi.org/10.46298/dmtcs.3358openalex-snapshot
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
inferred← citeshttps://doi.org/10.46298/dmtcs.3476openalex-snapshot
Analysis of a new skip list variant
inferred← citeshttps://doi.org/10.46298/dmtcs.3523openalex-snapshot
The average position of the first maximum in a sample of geometric random variables
inferred← citeshttps://doi.org/10.46298/dmtcs.363openalex-snapshot
The first descent in samples of geometric random variables and permutations
inferred← citeshttps://doi.org/10.46298/dmtcs.375openalex-snapshot
d-records in geometrically distributed random variables
inferred← citeshttps://doi.org/10.46298/dmtcs.527openalex-snapshot
Asymptotic results for silent elimination
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3552openalex-snapshot
A statistical analysis of probabilistic counting algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04615openalex-snapshot
How Far Might We Walk at Random?
inferred← citeshttps://doi.org/10.6688/jise.2011.27.3.14openalex-snapshot
Alternating Runs of Geometrically Distributed Random Variables
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/16934openalex-snapshot
Longest Waiting Time in the Coupon Collector’s Problem
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.