Michael Capalbo

Generating author description...

All published works

Action	Title	Year	Authors
+	An Explicit Infinite Family of $$\mathbb{M}$$-Vertex Graphs with Maximum Degree K and Diameter $$\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}\mathbb{M}}$$ for Each K − 1 a Prime Power	2021	Michael Capalbo
+	Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log <sub>𝐾-1</sub> 𝑁 for each 𝐾-1 a prime power	2019	Michael Capalbo
+	Near-optimum universal graphs for graphs with bounded degrees (Extended abstract)	2015	Noga Alon Michael Capalbo Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+ PDF Chat	Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$	2010	Michael Capalbo
+	Optimal universal graphs with deterministic embedding	2008	Noga Alon Michael Capalbo
+ PDF Chat	Sparse universal graphs for bounded‐degree graphs	2006	Noga Alon Michael Capalbo
+ PDF Chat	Smaller Explicit Superconcentrators	2004	Noga Alon Michael Capalbo
+	An Explicit Construction of Lower-Diameter Cubic Graphs	2003	Michael Capalbo
+	Universality and tolerance	2002	Noga Alon Michael Capalbo Yoshiharu Kohayakawa V. Rödl Andrzej Ruciński Endre Szemerédi
+	Randomness conductors and constant-degree lossless expanders	2002	Michael Capalbo Omer Reingold Salil Vadhan Avi Wigderson
+	Randomness conductors and constant-degree lossless expanders	2002	Michael Capalbo Omer Reingold Salil Vadhan Avi Wigderson
+ PDF Chat	Near-optimum Universal Graphs for Graphs with Bounded Degrees	2001	Noga Alon Michael Capalbo Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński Endre Szemerédi

Common Coauthors

Coauthor	Papers Together
Noga Alon	6
Yoshiharu Kohayakawa	3
Andrzej Ruciński	3
Endre Szemerédi	3
Avi Wigderson	2
Omer Reingold	2
Vojtěch Rödl	2
Salil Vadhan	2
V. Rödl	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Universal Graphs for Bounded-Degree Trees and Planar Graphs	1989	Sandeep Bhatt Fan Chung Frank Thomson Leighton Arnold L. Rosenberg	6
+	ON UNIVERSAL GRAPHS	1979	Fan Chung Ronald Graham	5
+	Perfect Storage Representations for Families of Data Structures	1983	Fan Chung Arnold L. Rosenberg Lawrence Snyder	5
+	On Universal Graphs for Spanning Trees	1983	Fan Chung Ronald Graham	5
+	Expanding graphs contain all small trees	1987	Joel Friedman Nicholas Pippenger	5
+ PDF Chat	On graphs which contain all small trees	1978	Fan Chung Ronald Graham	5
+	Ramanujan graphs	1988	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	5
+	On Graphs Which Contain All Sparse Graphs	1982	László Babai Fan Chung Paul Erdös Ronald Graham J. Spencer	5
+ PDF Chat	The Diameter of a Cycle Plus a Random Matching	1988	B Bollobás Fan Chung	3
+	Universality and tolerance	2002	Noga Alon Michael Capalbo Yoshiharu Kohayakawa V. Rödl Andrzej Ruciński Endre Szemerédi	3
+	Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q	1994	Moshe Morgenstern	3
+	An Explicit Construction of Lower-Diameter Cubic Graphs	2003	Michael Capalbo	2
+	Better expansion for Ramanujan graphs	2002	Nabil Kahalé	2
+	Combinatorial theory and its applications	1970	Colloquium on Combinatorial Theory P. Erdős Alfréd Rényi Vera T. Sós Bolyai János Matematikai Társulat	2
+ PDF Chat	Near-optimum Universal Graphs for Graphs with Bounded Degrees	2001	Noga Alon Michael Capalbo Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	2
+	Cubic Ramanujan graphs	1992	Patrick Chiu	2
+ PDF Chat	Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory	2017	João Araújo Wolfram Bentz Edward Dobson Janusz Konieczny Joy Morris	2
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon	2
+ PDF Chat	The strong chromatic number of a graph	1992	Noga Alon	1
+	The Blow-up Lemma	1999	János Komlós	1
+	Threshold Functions for <i>H</i>-factors	1993	Noga Alon Raphael Yuster	1
+	Perfect matchings in -regular graphs.	1998	Noga Alon Beverly Sackler Vojtěch Rödl Andrzej Ruci	1
+	Constructing disjoint paths on expander graphs	1989	David Peleg Eli Upfal	1
+	Expanders obtained from affine transformations	1987	Shuji Jimbo Akira Maruoka	1
+	Matching Theory (North-Holland mathematics studies)	1986	László Lovász	1
+	Almost universal graphs	2006	Alan Frieze Michael Krivelevich	1
+ PDF Chat	Sparse universal graphs for bounded‐degree graphs	2006	Noga Alon Michael Capalbo	1
+ PDF Chat	Diameter of Ramanujan Graphs and Random Cayley Graphs	2018	Naser T. Sardari	1
+	Lower bounds for polynomial calculus: non-binomial case	2001	M. Alekhnovich Alexander Razborov	1
+ PDF Chat	Sorting and Selecting in Rounds	1987	Nicholas Pippenger	1
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman	1
+	Spanning subgraphs of random graphs	1992	Noga Alon Zoltán Füredi	1
+	Matching and covering the vertices of a random graph by copies of a given graph	1992	Andrzej Ruciński	1
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński	1
+	An algorithmic approach to the Lovász local lemma. I	1991	József Beck	1
+ PDF Chat	Eigenvalues and expansion of regular graphs	1995	Nabil Kahalé	1
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	1
+	Expanders and Diffusers	1986	Marshall W. Buck	1
+	Better expanders and superconcentrators	1987	Noga Alon Zvi Galil Vitali Milman	1
+	Randomness is Linear in Space	1996	Noam Nisan David Zuckerman	1
+	Hypergraph Packing and Graph Embedding	1999	V. Rödl Andrzej Ruciński Anusch Taraz	1
+	Spanning Subgraphs of Random Graphs	2000	Oliver Riordan	1
+	Explicit constructions of linear size superconcentrators	1979	Ofer Gabber Zvi Galil	1
+ PDF Chat	A parallel algorithmic version of the local lemma	1991	Noga Alon	1
+	Tiny families of functions with random properties: A quality-size trade-off for hashing	1997	Oded Goldreich Avi Wigderson	1