Annalisa De Bonis

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Improved bounds for group testing in arbitrary hypergraphs	2024	Annalisa De Bonis
+	Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures	2023	Annalisa De Bonis
+	$\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication	2017	Annalisa De Bonis Ugo Vaccaro
+ PDF Chat	Partial Covering Arrays: Algorithms and Asymptotics	2017	Kaushik Sarkar Charles J. Colbourn Annalisa De Bonis Ugo Vaccaro
+	Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing	2016	Annalisa De Bonis
+	Partial Covering Arrays: Algorithms and Asymptotics	2016	Kaushik Sarkar Charles J. Colbourn Annalisa De Bonis Ugo Vaccaro
+	Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions	2016	Annalisa De Bonis
+ PDF Chat	Partial Covering Arrays: Algorithms and Asymptotics	2016	Kaushik Sarkar Charles J. Colbourn Annalisa De Bonis Ugo Vaccaro
+	Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing	2016	Annalisa De Bonis
+	Partial Covering Arrays: Algorithms and Asymptotics	2016	Kaushik Sarkar Charles J. Colbourn Annalisa De Bonis Ugo Vaccaro
+ PDF Chat	Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing	2015	Annalisa De Bonis
+	$$\epsilon $$-Almost Selectors and Their Applications	2015	Annalisa De Bonis Ugo Vaccaro
+ PDF Chat	Largest Families Without an r-Fork	2007	Annalisa De Bonis Gyula O. H. Katona
+	Largest family without <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>A</mml:mi><mml:mo>∪</mml:mo><mml:mi>B</mml:mi><mml:mo>⊆</mml:mo><mml:mi>C</mml:mi><mml:mo>∩</mml:mo><mml:mi>D</mml:mi></mml:math>	2005	Annalisa De Bonis Gyula O. H. Katona Konrad J. Swanepoel

Common Coauthors

Coauthor	Papers Together
Ugo Vaccaro	6
Charles J. Colbourn	4
Kaushik Sarkar	3
Gyula O. H. Katona	2
Kaushik Sarkar	1
Konrad J. Swanepoel	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Families of finite sets in which no set is covered by the union ofr others	1985	P. Erdős Péter Frankl Zoltán Füredi	3
+ PDF Chat	Locally Thin Set Families	2000	Noga Alon Emanuela Fachini János Körner	3
+	Two applications (for search theory and truth functions) of Sperner type theorems	1973	Gyula O. H. Katona	3
+	On sets of Boolean n-vectors with all k-projections surjective	1983	AshokK. Chandra LawrenceT. Kou George Markowsky Shmuel Zaks	3
+	Sperner capacities	1993	Luisa Gargano J. K�rner Ugo Vaccaro	3
+	<i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations	1996	Anant P. Godbole Daphne Skipper Rachel A. Sunley	3
+ PDF Chat	A constructive proof of the general lovász local lemma	2010	Robin A. Moser Gábor Tardos	3
+	On the upper bound of the size of the r-cover-free families	1994	Miklós Ruszinkó	3
+ PDF Chat	$S$-constrained random matrices	2006	Sylvain Gravier Bernard Ycart	3
+	Extremal Combinatorics: With Applications in Computer Science	2001	Stasys Jukna	3
+	On the ratio of optimal integral and fractional covers	1975	László Lovász	3
+	Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set	1963	L. D. Meshalkin	2
+	Lower bounds for identifying subset members with subset queries	1995	Emanuel Knill	2
+	A short proof of Sperner's lemma	1966	David Lubell	2
+ PDF Chat	On a lemma of Littlewood and Offord	1945	P. Erdős	2
+ PDF Chat	Extremal problems with excluded subgraphs in the n-cube	1983	Gyula O. H. Katona Tamás Tarján	2
+	Upper bounds on the size of covering arrays	2016	Kaushik Sarkar Charles J. Colbourn	2
+	Two-stage algorithms for covering array construction	2016	Kaushik Sarkar Charles J. Colbourn	2
+	Randomized Communication in Radio Networks.	2018	Bogdan S. Chlebus	2
+ PDF Chat	On Almost Disjunct Matrices for Group Testing	2012	Arya Mazumdar	2
+ PDF Chat	Asymptotic Size of Covering Arrays: An Application of Entropy Compression	2017	Nevena Francetić Brett Stevens	2
+	Ein Satz �ber Untermengen einer endlichen Menge	1928	Emanuel Sperner	2
+ PDF Chat	Randomized Communication in Radio Networks	2001	Bogdan S. Chlebus	2
+	Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability	1986	Béla Bollobás	1
+	Largest family without <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>A</mml:mi><mml:mo>∪</mml:mo><mml:mi>B</mml:mi><mml:mo>⊆</mml:mo><mml:mi>C</mml:mi><mml:mo>∩</mml:mo><mml:mi>D</mml:mi></mml:math>	2005	Annalisa De Bonis Gyula O. H. Katona Konrad J. Swanepoel	1
+	Almost cover-free codes and designs	2015	A.G. D'yachkov Ilya Vorobyev Nikita Polyanskii V. Yu. Shchukin	1
+	Onr-Cover-free Families	1996	Zoltán Füredi	1
+	A simple proof of the Erdös-Chao Ko-Rado theorem	1972	Gyula O. H. Katona	1
+	Two combinatorial covering theorems	1974	Sherman K. Stein	1
+ PDF Chat	Random Access With Physical-Layer Network Coding	2015	Jasper Goseling Michael Gastpar Jos H. Weber	1
+ PDF Chat	Group Testing Algorithms: Bounds and Simulations	2014	Matthew Aldridge Leonardo Baldassini Oliver Johnson	1
+ PDF Chat	Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms	2014	Chun Lam Chan Sidharth Jaggi Venkatesh Saligrama Samar Agnihotri	1
+ PDF Chat	Applied Mathematical Sciences	2021	Paolo De Angelis Roberto De Marchis Antonio Martire Stefano Patrì	1
+	Almost disjunct matrices from codes and designs.	2015	Alexander Barg Arya Mazumdar	1
+ PDF Chat	Exact Learning of Juntas from Membership Queries	2016	Nader H. Bshouty Areej Costa	1
+	A Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set	1963	L.D. Mesalkin	1
+	Asymptotic size of covering arrays: an application of entropy compression	2015	Nevena Francetić Brett Stevens	1
+ PDF Chat	Almost Cover-Free Codes and Designs	2015	A.G. D'yachkov Ilya Vorobyev Nikita Polyanskii V. Yu. Shchukin	1
+ PDF Chat	Upper Bounds on the Size of Covering Arrays	2017	Kaushik Sarkar Charles J. Colbourn	1
+ PDF Chat	Boolean Compressed Sensing and Noisy Group Testing	2012	George K. Atia Venkatesh Saligrama	1
+	None	1998	Hai Tran Thanh	1