The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael R. Capalbo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness Conductors and Constant-Degree Lossless Expanders. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:15- [Conf]
  2. Noga Alon, Michael R. Capalbo
    Explicit Unique-Neighbor Expanders. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:73-0 [Conf]
  3. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Universality and Tolerance. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:14-21 [Conf]
  4. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Near-optimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:170-180 [Conf]
  5. Noga Alon, Michael R. Capalbo
    Smaller explicit superconcentrators. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:340-346 [Conf]
  6. Michael R. Capalbo
    A Small Universal Graph for Bounded-degree Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:156-160 [Conf]
  7. Michael R. Capalbo, S. Rao Kosaraju
    Small Universal Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:741-749 [Conf]
  8. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness conductors and constant-degree lossless expanders. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:659-668 [Conf]
  9. Michael R. Capalbo
    Small Universal Graphs for Bounded-Degree Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:345-359 [Journal]
  10. Michael R. Capalbo
    Explicit Bounded-Degree Unique-Neighbor Concentrators. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:4, pp:379-391 [Journal]
  11. Michael R. Capalbo
    An Explicit Construction of Lower-Diameter Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:635-650 [Journal]

  12. Finding Disjoint Paths in Expanders Deterministically and Online. [Citation Graph (, )][DBLP]


  13. Optimal universal graphs with deterministic embedding. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002