James H. Davenport

Orcid: 0000-0002-3982-7545

Affiliations:
  • University of Bath, UK


According to our database1, James H. Davenport authored at least 199 papers between 1972 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Levelwise construction of a single cylindrical algebraic cell.
J. Symb. Comput., July, 2024

Towards Verified Polynomial Factorisation.
CoRR, 2024

First steps towards Computational Polynomials in Lean.
CoRR, 2024

A Global Survey of Introductory Programming Courses.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Embedding Technical, Personal and Professional Competencies in Computing Degree Programmes.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1, 2024

Exploring Alternative Machine Learning Models for Variable Ordering in Cylindrical Algebraic Decomposition.
Proceedings of the Mathematical Software - ICMS 2024, 2024

2023
SMT-Solving Induction Proofs of Inequalities Benchmarking Repository.
Dataset, March, 2023

Iterated Resultants and Rational Functions in Real Quantifier Elimination.
CoRR, 2023

Iterated Resultants in CAD.
CoRR, 2023

A Practical Overview of Quantum Computing: Is Exascale Possible?
CoRR, 2023

Teaching Programming Competencies: A Role for Craft Computing?
Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

A Poly-algorithmic Approach to Quantifier Elimination.
Proceedings of the 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2023

So the problem has poor complexity: what next?
Proceedings of the 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2023

Proving an Execution of an Algorithm Correct?
Proceedings of the Intelligent Computer Mathematics - 16th International Conference, 2023

Lazard-style CAD and Equational Constraints.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072).
Dagstuhl Reports, 2022

Artificial Conflict Sampling for Real Satisfiability Problems.
Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

SMT-Solving Induction Proofs of Inequalities.
Proceedings of the 7th SC-Square Workshop co-located with the Federated Logic Conference, 2022

A National Mentoring and Buddying Pilot Scheme for UK Early Career CS Academics.
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

Co-Constructing a Community of Practice for Early-Career Computer Science Academics in the UK.
Proceedings of the CEP 2022: Computing Education Practice 2022, 2022

2021
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings.
J. Log. Algebraic Methods Program., 2021

ATLAS: Interactive and Educational Linear Algebra System Containing Non-Standard Methods.
CoRR, 2021

Digital Collections of Examples in Mathematical Sciences.
CoRR, 2021

The DEWCAD project: pushing back the doubly exponential wall of cylindrical algebraic decomposition.
ACM Commun. Comput. Algebra, 2021

On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving.
Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021

Increasing the Value of Professional Body Computer Science Degree Accreditation.
Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Equational Constraints, the Lazard Projection and the Curtain Problem (short paper).
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2021

Practical Evaluation of Quantifier Elimination Methods (short paper).
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2021

Varieties of Doubly-Exponential behaviour in Cylindrical Algebraic Decomposition.
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2021

OpenMath Preface.
Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

Developing a Computer Science Education Community of Practice for Early-Career Academics in the UK.
Proceedings of the ITiCSE '21: Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V.2, Virtual Event, Germany, June 26, 2021

Towards a 21st Century Personalised Learning Skills Taxonomy.
Proceedings of the IEEE Global Engineering Education Conference, 2021

Supporting Early-Career Academics in the UK Computer Science Community.
Proceedings of the CEP '21: Computing Education Practice 2021, 2021

Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic.
Proceedings of the Third International Workshop on Automated Reasoning: Challenges, 2021

2020
Foreword.
Math. Comput. Sci., 2020

Cylindrical algebraic decomposition with equational constraints.
J. Symb. Comput., 2020

Symbolic computation and satisfiability checking.
J. Symb. Comput., 2020

Identifying the parametric occurrence of multiple steady states for some biological networks.
J. Symb. Comput., 2020

Data Without Software Are Just Numbers.
Data Sci. J., 2020

The Influence of Domain-Based Preprocessing on Subject-Specific Clustering.
CoRR, 2020

Unification of HDP and LDA Models for Optimal Topic Clustering of Subject Specific Question Banks.
CoRR, 2020

New Opportunities for the Formal Proof of Computational Real Geometry?
CoRR, 2020

The CAD Conundrum: Lex-Least vs Order.
Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2020

Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES.
Proceedings of the Selected Areas in Cryptography - SAC 2020, 2020

Assessing the Value of Professional Body Accreditation of Computer Science Degree Programmes: A UK Case Study.
Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

Curtains in CAD: Why Are They a Problem and How Do We Fix Them?
Proceedings of the Mathematical Software - ICMS 2020, 2020

Overcoming the Challenges of Teaching Cybersecurity in UK Computer Science Degree Programmes.
Proceedings of the IEEE Frontiers in Education Conference, 2020

The Institute of Coding: A University-Industry Collaboration to Address the UK's Digital Skills Crisis.
Proceedings of the 2020 IEEE Global Engineering Education Conference, 2020

Computer Science Degree Accreditation in the UK: A Post-Shadbolt Review Update.
Proceedings of the CEP 2020: Computing Education Practice 2020, 2020

New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract).
Proceedings of the Joint Proceedings of the 7th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 5th Satisfiability Checking and Symbolic Computation Workshop (SC-Square) Workshop, 2020

2019
Using Machine Learning to Improve Cylindrical Algebraic Decomposition.
Math. Comput. Sci., 2019

Foreword.
Math. Comput. Sci., 2019

Symbolic computation in software science.
J. Symb. Comput., 2019

Formal Methods and CyberSecurity.
CoRR, 2019

Lazard's CAD exploiting equality constraints.
ACM Commun. Comput. Algebra, 2019

The Institute of Coding: A University-Industry Collaboration to Address the UK Digital Skills Crisis.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

On Benefits of Equality Constraints in Lex-Least Invariant CAD.
Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2019

Cybersecurity Education and Formal Methods.
Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -.
Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

A UK Case Study on Cybersecurity Education and Accreditation.
Proceedings of the IEEE Frontiers in Education Conference, 2019

The Institute of Coding: Addressing the UK Digital Skills Crisis.
Proceedings of the 3rd Conference on Computing Education Practice, 2019

Teaching of Computing to Mathematics Students: Programming and Discrete Mathematics.
Proceedings of the 3rd Conference on Computing Education Practice, 2019

2018
Datset of automated economic reasoning problems for QE / SMT.
Dataset, April, 2018

Datset of automated economic reasoning problems for QE / SMT.
Dataset, April, 2018

Machine-Assisted Proofs (ICM 2018 Panel).
CoRR, 2018

TheoryGuru: A Mathematica Package to apply Quantifier Elimination.
CoRR, 2018

Using Machine Learning to Improve Cylindrical Algebraic Decomposition.
CoRR, 2018

Quantifier Elimination for Reasoning in Economics.
CoRR, 2018

Regular cylindrical algebraic decomposition.
CoRR, 2018

OpenMath and SMT-LIB.
CoRR, 2018

The Rôle of Benchmarking in Symbolic Computation (Position Paper).
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Language Choice in Introductory Programming Courses at Australasian and UK Universities.
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics.
Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

TheoryGuru: A Mathematica Package to Apply Quantifier Elimination Technology to Economics.
Proceedings of the Mathematical Software - ICMS 2018, 2018

Methodologies of Symbolic Computation.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

2017
An Analysis of Introductory Programming Courses at UK Universities.
Art Sci. Eng. Program., 2017

What Does "Without Loss of Generality" Mean, and How Do We Detect It.
Math. Comput. Sci., 2017

Fast Matrix Operations in Computer Algebra.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

The Potential and Challenges of CAD with Equational Constraints for SC-Square.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Benchmarking Solvers, SAT-style.
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), 2017

A Case Study on the Parametric Occurrence of Multiple Steady States.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017


2016
Truth table invariant cylindrical algebraic decomposition.
J. Symb. Comput., 2016

An Analysis of Introductory University Programming Courses in the UK.
CoRR, 2016

Satisfiability Checking meets Symbolic Computation (Project Paper).
CoRR, 2016

Satisfiability checking and symbolic computation.
ACM Commun. Comput. Algebra, 2016

A Generalised Successive Resultants Algorithm.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition.
Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), 2016

SC<sup>2</sup>: Satisfiability Checking Meets Symbolic Computation - (Project Paper).
Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

Innovative Pedagogical Practices in the Craft of Computing.
Proceedings of the International Conference on Learning and Teaching in Computing and Engineering, 2016

Need Polynomial Systems Be Doubly-Exponential?
Proceedings of the Mathematical Software - ICMS 2016, 2016

Complexity of Integration, Special Values, and Recent Developments.
Proceedings of the Mathematical Software - ICMS 2016, 2016

The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree.
Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015
Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Cylindrical Algebraic Sub-Decompositions.
Math. Comput. Sci., 2014

A comparison of three heuristics to choose the variable ordering for CAD.
CoRR, 2014

A Comparison of Three Heuristics to Choose the Variable Ordering for Cylindrical Algebraic Decomposition.
ACM Commun. Comput. Algebra, 2014

Branch cuts in maple 17.
ACM Commun. Comput. Algebra, 2014

Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition.
Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

Another Look at Formal Mathematical Properties.
Proceedings of the Joint Proceedings of the MathUI, 2014

Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Travelling through Facebook; Exploring affordances through the Lens of Age.
Proceedings of the 22st European Conference on Information Systems, 2014

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

Attribute-Based Signatures with User-Controlled Linkability.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

Recent Advances in Real Geometric Reasoning.
Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

2013
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries.
J. Symb. Comput., 2013

Triangular decomposition of semi-algebraic systems.
J. Symb. Comput., 2013

A "Piano Movers" Problem Reformulated.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Understanding Branch Cuts of Expressions.
Proceedings of the Intelligent Computer Mathematics, 2013

Optimising Problem Formulation for Cylindrical Algebraic Decomposition.
Proceedings of the Intelligent Computer Mathematics, 2013

Cylindrical algebraic decompositions for boolean combinations.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
A repository for CAD examples.
ACM Commun. Comput. Algebra, 2012

Small algorithms for small systems.
ACM Commun. Comput. Algebra, 2012

Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases.
Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2012

2011
Cryptographic Hash Functions: Recent Design Trends and Security Notions.
IACR Cryptol. ePrint Arch., 2011

Computing the real solutions of polynomial systems with the RegularChains library in Maple.
ACM Commun. Comput. Algebra, 2011

On Kahan's Rules for Determining Branch Cuts.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Computing with semi-algebraic sets represented by triangular decomposition.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
The Power of Vocabulary: The Case of Cyclotomic Polynomials
CoRR, 2010

Geometry of branch cuts.
ACM Commun. Comput. Algebra, 2010

The Challenges of Multivalued "Functions".
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
The Sparsity Challenges.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

Unifying Math Ontologies: A Tale of Two Standards.
Proceedings of the Intelligent Computer Mathematics, 2009

A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy.
Proceedings of the Intelligent Computer Mathematics, 2009

Certificate-Free Attribute Authentication.
Proceedings of the Cryptography and Coding, 2009

2008
The Freedom to Extend OpenMath and its Utility.
Math. Comput. Sci., 2008

Unit Knowledge Management.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

Effective Set Membership in Computer Algebra and Beyond.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

AISC Meets Natural Typography.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Testing elementary function identities using CAD.
Appl. Algebra Eng. Commun. Comput., 2007

What Might "Understand a Function" Mean?
Proceedings of the Towards Mechanized Mathematical Assistants, 14th Symposium, 2007

The complexity of quantifier elimination and cylindrical algebraic decomposition.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2005
Adherence is better than adjacency: computing the Riemann index using CAD.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Copyright Issues for MKM.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

A poly-algorithmic approach to simplifying elementary functions.
Proceedings of the Symbolic and Algebraic Computation, 2004

Mathematics on the (Semantic) NET.
Proceedings of the Semantic Web: Research and Applications, 2004

2003
MKM from Book to Computer: A Case Study.
Proceedings of the Mathematical Knowledge Management, Second International Conference, 2003

Better simplification of elementary functions through power series.
Proceedings of the Symbolic and Algebraic Computation, 2003

Resolving Large Prime(s) Variants for Discrete Logarithm Computation.
Proceedings of the Cryptography and Coding, 2003

The Geometry of C<sup>n</sup> is Important for the Algebra of Elementary Functions.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002
Equality in Computer Algebra and Beyond.
J. Symb. Comput., 2002

Reasoning about the Elementary Functions of Complex Analysis.
Ann. Math. Artif. Intell., 2002

Towards better simplification of elementary functions.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Lattice Attacks on RSA-Encrypted IP and TCP.
Proceedings of the Cryptography and Coding, 2001

2000
A small OpenMath type system.
SIGSAM Bull., 2000

On writing OpenMath content dictionaries.
SIGSAM Bull., 2000

"According to Abramowitz and Stegun" or arccoth needn't be uncouth.
SIGSAM Bull., 2000

Abstract Data Types in Computer Algebra.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

An exact real algebraic arithmetic with equality determination.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

A Generic Root Operation for Exact Real Arithmetic.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

Reasoning about the Elementary Functions of Complex Analysis.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1999
An Automatic Symbolic-Numeric Taylor Series ODE Solver.
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999

1996
An Intelligent Interface to Numerical Routines.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1996

1993
Computer algebra - systems and algorithms for algebraic computation (2. ed.).
Academic Press, ISBN: 978-0-12-204232-4, 1993

1992
Voronoi diagrams of set-theoretic solid models.
IEEE Computer Graphics and Applications, 1992

Primality Testing Revisited.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
Scratchpad's View of Algebra II: A Categorical View of Factorization.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Scratchpad's View of Algebra I: Basic Commutative Algebra.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Current Problems in Computer Algebra Systems Design.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

1988
Real Quantifier Elimination is Doubly Exponential.
J. Symb. Comput., 1988

Computer Algebra Applied to Itself.
J. Symb. Comput., 1988

Effective Tests for Cyclotonic Polynomials.
Proceedings of the Symbolic and Algebraic Computation, 1988

The Use of Symbolic Computation in Geometric Modelling.
Proceedings of the 3rd IMA Conference on the Mathematics of Surfaces, 1988

1987
Factorisation of Polynominals: Old Ideas and Recent Results.
Proceedings of the Trends in Computer Algebra, 1987

Applications of computer algebra in solid modelling.
Proceedings of the EUROCAL '87, 1987

Polynomial factorization: An exploration of Lenstra's algorithm.
Proceedings of the EUROCAL '87, 1987

1986
The Risch Differential Equation Problem.
SIAM J. Comput., 1986

Elementary and Liouvillian Solutions of Linear Differential Equations.
J. Symb. Comput., 1986

A "Piano Movers" Problem.
SIGSAM Bull., 1986

PowerMath: a system for the Macintosh.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

The Bath algebraic number package.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

1985
On the Parallel Risch Algorithm (II).
ACM Trans. Math. Softw., 1985

An Application of Factoring.
J. Symb. Comput., 1985

A remark on factorisation.
SIGSAM Bull., 1985

HEUGCD: How Elementary Upperbounds Generated Cheaper Data.
Proceedings of the EUROCAL '85, 1985

Symbolic and Numeric Manipulation of Integrals.
Proceedings of the Accurate Scientific Computations, 1985

1984
Factoring Medium-Sized Integers.
Comput. J., 1984

Integration in finite terms.
SIGSAM Bull., 1984

y'+ fy = g.
Proceedings of the EUROSAM 84, 1984

1983
Factorization of sparse polynominals.
Proceedings of the Computer Algebra, 1983

Integration - What do we want from the theory?
Proceedings of the Computer Algebra, 1983

1982
P-adic reconstruction of rational numbers.
SIGSAM Bull., 1982

What do we want from a high-level language?
SIGSAM Bull., 1982

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

Fast reduce: the trade-off between efficiency and generality.
SIGSAM Bull., 1982

The Parallel Risch Algorithm (I).
Proceedings of the Computer Algebra, 1982

1981
MODLISP.
SIGSAM Bull., 1981

Factorization over finitely generated fields.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

On the Integration of Algebraic Functions
Lecture Notes in Computer Science 102, Springer, ISBN: 0387102906, 1981

1979
Anatomy of an integral.
SIGSAM Bull., 1979

Integration -- the dust settles? (invited).
Proceedings of the Symbolic and Algebraic Computation, 1979

Integration of algebraic functions.
Proceedings of the Symbolic and Algebraic Computation, 1979

The computerization of algebraic geometry.
Proceedings of the Symbolic and Algebraic Computation, 1979

1972
The quadratic hash method when the table size is a power of 2.
Comput. J., 1972


  Loading...