dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Michael R. Capalbo Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo: Explicit sparse almost-universal graphs for G(n, k/n). Random Struct. Algorithms 37(4): 437-454 (2010)
2008
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Optimal universal graphs with deterministic embedding. SODA 2008: 373-378
2007
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Finding Disjoint Paths in Expanders Deterministically and Online. FOCS 2007: 518-524
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Sparse universal graphs for bounded-degree graphs. Random Struct. Algorithms 31(2): 123-133 (2007)
2005
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo: Explicit Bounded-Degree Unique-Neighbor Concentrators. Combinatorica 25(4): 379-391 (2005)
2003
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Smaller explicit superconcentrators. SODA 2003: 340-346
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Smaller Explicit Superconcentrators. Internet Mathematics 1(2): 151-163 (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo: An Explicit Construction of Lower-Diameter Cubic Graphs. SIAM J. Discrete Math. 16(4): 630-634 (2003)
2002
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo: Explicit Unique-Neighbor Expanders. FOCS 2002: 73-
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Randomness Conductors and Constant-Degree Lossless Expanders. IEEE Conference on Computational Complexity 2002: 15
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo: Small Universal Graphs for Bounded-Degree Planar Graphs. Combinatorica 22(3): 345-359 (2002)
2001
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001: 170-180
2000
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Universality and Tolerance. FOCS 2000: 14-21
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo: A Small Universal Graph for Bounded-degree Planar Graphs. SODA 1999: 156-160
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Capalbo, S. Rao Kosaraju: Small Universal Graphs. STOC 1999: 741-749

Coauthor Index

1Noga Alon [3] [4] [8] [10] [11] [13] [14] [15]
2Yoshiharu Kohayakawa [3] [4]
3S. Rao Kosaraju [1]
4Omer Reingold [6] [7]
5Vojtech Rödl [3] [4]
6Andrzej Rucinski [3] [4]
7Endre Szemerédi [3] [4]
8Salil P. Vadhan [6] [7]
9Avi Wigderson [6] [7]

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page