The following pages link to Rani Hod (Q426791):
Displaying 16 items.
- A construction for the hat problem on a directed graph (Q426792) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- 3/2 firefighters are not enough (Q1759889) (← links)
- Strong embeddings and 2-isomorphism (Q2399208) (← links)
- Multi-layered planar firefighting (Q2675861) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)
- Optimal Monotone Encodings (Q3521925) (← links)
- Random Low Degree Polynomials are Hard to Approximate (Q3638891) (← links)
- Voronoi Choice Games (Q4598158) (← links)
- Optimal Monotone Encodings (Q4975777) (← links)
- Tight Bounds on Online Checkpointing Algorithms (Q4987449) (← links)
- Tight Bounds on Online Checkpointing Algorithms (Q5002679) (← links)
- On Active and Passive Testing (Q5364269) (← links)
- Component Games on Regular Graphs (Q5414147) (← links)
- Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions (Q6293399) (← links)
- Component Games on Random Graphs (Q6356241) (← links)