Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
James H. Davenport
James Harold Davenport
2010 – today
- 2013
[j13]Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao: Triangular decomposition of semi-algebraic systems. J. Symb. Comput. 49: 3-26 (2013)- [j12]Changbo Chen, James H. Davenport, Marc Moreno Maza, Bican Xia, Rong Xiao: Computing with semi-algebraic sets: Relaxation techniques and effective boundaries. J. Symb. Comput. 52: 72-96 (2013)
- [c56]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson: Cylindrical algebraic decompositions for boolean combinations. ISSAC 2013: 125-132
- [c55]Russell J. Bradford, James H. Davenport, Matthew England, David J. Wilson: Optimising Problem Formulation for Cylindrical Algebraic Decomposition. MKM/Calculemus/DML 2013: 19-34
- [c54]Matthew England, Russell J. Bradford, James H. Davenport, David J. Wilson: Understanding Branch Cuts of Expressions. MKM/Calculemus/DML 2013: 136-151
- [e4]Christoph Lange, David Aspinall, Jacques Carette, James H. Davenport, Andrea Kohlhase, Michael Kohlhase, Paul Libbrecht, Pedro Quaresma, Florian Rabe, Petr Sojka, Iain Whiteside, Wolfgang Windsteiger (Eds.): Joint Proceedings of the MathUI, OpenMath, PLMMS and ThEdu Workshops and Work in Progress at CICM, Bath, UK. CEUR Workshop Proceedings 1010, CEUR-WS.org 2013
- [i11]Russell J. Bradford, James H. Davenport, Matthew England, David J. Wilson: Optimising Problem Formulation for Cylindrical Algebraic Decomposition. CoRR abs/1304.7222 (2013)
- [i10]Matthew England, Russell J. Bradford, James H. Davenport, David J. Wilson: Understanding Branch Cuts of Expressions. CoRR abs/1304.7223 (2013)
- [i9]Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson: Cylindrical Algebraic Decompositions for Boolean Combinations. CoRR abs/1304.7603 (2013)
- [i8]Matthew England, E. S. Cheb-Terrab, Russell J. Bradford, James Harold Davenport, David J. Wilson: Branch Cuts in Maple 17. CoRR abs/1308.6523 (2013)
- [i7]David J. Wilson, James H. Davenport, Matthew England, Russell J. Bradford: A "Piano Movers" Problem Reformulated. CoRR abs/1309.1588 (2013)
- 2012
- [c53]David J. Wilson, Russell J. Bradford, James H. Davenport: Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases. AISC/MKM/Calculemus 2012: 280-294
- [c52]James H. Davenport, Russell J. Bradford, Matthew England, David J. Wilson: Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc. SYNASC 2012: 83-88
- [i6]David J. Wilson, Russell J. Bradford, James H. Davenport: Speeding up Cylindrical Algebraic Decomposition by Gröbner Bases. CoRR abs/1205.6285 (2012)
- [i5]James H. Davenport, Russell J. Bradford, Matthew England, David J. Wilson: Program Verification in the presence of complex numbers, functions with branch cuts etc. CoRR abs/1212.5417 (2012)
- 2011
- [c51]Changbo Chen, James H. Davenport, Marc Moreno Maza, Bican Xia, Rong Xiao: Computing with semi-algebraic sets represented by triangular decomposition. ISSAC 2011: 75-82
- [c50]Frédéric Chyzak, James H. Davenport, Christoph Koutschan, Bruno Salvy: On Kahan's Rules for Determining Branch Cuts. SYNASC 2011: 47-51
- [e3]James H. Davenport, William M. Farmer, Josef Urban, Florian Rabe (Eds.): Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings. Lecture Notes in Computer Science 6824, Springer 2011, ISBN 978-3-642-22672-4
- [i4]Frédéric Chyzak, James H. Davenport, Christoph Koutschan, Bruno Salvy: On Kahan's Rules for Determining Branch Cuts. CoRR abs/1109.2809 (2011)
- [i3]Saif Al-Kuwari, James H. Davenport, Russell J. Bradford: Cryptographic Hash Functions: Recent Design Trends and Security Notions. IACR Cryptology ePrint Archive 2011: 565 (2011)
- 2010
- [c49]
- [c48]Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao: Triangular decomposition of semi-algebraic systems. ISSAC 2010: 187-194
- [i2]Jacques Carette, James H. Davenport: The Power of Vocabulary: The Case of Cyclotomic Polynomials. CoRR abs/1002.0012 (2010)
- [i1]Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao: Triangular Decomposition of Semi-algebraic Systems. CoRR abs/1002.4784 (2010)
2000 – 2009
- 2009
- [c47]Dalia Khader, Liqun Chen, James H. Davenport: Certificate-Free Attribute Authentication. IMA Int. Conf. 2009: 301-325
- [c46]Russell J. Bradford, James H. Davenport, Christopher J. Sangwin: A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy. Calculemus/MKM 2009: 75-89
- [c45]James H. Davenport, Michael Kohlhase: Unifying Math Ontologies: A Tale of Two Standards. Calculemus/MKM 2009: 263-278
- [c44]
- 2008
- [j11]James H. Davenport, Paul Libbrecht: The Freedom to Extend OpenMath and its Utility. Mathematics in Computer Science 2(2): 379-398 (2008)
- [c43]
- [c42]James H. Davenport: Effective Set Membership in Computer Algebra and Beyond. AISC/MKM/Calculemus 2008: 266-269
- [c41]Jonathan Stratford, James H. Davenport: Unit Knowledge Management. AISC/MKM/Calculemus 2008: 382-397
- 2007
- [j10]James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut: Testing elementary function identities using CAD. Appl. Algebra Eng. Commun. Comput. 18(6): 513-543 (2007)
- [c40]Christopher W. Brown, James H. Davenport: The complexity of quantifier elimination and cylindrical algebraic decomposition. ISSAC 2007: 54-60
- [c39]
- 2005
- [c38]James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut: Adherence is better than adjacency: computing the Riemann index using CAD. ISSAC 2005: 37-44
- 2004
- [c37]Olga Caprotti, James H. Davenport, Mike Dewar, Julian A. Padget: Mathematics on the (Semantic) NET. ESWS 2004: 213-224
- [c36]James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut: A poly-algorithmic approach to simplifying elementary functions. ISSAC 2004: 27-34
- [c35]
- 2003
- [c34]James H. Davenport: The Geometry of Cn is Important for the Algebra of Elementary Functions. Algebra, Geometry, and Software Systems 2003: 207-224
- [c33]Andrew J. Holt, James H. Davenport: Resolving Large Prime(s) Variants for Discrete Logarithm Computation. IMA Int. Conf. 2003: 207-222
- [c32]James C. Beaumont, Russell J. Bradford, James H. Davenport: Better simplification of elementary functions through power series. ISSAC 2003: 30-36
- [c31]
- [e2]Andrea Asperti, Bruno Buchberger, James H. Davenport (Eds.): Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2594, Springer 2003, ISBN 3-540-00568-4
- 2002
- [j9]Russell J. Bradford, Robert M. Corless, James H. Davenport, David J. Jeffrey, Stephen M. Watt: Reasoning about the Elementary Functions of Complex Analysis. Ann. Math. Artif. Intell. 36(3): 303-318 (2002)
- [j8]
- [c30]Russell J. Bradford, James H. Davenport: Towards better simplification of elementary functions. ISSAC 2002: 16-22
- 2001
- [c29]Paul A. Crouch, James H. Davenport: Lattice Attacks on RSA-Encrypted IP and TCP. IMA Int. Conf. 2001: 329-338
- 2000
- [c28]Robert M. Corless, James H. Davenport, David J. Jeffrey, Gurjeet Litt, Stephen M. Watt: Reasoning about the Elementary Functions of Complex Analysis. AISC 2000: 115-126
- [c27]Namhyun Hur, James H. Davenport: A Generic Root Operation for Exact Real Arithmetic. CCA 2000: 82-87
- [c26]Namhyun Hur, James H. Davenport: An exact real algebraic arithmetic with equality determination. ISSAC 2000: 169-174
- [c25]
1990 – 1999
- 1996
- [c24]Brian J. Dupée, James H. Davenport: An Intelligent Interface to Numerical Routines. DISCO 1996: 252-262
- 1993
- [b2]James Harold Davenport, Yvon Siret, Evelyne Tournier: Computer algebra - systems and algorithms for algebraic computation (2. ed.). Academic Press 1993, ISBN 978-0-12-204232-4, pp. I-XIX, 1-298
- 1992
- [c23]
- 1991
- [c22]James H. Davenport, Patrizia M. Gianni, Barry M. Trager: Scratchpad's View of Algebra II: A Categorical View of Factorization. ISSAC 1991: 32-38
- 1990
- [c21]
- [c20]James H. Davenport, Barry M. Trager: Scratchpad's View of Algebra I: Basic Commutative Algebra. DISCO 1990: 40-54
1980 – 1989
- 1989
- [e1]James H. Davenport (Ed.): EUROCAL '87, European Conference on Computer Algebra, Leipzig, GDR, June 2-5, 1987, Proceedings. Lecture Notes in Computer Science 378, Springer 1989, ISBN 3-540-51517-8
- 1988
- [j7]James H. Davenport, Joos Heintz: Real Quantifier Elimination is Doubly Exponential. J. Symb. Comput. 5(1/2): 29-35 (1988)
- [j6]
- [c19]Andrew F. Wallis, Adrian Bowyer, James H. Davenport, Philip S. Milne, Julian A. Padget: The Use of Symbolic Computation in Geometric Modelling. IMA Conference on the Mathematics of Surfaces 1988: 199-206
- [c18]Russell J. Bradford, James H. Davenport: Effective Tests for Cyclotonic Polynomials. ISSAC 1988: 244-251
- 1987
- [c17]Adrian Bowyer, James H. Davenport, Philip S. Milne, Julian A. Padget, Andrew F. Wallis: Applications of computer algebra in solid modelling. EUROCAL 1987: 244-245
- [c16]J. A. Abbott, James H. Davenport: Polynomial factorization: An exploration of Lenstra's algorithm. EUROCAL 1987: 391-402
- [c15]J. A. Abbott, Russell J. Bradford, James H. Davenport: Factorisation of Polynominals: Old Ideas and Recent Results. Trends in Computer Algebra 1987: 81-91
- 1986
- [j5]James H. Davenport: Elementary and Liouvillian Solutions of Linear Differential Equations. J. Symb. Comput. 2(3): 237-260 (1986)
- [j4]
- [c14]
- [c13]J. A. Abbott, Russell J. Bradford, James H. Davenport: The Bath algebraic number package. SYMSAC 1986: 250-253
- 1985
- [j3]Don Coppersmith, James H. Davenport: An Application of Factoring. J. Symb. Comput. 1(2): 241-243 (1985)
- [j2]James H. Davenport, Barry M. Trager: On the Parallel Risch Algorithm (II). ACM Trans. Math. Softw. 11(4): 356-362 (1985)
- [c12]James H. Davenport: Symbolic and Numeric Manipulation of Integrals. Accurate Scientific Computations 1985: 168-180
- [c11]James H. Davenport, Julian A. Padget: HEUGCD: How Elementary Upperbounds Generated Cheaper Data. European Conference on Computer Algebra (2) 1985: 18-28
- [c10]Michael F. Singer, James H. Davenport: Elementary and Liouvillian Solutions of Linear Differential Equations. European Conference on Computer Algebra (2) 1985: 595-596
- 1984
- [j1]R. J. Macmillan, James H. Davenport: Factoring Medium-Sized Integers. Comput. J. 27(1): 84-85 (1984)
- [c9]
- 1983
- [c8]
- [c7]
- 1982
- [c6]
- 1981
- [b1]James H. Davenport: On the Integration of Algebraic Functions. Lecture Notes in Computer Science 102, Springer 1981, ISBN 3-540-10290-6
- [c5]James H. Davenport, Barry M. Trager: Factorization over finitely generated fields. SYMSACC 1981: 200-205
- 1980
- [c4]
1970 – 1979
- 1979
- [c3]
- [c2]
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16 21:28 CEST by the dblp team