Pages that link to "Item:Q5814290"
From MaRDI portal
The following pages link to A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations (Q5814290):
Displaying 50 items.
- The distribution of the ''finitely many times'' in the strong law of large numbers (Q1083115) (← links)
- Probabilistic methods (Q1091406) (← links)
- On the shape of the convex hull of random points (Q1099869) (← links)
- Local Bahadur efficiency of score tests (Q1100825) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Packing items from a triangular distribution (Q1107981) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- A parallel bucket sort (Q1108803) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- Applications of the theory of records in the study of random trees (Q1110339) (← links)
- Broadcasting with random faults (Q1111578) (← links)
- Probabilities of large deviations for random fields (Q1112436) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Measures of distance between probability distributions (Q1118898) (← links)
- Knowing what doesn't matter: exploiting the omission of irrelevant data (Q1127363) (← links)
- Some first passage problems related to cusum procedures (Q1140945) (← links)
- Some new properties of the Bechhofer-Kiefer-Sobel stopping rule (Q1151221) (← links)
- Allocating observations between two normal populations to maximize the half slope of the F-test (Q1159926) (← links)
- Bahadur efficiency of the F-test (Q1163817) (← links)
- A note on the asymptotic efficiency of the Sobel-Wald test (Q1163827) (← links)
- Roth's estimate of the discrepancy of integer sequences is nearly sharp (Q1167207) (← links)
- Irregularities of two-colourings of the NxN square lattice (Q1172093) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Programmed interactions in higher-order neural networks: Maximal capacity (Q1179461) (← links)
- Local Chernoff and Hodges-Lehmann efficiencies of linear rank tests for symmetry (Q1179890) (← links)
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
- Confidence intervals for the mean in the bounded case (Q1181110) (← links)
- Some observations on skip-lists (Q1182095) (← links)
- The maximum number of winning 2-sets (Q1182325) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Hodges-Lehmann and Chernoff efficiencies of linear rank statistics (Q1193962) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Cooperation versus competition (Q1226444) (← links)
- Optimally ranking unrankable tournaments (Q1234694) (← links)
- Bayesian discriminant approach to input signal selection in parameter estimation problems (Q1235678) (← links)
- On sequential distinguishability for the exponential family (Q1236859) (← links)
- Exponential bound for distribution of locally infinitely divisible processes (Q1238550) (← links)
- The analysis of double hashing (Q1243123) (← links)
- Exponential convergence properties of linear estimators under exponential and uniform distribution (Q1243978) (← links)
- The weak convergence of likelihood ratio random fields and its applications (Q1248294) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps (Q1271382) (← links)
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis (Q1272556) (← links)
- An introduction to some statistical aspects of PAC learning theory (Q1274408) (← links)
