default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNabil Kahalé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Nabil Kahalé:
Unbiased least squares regression via averaged stochastic gradient descent. CoRR abs/2406.18623 (2024)- 2022
- [j15]Nabil Kahalé
:
On the effective dimension and multilevel Monte Carlo. Oper. Res. Lett. 50(4): 415-421 (2022) - 2021
- [i3]Nabil Kahalé:
On the effective dimension and multilevel Monte Carlo. CoRR abs/2111.03561 (2021) - 2020
- [j14]Nabil Kahalé:
General multilevel Monte Carlo methods for pricing discretely monitored Asian options. Eur. J. Oper. Res. 287(2): 739-748 (2020) - [j13]Nabil Kahalé:
Randomized Dimension Reduction for Monte Carlo Simulations. Manag. Sci. 66(3): 1421-1439 (2020) - [i2]Nabil Kahalé:
Least-squares regressions via randomized Hessians. CoRR abs/2006.01017 (2020)
2010 – 2019
- 2019
- [j12]Nabil Kahalé:
Efficient Simulation of High Dimensional Gaussian Vectors. Math. Oper. Res. 44(1): 58-73 (2019) - 2017
- [j11]Nabil Kahalé:
Superreplication of Financial Derivatives via Convex Programming. Manag. Sci. 63(7): 2323-2339 (2017)
1990 – 1999
- 1998
- [j10]Nabil Kahalé, Frank Thomson Leighton:
Greedy Dynamic Routing on Arrays. J. Algorithms 29(2): 390-410 (1998) - [j9]Noga Alon, Nabil Kahalé:
Approximating the independence number via the theta-function. Math. Program. 80: 253-264 (1998) - [j8]Edward G. Coffman Jr., Nabil Kahalé, Frank Thomson Leighton:
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM J. Comput. 27(5): 1221-1236 (1998) - 1997
- [j7]Nabil Kahalé:
Large Deviation Bounds for Markov Chains. Comb. Probab. Comput. 6(4): 465-474 (1997) - [j6]Nabil Kahalé:
A semidefinite bound for mixing rates of Markov chains. Random Struct. Algorithms 11(4): 299-313 (1997) - [j5]Noga Alon, Nabil Kahalé:
A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM J. Comput. 26(6): 1733-1748 (1997) - [j4]Nabil Kahalé:
Isoperimetric Inequalities and Eigenvalues. SIAM J. Discret. Math. 10(1): 30-40 (1997) - [c9]Nabil Kahalé, Paul E. Wright:
Dynamic Global Packet Routing in Wireless Networks. INFOCOM 1997: 1414-1421 - 1996
- [j3]Nabil Kahalé, Leonard J. Schulman:
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. Comb. 16(3): 383-397 (1996) - [c8]Nabil Kahalé:
A Semidefinite Bound for Mixing Rates of Markov Chains. IPCO 1996: 190-203 - 1995
- [j2]Nabil Kahalé:
Eigenvalues and Expansion of Regular Graphs. J. ACM 42(5): 1091-1106 (1995) - [c7]Richard Beigel, William Hurwood, Nabil Kahalé:
Fault Diagnosis in a Flash. FOCS 1995: 571-580 - [c6]Nabil Kahalé, Frank Thomson Leighton:
Greedy Dynamic Routing on Arrays. SODA 1995: 558-566 - [c5]Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi:
Lower bounds for sorting networks. STOC 1995: 437-446 - 1994
- [c4]Noga Alon, Nabil Kahalé:
A spectral technique for coloring random 3-colorable graphs (preliminary version). STOC 1994: 346-355 - [i1]Richard Beigel, William Hurwood, Nabil Kahalé:
Fault Diagnosis in a Flash. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [b1]Nabil Kahalé:
Expander graphs. Massachusetts Institute of Technology, Cambridge, MA, USA, 1993 - 1992
- [c3]Nabil Kahalé:
On the Second Eigenvalue and Linear Expansion of Regular Graphs. Expanding Graphs 1992: 49-62 - [c2]Nabil Kahalé:
On the Second Eigenvalue and Linear Expansion of Regular Graphs. FOCS 1992: 296-303 - 1991
- [j1]Nabil Kahalé:
New modular properties of bell numbers. J. Comb. Theory A 58(1): 147-152 (1991) - [c1]Nabil Kahalé:
Better Expansion for Ramanujan Graphs. FOCS 1991: 398-404
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
