Pages that link to "Item:Q3588439"
From MaRDI portal
The following pages link to Constructive Proofs of Concentration Bounds (Q3588439):
Displaying 20 items.
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Hoeffding's inequality for sums of dependent random variables (Q1693395) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- A constructive proof of a concentration bound for real-valued random variables (Q2308463) (← links)
- Discordant voting protocols for cyclically linked agents (Q2309228) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Survey on nonlocal games and operator space theory (Q2786626) (← links)
- Basic Facts about Expander Graphs (Q3088196) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions (Q6192059) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- On time-space lower bounds for finding short collisions in sponge hash functions (Q6582219) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
