 | 2012 |
|---|
| 7 |       | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random low-degree polynomials are hard to approximate.
Computational Complexity 21(1): 63-81 (2012) |
| 2010 |
|---|
| 6 | | Ohad N. Feldheim,
Rani Hod:
3/2 Firefighters are not enough
CoRR abs/1005.1694: (2010) |
| 5 | | Rani Hod,
Marcin Krzywkowski:
The hat problem on a directed graph
CoRR abs/1006.1587: (2010) |
| 2009 |
|---|
| 4 | | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random Low Degree Polynomials are Hard to Approximate.
APPROX-RANDOM 2009: 366-377 |
| 3 | | Noga Alon,
Rani Hod:
Optimal Monotone Encodings.
IEEE Transactions on Information Theory 55(3): 1343-1353 (2009) |
| 2008 |
|---|
| 2 | | Noga Alon,
Rani Hod:
Optimal Monotone Encodings.
ICALP (1) 2008: 258-270 |
| 1 | | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random low degree polynomials are hard to approximate.
Electronic Colloquium on Computational Complexity (ECCC) 15(080): (2008) |
Data released under the ODC-BY 1.0 license — See also our legal information page