default search action
Richard J. Fateman
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j37]Richard J. Fateman:
Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration. ACM Commun. Comput. Algebra 49(2): 38-47 (2015) - 2014
- [j36]Richard J. Fateman:
Algorithm Differentiation in Lisp: ADIL. ACM Commun. Comput. Algebra 48(3/4): 78-89 (2014)
2000 – 2009
- 2004
- [c28]Michael Yang, Richard J. Fateman:
Extracting mathematical expressions from postscript documents. ISSAC 2004: 305-311 - 2003
- [j35]Richard J. Fateman:
Comparing the speed of programs for sparse polynomial multiplication. SIGSAM Bull. 37(1): 4-15 (2003) - [j34]Richard J. Fateman:
Memory cache and lisp: faster list processing via automatically rearranging memory. SIGSAM Bull. 37(4): 109-116 (2003) - [j33]Henry S. Baird, Allison L. Coates, Richard J. Fateman:
PessimalPrint: a reverse Turing test. Int. J. Document Anal. Recognit. 5(2-3): 158-163 (2003) - [c27]Richard J. Fateman:
High-level proofs of mathematical programs using automatic differentiation, simplification, and some common sense. ISSAC 2003: 88-94 - [c26]Richard J. Fateman, Raymond Toy:
Converting call-by-reference to call-by-value: Fortran and Lisp coexisting. ISSAC 2003: 95-102 - 2002
- [j32]Richard J. Fateman:
Software Fault Prevention by Language Choice: Why C is Not My Favorite Language. Adv. Comput. 56: 167-188 (2002) - 2001
- [c25]Allison L. Coates, Richard J. Fateman, Henry S. Baird:
Pessimal Print: A Reverse Turing Test. ICDAR 2001: 1154-1158 - 2000
- [c24]Richard J. Fateman:
How to find mathematics on a scanned page. Document Recognition and Retrieval 2000: 98-109
1990 – 1999
- 1999
- [j31]William Kahan, Richard J. Fateman:
Symbolic computation of divided differences. SIGSAM Bull. 33(2): 7-28 (1999) - [j30]Richard J. Fateman:
Symbolic execution and NaNs: diagnostic tools for tracking scientific computation. SIGSAM Bull. 33(3): 25-26 (1999) - [j29]Richard J. Fateman, Eylon Caspi:
Parsing TEX into mathematics. SIGSAM Bull. 33(3): 26 (1999) - 1998
- [j28]Richard J. Fateman:
A short note on short differentiation programs in lisp, and a comment on lagarithmic differentiation. SIGSAM Bull. 32(3): 2-7 (1998) - 1997
- [j27]Richard J. Fateman:
Review of Gradshetyn and Ryzhik, CD-Rom version. SIGSAM Bull. 31(4): 60-62 (1997) - [c23]Richard J. Fateman:
More Versatile Scientific Document. ICDAR 1997: 1107-1110 - [c22]Richard J. Fateman:
Network Servers for Symbolic Mathematics. ISSAC 1997: 249-256 - 1996
- [j26]Richard J. Fateman, Mark Hayden:
Speeding up Lisp-based symbolic mathematics. SIGSAM Bull. 30(1): 25-30 (1996) - [j25]Richard J. Fateman:
Why computer algebra systems sometimes can't solve simple equations. SIGSAM Bull. 30(2): 8-11 (1996) - [j24]Richard J. Fateman, Taku Tokuyasu, Benjamin P. Berman, Nicholas Mitchell:
Optical Character Recognition and Parsing of Typeset Mathematics1. J. Vis. Commun. Image Represent. 7(1): 2-15 (1996) - [c21]Richard J. Fateman, Taku A. Tokuyasu
:
Progress in recognizing typeset mathematics. Document Recognition 1996: 37-50 - [c20]Richard J. Fateman:
Symbolic Mathematics System Evaluators (extended abstract). ISSAC 1996: 86-94 - 1995
- [j23]Richard J. Fateman, Kevin A. Broughan, Diane M. K. Willcock, Duane Rettig:
Fast Floating Point Processing in Common Lisp. ACM Trans. Math. Softw. 21(1): 26-62 (1995) - [c19]T. H. Einwohner, Richard J. Fateman:
Searching Techniques for Integral Tables. ISSAC 1995: 133-139 - [c18]Hsin-Chao Liao, Richard J. Fateman:
Evaluation of the Heuristic Polynomial GCD. ISSAC 1995: 240-247 - 1994
- [c17]Adam Dingle
Branch Cuts in Computer Algebra. ISSAC 1994: 250-257 - [c16]Benjamin P. Berman
Optical Character Recognition for Typeset Mathematics. ISSAC 1994: 348-353 - 1993
- [j22]Richard J. Fateman:
Automatic Differentiation of Algorithms: Theory, Implementation, and Application (Andreas Griewank and George F. Corliss, eds.). SIAM Rev. 35(4): 659-660 (1993) - 1992
- [j21]Richard J. Fateman:
A Review of Mathematica. J. Symb. Comput. 13(5): 545-579 (1992) - [c15]Richard J. Fateman:
Honest Plotting, Global Extrema, and Interval Arithmetic. ISSAC 1992: 216-223 - 1991
- [j20]Richard J. Fateman, Derek T. Lai:
A simple display package for polynomials and rational functions in common Lisp. SIGSAM Bull. 25(4): 1-3 (1991) - [j19]Richard J. Fateman:
Endpaper: FRPOLY: A Benchmark Revisited. LISP Symb. Comput. 4(2): 155-164 (1991) - [j18]Peter Klier, Richard J. Fateman:
On finding the closest bitwise matches in a fixed set. ACM Trans. Math. Softw. 17(1): 88-97 (1991) - [c14]Richard J. Fateman:
Canonical Representations in Lisp and Applications to Computer Algebra systems. ISSAC 1991: 360-369 - 1990
- [j17]Richard J. Fateman:
A lisp-language Mathematica-to-lisp translator. SIGSAM Bull. 24(2): 19-21 (1990) - [c13]Richard J. Fateman:
Advances and Trends in the Design and Construction of Algebraic Manipulation Systems. ISSAC 1990: 60-67
1980 – 1989
- 1989
- [j16]Richard J. Fateman, Carl Ponder:
Speed and data structures in computer algebra systems. SIGSAM Bull. 23(2): 8-11 (1989) - [j15]Richard J. Fateman:
A Review of Macsyma. IEEE Trans. Knowl. Data Eng. 1(1): 133-145 (1989) - [c12]Richard J. Fateman:
Series Solutions of Algebraic and Differential Equations: A Comparison of Linear and Quadratic Algebraic Convergence. ISSAC 1989: 11-16 - [c11]Richard J. Fateman:
Lookup Tables, Recurrences and Complexity. ISSAC 1989: 68-73 - [c10]T. H. Einwohner, Richard J. Fateman:
A MACSYMA Package for the Generation and Manipulation of Chebyshev Series. ISSAC 1989: 180-185 - 1988
- [j14]Richard J. Fateman, Alan Bundy, Richard A. O'Keefe, Leon Sterling:
Commentary on: solving symbolic equations with PRESS. SIGSAM Bull. 22(2): 27-40 (1988) - [j13]Carl Ponder, Richard J. Fateman:
Inaccuracies in Program Profilers. Softw. Pract. Exp. 18(5): 459-467 (1988) - 1987
- [j12]Richard J. Fateman:
TEX output from MACSYMA-like systems. SIGSAM Bull. 21(4): 1-5 (1987) - 1985
- [j11]Richard J. Fateman:
Eleven proofs of sin2x+cos2x = 1. SIGSAM Bull. 19(2): 25-28 (1985) - [j10]Richard J. Fateman:
Comments on SMP. SIGSAM Bull. 19(3): 5-7 (1985) - 1984
- [j9]Richard J. Fateman:
My view of the future of symbolic and algebraic computation. SIGSAM Bull. 18(2): 10-11 (1984) - 1982
- [j8]Richard J. Fateman:
High-Level Language Implications of the Proposed IEEE Floating-Point Standard. ACM Trans. Program. Lang. Syst. 4(2): 239-257 (1982) - 1981
- [j7]Richard J. Fateman:
Symbolic and algebraic computer programming systems. SIGSAM Bull. 15(1): 21-32 (1981) - [c9]John K. Foderaro, Richard J. Fateman:
Characterization of VAX Macsyma. SYMSACC 1981: 14-19 - [c8]Richard J. Fateman:
A case study in interlanguage communication: Fast LISP polynomial operations written in 'C'. SYMSACC 1981: 122-125 - [c7]Richard J. Fateman:
Views on transportability of Lisp and Lisp-based systems. SYMSACC 1981: 137-141 - [c6]Richard J. Fateman:
Computer algebra and numerical integration. SYMSACC 1981: 228-232
1970 – 1979
- 1978
- [j6]Richard J. Fateman:
Is a LISP machine different from a fortran machine? SIGSAM Bull. 12(3): 8-11 (1978) - 1977
- [j5]Richard J. Fateman:
An Algorithm for Deciding the Convergence of the Rational Iteration xn+1 = f(xn). ACM Trans. Math. Softw. 3(3): 272-278 (1977) - 1976
- [j4]Richard J. Fateman:
Final problem set excerpts. SIGSAM Bull. 10(3): 14 (1976) - [c5]Richard J. Fateman:
The MACSYMA "big-floating-point" arithmetic system. SYMSACC 1976: 209-213 - [c4]Bob F. Caviness, Richard J. Fateman:
Simplification of radical expressions. SYMSACC 1976: 329-338 - [c3]Richard J. Fateman:
An approach to automatic asymptotic expansions. SYMSACC 1976: 365-371 - 1974
- [j3]Richard J. Fateman, Joel Moses, Paul Wang:
Solution to problem #7 using MACSYMA. SIGSAM Bull. 8(2): 14-16 (1974) - [j2]Richard J. Fateman:
Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments. SIAM J. Comput. 3(3): 196-213 (1974) - 1971
- [c2]William A. Martin, Richard J. Fateman:
The MACSYMA system. SYMSAC 1971: 59-75 - [c1]Richard J. Fateman:
The user-level semantic matching capability in MACSYMA. SYMSAC 1971: 311-323
1960 – 1969
- 1969
- [j1]Richard J. Fateman:
Optimal code for serial and parallel computation. Commun. ACM 12(12): 694-695 (1969)
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-05-02 21:45 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: