Rani Hod

According to our database1, Rani Hod authored at least 12 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Tight Bounds on Online Checkpointing Algorithms.
ACM Trans. Algorithms, 2020

2017
Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions.
CoRR, 2017

Optimal Backup Strategies Against Cyber Attacks.
CoRR, 2017

2016
On Active and Passive Testing.
Comb. Probab. Comput., 2016

Voronoi Choice Games.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Component Games on Regular Graphs.
Comb. Probab. Comput., 2014

2013
3/2 firefighters are not enough.
Discret. Appl. Math., 2013

2012
A Construction for the Hat Problem on a Directed Graph.
Electron. J. Comb., 2012

Random low-degree polynomials are hard to approximate.
Comput. Complex., 2012

CS1001.py: a topic-based introduction to computer science.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

2010
The hat problem on a directed graph
CoRR, 2010

2009
Optimal Monotone Encodings.
IEEE Trans. Inf. Theory, 2009


  Loading...