Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1279.68350OpenAlexW4298253479MaRDI QIDQ5900938

Yevgeniy Dodis, Roberto Imbuzeiro Oliveira

Publication date: 26 May 2010

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20)

Related Items (6)

Improved computational extractors and their applications ⋮ On the impossibility of cryptography with tamperable randomness ⋮ Improving the Hadamard extractor ⋮ Simpler session-key generation from short random passwords ⋮ Multi-source non-malleable extractors and applications ⋮ Explicit two-source extractors and resilient functions

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques