James H. Davenport

James H. Davenport's AcademicInfluence.com Rankings

James H. Davenport

Computer Science

#3065

World Rank

#3215

Historical Rank

computer-science Degrees

James H. Davenport

Mathematics

#3391

World Rank

#5013

Historical Rank

Algebra

#51

World Rank

#88

Historical Rank

Measure Theory

#2491

World Rank

#2992

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is James H. Davenport Influential?

(Suggest an Edit or Addition)

According to Wikipedia, James Harold Davenport is a British computer scientist who works in computer algebra. Having done his PhD and early research at the Computer Laboratory, University of Cambridge, he is the Hebron and Medlock Professor of Information Technology at the University of Bath in Bath, England.

(See a Problem?)

James H. Davenport's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Real Quantifier Elimination is Doubly Exponential (1988) (396)
Computer algebra - systems and algorithms for algebraic computation (2. ed.) (1988) (291)
On the Integration of Algebraic Functions (1979) (184)
The complexity of quantifier elimination and cylindrical algebraic decomposition (2007) (144)
P-adic reconstruction of rational numbers (1982) (129)
A "Piano Movers" Problem. (1986) (96)
Triangular decomposition of semi-algebraic systems (2010) (82)
Truth table invariant cylindrical algebraic decomposition (2014) (66)
British Academy of Management (2013) (64)
Integration in finite terms (1984) (61)
An Analysis of Introductory Programming Courses at UK Universities (2016) (54)
Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition (2014) (53)
Cylindrical algebraic decompositions for boolean combinations (2013) (49)
Optimising Problem Formulation for Cylindrical Algebraic Decomposition (2013) (46)
SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper) (2016) (46)
Language Choice in Introductory Programming Courses at Australasian and UK Universities (2018) (43)
A small OpenMath type system (2000) (43)
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc (2012) (41)
Cryptographic Hash Functions: Recent Design Trends and Security Notions (2011) (41)
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains (2014) (39)
Reasoning about the Elementary Functions of Complex Analysis (2000) (39)
Scratchpad's View of Algebra I: Basic Commutative Algebra (1990) (39)
“According to Abramowitz and Stegun” or arccoth needn't be uncouth (2000) (38)
According to abramowitz and stegun (2000) (37)
Towards better simplification of elementary functions (2002) (35)
A Case Study on the Parametric Occurrence of Multiple Steady States (2017) (32)
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition (2015) (31)
Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting (2014) (30)
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (2016) (29)
A "Piano Movers" Problem Reformulated (2013) (29)
The Risch Differential Equation Problem (1986) (28)
Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition (2014) (27)
Scratchpad's view of algebra II: A categorical view of factorization (1991) (27)
Cylindrical Algebraic Decomposition with Equational Constraints (2019) (26)
Innovative Pedagogical Practices in the Craft of Computing (2016) (26)
Cylindrical Algebraic Sub-Decompositions (2014) (26)
Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition (2014) (26)
Computing with semi-algebraic sets represented by triangular decomposition (2011) (26)
A UK Case Study on Cybersecurity Education and Accreditation (2019) (26)
Looking at a set of equations (1987) (26)
Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases (2012) (25)
Mathematics on the (Semantic) NET (2004) (23)
Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks (2019) (23)
Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases (2016) (22)
Attribute-Based Signatures with User-Controlled Linkability (2014) (22)
Using Machine Learning to Improve Cylindrical Algebraic Decomposition (2018) (21)
Deciding the Consistency of Non-Linear Real Arithmetic Constraints with a Conflict Driven Search Using Cylindrical Algebraic Coverings (2020) (21)
A geometric algebra system (1989) (19)
A repository for CAD examples (2013) (19)
Factorization over finitely generated fields (1981) (18)
The Bath algebraic number package (1986) (18)
The Parallel Risch Algorithm (I) (1982) (18)
Understanding Branch Cuts of Expressions (2013) (18)
Chairman's column (1983) (17)
Polynomials whose powers are sparse (1991) (17)
Algebraic properties of the Lambert W function from a result of Rosenlicht and of Liouville (2008) (17)
A :20piano movers' ' (1986) (17)
Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings (2011) (17)
Elementary and Liouvillian Solutions of Linear Differential Equations (1985) (17)
HEUGCD: How Elementary Upperbounds Generated Cheaper Data (1985) (16)
Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition (2014) (16)
Computer Science Degree Accreditation in the UK: A Post-Shadbolt Review Update (2020) (16)
Computer algebra approaches to enzyme kinetics (1991) (16)
Geometry of branch cuts (2011) (15)
The Institute of Coding: Addressing the UK Digital Skills Crisis (2019) (15)
Non-Linear Real Arithmetic Benchmarks Derived from Automated Reasoning in Economics (2018) (15)
The Freedom to Extend OpenMath and its Utility (2008) (15)
The quadratic hash method when the table size is a power of 2 (1972) (14)
On finding the largest root of a polynomial (1990) (14)
Effective Tests for Cyclotonic Polynomials (1988) (14)
Equality in Computer Algebra and Beyond (2002) (14)
Fast recognition of alternating and symmetric Galois groups (2000) (13)
On the parallel Risch Algorithm (II) (1985) (13)
The Institute of Coding: A University-Industry Collaboration to Address the UK’s Digital Skills Crisis (2019) (12)
An overview of computer algebra (1993) (12)
Unit Knowledge Management (2008) (12)
Testing elementary function identities using CAD (2007) (12)
On writing OpenMath content dictionaries (2000) (12)
Symbolic integration — the dust settles? (1979) (12)
A remark on factorisation (1985) (12)
Primality testing revisited (1992) (11)
Need Polynomial Systems Be Doubly-Exponential? (2016) (11)
MKM from Book to Computer: A Case Study (2003) (11)
Benchmarking Solvers, SAT-style (2017) (11)
Unifying Math Ontologies: A Tale of Two Standards (2009) (11)
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries (2013) (11)
Data Without Software Are Just Numbers (2020) (10)
New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract) (2020) (10)
A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (2009) (10)
A poly-algorithmic approach to simplifying elementary functions (2004) (10)
Current Problems in Computer Algebra Systems Design (1990) (10)
Better simplification of elementary functions through power series (2003) (10)
Overcoming the Challenges of Teaching Cybersecurity in UK Computer Science Degree Programmes (2020) (10)
Mathematical Knowledge Management: Second International Conference, MKM 2003 Bertinoro, Italy, February 16–18, 2003 Proceedings (2003) (10)
Branch cuts in maple 17 (2013) (10)
Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES (2020) (10)
Intelligent Computer Mathematics, 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5-10, 2010. Proceedings (2010) (9)
An Application of Factoring (1985) (9)
Solving semi-algebraic systems with the RegularChains library in Maple (2011) (9)
Adherence is better than adjacency: computing the Riemann index using CAD (2005) (9)
Certificate-Free Attribute Authentication (2009) (9)
The challenges of multivalued "Functions" (2010) (9)
Computing the real solutions of polynomial systems with the RegularChains library in Maple (2012) (9)
Table errata: Tables of indefinite integrals\ [English translation, Dover, New York, 1961;\ MR 23 #A256]\ by G. Petit Bois (1982) (8)
An Intelligent Interface to Numerical Routines (1996) (8)
The computerization of algebraic geometry (1979) (8)
TheoryGuru: A Mathematica Package to apply Quantifier Elimination (2018) (8)
Repositioning BCS Degree Accreditation (2020) (8)
On Benefits of Equality Constraints in Lex-Least Invariant CAD (Extended Abstract (2019) (7)
Curtains in CAD: Why Are They a Problem and How Do We Fix Them? (2020) (7)
Effective mathematics — the computer algebra viewpoint (1981) (7)
Symbolic computation and satisfiability checking (2020) (7)
The Sparsity Challenges (2009) (7)
Satisfiability checking and symbolic computation (2016) (6)
Table errata (2002) (6)
Integration -- the dust settles? (invited) (1979) (6)
Supporting Early-Career Academics in the UK Computer Science Community (2021) (6)
Mathematical Software – ICMS 2018 (2018) (6)
An exact real algebraic arithmetic with equality determination (2000) (6)
User interface design for geometrical decomposition algorithms in Maple (2009) (6)
Abstract Data Types in Computer Algebra (2000) (6)
Towards a 21st Century Personalised Learning Skills Taxonomy (2021) (6)
Dataset supporting the paper: Truth table invariant cylindrical algebraic decomposition (2015) (6)
Integration - What do we want from the theory? (1983) (5)
Recent Advances in Real Geometric Reasoning (2014) (5)
Joint Proceedings of the MathUI, OpenMath and ThEdu Workshops and Work in Progress track at CICM co-located with Conferences on Intelligent Computer Mathematics (CICM 2014), Coimbra, Portugal, July 7-11, 2014 (2014) (5)
Teaching of Computing to Mathematics Students: Programming and Discrete Mathematics (2019) (5)
The Geometry of C^n is Important for the Algebra of Elementary Function (2003) (5)
Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition (2016) (5)
The “Unknown” in Computer Algebra (2007) (5)
On the parallel Risch algorithm (III): use of tangents (1982) (5)
A Comparison of Three Heuristics to Choose the Variable Ordering for Cylindrical Algebraic Decomposition (2015) (4)
Integration of algebraic functions (1979) (4)
Using EVS and ResponseWare to Enhance Student Learning and Learning Experience (2010) (4)
Proceedings of the Second International Conference on Mathematical Knowledge Management (2003) (4)
Maintaining the Focus on Cybersecurity in UK Higher Education (2019) (4)
A Generalised Successive Resultants Algorithm (2016) (4)
Factorization of sparse polynominals (1983) (4)
Lattice Attacks on RSA-Encrypted IP and TCP (2001) (4)
Interdisciplinary teaching of computing to mathematics students: Programming and discrete mathematics (2014) (4)
Increasing the Value of Professional Body Computer Science Degree Accreditation (2021) (4)
On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving (2021) (4)
A remark on a paper by Wang: another surprising property of 42 (1988) (3)
The use of an Electronic Voting System to enhance student feedback (2009) (3)
A Generic Root Operation for Exact Real Arithmetic (2000) (3)
EUROCAL '87: European Conference on Computer Algebra, Leipzig, GDR, June 2-5, 1987. Proceedings (1989) (3)
Symbolic and Numeric Manipulation of Integrals (1985) (3)
PowerMath: a system for the Macintosh (1986) (3)
What Might "Understand a Function" Mean? (2007) (3)
The debate about "algorithms" (2017) (3)
Proceedings of the European Conference on Computer Algebra (1987) (3)
Complexity of Integration, Special Values, and Recent Developments (2016) (3)
Polynomial factorization: An exploration of Lenstra's algorithm (1987) (3)
Rooting Formal Methods within Higher Education Curricula for Computer Science and Software Engineering - A White Paper (2020) (3)
Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic (2021) (3)
Machine-Assisted Proofs (ICM 2018 Panel) (2018) (3)
Mathematical Knowledge Management: 2nd International Conference, MKM 2003, Bertorino, Italy: Proceedings (2003) (3)
Solving computational problems in real algebra/geometry (2015) (3)
What Does “Without Loss of Generality” Mean, and How Do We Detect It (2017) (3)
Intelligent Computer Mathematics: 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011, ... / Lecture Notes in Artificial Intelligence) (2011) (3)
The Geometry of Cn is Important for the Algebra of Elementary Functions (2003) (3)
Assessing the Value of Professional Body Accreditation of Computer Science Degree Programmes: A UK Case Study (2020) (3)
Quantifier Elimination for Reasoning in Economics (2018) (3)
Y'+ Fy = G (1984) (3)
Regular cylindrical algebraic decomposition (2018) (2)
The DEWCAD Project: Pushing Back the Doubly Exponential Wall of Cylindrical Algebraic Decomposition (2021) (2)
Fast Matrix Operations in Computer Algebra (2017) (2)
The Piano Mover's Problem Reformulated (2013) (2)
Multi-Valued Computer Algebra (1999) (2)
$$\mathsf {SC}^\mathsf{2} $$: Satisfiability Checking Meets Symbolic Computation (2016) (2)
Factorization of sparse polynomials or the power of vocabulary (2010) (2)
How does one program in the AXIOM System (1992) (2)
Factorisation of Polynominals: Old Ideas and Recent Results (1987) (2)
On numbers and polynomials (1986) (2)
Resolving Large Prime(s) Variants for Discrete Logarithm Computation (2003) (2)
Unification of HDP and LDA Models for Optimal Topic Clustering of Subject Specific Question Banks (2020) (2)
Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics (2011) (2)
Lazard's CAD exploiting equality constraints (2019) (1)
Mathematical Massive Open Online Courses (MOOCs):report of a panel at the 2014 ICM (2014) (1)
The Use of Symbolic Computation in Geometric Modelling (1988) (1)
An Analysis of Introductory University Programming Courses in the UK (2016) (1)
The Roˆle of intelligence in computer algebra (1994) (1)
Barton and Fitch Revisited (2009) (1)
Description and generation of mathematical web services (1)
The Potential and Challenges of CAD with Equational Constraints for SC-Square (2017) (1)
Intelligent Computer Mathematics: CICM 2014 Joint Events Calculemus, DML, MKM, and Systems and Projects 2014, Coimbra, Portugal, July 7-11, 2014 (2014) (1)
Integration: formal and numeric approaches (1984) (1)
The CAD Conundrum: Lex-Least vs Order (2020) (1)
Levelwise construction of a single cylindrical algebraic cell (2022) (1)
Teaching Programming for Mathematical Scientists (2020) (1)
VLSI and Computer Algebra: the GCD example (1985) (1)
Fast reduce: the trade-off between efficiency and generality (1982) (1)
A comparison of three heuristics to choose the variable ordering for CAD (2014) (1)
Developing a Computer Science Education Community of Practice for Early-Career Academics in the UK (2021) (1)
UK Computer Science Degree Accreditation: A Post-Shadbolt Review Update (2019) (1)
What do we want from a high-level language? (1982) (1)
Symbolic Computation and Satisfiability Checking Editorial (2019) (1)
The Utility of OpenMath (2007) (1)
Integration in closed form (1988) (1)
The Institute of Coding: A University-Industry Collaboration to Address the UK Digital Skills Crisis (2019) (1)
What Does “Without Loss of Generality” Mean, and How Do We Detect It (2017) (1)
Nauseating Notation Very Much in Draft (2012) (1)
SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper) (2016) (1)
Methodologies of Symbolic Computation (2018) (1)
The Changing Relevance of the TLB (2013) (1)
Co-Constructing a Community of Practice for Early-Career Computer Science Academics in the UK (2022) (1)
Mathematical Software – ICMS 2020: 7th International Conference, Braunschweig, Germany, July 13–16, 2020, Proceedings (2020) (1)
Small algorithms for small systems (2012) (1)
Computer Algebra Applied to Itself (1988) (1)
Satisfiability Checking meets Symbolic Computation (Project Paper) (2016) (1)
SC 2 : Satisfiability Checking meets (2016) (1)
On Kahan's Rules for Determining Branch Cuts (2011) (0)
The {open_quotes}unknown{close_quotes} in computer algebra (1994) (0)
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (2019) (0)
Cybersecurity Education and Formal Methods (2019) (0)
Intelligent Computer Mathematics (2016) (0)
Another surprising property of 42. A remark on a paper by P. S. Wang: “Factoring multivariate polynomials over algebraic number fields” [Math. Comp. 30 (1976), no. 134, 324–336; MR0568283 (58 #27887a)] (1988) (0)
Formal Methods and CyberSecurity (2019) (0)
SIAM AAG 15 and ICIAM 2015 (2015) (0)
11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning In conjunction with TPHOL 2003 and TABLEAUX 2003 (2003) (0)
The Sparsity Challenges (Invited Paper) (2009) (0)
S C ] 2 3 Ju l 2 01 6 Satisfiability Checking and Symbolic Computation (2016) (0)
Applications of computer algebra in solid modelling (1987) (0)
Exemplary Achievements SC 2 challenges : when Satisfiability Checking and Symbolic Computation join forces (2017) (0)
Equational Constraints, the Lazard Projection and the Curtain Problem (2022) (0)
Daniel Lazard and Polynomial Systems A Personal View (2004) (0)
Report on the Workshop on Sustainable Software Sustainability 2019 (WOSSS19) (2020) (0)
Varieties of Doubly-Exponential Behaviour in Cylindrical Algebraic Decomposition (2022) (0)
Risch's theorem (1981) (0)
Social Networks in Cyberspace (2013) (0)
Session details: Paper Session: Databases (2019) (0)
Very-High-Performance Multiple-Instruction Multiple-Data Application: Discussion (1988) (0)
Travelling through Facebook; Exploring affordances through the Lens of Age (2014) (0)
A Poly-algorithmic Approach to Quantifier Elimination (2023) (0)
MACHINE-ASSISTED PROOFS (2019) (0)
The problem of torsion divisors (1981) (0)
An Automatic Symbolic-Numeric Taylor Series ODE Solver (1999) (0)
Symbolic, Algebraic and Validated Numerical Computation (Dagstuhl Seminar 9232) (2021) (0)
A Combined VTS/Lazard Quantifier Elimination Method (2022) (0)
Metaphors of Identity: Focus Groups (2015) (0)
Foreword (to special issue on ICMS 2018) (2020) (0)
62 – Symbolic computation (1991) (0)
Gauss-Manin operators (1981) (0)
Curves over algebaic number fields (1981) (0)
What does Mathematical Notation actually mean, and how can computers process it? (2015) (0)
Effective Set Membership in Computer Algebra and Beyond (2008) (0)
New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072) (2022) (0)
Rethinking pedagogies for programming: Computational thinking, codemanship and (software) carpentry (2016) (0)
Cylindrical Algebraic Sub-Decompositions (2014) (0)
OpenMath 2014 preface (2014) (0)
The Rôle of Benchmarking in Symbolic Computation (Position Paper) (2018) (0)
Algorithms of Computeralgebra (Dagstuhl Seminar 9151) (2021) (0)
SMT Nonlinear Real Arithmetic and Computer Algebra: a Dialogue of the Deaf? (2017) (0)
MODLISP (1981) (0)
Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner (2016) (0)
The Power of Vocabulary: The Case of Cyclotomic Polynomials (2010) (0)
Elliptic integras concluded (1981) (0)
Intelligent Geometry Tools (2019) (0)
The Mathematics of Computer Algebra (1986) (0)
Rock and Role at Club Facebook: Consumer metaphors of Facebook and the situated social roles within (2013) (0)
The DEWCAD project (2021) (0)
AISC Meets Natural Typography (2008) (0)
Branch cuts in Maple 17 England (2013) (0)
Digital Collections of Examples in Mathematical Sciences (2021) (0)
Computer Algebra (1982) (0)
ATLAS: Interactive and Educational Linear Algebra System Containing Non-Standard Methods (2021) (0)
Foreword (2020) (0)
The Axiom System a Little History (2007) (0)
Recent and upcoming events (2013) (0)
Factoring Medium-Sized Integers (1984) (0)
Computer science and mathematics (1996) (0)
S C ] 2 7 Ju l 2 01 6 SC 2 : Satisfiability Checking meets Symbolic Computation ( Project Paper ) (2016) (0)
S C ] 1 5 M ay 2 01 8 Quantifier Elimination for Reasoning in Economics (2018) (0)
Anatomy of an integral (1979) (0)
Foreword (2019) (0)
Applications of computer algebraa to verification and safistiability checking (2018) (0)
Geometric reasoning : By D. Kapur and J.L. Mundy, eds. MIT Press, London, United Kingdom, 1989, Price £24.75 (paperback), ISBN 0-262-6-1058-2. (1990) (0)
Lazard-style CAD and Equational Constraints (2023) (0)
Dataset for GW4 "First Programming Courses" project (2016) (0)
Joint Proceedings of the MathUI, OpenMath, PLMMS, and ThEdu Workshops and Work in Progress at the Conference on Intelligent Computer Mathematics 2014 (2014) (0)
rayleigh: Release to Zenodo (2015) (0)
How EU data protection law could interfere with targeted ads (2015) (0)
The Influence of Domain-Based Preprocessing on Subject-Specific Clustering (2020) (0)
Cybersecurity Education and Formal Method (2019) (0)
Using Machine Learning to Improve Cylindrical Algebraic Decomposition (2019) (0)
A National Mentoring and Buddying Pilot Scheme for UK Early Career CS Academics (2022) (0)
Situated identities on social network sites (2013) (0)
Mathematics for computer algebra , by Maurice Mignotte, (translation from French by Catherine Mignotte) Pp 346. DM78. 1992. ISBN 3-540-97675-2 (Springer) (1994) (0)
Powerful Computing : A Way Forward ? (2007) (0)
Computer Algebra and the three ‘ E ’ s : Efficiency , Elegance and Expressiveness (2007) (0)
Foreword (2020) (0)
Another Look at Formal Mathematical Properties (2014) (0)
Small Roots of Modular Equations (2009) (0)
Symbolic computation in software science (2019) (0)
Symbolic Computation: A Formula is Worth 10000 Numbers (1986) (0)
OpenMath and SMT-LIB (2018) (0)
Degree Apprenticeships: Learners and aspirations. (2020) (0)
SC-square: when Satisfiability Checking and Symbolic Computation join forces (2017) (0)

This paper list is powered by the following services:

Other Resources About James H. Davenport

What Schools Are Affiliated With James H. Davenport?

James H. Davenport is affiliated with the following schools:

James H. Davenport's Academic­Influence.com Rankings

Why Is James H. Davenport Influential?

James H. Davenport's Published Works

Published Works

Other Resources About James H. Davenport

What Schools Are Affiliated With James H. Davenport?

Image Attributions

James H. Davenport's AcademicInfluence.com Rankings