The following pages link to Omid Etesami (Q930666):
Displayed 13 items.
- Mafia: A theoretical study of players and coalitions in a partial information environment (Q930667) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- On NP-hard graph properties characterized by the spectrum (Q2197466) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
- Improved Pseudorandom Generators for Depth 2 Circuits (Q3588430) (← links)
- (Q5009525) (← links)
- Computational Concentration of Measure: Optimal Bounds, Reductions, and More (Q5146786) (← links)
- (Q5294911) (← links)
- Complete Classification of Generalized Santha-Vazirani Sources (Q6291093) (← links)
- Convex Ramsey matrices and non-amenability of automophism groups of generic structures (Q6293572) (← links)