The quadratic hash method when the table size is a power of 2. - F. Robert A. Hopgood; James H. Davenport (Comput. J., 1972)

The computerization of algebraic geometry. - James H. Davenport (EUROSAM, 1979)

Integration of algebraic functions. - James H. Davenport (EUROSAM, 1979)

Integration – the dust settles? (invited). - A. C. Norman; James H. Davenport (EUROSAM, 1979)

Anatomy of an integral. - James H. Davenport (SIGSAM Bull., 1979)

On the Integration of Algebraic Functions - James H. Davenport (Springer, 1981)

Factorization over finitely generated fields. - James H. Davenport; Barry M. Trager (SYMSACC, 1981)

MODLISP. - James H. Davenport; Richard D. Jenks (SIGSAM Bull., 1981)

The Parallel Risch Algorithm (I). - James H. Davenport (EUROCAM, 1982)

Fast reduce: the trade-off between efficiency and generality. - James H. Davenport (SIGSAM Bull., 1982)

On the parallel Risch algorithm (III): use of tangents. - James H. Davenport (SIGSAM Bull., 1982)

What do we want from a high-level language? - James H. Davenport (SIGSAM Bull., 1982)

P-adic reconstruction of rational numbers. - Paul S. Wang; M. J. T. Guy; James H. Davenport (SIGSAM Bull., 1982)

Integration - What do we want from the theory? - James H. Davenport (EUROCAL, 1983)

Factorization of sparse polynominals. - James H. Davenport (EUROCAL, 1983)

y'+ fy = g. - James H. Davenport (EUROSAM, 1984)

Integration in finite terms. - James H. Davenport (SIGSAM Bull., 1984)

Factoring Medium-Sized Integers. - R. J. Macmillan; James H. Davenport (Comput. J., 1984)

Symbolic and Numeric Manipulation of Integrals. - James H. Davenport (Accurate Scientific Computations, 1985)

HEUGCD: How Elementary Upperbounds Generated Cheaper Data. - James H. Davenport; Julian A. Padget (European Conference on Computer Algebra (2), 1985)

A remark on factorisation. - John A. Abbott; Russell J. Bradford; James H. Davenport (SIGSAM Bull., 1985)

An Application of Factoring. - Don Coppersmith; James H. Davenport (J. Symb. Comput., 1985)

On the Parallel Risch Algorithm (II). - James H. Davenport; Barry M. Trager (ACM Trans. Math. Softw., 1985)

The Bath algebraic number package. - John A. Abbott; Russell J. Bradford; James H. Davenport (SYMSAC, 1986)

PowerMath: a system for the Macintosh. - James H. Davenport; C. E. Roth (SYMSAC, 1986)

A "Piano Movers" Problem. - James H. Davenport (SIGSAM Bull., 1986)

Elementary and Liouvillian Solutions of Linear Differential Equations. - James H. Davenport; Michael F. Singer (J. Symb. Comput., 1986)

The Risch Differential Equation Problem. - James H. Davenport (SIAM J. Comput., 1986)

Polynomial factorization: An exploration of Lenstra's algorithm. - John A. Abbott; James H. Davenport (EUROCAL, 1987)

Applications of computer algebra in solid modelling. - Adrian Bowyer; James H. Davenport; Philip S. Milne; Julian A. Padget; Andrew F. Wallis (EUROCAL, 1987)

Factorisation of Polynominals: Old Ideas and Recent Results. - John A. Abbott; Russell J. Bradford; James H. Davenport (Trends in Computer Algebra, 1987)

The Use of Symbolic Computation in Geometric Modelling. - Andrew F. Wallis; Adrian Bowyer; James H. Davenport; Philip S. Milne; Julian A. Padget (IMA Conference on the Mathematics of Surfaces, 1988)

Effective Tests for Cyclotonic Polynomials. - Russell J. Bradford; James H. Davenport (ISSAC, 1988)

Computer Algebra Applied to Itself. - James H. Davenport (J. Symb. Comput., 1988)

Real Quantifier Elimination is Doubly Exponential. - James H. Davenport; Joos Heintz (J. Symb. Comput., 1988)

Current Problems in Computer Algebra Systems Design. - James H. Davenport (DISCO, 1990)

Scratchpad's View of Algebra I: Basic Commutative Algebra. - James H. Davenport; Barry M. Trager (DISCO, 1990)

Scratchpad's View of Algebra II: A Categorical View of Factorization. - James H. Davenport; Patrizia M. Gianni; Barry M. Trager (ISSAC, 1991)

Primality Testing Revisited. - James H. Davenport (ISSAC, 1992)

Voronoi diagrams of set-theoretic solid models. - David Lavender; Adrian Bowyer; James H. Davenport; Andrew F. Wallis; John R. Woodwark (IEEE Computer Graphics and Applications, 1992)

Computer algebra - systems and algorithms for algebraic computation (2. ed.). - James Harold Davenport; Yvon Siret; Evelyne Tournier (Academic Press, 1993)

An Intelligent Interface to Numerical Routines. - Brian J. Dupée; James H. Davenport (DISCO, 1996)

An Automatic Symbolic-Numeric Taylor Series ODE Solver. - Brian J. Dupée; James H. Davenport (CASC, 1999)

Reasoning about the Elementary Functions of Complex Analysis. - Robert M. Corless; James H. Davenport; David J. Jeffrey; Gurjeet Litt; Stephen M. Watt (AISC, 2000)

A Generic Root Operation for Exact Real Arithmetic. - Namhyun Hur; James H. Davenport (CCA, 2000)

An exact real algebraic arithmetic with equality determination. - Namhyun Hur; James H. Davenport (ISSAC, 2000)

Abstract Data Types in Computer Algebra. - James H. Davenport (MFCS, 2000)

"According to Abramowitz and Stegun" or arccoth needn't be uncouth. - Robert M. Corless; David J. Jeffrey; Stephen M. Watt; James H. Davenport (SIGSAM Bull., 2000)

On writing OpenMath content dictionaries. - James H. Davenport (SIGSAM Bull., 2000)

A small OpenMath type system. - James H. Davenport (SIGSAM Bull., 2000)

Lattice Attacks on RSA-Encrypted IP and TCP. - Paul A. Crouch; James H. Davenport (IMACC, 2001)

Towards better simplification of elementary functions. - Russell J. Bradford; James H. Davenport (ISSAC, 2002)

Reasoning about the Elementary Functions of Complex Analysis. - Russell J. Bradford; Robert M. Corless; James H. Davenport; David J. Jeffrey; Stephen M. Watt (Ann. Math. Artif. Intell., 2002)

Equality in Computer Algebra and Beyond. - James H. Davenport (J. Symb. Comput., 2002)

The Geometry of Cn is Important for the Algebra of Elementary Functions. - James H. Davenport (Algebra, Geometry, and Software Systems, 2003)

Resolving Large Prime(s) Variants for Discrete Logarithm Computation. - Andrew J. Holt; James H. Davenport (IMACC, 2003)

Better simplification of elementary functions through power series. - James C. Beaumont; Russell J. Bradford; James H. Davenport (ISSAC, 2003)

MKM from Book to Computer: A Case Study. - James H. Davenport (MKM, 2003)

Mathematics on the (Semantic) NET. - Olga Caprotti; James H. Davenport; Mike Dewar; Julian A. Padget (ESWS, 2004)

A poly-algorithmic approach to simplifying elementary functions. - James C. Beaumont; Russell J. Bradford; James H. Davenport; Nalina Phisanbut (ISSAC, 2004)

Copyright Issues for MKM. - Andrew A. Adams; James H. Davenport (MKM, 2004)

Adherence is better than adjacency: computing the Riemann index using CAD. - James C. Beaumont; Russell J. Bradford; James H. Davenport; Nalina Phisanbut (ISSAC, 2005)

The complexity of quantifier elimination and cylindrical algebraic decomposition. - Christopher W. Brown 001; James H. Davenport (ISSAC, 2007)

What Might "Understand a Function" Mean? - James H. Davenport (Calculemus/MKM, 2007)

Testing elementary function identities using CAD. - James C. Beaumont; Russell J. Bradford; James H. Davenport; Nalina Phisanbut (Appl. Algebra Eng. Commun. Comput., 2007)

AISC Meets Natural Typography. - James H. Davenport (AISC/MKM/Calculemus, 2008)

Effective Set Membership in Computer Algebra and Beyond. - James H. Davenport (AISC/MKM/Calculemus, 2008)

Unit Knowledge Management. - Jonathan Stratford; James H. Davenport (AISC/MKM/Calculemus, 2008)

The Freedom to Extend OpenMath and its Utility. - James H. Davenport; Paul Libbrecht (Math. Comput. Sci., 2008)

Certificate-Free Attribute Authentication. - Dalia Khader; Liqun Chen 002; James H. Davenport (IMACC, 2009)

A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy. - Russell J. Bradford; James H. Davenport; Christopher J. Sangwin (Calculemus/MKM, 2009)

Unifying Math Ontologies: A Tale of Two Standards. - James H. Davenport; Michael Kohlhase (Calculemus/MKM, 2009)

The Sparsity Challenges. - James Harold Davenport; Jacques Carette (SYNASC, 2009)

The Challenges of Multivalued "Functions". - James H. Davenport (AISC/MKM/Calculemus, 2010)

Geometry of branch cuts. - Nalina Phisanbut; Russell J. Bradford; James H. Davenport (ACM Commun. Comput. Algebra, 2010)

The Power of Vocabulary: The Case of Cyclotomic Polynomials - Jacques Carette; James H. Davenport (CoRR, 2010)

Computing with semi-algebraic sets represented by triangular decomposition. - Changbo Chen; James H. Davenport; Marc Moreno Maza; Bican Xia; Rong Xiao 004 (ISSAC, 2011)

On Kahan's Rules for Determining Branch Cuts. - Frédéric Chyzak; James H. Davenport; Christoph Koutschan; Bruno Salvy (SYNASC, 2011)

Computing the real solutions of polynomial systems with the RegularChains library in Maple. - Changbo Chen; James H. Davenport; François Lemaire; Marc Moreno Maza; Bican Xia; Rong Xiao 004; Yuzhen Xie (ACM Commun. Comput. Algebra, 2011)

Cryptographic Hash Functions: Recent Design Trends and Security Notions. - Saif Al-Kuwari; James H. Davenport; Russell J. Bradford (IACR Cryptol. ePrint Arch., 2011)

Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases. - David J. Wilson; Russell J. Bradford; James H. Davenport (AISC/MKM/Calculemus, 2012)

Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc. - James H. Davenport; Russell J. Bradford; Matthew England 001; David J. Wilson (SYNASC, 2012)

Small algorithms for small systems. - James H. Davenport (ACM Commun. Comput. Algebra, 2012)

A repository for CAD examples. - David J. Wilson; Russell J. Bradford; James H. Davenport (ACM Commun. Comput. Algebra, 2012)

Cylindrical algebraic decompositions for boolean combinations. - Russell J. Bradford; James H. Davenport; Matthew England 001; Scott McCallum; David J. Wilson (ISSAC, 2013)

Optimising Problem Formulation for Cylindrical Algebraic Decomposition. - Russell J. Bradford; James H. Davenport; Matthew England 001; David J. Wilson (MKM/Calculemus/DML, 2013)

Understanding Branch Cuts of Expressions. - Matthew England 001; Russell J. Bradford; James H. Davenport; David J. Wilson (MKM/Calculemus/DML, 2013)

A "Piano Movers" Problem Reformulated. - David J. Wilson; James H. Davenport; Matthew England 001; Russell J. Bradford (SYNASC, 2013)

Triangular decomposition of semi-algebraic systems. - Changbo Chen; James H. Davenport; John P. May; Marc Moreno Maza; Bican Xia; Rong Xiao 004 (J. Symb. Comput., 2013)

Computing with semi-algebraic sets: Relaxation techniques and effective boundaries. - Changbo Chen; James H. Davenport; Marc Moreno Maza; Bican Xia; Rong Xiao 004 (J. Symb. Comput., 2013)

Recent Advances in Real Geometric Reasoning. - James H. Davenport; Matthew England 001 (ADG, 2014)

Attribute-Based Signatures with User-Controlled Linkability. - Ali El Kaafarani; Liqun Chen 002; Essam Ghadafi; James H. Davenport (CANS, 2014)

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains. - Russell J. Bradford; Changbo Chen; James H. Davenport; Matthew England 001; Marc Moreno Maza; David J. Wilson (CASC, 2014)

Travelling through Facebook; Exploring affordances through the Lens of Age. - Niki Panteli; Ben L. Marder; James H. Davenport; Fabio Nemetz (ECIS, 2014)

Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition. - Matthew England 001; Russell J. Bradford; James H. Davenport; David J. Wilson (ICMS, 2014)

Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting. - Matthew England 001; David J. Wilson; Russell J. Bradford; James H. Davenport (ICMS, 2014)

Another Look at Formal Mathematical Properties. - James H. Davenport (CICM Workshops, 2014)

Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition. - Matthew England 001; Russell J. Bradford; Changbo Chen; James H. Davenport; Marc Moreno Maza; David J. Wilson (CICM, 2014)

Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition. - Zongyan Huang; Matthew England 001; David J. Wilson; James H. Davenport; Lawrence C. Paulson; James P. Bridge (CICM, 2014)

Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition. - David J. Wilson; Matthew England 001; Russell J. Bradford; James H. Davenport (SYNASC, 2014)

Branch cuts in maple 17. - Matthew England 001; Edgardo S. Cheb-Terrab; Russell J. Bradford; James H. Davenport; David J. Wilson (ACM Commun. Comput. Algebra, 2014)

A Comparison of Three Heuristics to Choose the Variable Ordering for Cylindrical Algebraic Decomposition. - Zongyan Huang; Matthew England 001; David J. Wilson; James H. Davenport; Lawrence C. Paulson (ACM Commun. Comput. Algebra, 2014)

A comparison of three heuristics to choose the variable ordering for CAD. - Zongyan Huang; Matthew England 001; David J. Wilson; James H. Davenport; Lawrence C. Paulson (CoRR, 2014)

Cylindrical Algebraic Sub-Decompositions. - David J. Wilson; Russell J. Bradford; James H. Davenport; Matthew England 001 (Math. Comput. Sci., 2014)

Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition. - Matthew England 001; Russell J. Bradford; James H. Davenport (ISSAC, 2015)

The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree. - Matthew England 001; James H. Davenport (CASC, 2016)

Complexity of Integration, Special Values, and Recent Developments. - James H. Davenport (ICMS, 2016)

Need Polynomial Systems Be Doubly-Exponential? - James H. Davenport; Matthew England 001 (ICMS, 2016)

Innovative Pedagogical Practices in the Craft of Computing. - James H. Davenport; Alan Hayes; Rachid Hourizi; Tom Crick (LaTiCE, 2016)

SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper). - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (CICM, 2016)

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition. - Matthew England 001; James H. Davenport (SC²@SYNASC, 2016)

Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases. - Zongyan Huang; Matthew England 001; James H. Davenport; Lawrence C. Paulson (SYNASC, 2016)

A Generalised Successive Resultants Algorithm. - James H. Davenport; Christophe Petit 001; Benjamin Pring (WAIFI, 2016)

Satisfiability checking and symbolic computation. - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (ACM Commun. Comput. Algebra, 2016)

Satisfiability Checking meets Symbolic Computation (Project Paper). - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (CoRR, 2016)

An Analysis of Introductory University Programming Courses in the UK. - Ellen Murphy; Tom Crick; James H. Davenport (CoRR, 2016)

Truth table invariant cylindrical algebraic decomposition. - Russell J. Bradford; James H. Davenport; Matthew England 001; Scott McCallum; David J. Wilson (J. Symb. Comput., 2016)

SC-square: when Satisfiability Checking and Symbolic Computation join forces. - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Vijay Ganesh 001; Alberto Griggio; et al. (ARCADE@CADE, 2017)

A Case Study on the Parametric Occurrence of Multiple Steady States. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (ISSAC, 2017)

Benchmarking Solvers, SAT-style. - Martin Brain; James H. Davenport; Alberto Griggio (SC²@ISSAC, 2017)

The Potential and Challenges of CAD with Equational Constraints for SC-Square. - James H. Davenport; Matthew England 001 (MACIS, 2017)

Fast Matrix Operations in Computer Algebra. - Zak Tonks; Gregory Sankaran; James H. Davenport (SYNASC, 2017)

What Does "Without Loss of Generality" Mean, and How Do We Detect It. - James H. Davenport (Math. Comput. Sci., 2017)

An Analysis of Introductory Programming Courses at UK Universities. - Ellen Murphy; Tom Crick; James H. Davenport (Art Sci. Eng. Program., 2017)

Methodologies of Symbolic Computation. - James H. Davenport (AISC, 2018)

TheoryGuru: A Mathematica Package to Apply Quantifier Elimination Technology to Economics. - Casey B. Mulligan; James H. Davenport; Matthew England 001 (ICMS, 2018)

Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics. - Casey B. Mulligan; Russell J. Bradford; James H. Davenport; Matthew England 001; Zak Tonks (SC-Square@FLOC, 2018)

Language Choice in Introductory Programming Courses at Australasian and UK Universities. - Simon; Raina Mason; Tom Crick; James H. Davenport; Ellen Murphy (SIGCSE, 2018)

The Rôle of Benchmarking in Symbolic Computation (Position Paper). - James H. Davenport (SYNASC, 2018)

OpenMath and SMT-LIB. - James H. Davenport; Matthew England 001; Roberto Sebastiani; Patrick Trentin (CoRR, 2018)

Regular cylindrical algebraic decomposition. - James H. Davenport; Acyr F. Locatelli; Gregory K. Sankaran (CoRR, 2018)

Quantifier Elimination for Reasoning in Economics. - Casey B. Mulligan; Russell J. Bradford; James H. Davenport; Matthew England 001; Zak Tonks (CoRR, 2018)

Using Machine Learning to Improve Cylindrical Algebraic Decomposition. - Zongyan Huang; Matthew England 001; David J. Wilson; James H. Davenport; Lawrence C. Paulson (CoRR, 2018)

TheoryGuru: A Mathematica Package to apply Quantifier Elimination. - Casey B. Mulligan; James Harold Davenport; Matthew England 001 (CoRR, 2018)

Machine-Assisted Proofs (ICM 2018 Panel). - James H. Davenport; Bjorn Poonen; James Maynard 001; Harald Helfgott; Pham Huu Tiep; Luís Cruz-Filipe (CoRR, 2018)

Datset of automated economic reasoning problems for QE / SMT. - Casey B. Mulligan; Russell J. Bradford; James H. Davenport; Matthew England 001; Zak Tonks (Zenodo, 2018)

Datset of automated economic reasoning problems for QE / SMT. - Casey B. Mulligan; Russell J. Bradford; James H. Davenport; Matthew England 001; Zak Tonks (Zenodo, 2018)

Teaching of Computing to Mathematics Students: Programming and Discrete Mathematics. - Jack D. Betteridge; James H. Davenport; Melina A. Freitag; Willem Heijltjes; Stef Kynaston; Gregory Sankaran; Gunnar Traustason (CEP, 2019)

The Institute of Coding: Addressing the UK Digital Skills Crisis. - James H. Davenport; Tom Crick; Alan Hayes; Rachid Hourizi (CEP, 2019)

A UK Case Study on Cybersecurity Education and Accreditation. - Tom Crick; James H. Davenport; Alastair Irons; Tom Prickett (FIE, 2019)

Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -. - Antonio Cerone; Markus Roggenbach; James H. Davenport; Casey Denner; Marie Farrell; Magne Haveraaen; Faron Moller; Philipp Körner; Sebastian Krings; Peter Csaba Ölveczky; Bernd-Holger Schlingloff; Nikolay V. Shilov 002; et al. (FMFun, 2019)

Cybersecurity Education and Formal Methods. - James H. Davenport; Tom Crick (FMFun, 2019)

On Benefits of Equality Constraints in Lex-Least Invariant CAD. - Akshar Nair; James H. Davenport; Gregory Sankaran (SC-square@SIAM AG, 2019)

The Institute of Coding: A University-Industry Collaboration to Address the UK Digital Skills Crisis. - James H. Davenport; Rachid Hourizi (SIGCSE, 2019)

Lazard's CAD exploiting equality constraints. - Akshar Nair; James H. Davenport; Gregory Sankaran; Scott McCallum (ACM Commun. Comput. Algebra, 2019)

Formal Methods and CyberSecurity. - James H. Davenport (CoRR, 2019)

Symbolic computation in software science. - James Harold Davenport; Temur Kutsia (J. Symb. Comput., 2019)

Foreword. - James H. Davenport; Laura Kovács; Daniela Zaharie (Math. Comput. Sci., 2019)

Using Machine Learning to Improve Cylindrical Algebraic Decomposition. - Zongyan Huang; Matthew England 001; David J. Wilson; James P. Bridge; James H. Davenport; Lawrence C. Paulson (Math. Comput. Sci., 2019)

New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract). - Erika Ábrahám; James H. Davenport; Matthew England 001; Gereon Kremer; Zak Tonks (PAAR+SC²@IJCAR, 2020)

Computer Science Degree Accreditation in the UK: A Post-Shadbolt Review Update. - Tom Crick; James H. Davenport; Paul Hanna; Alastair Irons; Tom Prickett (CEP, 2020)

The Institute of Coding: A University-Industry Collaboration to Address the UK's Digital Skills Crisis. - James H. Davenport; Tom Crick; Rachid Hourizi (EDUCON, 2020)

Overcoming the Challenges of Teaching Cybersecurity in UK Computer Science Degree Programmes. - Tom Crick; James H. Davenport; Paul Hanna; Alastair Irons; Tom Prickett (FIE, 2020)

Curtains in CAD: Why Are They a Problem and How Do We Fix Them? - Akshar Nair; James H. Davenport; Gregory Sankaran (ICMS, 2020)

Assessing the Value of Professional Body Accreditation of Computer Science Degree Programmes: A UK Case Study. - Tom Crick; Tom Prickett; James H. Davenport; Alastair Irons (ITiCSE, 2020)

Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES. - James H. Davenport; Benjamin Pring (SAC, 2020)

The CAD Conundrum: Lex-Least vs Order. - Scott McCallum; Akshar Nair; James H. Davenport; Gregory Sankaran (SYNASC, 2020)

New Opportunities for the Formal Proof of Computational Real Geometry? - Erika Ábrahám; James H. Davenport; Matthew England 001; Gereon Kremer; Zak Tonks (CoRR, 2020)

Unification of HDP and LDA Models for Optimal Topic Clustering of Subject Specific Question Banks. - Nikhil Fernandes; Alexandra Gkolia; Nicolas Pizzo; James H. Davenport; Akshar Nair (CoRR, 2020)

The Influence of Domain-Based Preprocessing on Subject-Specific Clustering. - Alexandra Gkolia; Nikhil Fernandes; Nicolas Pizzo; James H. Davenport; Akshar Nair (CoRR, 2020)

Data Without Software Are Just Numbers. - James Harold Davenport; James Grant; Catherine Mary Jones (Data Sci. J., 2020)

Identifying the parametric occurrence of multiple steady states for some biological networks. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (J. Symb. Comput., 2020)

Symbolic computation and satisfiability checking. - James H. Davenport; Matthew England 001; Alberto Griggio; Thomas Sturm 001; Cesare Tinelli (J. Symb. Comput., 2020)

Cylindrical algebraic decomposition with equational constraints. - Matthew England 001; Russell J. Bradford; James H. Davenport (J. Symb. Comput., 2020)

Foreword. - George Labahn; James H. Davenport; Josef Urban (Math. Comput. Sci., 2020)

Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic. - Erika Ábrahám; James H. Davenport; Matthew England 001; Gereon Kremer (ARCADE@CADE, 2021)

Supporting Early-Career Academics in the UK Computer Science Community. - Tom Crick; James H. Davenport; Alan Hayes; Alastair Irons; Tom Prickett (CEP, 2021)

Towards a 21st Century Personalised Learning Skills Taxonomy. - Rupert Ward; Oliver Phillips; David Bowers 001; Tom Crick; James H. Davenport; Paul Hanna; Alan Hayes; Alastair Irons; Tom Prickett (EDUCON, 2021)

Developing a Computer Science Education Community of Practice for Early-Career Academics in the UK. - Tom Crick; James H. Davenport; Alan Hayes; Alastair Irons; Tom Prickett (ITiCSE (2), 2021)

OpenMath Preface. - James H. Davenport; Michael Kohlhase (CICM Workshops, 2021)

Varieties of Doubly-Exponential behaviour in Cylindrical Algebraic Decomposition. - James H. Davenport (SC-Square@SIAM AG, 2021)

Practical Evaluation of Quantifier Elimination Methods (short paper). - James H. Davenport; Zak Tonks; Ali Kemal Uncu (SC-Square@SIAM AG, 2021)

Equational Constraints, the Lazard Projection and the Curtain Problem (short paper). - Akshar S. Nair; James H. Davenport; Gregory Sankaran (SC-Square@SIAM AG, 2021)

Increasing the Value of Professional Body Computer Science Degree Accreditation. - Alastair Irons; Tom Crick; James H. Davenport; Tom Prickett (SIGCSE, 2021)

On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving. - Gereon Kremer; Erika Ábrahám; Matthew England 001; James H. Davenport (SYNASC, 2021)

The DEWCAD project: pushing back the doubly exponential wall of cylindrical algebraic decomposition. - Russell J. Bradford; James H. Davenport; Matthew England 001; AmirHosein Sadeghimanesh; Ali Kemal Uncu (ACM Commun. Comput. Algebra, 2021)

Digital Collections of Examples in Mathematical Sciences. - James Harold Davenport (CoRR, 2021)

ATLAS: Interactive and Educational Linear Algebra System Containing Non-Standard Methods. - Akhilesh Pai; James Harold Davenport (CoRR, 2021)

Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings. - Erika Ábrahám; James H. Davenport; Matthew England 001; Gereon Kremer (J. Log. Algebraic Methods Program., 2021)

Co-Constructing a Community of Practice for Early-Career Computer Science Academics in the UK. - Tom Crick; James H. Davenport; Paul Hanna; Alan Hayes; Alastair Irons; Keith Miller 007; Tom Prickett; Rupert Ward; Becky Allen; Bhagyashree Patil; Simon Payne (CEP, 2022)

A National Mentoring and Buddying Pilot Scheme for UK Early Career CS Academics. - Tom Crick; James H. Davenport; Alan Hayes; Alastair Irons; Tom Prickett; Simon Payne (ITiCSE (2), 2022)

SMT-Solving Induction Proofs of Inequalities. - Ali Kemal Uncu; James H. Davenport; Matthew England 001 (SC-Square@FLoC, 2022)

Artificial Conflict Sampling for Real Satisfiability Problems. - James H. Davenport; Ali Kemal Uncu (SYNASC, 2022)

New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072). - Erika Ábrahám; James H. Davenport; Matthew England 001; Alberto Griggio (Dagstuhl Reports, 2022)

Lazard-style CAD and Equational Constraints. - James Harold Davenport; Akshar Sajive Nair; Gregory Kumar Sankaran; Ali Kemal Uncu (ISSAC, 2023)

Proving an Execution of an Algorithm Correct? - James Harold Davenport (CICM, 2023)

So the problem has poor complexity: what next? - James H. Davenport (SYNASC, 2023)

A Poly-algorithmic Approach to Quantifier Elimination. - James H. Davenport; Zak P. Tonks; Ali Kemal Uncu (SYNASC, 2023)

Teaching Programming Competencies: A Role for Craft Computing? - Tom Crick; James H. Davenport; Alan Hayes; Tom Prickett (UKICER, 2023)

A Practical Overview of Quantum Computing: Is Exascale Possible? - James H. Davenport; Jessica R. Jones; Matthew Thomason (CoRR, 2023)

Iterated Resultants in CAD. - James H. Davenport; Matthew England 001 (CoRR, 2023)

Iterated Resultants and Rational Functions in Real Quantifier Elimination. - James H. Davenport; Matthew England 001; Scott McCallum; Ali Kemal Uncu (CoRR, 2023)

SMT-Solving Induction Proofs of Inequalities Benchmarking Repository. - Ali Kemal Uncu; James H. Davenport; Matthew England 001 (Zenodo, 2023)

Exploring Alternative Machine Learning Models for Variable Ordering in Cylindrical Algebraic Decomposition. - Rohit John; James H. Davenport (ICMS, 2024)

Embedding Technical, Personal and Professional Competencies in Computing Degree Programmes. - Tom Prickett; Tom Crick; James H. Davenport; David S. Bowers; Alan Hayes; Alastair Irons (ITiCSE (1), 2024)

A Global Survey of Introductory Programming Courses. - Raina Mason; Simon; Brett A. Becker; Tom Crick; James H. Davenport (SIGCSE (1), 2024)

First Steps Towards Computational Polynomials in Lean. - James H. Davenport (SYNASC, 2024)

Towards Verified Polynomial Factorisation. - James H. Davenport (SYNASC, 2024)

On Projective Delineability. - Lucas Michel; Jasper Nalbach; Pierre Mathonet; Naïm Zénaïdi; Christopher W. Brown 001; Erika Ábrahám; James H. Davenport; Matthew England 001 (SYNASC, 2024)

Levelwise construction of a single cylindrical algebraic cell. - Jasper Nalbach; Erika Ábrahám; Philippe Specht; Christopher W. Brown 001; James H. Davenport; Matthew England 001 (J. Symb. Comput., 2024)

Postgraduate Cybersecurity Education for Non-Specialist Professionals. - James H. Davenport; Tim French 004 (EDUCON, 2025)

Towards a Framework for Mapping Authentic Assessment to Competency in University Computing Education in the Uk. - Tom Prickett; Ian McChesney; Emma Norling; Alan Hayes; Alexandros Chrysikos; Steve Riddle; James H. Davenport; Alastair Irons; Tom Crick (EDUCON, 2025)

Projective Delineability for Single Cell Construction. - Jasper Nalbach; Lucas Michel; Erika Ábrahám; Christopher W. Brown 001; James H. Davenport; Matthew England 001; Pierre Mathonet; Naïm Zénaïdi (CoRR, 2025)