The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David A. Grable: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David A. Grable, Alessandro Panconesi
    Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:278-285 [Conf]
  2. David A. Grable, Alessandro Panconesi
    Fast Distributed Algorithms for {Brooks-Vizing} Colourings. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:473-480 [Conf]
  3. David A. Grable
    More-Than-Nearly-Perfect Packings and Partial Designs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:221-239 [Journal]
  4. David A. Grable, Kevin T. Phelps, Vojtech Rödl
    The Minimum Independence Number for Designs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:175-185 [Journal]
  5. David A. Grable
    On Random Greedy Triangle Packing. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  6. David A. Grable
    A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:57-63 [Journal]
  7. David A. Grable
    Nearly-Perfect Hypergraph Packing is in NC. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:6, pp:295-299 [Journal]
  8. David A. Grable, Alessandro Panconesi
    Fast Distributed Algorithms for Brooks-Vizing Colorings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:85-120 [Journal]
  9. David A. Grable
    Sharpened Bonferroni Inequalities. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:131-137 [Journal]
  10. David A. Grable
    Almost All Linear Spaces and Partial t-Designs Have Trivial Automorphism Groups. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:1, pp:1-32 [Journal]
  11. David A. Grable
    The Diameter of a Random Graph with Bounded Diameter. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:193-200 [Journal]
  12. David A. Grable, Alessandro Panconesi
    Nearly optimal distributed edge coloring in O(log log n) rounds. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:3, pp:385-405 [Journal]
  13. Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi
    Near-Optimal, Distributed Edge Colouring via the Nibble Method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:2, pp:225-251 [Journal]
  14. Graham Brightwell, David A. Grable, Hans Jürgen Prömel
    Forbidden induced partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:53-80 [Journal]
  15. Dan Archdeacon, David A. Grable
    The genus of a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:21-37 [Journal]
  16. David A. Grable
    Hypergraphs and sharpened sieve inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:75-82 [Journal]

Search in 0.002secs, Finished in 0.003secs
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