Some extremal problems arising from discrete control processes

DOI10.1007/BF02125896zbMath0699.90110OpenAlexW1987754111MaRDI QIDQ913685

Michael E. Saks, David Lichtenstein, Nathan Linial

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

bit extractioncollective coin flippingdiscrete control processesimperfect random sources

Mathematics Subject Classification ID

Game theory (91A99) Discrete-time control/observation systems (93C55) Optimal stochastic control (93E20)

Related Items (13)

A lower bound for adaptively-secure collective coin flipping protocols ⋮ Adaptively Secure Coin-Flipping, Revisited ⋮ Privacy with Imperfect Randomness ⋮ Biased random walks ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Simulating BPP using a general weak random source ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ Deterministic extractors for small-space sources ⋮ Extracting randomness from extractor-dependent sources ⋮ How to extract useful randomness from unreliable sources ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols ⋮ Extracting randomness: A survey and new constructions

Cites Work

• Generating quasi-random sequences from semi-random sources
• Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Optimal numberings and isoperimetric problems on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some extremal problems arising from discrete control processes