The following pages link to Theodore P. Hill (Q239854):
Displaying 50 items.
- A basic theory of Benford's law (Q431507) (← links)
- Gender gaps in science: the creativity factor (Q444046) (← links)
- Benford's law strikes back: no simple explanation in sight for mathematical gem (Q536612) (← links)
- Partitioning general probability measures (Q579730) (← links)
- A stronger conclusion to the classical ham sandwich theorem (Q641540) (← links)
- Minimax-optimal stop rules and distributions in secretary problems (Q756847) (← links)
- The advantage of using non-measurable stop rules (Q787581) (← links)
- On maximizing the average time at a goal (Q792886) (← links)
- Equipartitioning common domains of non-atomic measures (Q799293) (← links)
- A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures (Q1077801) (← links)
- Prophet inequalities for averages of independent non-negative random variables (Q1083121) (← links)
- The existence of good Markov strategies for decision processes with general payoffs (Q1092823) (← links)
- Equitable distribution of indivisible objects (Q1107410) (← links)
- Strongly-consistent, distribution-free confidence intervals for quantiles (Q1126126) (← links)
- Decision processes with total-cost criteria (Q1151192) (← links)
- (Q1163293) (redirect page) (← links)
- Comparisons of stop rule and supremum expectations of i.i.d. random variables (Q1163294) (← links)
- Conditional generalizations of strong laws which conclude the partial sums converge almost surely (Q1164910) (← links)
- Fusions of a probability distribution (Q1184099) (← links)
- On the game of googol (Q1196120) (← links)
- Sharp inequalities for optimal stopping with rewards based on ranks (Q1198584) (← links)
- One-sided refinements of the strong law of large numbers and the Glivenko-Cantelli theorem (Q1201169) (← links)
- Moment-based minimax stopping functions for sequences of random variables (Q1201894) (← links)
- On the basic representation theorem for convex domination of measures (Q1276359) (← links)
- (Q1299924) (redirect page) (← links)
- The elimination algorithm for the problem of optimal stopping (Q1299925) (← links)
- A sharp nonconvexity bound for partition ranges of vector measures with atoms (Q1300041) (← links)
- Positive dependence orderings and stopping times (Q1336528) (← links)
- A countably-valued sleeping stockbroker process (Q1337942) (← links)
- A replacement model with general age-dependent failure rates (Q1361676) (← links)
- Optimal stopping and maximal inequalities for linear diffusions (Q1383185) (← links)
- Maximin share and minimax envy in fair-division problems. (Q1399324) (← links)
- A statistical derivation of the significant-digit law (Q1596091) (← links)
- Partitioning inequalities in probability and statistics (Q1624505) (← links)
- (Q1807137) (redirect page) (← links)
- Constructions of random distributions via sequential barycenters (Q1807138) (← links)
- Optimal-partitioning inequalities in classification and multi-hypotheses testing (Q1824968) (← links)
- Prophet inequalities for parallel processes (Q1826208) (← links)
- A stronger form of the Borel-Cantelli lemma (Q1838763) (← links)
- Random probability measures with given mean and variance (Q1866072) (← links)
- Necessary and sufficient condition that the limit of Stieltjes transforms is a Stieltjes transform (Q1874474) (← links)
- Correction to ``Prophet inequalities for averages of independent non-negative random variables'' (Q1910190) (← links)
- The mathematics of Benford's law: a primer (Q2062326) (← links)
- Scale-distortion inequalities for mantissas of finite data sets (Q2481396) (← links)
- Regularity of digits and significant digits of random variables (Q2568303) (← links)
- WHAT IS...Benford's Law? (Q2974849) (← links)
- (Q2986630) (← links)
- Cutting Cakes Carefully (Q2999698) (← links)
- Conflations of probability distributions (Q3004376) (← links)
- Finite-state Markov Chains Obey Benford’s Law (Q3112388) (← links)
