default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRani Hod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald:
Component Games on Random Graphs. Comb. 42(6): 1189-1229 (2022)- [j8]Arye Deutsch
, Ohad Noy Feldheim, Rani Hod:
Multi-layered planar firefighting. Discret. Math. 345(12): 113103 (2022) - 2021
- [i9]Arye Deutsch, Ohad Noy Feldheim, Rani Hod:
Multi-layered planar firefighting. CoRR abs/2105.03759 (2021) - 2020
- [j7]Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir:
Tight Bounds on Online Checkpointing Algorithms. ACM Trans. Algorithms 16(3): 31:1-31:22 (2020)
2010 – 2019
- 2018
- [c5]Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir:
Tight Bounds on Online Checkpointing Algorithms. ICALP 2018: 13:1-13:13 - 2017
- [i8]Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir:
Optimal Backup Strategies Against Cyber Attacks. CoRR abs/1704.02659 (2017) - [i7]Rani Hod:
Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions. CoRR abs/1711.00762 (2017) - 2016
- [j6]Noga Alon, Rani Hod, Amit Weinstein:
On Active and Passive Testing. Comb. Probab. Comput. 25(1): 1-20 (2016) - [c4]Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan:
Voronoi Choice Games. ICALP 2016: 23:1-23:13 - [i6]Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan:
Voronoi Choice Games. CoRR abs/1604.07084 (2016) - 2014
- [j5]Rani Hod, Alon Naor:
Component Games on Regular Graphs. Comb. Probab. Comput. 23(1): 75-89 (2014) - 2013
- [b1]Rani Hod:
Codes, games, and algorithms. Tel Aviv University, Israel, 2013 - [j4]Ohad N. Feldheim, Rani Hod:
3/2 firefighters are not enough. Discret. Appl. Math. 161(1-2): 301-306 (2013) - [i5]Rani Hod, Alon Naor:
Component Games on Regular Graphs. CoRR abs/1301.0282 (2013) - [i4]Noga Alon, Rani Hod, Amit Weinstein:
On active and passive testing. CoRR abs/1307.7364 (2013) - 2012
- [j3]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random low-degree polynomials are hard to approximate. Comput. Complex. 21(1): 63-81 (2012) - [j2]Rani Hod, Marcin Krzywkowski:
A Construction for the Hat Problem on a Directed Graph. Electron. J. Comb. 19(1): 30 (2012) - [c3]Benny Chor, Rani Hod:
CS1001.py: a topic-based introduction to computer science. ITiCSE 2012: 215-220 - 2010
- [i3]Ohad N. Feldheim, Rani Hod:
3/2 Firefighters are not enough. CoRR abs/1005.1694 (2010) - [i2]Rani Hod, Marcin Krzywkowski:
The hat problem on a directed graph. CoRR abs/1006.1587 (2010)
2000 – 2009
- 2009
- [j1]Noga Alon, Rani Hod:
Optimal Monotone Encodings. IEEE Trans. Inf. Theory 55(3): 1343-1353 (2009) - [c2]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377 - 2008
- [c1]Noga Alon, Rani Hod:
Optimal Monotone Encodings. ICALP (1) 2008: 258-270 - [i1]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random low degree polynomials are hard to approximate. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
