Pages that link to "Item:Q2391191"
From MaRDI portal
The following pages link to Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191):
Displaying 14 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Local random quantum circuits are approximate polynomial-designs (Q506483) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Deterministic public-key encryption for adaptively-chosen plaintext distributions (Q1994638) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- (Q5743464) (← links)
- (Q5743469) (← links)
- Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q6103528) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
