Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Daniel Z. Zanger
Observed names:
D.Z. Zanger,
Daniel Zanger,
Zanger, Daniel,
Zanger, Daniel Z.
Institution:
University of California, Santa Barbara
Observed institutions:
SRI International,
Albert Einstein College of Medicine,
Booz Allen Hamilton (United States),
University of California, Santa Barbara,
Massachusetts Institute of Technology
ORCID:
0000-0003-0678-6617
Observed ORCID:
0000-0003-0678-6617
OpenAlex ID:
A5091281981
The Inhomogeneous Neumann Problem in Lipschitz Domains
2000
·
Daniel Z. Zanger
·
Communications in Partial Differential Equations
·
60
Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing
2013
·
Daniel Z. Zanger
·
Finance and Stochastics
·
55
Convergence of a Least‐squares Monte Carlo Algorithm for American Option Pricing With Dependent Sample Data
2016
·
Daniel Z. Zanger
·
Mathematical Finance
·
29
Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets
2009
·
Daniel Z. Zanger
·
Applied Mathematical Finance
·
28
General Error Estimates for the Longstaff–Schwartz Least-Squares Monte Carlo Algorithm
2019
·
Daniel Z. Zanger
·
Mathematics of Operations Research
·
12
Eigenvalue variations for the Neumann problem
2001
·
D.Z. Zanger
·
Applied Mathematics Letters
·
11
PDF
Encainide: A new and potent antiarrhythmic
1987
·
John C. Somberg
, Daniel Zanger
, et al.
·
American Heart Journal
·
7
Concentration of measure and cluster analysis
2003
·
Daniel Z. Zanger
·
Statistics & Probability Letters
·
4
G3Ms:Generalized Mean Market Makers
2022
·
Zanger, Daniel Z.
·
RePEc: Research Papers in Economics
·
3
PDF
Regularity and boundary variations for the Neumann problem
1997
·
Daniel Z. Zanger
·
DSpace@MIT (Massachusetts Institute of Technology)
·
2
Security of Random Output Perturbation for Statistical Databases
2012
·
Daniel Z. Zanger
·
Lecture notes in computer science
·
1
Interpolation of the extended Boolean retrieval model
2002
·
Daniel Z. Zanger
·
Information Processing & Management
·
1
A quadratic sample complexity reduction for agnostic learning via quantum algorithms
2025
·
Daniel Z. Zanger
·
International Journal of Quantum Information
PDF
Nonexact oracle inequalities, r-learnability, and fast rates
2023
·
Daniel Z. Zanger
·
Journal of Complexity
Super-exponential query complexity reduction via noise-resistant quantum search
2017
·
Zanger, Daniel Z.
·
arXiv (Cornell University)
PDF
Exponential Bounds for Information Leakage in Unknown-Message Side-Channel Attacks.
2010
·
Daniel Z. Zanger
·
IACR Cryptology ePrint Archive
Talagrand’s inductive method and isoperimetric inequalities involving random sets
2007
·
Daniel Z. Zanger
·
Statistics & Probability Letters
Show more works
View as search
Works count:
28
Citation count:
213
H-index:
7
I10-index:
6
Year
Topic
Type