Pages that link to "Item:Q1238345"
From MaRDI portal
The following pages link to Distribution inequalities for the binomial law (Q1238345):
Displaying 16 items.
- On the oscillation of the expected number of extreme points of a random set (Q756837) (← links)
- Average time behavior of distributive sorting algorithms (Q1146523) (← links)
- On the average complexity of some bucketing algorithms (Q1157091) (← links)
- Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
- Maximal meaningful events and applications to image analysis (Q1430912) (← links)
- An elementary analysis of the probability that a binomial random variable exceeds its expectation (Q1642431) (← links)
- Minority population in the one-dimensional Schelling model of segregation (Q1756787) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- On the Chvátal-Janson conjecture (Q2112271) (← links)
- A no-free-lunch theorem for multitask learning (Q2112800) (← links)
- Public goods with ambiguity in large economies (Q2419596) (← links)
- On the probability that a binomial variable is at most its expectation (Q2658001) (← links)
- Новые оценки расстояния по вариации между двумя распределениями выборки (Q3382030) (← links)
- Normal numbers with digit dependencies (Q5234494) (← links)
- (Q5874488) (← links)
- Convergence of optimal expected utility for a sequence of binomial models (Q6054382) (← links)
