default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles B. Dunham
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2003
[j31]Charles B. Dunham:
Approximation with Taylor Matching at the Origin. Int. J. Comput. Math. 80(8): 1019-1024 (2003)- 2001
- [j30]Charles B. Dunham:
Wilkinson-type error analysis applied to double-precision accumulation under contamination, II. Int. J. Comput. Math. 77(2): 299-303 (2001) - 2000
- [j29]Charles B. Dunham:
Partially Wrong Completions. SIGACT News 31(2): 69 (2000) - 1999
- [j28]Charles B. Dunham:
Fitting approximations with fixed components at zeroFixed components at zero. Int. J. Comput. Math. 71(1): 97-98 (1999) - [j27]Charles B. Dunham:
Wilkinson-type error analysis applied to double-precision accumulation under contamination. Int. J. Comput. Math. 71(3): 369-372 (1999) - 1998
- [j26]Charles B. Dunham:
Accurate evaluation of even and odd functions. Int. J. Comput. Math. 68(1-2): 189-191 (1998) - 1996
- [j25]Changzhong Zhu, Charles B. Dunham, Darrell Schmidt:
Generalized strong unicity constants in linear uniform approximation. Int. J. Comput. Math. 62(1-2): 73-87 (1996) - 1995
- [j24]Charles B. Dunham, C. Z. Zhu:
Minimax exponential approximation can be ILL-posed. Int. J. Comput. Math. 59(1-2): 67-70 (1995) - 1994
- [j23]Charles B. Dunham:
Uniform approximation by Mc Callig rationals. Numer. Algorithms 7(2): 201-204 (1994) - 1991
- [j22]Charles B. Dunham, C. Z. Zhu:
The remez algorithm for biased uniform approximation on an interval. Int. J. Comput. Math. 39(3-4): 213-216 (1991) - 1990
- [j21]Charles B. Dunham:
A cheap approximate solution to everett-type rational approximation problems. Int. J. Comput. Math. 34(3-4): 255-257 (1990) - 1987
- [j20]Charles B. Dunham:
Pessimization is unsolvable. SIGACT News 18(3): 37 (1987) - 1986
- [j19]Charles B. Dunham:
A simpler approach to the busy beaver problem. SIGACT News 17(3): 29 (1986) - [j18]Charles B. Dunham:
The cycle burning problem. SIGACT News 18(1): 51 (1986) - 1984
- [j17]Charles B. Dunham:
A sequence of uncomputable functions. SIGACT News 16(3): 48 (1984) - 1983
- [j16]Charles B. Dunham:
The one-sided Remez algorithm. Computing 30(3): 275-278 (1983) - 1982
- [j15]Charles B. Dunham:
The Necessity of Publishing Programs. Comput. J. 25(1): 61-62 (1982) - [j14]Charles B. Dunham:
Remez algorithm for Chebyshev approximation with interpolation. Computing 28(1): 75-78 (1982) - [j13]Charles B. Dunham:
Choice of Basis for Chebyshev Approximation. ACM Trans. Math. Softw. 8(1): 21-25 (1982) - 1977
- [j12]Charles B. Dunham:
Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]". ACM Trans. Math. Softw. 3(1): 112 (1977) - 1974
- [j11]Charles B. Dunham:
Chebyshev approximation by A+B*phi(CX). Computing 13(3-4): 205-213 (1974) - [j10]Charles B. Dunham:
Failure of Loeb's method for rational L1 approximation. Computing 13(3-4): 235-237 (1974) - [j9]Charles B. Dunham:
Efficiency of Chebyshev Approximation on Finite Subsets. J. ACM 21(2): 311-313 (1974) - 1973
- [j8]Charles B. Dunham:
When Absolute Approximations are Optimal in Function Subroutines. Comput. J. 16(3): 265 (1973) - 1972
- [j7]Charles B. Dunham:
Minimax Nonlinear Approximation by Approximation on Subsets. Commun. ACM 15(5): 351 (1972) - [j6]Charles B. Dunham:
Best mean rational approximation. Computing 9(2): 87-93 (1972) - [j5]Charles B. Dunham:
Approximation by alternating families on subsets. Computing 9(4): 261-265 (1972) - 1970
- [j4]Charles B. Dunham:
Remarks on algorithms with numerical constants. Commun. ACM 13(9): 575 (1970) - 1969
- [j3]Charles B. Dunham:
Minimax logarithmic error. Commun. ACM 12(10): 581-582 (1969) - 1966
- [j2]Charles B. Dunham:
Convergence Problems in Maehly's Second Method: Part II. J. ACM 13(1): 108-113 (1966) - 1965
- [j1]Charles B. Dunham:
Convergence Problems in Maehly's Second Method. J. ACM 12(2): 181-186 (1965)
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-04-24 23:19 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:
