The following pages link to (Q4023085):
Displaying 50 items.
- An overview of distinguishing attacks on stream ciphers (Q1032489) (← links)
- Counting distinctions: on the conceptual foundations of Shannon's information theory (Q1036041) (← links)
- Commitment and authentication systems (Q1039270) (← links)
- Restructuring binary search trees revisited (Q1041801) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- Compressing probability distributions (Q1045918) (← links)
- Blind detection in symmetric non-Gaussian noise with unknown PDF using maximum entropy method with moment generating function constraints (Q1046659) (← links)
- When cognitive diagnosis meets computerized adaptive testing: CD-CAT (Q1048648) (← links)
- Some results on ordering of survival functions through uncertainty (Q1126098) (← links)
- Numerical taxonomy and the principle of maximum entropy (Q1126398) (← links)
- Averaging over decision trees (Q1126405) (← links)
- Models, prior information, and Bayesian analysis (Q1126460) (← links)
- Some aspects of the information theoretic dialogue (Q1199632) (← links)
- Perfectly secure key distribution for dynamic conferences (Q1273875) (← links)
- Optimal representation in average using Kolmogorov complexity (Q1276258) (← links)
- Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution (Q1276261) (← links)
- A strong approximation theorem for stochastic recursive algorithms (Q1289391) (← links)
- Action-timing problem with sequential Bayesian belief revision process (Q1291712) (← links)
- The space complexity of approximating the frequency moments (Q1305928) (← links)
- On the stability of open networks: A unified approach by stochastic dominance (Q1319172) (← links)
- Fluctuation spectroscopy (Q1321719) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Minimum entropy of error principle in estimation (Q1331031) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- Testing for nonlinearity using redundancies: Quantitative and qualitative aspects (Q1342727) (← links)
- The theory of search from a statistical viewpoint. (With discussion) (Q1346932) (← links)
- The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key (Q1350004) (← links)
- State estimation with communication constraints (Q1352079) (← links)
- Information and the clone mapping of chromosomes (Q1355174) (← links)
- An information-theoretic approach to the design of a distributed cascade of sensors (Q1358709) (← links)
- Information criteria for residual generation and fault detection and isolation (Q1360454) (← links)
- Linking information reconciliation and privacy amplification (Q1363071) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- Optimum measurements for discrimination among symmetric quantum states and parameter estimation (Q1367637) (← links)
- On-line maximum likelihood prediction with respect to general loss functions (Q1370862) (← links)
- Classification of binary vectors by stochastic complexity. (Q1372217) (← links)
- Testing whether lifetime distribution is decreasing uncertainty (Q1372862) (← links)
- Identification of deterministic chaos by an information-theoretic measure of the sensitive dependence on the initial conditions (Q1373924) (← links)
- The finite sample properties of simultaneous equations' estimates and estimators. Bayesian and non-Bayesian approaches (Q1377312) (← links)
- Performance study of marginal posterior density estimation via Kullback-Leibler divergence (Q1382945) (← links)
- Mutual information, metric entropy and cumulative relative entropy risk (Q1383090) (← links)
- State change, quantum probability, and information in operational phase-space measurement (Q1388171) (← links)
- Tsallis entropy production for diffusion on the diluted hypercube (Q1394670) (← links)
- Portfolio choice with endogenous utility: a large deviations approach. (Q1398986) (← links)
- On finite strategy sets for finitely repeated zero-sum games. (Q1399527) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- On the concept of best achievable compression ratio for lossy image coding. (Q1403800) (← links)
- The generalized universal law of generalization. (Q1404969) (← links)
- An approach to simple bargaining games and related problems (Q1408730) (← links)
- Non-logarithmic Jensen-Shannon divergence (Q1409092) (← links)
