Nabil Kahalé

977 total citations
30 papers, 533 citations indexed

About

Nabil Kahalé is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Finance. According to data from OpenAlex, Nabil Kahalé has authored 30 papers receiving a total of 533 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 10 papers in Discrete Mathematics and Combinatorics and 7 papers in Finance. Recurrent topics in Nabil Kahalé's work include Limits and Structures in Graph Theory (8 papers), Stochastic processes and financial applications (7 papers) and Advanced Graph Theory Research (7 papers). Nabil Kahalé is often cited by papers focused on Limits and Structures in Graph Theory (8 papers), Stochastic processes and financial applications (7 papers) and Advanced Graph Theory Research (7 papers). Nabil Kahalé collaborates with scholars based in United States, Germany and France. Nabil Kahalé's co-authors include Noga Alon, Rüdiger Urbanke, Paul E. Wright, Tom Leighton, Leonard J. Schulman, E. G. Coffman, Bjorn Poonen, Anja Feldmann, Endre Szemerédi and Yuan Ma and has published in prestigious journals such as Management Science, European Journal of Operational Research and Journal of the ACM.

In The Last Decade

Nabil Kahalé

29 papers receiving 474 citations

Peers

Nabil Kahalé
Stephen Suen United States
Neil J. Calkin United States
Ryan R. Martin United States
L. H. Harper United States
Emanuele Viola United States
Stephen Suen United States
Nabil Kahalé
Citations per year, relative to Nabil Kahalé Nabil Kahalé (= 1×) peers Stephen Suen

Countries citing papers authored by Nabil Kahalé

Since Specialization
Citations

This map shows the geographic impact of Nabil Kahalé's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nabil Kahalé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nabil Kahalé more than expected).

Fields of papers citing papers by Nabil Kahalé

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nabil Kahalé. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nabil Kahalé. The network helps show where Nabil Kahalé may publish in the future.

Co-authorship network of co-authors of Nabil Kahalé

This figure shows the co-authorship network connecting the top 25 collaborators of Nabil Kahalé. A scholar is included among the top collaborators of Nabil Kahalé based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nabil Kahalé. Nabil Kahalé is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kahalé, Nabil. (2022). On the effective dimension and multilevel Monte Carlo. Operations Research Letters. 50(4). 415–421.
2.
Kahalé, Nabil. (2020). General multilevel Monte Carlo methods for pricing discretely monitored Asian options. European Journal of Operational Research. 287(2). 739–748. 8 indexed citations
3.
Kahalé, Nabil. (2019). Randomized Dimension Reduction for Monte Carlo Simulations. Management Science. 66(3). 1421–1439. 4 indexed citations
4.
Kahalé, Nabil. (2017). Superreplication of Financial Derivatives via Convex Programming. Management Science. 63(7). 2323–2339. 7 indexed citations
5.
Kahalé, Nabil. (2014). MODEL‐INDEPENDENT LOWER BOUND ON VARIANCE SWAPS. Mathematical Finance. 26(4). 939–961. 6 indexed citations
6.
Kahalé, Nabil & Paul E. Wright. (2002). Dynamic global packet routing in wireless networks. 3. 1414–1421. 55 indexed citations
7.
Coffman, E. G., Anja Feldmann, Nabil Kahalé, & Bjorn Poonen. (1999). COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS. Probability in the Engineering and Informational Sciences. 13(4). 387–406. 7 indexed citations
8.
Coffman, E. G., Nabil Kahalé, & Frank Thomson Leighton. (1998). Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM Journal on Computing. 27(5). 1221–1236. 4 indexed citations
9.
Alon, Noga & Nabil Kahalé. (1998). Approximating the independence number via theϑ-function. Mathematical Programming. 80(3). 253–264. 71 indexed citations
10.
Kahalé, Nabil & Tom Leighton. (1998). Greedy Dynamic Routing on Arrays. Journal of Algorithms. 29(2). 390–410. 2 indexed citations
11.
Kahalé, Nabil. (1997). Isoperimetric Inequalities and Eigenvalues. SIAM Journal on Discrete Mathematics. 10(1). 30–40. 10 indexed citations
12.
Kahalé, Nabil. (1997). Large Deviation Bounds for Markov Chains. Combinatorics Probability Computing. 6(4). 465–474. 25 indexed citations
13.
Alon, Noga & Nabil Kahalé. (1997). A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computing. 26(6). 1733–1748. 95 indexed citations
14.
Kahalé, Nabil & Tom Leighton. (1995). Greedy dynamic routing on arrays. Symposium on Discrete Algorithms. 29(2). 558–566. 18 indexed citations
15.
Kahalé, Nabil. (1995). Eigenvalues and expansion of regular graphs. Journal of the ACM. 42(5). 1091–1106. 65 indexed citations
16.
Kahalé, Nabil, Tom Leighton, Yuan Ma, et al.. (1995). Lower bounds for sorting networks. 437–446. 6 indexed citations
17.
Kahalé, Nabil. (1993). On Reducing the Cut Ratio to the Multicut Problem. 2 indexed citations
18.
Kahalé, Nabil. (1993). Expander graphs. 7 indexed citations
19.
Kahalé, Nabil. (1992). On the second eigenvalue and linear expansion of regular graphs. 296–303. 17 indexed citations
20.
Kahalé, Nabil. (1991). New modular properties of bell numbers. Journal of Combinatorial Theory Series A. 58(1). 147–152. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026