Rani Hod

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Component Games on Random Graphs	2022	Rani Hod Michael Krivelevich Tobias Müller Alon Naor Nicholas Wormald
+ PDF Chat	Multi-layered planar firefighting	2022	A. S. Deutsch Ohad N. Feldheim Rani Hod
+	Multi-layered planar firefighting	2021	Arye Deutch Ohad N. Feldheim Rani Hod
+ PDF Chat	Tight Bounds on Online Checkpointing Algorithms	2020	Achiya Bar-On Itai Dinur Orr Dunkelman Rani Hod Nathan Keller Eyal Ronen Adi Shamir
+	Component Games on Random Graphs	2020	Rani Hod Michael Krivelevich Tobias Müller Alon Naor Nicholas Wormald
+	Tight Bounds on Online Checkpointing Algorithms	2018	Achiya Bar-On Itai Dinur Orr Dunkelman Rani Hod Nathan Keller Eyal Ronen Adi Shamir
+	Optimal Backup Strategies Against Cyber Attacks.	2017	Achiya Bar-On Itai Dinur Orr Dunkelman Rani Hod Nathan Keller Eyal Ronen Adi Shamir
+	Tight Bounds on Online Checkpointing Algorithms	2017	Achiya Bar-On Itai Dinur Orr Dunkelman Rani Hod Nathan Keller Eyal Ronen Adi Shamir
+	Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions	2017	Rani Hod
+	Tight Bounds on Online Checkpointing Algorithms	2017	Achiya Bar-On Itai Dinur Orr Dunkelman Rani Hod Nathan Keller Eyal Ronen Adi Shamir
+	Voronoi Choice Games	2016	Meena Boppana Rani Hod Michael Mitzenmacher Thomas Morgan
+	Voronoi Choice Games	2016	Meena Boppana Rani Hod Michael Mitzenmacher Thomas Morgan
+ PDF Chat	On Active and Passive Testing	2016	Noga Alon Rani Hod Amit Weinstein
+	Strong embeddings and $2$-isomorphism	2016	Rani Hod An Huang Mark Kempton Shing‐Tung Yau
+	Voronoi Choice Games	2016	Meena Boppana Rani Hod Michael Mitzenmacher Thomas Morgan
+ PDF Chat	A Construction of Almost Steiner Systems	2013	Asaf Ferber Rani Hod Michael Krivelevich Benny Sudakov
+ PDF Chat	Component Games on Regular Graphs	2013	Rani Hod Alon Naor
+	A construction of almost Steiner systems	2013	Asaf Ferber Rani Hod Michael Krivelevich Benny Sudakov
+	Component Games on Regular Graphs	2013	Rani Hod Alon Naor
+	Component Games on Regular Graphs	2013	Rani Hod Alon Naor
+	A construction of almost Steiner systems	2013	Asaf Ferber Rani Hod Michael Krivelevich Benny Sudakov
+	3/2 firefighters are not enough	2012	Ohad N. Feldheim Rani Hod
+ PDF Chat	A Construction for the Hat Problem on a Directed Graph	2012	Rani Hod Marcin Krzywkowski
+	Random low-degree polynomials are hard to approximate	2011	Ido Ben‐Eliezer Rani Hod Shachar Lovett
+	The hat problem on a directed graph	2010	Rani Hod Marcin Krzywkowski
+	A construction for the hat problem on a directed graph	2010	Rani Hod Marcin Krzywkowski
+	A construction for the hat problem on a directed graph	2010	Rani Hod Marcin Krzywkowski
+	Random Low Degree Polynomials are Hard to Approximate	2009	Ido Ben‐Eliezer Rani Hod Shachar Lovett
+	Random low degree polynomials are hard to approximate.	2008	Ido Ben‐Eliezer Rani Hod Shachar Lovett

Common Coauthors

Coauthor	Papers Together
Eyal Ronen	5
Alon Naor	5
Michael Krivelevich	5
Adi Shamir	5
Achiya Bar-On	5
Itai Dinur	5
Orr Dunkelman	5
Nathan Keller	5
Marcin Krzywkowski	4
Meena Boppana	3
Asaf Ferber	3
Shachar Lovett	3
Ohad N. Feldheim	3
Ido Ben‐Eliezer	3
Michael Mitzenmacher	3
Benny Sudakov	3
Thomas Morgan	3
Nicholas Wormald	2
Amit Weinstein	1
Tobias Müller	1
An Huang	1
Mark Kempton	1
A. S. Deutsch	1
Noga Alon	1
Tobias Müller	1
Arye Deutch	1
Shing‐Tung Yau	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	None	2009	Gruia Călinescu Chandra Chekuri J. Vondrák	3
+	None	2005	Jeong Han Kim Oleg Pikhurko Joel Spencer Oleg Verbitsky	3
+ PDF Chat	Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices	2005	Peter Keevash Benny Sudakov	2
+	Global Maker–Breaker games on sparse graphs	2010	Dan Hefetz Michael Krivelevich Miloš Stojaković Tibor Szabó	2
+	Average firefighting on infinite grids	2008	Margaret-Ellen Messinger	2
+	Fire containment in grids of dimension three and higher	2007	Mike Develin Stephen G. Hartke	2
+	The distribution of polynomials over finite fields, with applications to the Gowers norms	2007	Ben Green Terence Tao	2
+	On the Problem of Decomposing a Graph into <i>n</i> Connected Factors	1961	W. T. Tutte	2
+	On the density of sets of vectors	1983	Noga Alon	2
+	A new proof of Szemerédi's theorem	2001	W. T. Gowers	2
+	Partial Steiner systems and matchings in hypergraphs	1998	Alexandr Kostochka V. R�dl	2
+	Biased positional games and the phase transition	2001	Ma gorzata Bednarska Tomasz uczak	2
+ PDF Chat	Positional games on random graphs	2005	Miloš Stojaković Tibor Szabó	2
+	Hat Guessing Games	2008	Steve Butler Mohammad Taghi Hajiaghayi Robert Kleinberg Tom Leighton	2
+	More-Than-Nearly-Perfect Packings and Partial Designs	1999	David A. Grable	2
+ PDF Chat	Doubly Biased Maker-Breaker Connectivity Game	2012	Dan Hefetz Mirjana Mikalački Miloš Stojaković	2
+	Problems and results in extremal combinatorics—I	2003	Noga Alon	2
+ PDF Chat	Biased games on random boards	2014	Asaf Ferber Roman Glebov Michael Krivelevich Alon Naor	2
+	The firefighter problem for graphs of maximum degree three	2006	Stephen Finbow Andrew D. King Gary MacGillivray Roméo Rizzi	2
+	On the trace of finite sets	1983	Péter Frankl	2
+	Worst Case to Average Case Reductions for Polynomials	2008	Tali Kaufman Shachar Lovett	2
+ PDF Chat	Percolation on finite graphs and isoperimetric inequalities	2004	Noga Alon Itaı Benjamini Alan Stacey	2
+ PDF Chat	Small Sample Spaces Cannot Fool Low Degree Polynomials	2008	Noga Alon Ido Ben‐Eliezer Michael Krivelevich	2
+	Asymptotic random graph intuition for the biased connectivity game	2009	Heidi Gebauer Tibor Szabó	2
+	Applications of recursive operators to randomness and complexity	1998	Todd Ebert John Doner	2
+	Nearly Optimal Partial Steiner Systems	2001	Jeong Han Kim	2
+ PDF Chat	Online Checkpointing with Improved Worst-Case Guarantees	2013	Karl Bringmann Carola Doerr Adrian Neumann Jakub Sliačan	2
+	Edge-Disjoint Spanning Trees of Finite Graphs	1961	C. St. J. A. Nash‐Williams	2
+	None	2010		2
+	The Angel Problem	1996	J. Conway	1
+	Hat problem on odd cycles	2011	Marcin Krzywkowski	1
+	A simple solution to the <i>k</i>‐core problem	2006	Svante Janson Malwina Luczak	1
+ PDF Chat	Introduction to Random Graphs	2015	Alan Frieze Michał Karoński	1
+	The hat problem on cycles on at least nine vertices.	2011	Marcin Krzywkowski	1
+ PDF Chat	Parallel Peeling Algorithms	2016	Jiayang Jiang Michael Mitzenmacher Justin Thaler	1
+	Hat Problem on the Cycle C 4	2010	Marcin Krzywkowski	1
+ PDF Chat	Firefighting on Trees Beyond Integrality Gaps	2018	David Adjiashvili Andrea Baggio Rico Zenklusen	1
+	Firefighting on Trees Beyond Integrality Gaps	2017	David Adjiashvili Andrea Baggio Rico Zenklusen	1
+ PDF Chat	Critical percolation on random regular graphs	2009	Asaf Nachmias Yuval Peres	1
+ PDF Chat	Component Games on Regular Graphs	2013	Rani Hod Alon Naor	1
+ PDF Chat	The solution space geometry of random linear equations	2013	Dimitris Achlioptas Michael Molloy	1
+ PDF Chat	Problems and results in extremal combinatorics—II	2007	Noga Alon	1
+	The firefighter problem on polynomial and intermediate growth groups	2020	Gideon Amir Rangel Baldasso Gady Kozma	1
+	Extremal Combinatorics	2001	Stasys Jukna	1
+	Ramanujan graphs	1988	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	1
+	On a limit theorem in combinatorical analysis	2022	P. Erdős H. Hanani	1
+ PDF Chat	Nombre chromatique et plus longs chemins d'un graphe	1967	Bishwambhar Roy	1
+	The List-Decoding Size of Reed-Muller Codes	2008	Tali Kaufman Shachar Lovett	1
+	The hat problem on a union of disjoint graphs	2011	Marcin Krzywkowski	1
+	Extremal Combinatorics: With Applications in Computer Science	2001	Stasys Jukna	1