Nabil Kahalé

According to our database, Nabil Kahalé authored at least 25 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Unbiased Time-Average Estimators for Markov Chains.

Nabil Kahalé

Math. Oper. Res., 2024

Unbiased least squares regression via averaged stochastic gradient descent.

Nabil Kahalé

CoRR, 2024

2022

On the effective dimension and multilevel Monte Carlo.

Nabil Kahalé

Oper. Res. Lett., 2022

2020

Randomized Dimension Reduction for Monte Carlo Simulations.

Nabil Kahalé

Manag. Sci., 2020

General multilevel Monte Carlo methods for pricing discretely monitored Asian options.

Nabil Kahalé

Eur. J. Oper. Res., 2020

Least-squares regressions via randomized Hessians.

Nabil Kahalé

CoRR, 2020

2019

Efficient Simulation of High Dimensional Gaussian Vectors.

Nabil Kahalé

Math. Oper. Res., 2019

2017

Superreplication of Financial Derivatives via Convex Programming.

Nabil Kahalé

Manag. Sci., 2017

1998

Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times.

Edward G. Coffman Jr., Nabil Kahalé, Frank Thomson Leighton

SIAM J. Comput., 1998

Approximating the independence number via the theta-function.

Noga Alon, Nabil Kahalé

Math. Program., 1998

1997

Isoperimetric Inequalities and Eigenvalues.

Nabil Kahalé

SIAM J. Discret. Math., 1997

A Spectral Technique for Coloring Random 3-Colorable Graphs.

Noga Alon, Nabil Kahalé

SIAM J. Comput., 1997

Large Deviation Bounds for Markov Chains.

Nabil Kahalé

Comb. Probab. Comput., 1997

Dynamic Global Packet Routing in Wireless Networks.

Nabil Kahalé, Paul E. Wright

Proceedings of the Proceedings IEEE INFOCOM '97, 1997

1996

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

Nabil Kahalé, Leonard J. Schulman

Comb., 1996

A Semidefinite Bound for Mixing Rates of Markov Chains.

Nabil Kahalé

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Eigenvalues and Expansion of Regular Graphs.

Nabil Kahalé

J. ACM, 1995

Lower bounds for sorting networks.

Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Greedy Dynamic Routing on Arrays.

Nabil Kahalé, Frank Thomson Leighton

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Fault Diagnosis in a Flash.

Richard Beigel, William Hurwood, Nabil Kahalé

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

A spectral technique for coloring random 3-colorable graphs (preliminary version).

Noga Alon, Nabil Kahalé

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Expander graphs.

Nabil Kahalé

PhD thesis, 1993

1992

On the Second Eigenvalue and Linear Expansion of Regular Graphs.

Nabil Kahalé

Proceedings of the Expanding Graphs, 1992

1991

New modular properties of bell numbers.

Nabil Kahalé

J. Comb. Theory A, 1991

Better Expansion for Ramanujan Graphs

Nabil Kahalé

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991