Research

Items by Davenport, Professor James

Up a level
Export as [feed] RSS 1.0 [feed] Atom [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 98.

Book/s

Asperti, A., Buchberger, B. and Davenport, J. H., eds., 2003. Mathematical Knowledge Management:2nd International Conference, MKM 2003, Bertorino, Italy: Proceedings. Springer. (Lecture Notes in Computer Science; 2594)

Davenport, J.H., 1981. On the Integration of Algebraic Functions. Springer. (Lecture Notes in Computer Science; 102)

Articles

Davenport, J. H., 2015. Forthcoming. Solving computational problems in real algebra/geometry. Annales Mathematicae et Informaticae, 44, pp. 35-46.

Davenport, J. H., 2014. OpenMath 2014 preface. CEUR Workshop Proceedings, 1186.

Wilson, D., Bradford, R., Davenport, J. H. and England, M., 2014. Cylindrical algebraic sub-decompositions. Mathematics in Computer Science, 8 (2), pp. 263-288.

Chen, C., Davenport, J. H., May, J. P., Moreno Maza, M., Xia, B. and Xiao, R., 2013. Triangular decomposition of semi-algebraic systems. Journal of Symbolic Computation, 49, pp. 3-26.

Bradford, R., Davenport, J. and Wilson, D., 2013. A repository for CAD Examples. ACM Communications in Computer Algebra, 46 (3), pp. 67-69.

England, M., Cheb-Terrab, E., Bradford, R., Davenport, J. and Wilson, D., 2013. Branch Cuts in Maple 17. ACM Communications in Computer Algebra, 48 (1), pp. 24-27.

Chen, C., Davenport, J.H., Moreno Maza, M., Xia, B. and Xiao, R., 2012. Computing with semi-algebraic sets:Relaxation techniques and effective boundaries. Journal of Symbolic Computation, 52, pp. 72-96.

Davenport, J.H., 2012. Small algorithms for small systems. ACM Communications in Computer Algebra, 46 (1-2), pp. 1-9.

Chen, C., Davenport, J. H., Lemaire, F., Maza, M. M., Xia, B., Xiao, R. and Xie, Y., 2011. Computing the real solutions of polynomial systems with the RegularChains library in Maple. ACM Communications in Computer Algebra, 45 (3-4), pp. 166-168.

Davenport, J., 2010. The Challenges of Multivalued "Functions". Lecture Notes in Computer Science, 6167, pp. 1-12.

Bradford, R., Davenport, J. H. and Sangwin, C., 2010. A comparison of equality in computer algebra and correctness in mathematical pedagogy (II). International Journal for Technology in Mathematics Education, 17 (2), pp. 93-98.

Carette, J., Davenport, J. and Fitch, J., 2009. Barton and Fitch Revisited. EPRINTS-JOURNAL

Davenport, J. H. and Libbrecht, P., 2008. The freedom to extend OpenMath and its utility. Mathematics in Computer Science, 2 (2), pp. 379-398.

Bronstein, M., Corless, R. M., Davenport, J. H. and Jeffrey, D. J., 2008. Algebraic properties of the Lambert W Function from a result of Rosenlicht and of Liouville. Integral Transforms and Special Functions, 19 (10), pp. 709-712.

Beaumont, J. C., Bradford, R. J., Davenport, J. H. and Phisanbut, N., 2007. Testing elementary function identities using CAD. Applicable Algebra in Engineering Communication and Computing, 18 (6), pp. 513-543.

Bradford, R., Corless, R. M., Davenport, J. H., Jeffrey, D. J. and Watt, S. M., 2002. Reasoning about the elementary functions of complex analysis. Annals of Mathematics and Artificial Intelligence, 36 (3), pp. 303-318.

Davenport, J. H., 2002. Equality in computer algebra and beyond. Journal of Symbolic Computation, 34 (4), pp. 259-270.

Davenport, J. H., 2002. Table Errata --- Abramowitz & Stegun. Mathematics of Computation (MCOM)

Corless, R. M., Davenport, J.H., Jeffrey, D. J. and Watt, S. M., 2000. "According to Abramowitz and Stegun", or arcoth needn't be uncouth. SIGSAM Bulletin, 34, pp. 58-65.

Coppersmith, D. and Davenport, J.H., 1991. Polynomials whose powers are sparse. Acta Arithmetica, 58 (1), pp. 79-87.

Abbott, J. A. and Davenport, J., 1988. A remark on a paper by Wang:another surprising property of 42. Mathematics of Computation, 51 (184), pp. 837-839.

Abbott, J. A., Bradford, R. J. and Davenport, J., 1985. A remark on factorisation. SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation), 19 (2), pp. 31-33.

Coppersmith, D. and Davenport, J.H., 1985. An application of factoring. Journal of Symbolic Computation, 1, pp. 241-243.

Davenport, J.H., 1979. Anatomy of an integral. SIGSAM Bulletin, 13 (4), pp. 16-18.

Reports/Papers

Wilson, D., Bradford, R. J., Davenport, J. H. and England, M., 2013. The Piano Mover's Problem Reformulated. Other. Department of Computer Science, University of Bath. (Department of Computer Science Technical Report Series; CSBU-2013-03)

Bennett, J.P., Davenport, J.H. and Sauro, H.M., 1988. Solution of Some Equations in Biochemistry. Other. University of Bath.

Conference or Workshop Items

Davenport, J. H. and England, M., 2015. Recent advances in real geometric reasoning. In: Botana, F. and Quaresma, P., eds. 10th International Workshop on Automated Deduction in Geometry (ADG), 2014, 2011-07-09 - 2011-07-11, Coimbra. Springer, pp. 37-52. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 9201)

England, M., Bradford, R. and Davenport, J., 2015. Improving the use of equational constraints in cylindrical algebraic decomposition. In: ISSAC '15 - 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015-07-06 - 2015-07-09, Bath.

Huang, Z., England, M., Wilson, D., Davenport, J. H. and Paulson, L. C., 2015. A comparison of three heuristics to choose the variable ordering for CAD. New York, U. S. A.: ACM, pp. 121-123.

Huang, Z., England, M., Wilson, D., Davenport, J. H., Paulson, L. and Bridge, J., 2014. Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition. Springer, pp. 92-107. (Lecture Notes in Artificial Intelligence)

El Kaafarani, A., Chen, L., Ghadafi, E. and Davenport, J., 2014. Attribute-based signatures with user-controlled linkability. In: Gritzalis, D., Kiayias, A. and Askoxylakis, I., eds. 13th International Conference on Cryptology and Network Security, CANS 2014, 2014-10-22 - 2014-10-24, Heraklion, Crete. Springer, pp. 256-269. (Lecture Notes in Computer Science; 8813)

Davenport, J., 2014. Mathematical Massive Open Online Courses (MOOCs):report of a panel at the 2014 ICM. In: Seoul International Conference of Mathematicians (ICM), 2014, 2014-08-13 - 2014-08-21, Seoul.

Panteli, N., Marder, B., Davenport, J.H. and Nemetz, F., 2014. Travelling through facebook:Exploring affordances through the Lens of age. In: ECIS 2014 Proceedings - 22nd European Conference on Information Systems, 2014-06-09 - 2014-06-11, Tel Aviv.

Bradford, R., Chen, C., Davenport, J. H., England, M., Moreno Maza, M. and Wilson, D., 2014. Truth table invariant cylindrical algebraic decomposition by regular chains. Springer, pp. 44-58. (Lecture Notes in Computer Science)

Jones, J., Davenport, J. and Bradford, R., 2013. The changing relevance of the TLB. In: DCABES 2013, 2013-09-02 - 2013-09-04, Kingston-on-Thames. Piscataway, NJ: IEEE, pp. 110-114.

Wilson, D., Davenport, J. H., England, M. and Bradford, R. J., 2013. A "piano movers" problem reformulated. In: SYNASC 2013: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013-09-23 - 2013-09-26, Timisoara. IEEE, pp. 53-60.

Bradford, R., Davenport, J. H., England, M., McCallum, S. and Wilson, D., 2013. Cylindrical algebraic decompositions for Boolean combinations. In: ISSAC 2013: International Symposium on Symbolic and Algebraic Computation, 2013-06-25 - 2013-06-28, Boston. New York: ACM, pp. 125-132.

Bradford, R., Davenport, J. H., England, M. and Wilson, D., 2013. Optimising problem formulation for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P. and Windsteiger, W., eds. Conferences on Intelligent Computer Mathematics: CICM 2013, 2013-07-07 - 2013-07-11, Bath. Berlin: Springer, pp. 19-34. (Lecture Notes in Computer Science; 7961)

England, M., Bradford, R., Davenport, J. H. and Wilson, D., 2013. Understanding branch cuts of expressions. In: Carette, J., Aspinall, D., Lange, C., Sojka, P. and Windsteiger, W., eds. Conferences on Intelligent Computer Mathematics: CICM 2013, 2013-07-07 - 2013-07-11, Bath. Berlin: Springer, pp. 136-151. (Lecture Notes in Computer Science; 7961)

Davenport, J., 2012. Program Verification in the presence of complex numbers, functions with branch cuts etc. In: SYNASC 2012: 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012-09-25 - 2012-09-28, Timisoara.

Chyzak, F., Davenport, J. H., Koutschan, C. and Salvy, B., 2012. On Kahan's rules for determining branch cuts. IEEE Press.

Davenport, J., Bradford, R., England, M. and Wilson, D., 2012. Program Verification in the presence of complex numbers, functions with branch cuts etc. In: SYNASC 2012: 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012-09-25 - 2012-09-28, Timisoara. Piscataway: IEEE, pp. 83-88.

Chen, C., Davenport, J. H., Moreno Maza, M., Xia, B. and Xiao, R., 2011. Computing with semi-algebraic sets represented by triangular decomposition. In: 36th International Symposium on Symbolic and Algebraic Computation, ISSAC 2011, June 8, 2011 - June 11, 2011, 2011-01-01, San Jose, CA. New York: Association for Computing Machinery (ACM), pp. 75-82. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC)

Cliffe, E., Davenport, J., De Vos, M., Parmar, N. R. and Hayes, A., 2010. Using EVS and ResponseWare to Enhance Student Learning and Learning Experience. Submitted to: 11th Annual Conference of Higher Education Academy Subject Centre for Information and Computer Science, 2010-08-24 - 2010-08-26, Durham.

Carette, J. and Davenport, J. H., 2010. Factorization of sparse polynomials or the power of vocabulary. Submitted to: International Symposium on Symbolic and Algebraic Computation 2010 (ISSAC 2010), 2010-07-25 - 2010-07-28, Technische Universität München, München.

Chen, C., Davenport, J. H., May, J. P., Maza, M. M., Xia, B. and Xiao, R., 2010. Triangular decomposition of semi-algebraic systems. In: 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, July 25, 2010 - July 28, 2010, 2010-01-01, Munich. New York, U. S. A.: ACM, pp. 187-194.

Bradford, R., Davenport, J. H. and Sangwin, C. J., 2009. A comparison of equality in computer algebra and correctness in mathematical pedagogy. In: Carette, J., Dixon, L., Sacerdoti Coen, C. and Watt, S. M., eds. 8th International Conference on Mathematical Knowledge Management (MKM 2009), 2009-07-10 - 2009-07-12, Grand Bend, Ontario. Berlin: Springer, pp. 75-89. (Lecture Notes in Computer Science; 5625/2)

Khader, D., Chen, L. Q. and Davenport, J. H., 2009. Certificate-free Attribute Authentication. Berlin: Springer, pp. 301-325. (Lecture Notes in Computer Science; 5921)

Davenport, J. H. and Carette, J., 2009. The sparsity challenges. IEEE Press, pp. 3-7.

Davenport, J., Hayes, A. and Parmar, N. R., 2009. The use of an Electronic Voting System to enhance student feedback. In: Plymouth e-Learning Conference, 2009-04-23 - 2009-04-24, Plymouth.

Davenport, J. H. and Kohlhase, M., 2009. Unifying Math Ontologies: A tale of two standards. In: Carette, J., Dixon, L., Sacerdoti Coen, C. and Watt, S. M., eds. 8th International Conference on Mathematical Knowledge Management (MKM 2009), 2009-07-10 - 2009-07-12, Grand Bend, Ontario. Berlin: Springer, pp. 263-278.

Chen, C., Davenport, J. H., May, J., Moreno Maza, M., Xia, B., Xiao, R. and Xie, Y., 2009. User interface design for geometrical decomposition algorithms in Maple. In: Mathematical User-Interfaces Workshop 2009, 2009-07-06, Grand Bend, Ontario, Canada.

Stratford, J. and Davenport, J., 2008. Unit Knowledge Management. Berlin, Heidelberg: Springer, pp. 382-397. (Lecture Notes in Computer Science; 5144/2)

Davenport, J. H., 2008. AISC Meets Natural Typography. Berlin, Heidelberg: Springer, pp. 53-60. (Lecture Notes in Computer Science)

Davenport, J. H., 2008. Effective Set Membership in Computer Algebra and Beyond. Berlin, Heidelberg: Springer, pp. 266-280. (Lecture Notes in Computer Science)

Brown, C. W. and Davenport, J. H., 2007. The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, 2007-01-01, Waterloo, Ontario. New York: ACM, pp. 54-60.

Beaumont, J., Bradford, R., Davenport, J. H. and Phisanbut, N., 2005. Adherence is Better than Adjacency: Computing the Riemann Index using CAD. In: Proceedings of the 2005 international symposium on Symbolic and algebraic computation, 2005-07-01.

Beaumont, J. C., Bradford, R. J., Davenport, J. H. and Phisanbut, N., 2004. A poly-algorithmic approach to simplifying elementary functions. In: Proceedings of the 2004 international symposium on Symbolic and algebraic computation, 2004-01-01, Santander.

Adams, A. A. and Davenport, J. H., 2004. Copyright issues for MKM. In: 3rd International Conference on Mathematical Knowledge Management, 2004-09-18 - 2004-09-20, Bialowieza. Berlin, Germany: Springer, pp. 1-16. (Lecture Notes in Computer Science; 3119)

Caprotti, O., Davenport, J. H., Dewar, M. and Padget, J., 2004. Mathematics on the (semantic) NET. (Lecture Notes in Computer Science)

Beaumont, J., Bradford, R. and Davenport, J. H., 2003. Better simplification of elementary functions through power series. In: ISSAC 2003 International Symposium on Symbolic and Algebraic Computation, 2003-08-03 - 2003-08-06, Philadelphia, U. S. A.. New York, U. S. A.: ACM, pp. 30-36.

Davenport, J. H., 2003. MKM from book to computer: A case study. (Lecture Notes in Computer Science)

Holt, A. J. and Davenport, J. H., 2003. Resolving large prime(s) variants for discrete logarithm computation. (Lecture Notes in Computer Science)

Bradford, R. and Davenport, J. H., 2002. Towards better simplification of elementary functions. In: Proceedings of the 2002 international symposium on Symbolic and algebraic computation, 2002-01-01, Lille.

Crouch, P. A. and Davenport, J. H., 2001. Lattice Attacks on RSA-Encrypted IP and TCP. In: Honary, B., ed. Proceedings 8th. IMA Conf. Cryptography and Coding, 2001-12-01.

Hur, N. and Davenport, J. H., 2001. A Generic Root Operation for Exact Real Arithmetic. In: Blanck, J., Brattka, V. and Hertling, P., eds. Computability and Complexity in Analysis, 2001-01-01, Berlin-Heidelberg-New York.

Corless, R. M., Davenport, J. H., Jeffrey, D. J., Litt, G. and Watt, S. M., 2001. Reasoning about the elementary functions of complex analysis. In: Campbell, J. A. and Roanes-Lozano, E., eds. International Conference Artificial Intelligence and Symbolic Computation (AISC), 2000, 2000-07-17 - 2000-07-19, Madrid. Berlin, Germany: Springer, pp. 115-126. (Lecture Notes in Artificial Intelligence; 1930)

Cohen, A. M., Davenport, J.H. and Heck, A.J.P., 1993. An overview of computer algebra. Chichester, UK: John Wiley, pp. 1-52.

Bennett, J.P., Davenport, J.H., Dewar, M.C., Fisher, D.L., Grinfeld, M. and Sauro, H., 1991. Computer algebra approaches to enzyme kinetics. Berlin, Germany: Springer, pp. 23-30. (Lecture Notes in Control and Information Sciences; 165)

Davenport, J. H., Gianni, P. and Trager, B. M., 1991. Scratchpad's view of algebra II:A categorical view of factorization. In: ISSAC '91 The 1991 International Symposium on Symbolic and Algebraic Computation, 1991-07-14 - 1991-07-16, Bonn. New York: ACM, pp. 32-38.

Davenport, J. H. and Trager, B. M., 1990. Scratchpad's view of algebra I: Basic commutative algebra. In: Design and Implementation of Symbolic Computation Systems: International Symposium DISCO '90, 1990-04-09 - 1990-04-11, Capri. Berlin: Springer, pp. 40-54. (Lecture Notes in Computer Science; 429/1990)

Bowyer, A., Davenport, J.H., Milne, P.S., Padget, J.A. and Wallis, A.F., 1989. A geometric algebra system. Oxford, UK: Clarendon Press, pp. 1-30.

Bowyer, A., Davenport, J.H., Milne, P.S., Padget, J. and Wallis, A.F., 1989. Applications of computer algebra in solid modelling. Berlin: Springer, pp. 244-245. (Lecture Notes in Computer Science; 378)

Bradford, R.J. and Davenport, J.H., 1989. Effective tests for cyclotomic polynomials. Berlin, Germany: Springer, pp. 244-251. (Lecture Notes in Computer Science; 358)

Abbott, J. A., Bradford, R. J. and Davenport, J., 1988. Factorisation of polynomials:old ideas and recent results. London, UK: Springer, pp. 81-91.

Abbott, J. A. and Davenport, J., 1987. Polynomial factorization. New York, USA: Springer, pp. 391-402. (Lecture Notes in Computer Science; 378)

Abbott, J. A., Bradford, R. J. and Davenport, J., 1986. The Bath algebraic number package. In: Char, B. W., ed. SYMSAC 86, 1986-07-20 - 1986-07-22, Waterloo. New York, USA: Association for Computing Machinery (ACM), pp. 250-253.

Davenport, J.H., 1983. Integration - what do we want from the theory? Berlin, Germany: Springer, pp. 2-11. (Lecture Notes in Computer Science; 162)

Davenport, J.H., 1982. The Parallel Risch Algorithm (I). Berlin, Germany: Springer, pp. 144-157. (Lecture Notes in Computer Science; 144)

Davenport, J.H., 1981. Effective mathematics:the computer algebra viewpoint. Berlin, Germany: Springer, pp. 31-43. (Springer Lecture Notes in Mathematics; 873)

Davenport, J.H., 1979. Algorithms for the integration of algebraic functions. Berlin, Germany: Springer, pp. 415-425. (Lecture Notes in Computer Science; 72)

Davenport, J.H., 1979. The computerisation of algebraic geometry. Berlin, Germany: Springer, pp. 119-133. (Lecture Notes in Computer Science; 72)

This list was generated on Mon Feb 8 16:38:53 2016 GMT.