Success probability of the Hellman trade-off
From MaRDI portal
Publication:976114
DOI10.1016/J.IPL.2008.12.002zbMATH Open1191.68282OpenAlexW2084988170MaRDI QIDQ976114FDOQ976114
Publication date: 16 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.002
Recommendations
- Winning Rate in the Full-Information Best-Choice Problem
- Game-theoretic probability
- The game-theoretic framework for probability
- Probabilities within optimal strategies for tournament games
- Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin
- On the optimality of the uniform random strategy
- Probabilistic choice and stochastic dominance
Cites Work
Cited In (8)
- Distribution of the length of aperiodicity segment in the graph of \(k\)-fold iteration of uniform random mapping
- Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton-Watson process
- On a probabilistic approach to the estimation of reliability of the Hellman method
- Distribution of the length of aperiodicity segment in the graph of independent uniform random mappings composition
- On the limiting mean values in probabilistic models of time-memory-data tradeoff methods
- Limit theorem for the size of an image of subset under compositions of random mappings
- On the sets of images of \(k\)-fold iteration of uniform random mapping
- A comparison of cryptanalytic tradeoff algorithms
This page was built for publication: Success probability of the Hellman trade-off
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976114)