No photo of Rani Hod

View Scopus Profile

Rani Hod

Doctor

Former affiliation
 https://orcid.org/0000-0001-5718-7548
20082022

Research activity per year

  • 10 Article
  • 5 Conference contribution

Search results

  • 2022

    Component Games on Random Graphs

    Hod, R., Krivelevich, M., Müller, T., Naor, A. & Wormald, N., Dec 2022, In: Combinatorica. 42, p. 1189-1229 41 p.

    Research output: Contribution to journal › Article › peer-review

  • Multi-layered planar firefighting

    Deutsch, A., Feldheim, O. N. & Hod, R., Dec 2022, In: Discrete Mathematics. 345, 12, 113103.

    Research output: Contribution to journal › Article › peer-review

    Open Access
  • 2020

    Tight Bounds on Online Checkpointing Algorithms

    Bar-On, A., Dinur, I., Dunkelman, O., Hod, R., Keller, N., Ronen, E. & Shamir, A., Jun 2020, In: ACM Transactions on Algorithms. 16, 3, 31.

    Research output: Contribution to journal › Article › peer-review

    Open Access
  • 2018

    Tight bounds on online checkpointing algorithms

    Bar-On, A., Dinur, I., Hod, R., Dunkelman, O., Keller, N., Ronen, E. & Shamir, A., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2016

    On Active and Passive Testing

    Alon, N., Hod, R. & Weinstein, A., 1 Jan 2016, In: Combinatorics Probability and Computing. 25, 1, p. 1-20 20 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    6 Scopus citations

  • Voronoi choice games

    Boppana, M., Hod, R., Mitzenmacher, M. & Morgan, T., 1 Aug 2016, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Rabani, Y., Chatzigiannakis, I., Sangiorgi, D. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 55).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2014

    A construction of almost Steiner systems

    Ferber, A., Hod, R., Krivelevich, M. & Sudakov, B., Nov 2014, In: Journal of Combinatorial Designs. 22, 11, p. 488-494 7 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    3 Scopus citations

  • Component games on regular graphs

    Hod, R. & Naor, A., Jan 2014, In: Combinatorics Probability and Computing. 23, 1, p. 75-89 15 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations
  • 2013

    3/2 firefighters are not enough

    Feldheim, O. N. & Hod, R., Jan 2013, In: Discrete Applied Mathematics. 161, 1-2, p. 301-306 6 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    18 Scopus citations
  • 2012

    A construction for the hat problem on a directed graph

    Hod, R. & Krzywkowski, M., 2012, In: Electronic Journal of Combinatorics. 19

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations

  • CS1001.py: A topic-based introduction to computer science

    Chor, B. & Hod, R., 2012, ITiCSE'12 - Proceedings of the ACM Conference on Innovation and Technology in Computer Science Education. p. 215-220 6 p. (Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations

  • Random low-degree polynomials are hard to approximate

    Ben-Eliezer, I., Hod, R. & Lovett, S., Mar 2012, In: Computational Complexity. 21, 1, p. 63-81 19 p.

    Research output: Contribution to journal › Article › peer-review

    16 Scopus citations
  • 2009

    Optimal monotone encodings

    Alon, N. & Hod, R., 2009, In: IEEE Transactions on Information Theory. 55, 3, p. 1343-1353 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    6 Scopus citations

  • Random low degree polynomials are hard to approximate

    Ben-Eliezer, I., Hod, R. & Lovett, S., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 366-377 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2008

    Optimal monotone encodings

    Alon, N. & Hod, R., 2008, Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 ed. p. 258-270 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5125 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review