Nabil Kahalé

According to our database1, Nabil Kahalé authored at least 22 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Randomized Dimension Reduction for Monte Carlo Simulations.
Manag. Sci., 2020

General multilevel Monte Carlo methods for pricing discretely monitored Asian options.
Eur. J. Oper. Res., 2020

Least-squares regressions via randomized Hessians.
CoRR, 2020

2019
Efficient Simulation of High Dimensional Gaussian Vectors.
Math. Oper. Res., 2019

2017
Superreplication of Financial Derivatives via Convex Programming.
Manag. Sci., 2017

1998
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times.
SIAM J. Comput., 1998

Approximating the independence number via the theta-function.
Math. Program., 1998

Greedy Dynamic Routing on Arrays.
J. Algorithms, 1998

1997
Isoperimetric Inequalities and Eigenvalues.
SIAM J. Discret. Math., 1997

A Spectral Technique for Coloring Random 3-Colorable Graphs.
SIAM J. Comput., 1997

A semidefinite bound for mixing rates of Markov chains.
Random Struct. Algorithms, 1997

Large Deviation Bounds for Markov Chains.
Comb. Probab. Comput., 1997

Dynamic Global Packet Routing in Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM '97, 1997

1996
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph.
Comb., 1996

1995
Eigenvalues and Expansion of Regular Graphs.
J. ACM, 1995

Lower bounds for sorting networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Fault Diagnosis in a Flash
Electron. Colloquium Comput. Complex., 1994

A spectral technique for coloring random 3-colorable graphs (preliminary version).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993
Expander graphs.
PhD thesis, 1993

1992
On the Second Eigenvalue and Linear Expansion of Regular Graphs
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
New modular properties of bell numbers.
J. Comb. Theory, Ser. A, 1991

Better Expansion for Ramanujan Graphs
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991


  Loading...