SIGN IN
SIGN UP
Accurate approximations for Asian options
Full Text:
PDF
Buy this Article
Authors:
Donald Aingworth
Department of Computer Science, Stanford University, Stanford, CA
Rajeev Motwani
Department of Computer Science, Stanford University, Stanford, CA
Jeffrey D. Oldham
Department of Computer Science, Stanford University, Stanford, CA
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2000
table of contents
ISBN:0-89871-453-2
2000 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 26
· Citation Count: 5
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
computations on polynomials
design
economics
financial
heuristic methods
measurement
polynomials, methods for
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder