Searching for authors named "Nabil Kahale" – sorted by Relevance.
18 documents found, showing 1 through 10.
Next 10 →
-
Isoperimetric Inequalities and Eigenvalues
- …Isoperimetric Inequalities and Eigenvalues Nabil Kahale 3 Abstract An upper bound is given…
- Cited by 4 (0 self) – Add To MetaCart
-
On Reducing the Cut Ratio to the Multicut Problem
- …On reducing the cut ratio to the multicut problem Nabil Kahale 3 Abstract We compare two…
- Cited by 1 (0 self) – Add To MetaCart
-
A Semidefinite Bound for Mixing Rates of Markov Chains
- …A Semidefinite Bound for Mixing Rates of Markov Chains Nabil Kahale ? AT&T Bell Laboratories…
- Cited by 20 (0 self) – Add To MetaCart
-
Large deviation bounds for Markov chains
- …Large deviation bounds for Markov chains Nabil Kahale Abstract We study the fraction of time…
- Cited by 9 (0 self) – Add To MetaCart
-
Eigenvalues and Expansion of Regular Graphs
- … Eigenvalues and Expansion of Regular Graphs Nabil Kahale Abstract The spectral method…
- Cited by 40 (1 self) – Add To MetaCart
-
unknown title
- …A spectral technique for coloring random 3-colorable graphs Noga Alon ∗ Nabil Kahale † Abstract…
- Add To MetaCart
-
Approximating the Independence Number Via the Theta-Function
- …Approximating the independence number via the `-function Noga Alon Nabil Kahale y November 26…
- Cited by 7 (0 self) – Add To MetaCart
-
On the Minimum Distance of Parallel and Serially Concatenated Codes
- … 1 On the Minimum Distance of Parallel and Serially Concatenated Codes Nabil Kahale Room C-258 Tel…
- Cited by 22 (0 self) – Add To MetaCart
-
Greedy Dynamic Routing on Arrays
- … Greedy Dynamic Routing on Arrays Nabil Kahale Tom Leighton y Abstract We study the problem…
- Cited by 22 (4 self) – Add To MetaCart
-
A spectral technique for coloring random 3-colorable graphs
- …–1748, December 1997 009 A SPECTRAL TECHNIQUE FOR COLORING RANDOM 3-COLORABLE GRAPHS ∗ NOGA ALON † AND NABIL…
- Cited by 61 (5 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
