Search the dblp DataBase

Publications of Author

1. Richard Beigel, William Hurwood, Nabil Kahale
   Fault Diagnosis in a Flash. [Citation Graph (0, 0)][DBLP]
   FOCS, 1995, pp:571-580 [Conf]
   
2. Nabil Kahale
   Better Expansion for Ramanujan Graphs [Citation Graph (0, 0)][DBLP]
   FOCS, 1991, pp:398-404 [Conf]
   
3. Nabil Kahale
   On the Second Eigenvalue and Linear Expansion of Regular Graphs [Citation Graph (0, 0)][DBLP]
   FOCS, 1992, pp:296-303 [Conf]
   
4. Nabil Kahale, Paul E. Wright
   Dynamic Global Packet Routing in Wireless Networks. [Citation Graph (0, 0)][DBLP]
   INFOCOM, 1997, pp:1414-1421 [Conf]
   
5. Nabil Kahale
   A Semidefinite Bound for Mixing Rates of Markov Chains. [Citation Graph (0, 0)][DBLP]
   IPCO, 1996, pp:190-203 [Conf]
   
6. Nabil Kahale, Frank Thomson Leighton
   Greedy Dynamic Routing on Arrays. [Citation Graph (0, 0)][DBLP]
   SODA, 1995, pp:558-566 [Conf]
   
7. Noga Alon, Nabil Kahale
   A spectral technique for coloring random 3-colorable graphs (preliminary version). [Citation Graph (0, 0)][DBLP]
   STOC, 1994, pp:346-355 [Conf]
   
8. Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
   Lower bounds for sorting networks. [Citation Graph (0, 0)][DBLP]
   STOC, 1995, pp:437-446 [Conf]
   
9. Nabil Kahale, Leonard J. Schulman
   Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1996, v:16, n:3, pp:383-397 [Journal]
   
10. Nabil Kahale
    Large Deviation Bounds for Markov Chains. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:4, pp:465-474 [Journal]
    
11. Richard Beigel, William Hurwood, Nabil Kahale
    Fault Diagnosis in a Flash [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:11, pp:- [Journal]
    
12. Nabil Kahale
    Eigenvalues and Expansion of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:5, pp:1091-1106 [Journal]
    
13. Nabil Kahale, Frank Thomson Leighton
    Greedy Dynamic Routing on Arrays. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:390-410 [Journal]
    
14. Nabil Kahale
    New modular properties of bell numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:147-152 [Journal]
    
15. Noga Alon, Nabil Kahale
    Approximating the independence number via the theta-function. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:253-264 [Journal]
    
16. Nabil Kahale
    A semidefinite bound for mixing rates of Markov chains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:299-313 [Journal]
    
17. Noga Alon, Nabil Kahale
    A Spectral Technique for Coloring Random 3-Colorable Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1733-1748 [Journal]
    
18. Edward G. Coffman Jr., Nabil Kahale, Frank Thomson Leighton
    Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1221-1236 [Journal]
    
19. Nabil Kahale
    Isoperimetric Inequalities and Eigenvalues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:30-40 [Journal]