Jill S. Dizona

Generating author description...

All published works

Action	Title	Year	Authors
+	Constructive Packings by Linear Hypergraphs	2013	Jill S. Dizona Brendan Nagle
+	On Algorithmic Fractional Packings of Hypergraphs	2012	Jill S. Dizona

Common Coauthors

Coauthor	Papers Together
Brendan Nagle	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	An Algorithmic Regularity Lemma for Hypergraphs	2000	Andrzej Czygrinow Vojtěch Rödl	2
+ PDF Chat	The Algorithmic Aspects of the Regularity Lemma	1994	Noga Alon Richard A. Duke Hanno Lefmann V. Rödl Raphael Yuster	2
+	Extremal problems on set systems	2002	Péter Frankl Vojtěch Rödl	2
+ PDF Chat	Bipartite Subgraphs and Quasi-Randomness	2004	Jozef Skokan Luboš Thoma	2
+	Weak hypergraph regularity and linear hypergraphs	2009	Yoshiharu Kohayakawa Brendan Nagle Vojtěch Rödl Mathias Schacht	2
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	2
+	Regularity Lemma for k‐uniform hypergraphs	2004	Vojtěch Rödl Jozef Skokan	2
+	The Uniformity Lemma for hypergraphs	1992	Péter Frankl V. Rödl	2
+ PDF Chat	Hypergraph regularity and the multidimensional Szemerédi theorem	2007	William Timothy Gowers	2
+	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs	2006	W. T. Gowers	2
+	Integer and fractional packings of hypergraphs	2006	V. Rödl Mathias Schacht Mark Siggers Norihide Tokushige	2
+ PDF Chat	Integer and fractional packings in dense 3‐uniform hypergraphs	2003	Penny Haxell Brendan Nagle Vojtěch Rödl	2
+	An Algorithmic Version of the Hypergraph Regularity Method	2008	Penny Haxell Brendan Nagle V. Rödl	2
+	An Optimal Algorithm for Checking Regularity	2003	Yoshiharu Kohayakawa V. Rödl Luboš Thoma	2
+	Integer and Fractional Packings in Dense Graphs	2001	Penny Haxell V. Rödl	2
+ PDF Chat	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi	1
+	Hypergraph regularity and quasi-randomness	2009	Brendan Nagle Annika Poerschket Vojtěch Rödl Mathias Schacht	1
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	1
+	Hypergraph regularity and quasi-randomness	2009	Brendan Nagle Annika Poerschke Vojtěch Rödl Mathias Schacht	1
+	The Regularity Lemma and Its Applications in Graph Theory	2002	János Komlós Ali Shokoufandeh Miklós Simonovits Endre Szemerédi	1
+	Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture	1997	Dorit Dor Michael Tarsi	1
+	A random graph	1981	Sheldon M. Ross	1
+	Graph decomposition is NPC - a complete proof of Holyer's conjecture	1992	Dorit Dor Michael Tarsi	1
+	Lower bounds of tower type for Szemerédi's uniformity lemma	1997	W. T. Gowers	1
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	1
+	Weak quasi‐randomness for uniform hypergraphs	2011	David Conlon Hiệp Hàn Yury Person Mathias Schacht	1
+	None	2005	Jeong Han Kim Oleg Pikhurko Joel Spencer Oleg Verbitsky	1
+	An Algorithmic Version of the Hypergraph Regularity Method	2005	Penny Haxell Brendan Nagle V. Rödl	1
+ PDF Chat	On characterizing hypergraph regularity	2002	Yulia Dementieva Penny Haxell Brendan Nagle V. Rödl	1
+	Extremal problems on set systems	2002	Péter Frankl Vojtěch Rödl	1
+ PDF Chat	Integer and fractional packing of families of graphs	2004	Raphael Yuster	1