Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1106.68036OpenAlexW4301133941MaRDI QIDQ5313037

Ran Raz, Ariel Elbaz, Yevgeniy Dodis, Roberto Imbuzeiro Oliveira

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Information theory (general) (94A15) Randomized algorithms (68W20)

Related Items

Robustly reusable fuzzy extractor with imperfect randomness, Incompressible functions, relative-error extractors, and the power of nondeterministic reductions, Deterministic extractors for affine sources over large fields, Weak derandomization of weak algorithms: explicit versions of Yao's lemma, Increasing the Output Length of Zero-Error Dispersers, Improving the Hadamard extractor, Rainbow paths, Post-challenge leakage in public-key encryption, Unnamed Item, Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources, On hardening leakage resilience of random extractors for instantiations of leakage-resilient cryptographic primitives, Coalgebraic tools for randomness-conserving protocols, Pseudorandom generators from regular one-way functions: new constructions with improved parameters, Extractors and Lower Bounds for Locally Samplable Sources, Leakage-resilient key exchange and two-seed extractors