James H. Davenport

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Engineering Education Conference, 2021

Supporting Early-Career Academics in the UK Computer Science Community.

[BibT_eX]

[DOI]

Proceedings of the CEP '21: Computing Education Practice 2021, 2021

Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Automated Reasoning: Challenges, 2021

2020

Foreword.

[BibT_eX]

[DOI]

George Labahn

Josef Urban

Math. Comput. Sci., 2020

Cylindrical algebraic decomposition with equational constraints.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Symbolic computation and satisfiability checking.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Identifying the parametric occurrence of multiple steady states for some biological networks.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Data Without Software Are Just Numbers.

[BibT_eX]

[DOI]

James Grant

Catherine Mary Jones

Data Sci. J., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

New Opportunities for the Formal Proof of Computational Real Geometry?

[BibT_eX]

[DOI]

CoRR, 2020

The CAD Conundrum: Lex-Least vs Order.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Benjamin Pring

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.

[BibT_eX]

[DOI]

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?

[BibT_eX]

[DOI]

Akshar Nair

Gregory Sankaran

Proceedings of the Mathematical Software - ICMS 2020, 2020

Overcoming the Challenges of Teaching Cybersecurity in UK Computer Science Degree Programmes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rachid Hourizi

Proceedings of the 2020 IEEE Global Engineering Education Conference, 2020

Computer Science Degree Accreditation in the UK: A Post-Shadbolt Review Update.

[BibT_eX]

[DOI]

Proceedings of the CEP 2020: Computing Education Practice 2020, 2020

New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2019

Foreword.

[BibT_eX]

[DOI]

Laura Kovács

Daniela Zaharie

Math. Comput. Sci., 2019

Symbolic computation in software science.

[BibT_eX]

[DOI]

Temur Kutsia

J. Symb. Comput., 2019

Formal Methods and CyberSecurity.

[BibT_eX]

[DOI]

CoRR, 2019

Lazard's CAD exploiting equality constraints.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2019

The Institute of Coding: A University-Industry Collaboration to Address the UK Digital Skills Crisis.

[BibT_eX]

[DOI]

Rachid Hourizi

Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

On Benefits of Equality Constraints in Lex-Least Invariant CAD.

[BibT_eX]

[DOI]

Akshar Nair

Gregory Sankaran

Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2019

Cybersecurity Education and Formal Methods.

[BibT_eX]

[DOI]

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 -.

[BibT_eX]

[DOI]

Bernd-Holger Schlingloff

Nikolay V. Shilov

Rustam Zhumagambetov

Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

A UK Case Study on Cybersecurity Education and Accreditation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Frontiers in Education Conference, 2019

The Institute of Coding: Addressing the UK Digital Skills Crisis.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Computing Education Practice, 2019

Teaching of Computing to Mathematics Students: Programming and Discrete Mathematics.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Computing Education Practice, 2019

2018

Machine-Assisted Proofs (ICM 2018 Panel).

[BibT_eX]

[DOI]

CoRR, 2018

TheoryGuru: A Mathematica Package to apply Quantifier Elimination.

[BibT_eX]

[DOI]

Casey B. Mulligan

CoRR, 2018

Using Machine Learning to Improve Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

CoRR, 2018

Quantifier Elimination for Reasoning in Economics.

[BibT_eX]

[DOI]

CoRR, 2018

Regular cylindrical algebraic decomposition.

[BibT_eX]

[DOI]

Acyr F. Locatelli

Gregory K. Sankaran

CoRR, 2018

OpenMath and SMT-LIB.

[BibT_eX]

[DOI]

CoRR, 2018

The Rôle of Benchmarking in Symbolic Computation (Position Paper).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Casey B. Mulligan

Proceedings of the Mathematical Software - ICMS 2018, 2018

Methodologies of Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

2017

An Analysis of Introductory Programming Courses at UK Universities.

[BibT_eX]

[DOI]

Ellen Murphy

Art Sci. Eng. Program., 2017

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

[BibT_eX]

[DOI]

Math. Comput. Sci., 2017

Fast Matrix Operations in Computer Algebra.

[BibT_eX]

[DOI]

Zak Tonks

Gregory Sankaran

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.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Benchmarking Solvers, SAT-style.

[BibT_eX]

[DOI]

Martin Brain

Alberto Griggio

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.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

SC-square: when Satisfiability Checking and Symbolic Computation join forces.

[BibT_eX]

[DOI]

Proceedings of the ARCADE 2017, 2017

2016

Truth table invariant cylindrical algebraic decomposition.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

An Analysis of Introductory University Programming Courses in the UK.

[BibT_eX]

[DOI]

Ellen Murphy

CoRR, 2016

Satisfiability Checking meets Symbolic Computation (Project Paper).

[BibT_eX]

[DOI]

CoRR, 2016

Satisfiability checking and symbolic computation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2016

A Generalised Successive Resultants Algorithm.

[BibT_eX]

[DOI]

Christophe Petit

Benjamin Pring

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.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

Innovative Pedagogical Practices in the Craft of Computing.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Learning and Teaching in Computing and Engineering, 2016

Need Polynomial Systems Be Doubly-Exponential?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2016, 2016

Complexity of Integration, Special Values, and Recent Developments.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2016, 2016

The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015

Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Cylindrical Algebraic Sub-Decompositions.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

A Comparison of Three Heuristics to Choose the Variable Ordering for Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2014

Branch cuts in maple 17.

[BibT_eX]

[DOI]

Edgardo S. Cheb-Terrab

David J. Wilson

ACM Commun. Comput. Algebra, 2014

Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

Another Look at Formal Mathematical Properties.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the MathUI, 2014

Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Travelling through Facebook; Exploring affordances through the Lens of Age.

[BibT_eX]

[DOI]

Proceedings of the 22st European Conference on Information Systems, 2014

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

Attribute-Based Signatures with User-Controlled Linkability.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

Recent Advances in Real Geometric Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

2013

Computing with semi-algebraic sets: Relaxation techniques and effective boundaries.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Triangular decomposition of semi-algebraic systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

A "Piano Movers" Problem Reformulated.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Understanding Branch Cuts of Expressions.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 2013

Optimising Problem Formulation for Cylindrical Algebraic Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 2013

Cylindrical algebraic decompositions for boolean combinations.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

A repository for CAD examples.

[BibT_eX]

[DOI]

David J. Wilson

ACM Commun. Comput. Algebra, 2012

Small algorithms for small systems.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2012

Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases.

[BibT_eX]

[DOI]

David J. Wilson

Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2012

2011

Cryptographic Hash Functions: Recent Design Trends and Security Notions.

[BibT_eX]

[DOI]

Saif Al-Kuwari

IACR Cryptol. ePrint Arch., 2011

Computing the real solutions of polynomial systems with the RegularChains library in Maple.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2011

On Kahan's Rules for Determining Branch Cuts.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Computing with semi-algebraic sets represented by triangular decomposition.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

The Power of Vocabulary: The Case of Cyclotomic Polynomials

[BibT_eX]

[DOI]

Jacques Carette

CoRR, 2010

Geometry of branch cuts.

[BibT_eX]

[DOI]

Nalina Phisanbut

ACM Commun. Comput. Algebra, 2010

The Challenges of Multivalued "Functions".

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009

The Sparsity Challenges.

[BibT_eX]

[DOI]

Jacques Carette

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

Unifying Math Ontologies: A Tale of Two Standards.

[BibT_eX]

[DOI]

Michael Kohlhase

Proceedings of the Intelligent Computer Mathematics, 2009

A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy.

[BibT_eX]

[DOI]

Christopher J. Sangwin

Proceedings of the Intelligent Computer Mathematics, 2009

Certificate-Free Attribute Authentication.

[BibT_eX]

[DOI]

Dalia Khader

Liqun Chen

Proceedings of the Cryptography and Coding, 2009

2008

The Freedom to Extend OpenMath and its Utility.

[BibT_eX]

[DOI]

Paul Libbrecht

Math. Comput. Sci., 2008

Unit Knowledge Management.

[BibT_eX]

[DOI]

Jonathan Stratford

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

Effective Set Membership in Computer Algebra and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

AISC Meets Natural Typography.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007

Testing elementary function identities using CAD.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2007

What Might "Understand a Function" Mean?

[BibT_eX]

[DOI]

Proceedings of the Towards Mechanized Mathematical Assistants, 14th Symposium, 2007

The complexity of quantifier elimination and cylindrical algebraic decomposition.

[BibT_eX]

[DOI]

Christopher W. Brown

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2005

Adherence is better than adjacency: computing the Riemann index using CAD.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

[BibT_eX]

[DOI]

Andrew A. Adams

Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

A poly-algorithmic approach to simplifying elementary functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

Mathematics on the (Semantic) NET.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web: Research and Applications, 2004

2003

MKM from Book to Computer: A Case Study.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Knowledge Management, Second International Conference, 2003

Better simplification of elementary functions through power series.

[BibT_eX]

[DOI]

James C. Beaumont

Proceedings of the Symbolic and Algebraic Computation, 2003

Resolving Large Prime(s) Variants for Discrete Logarithm Computation.

[BibT_eX]

[DOI]

Andrew J. Holt

Proceedings of the Cryptography and Coding, 2003

The Geometry of C<sup>n</sup> is Important for the Algebra of Elementary Functions.

[BibT_eX]

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002

Equality in Computer Algebra and Beyond.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

Reasoning about the Elementary Functions of Complex Analysis.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2002

Towards better simplification of elementary functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Lattice Attacks on RSA-Encrypted IP and TCP.

[BibT_eX]

[DOI]

Paul A. Crouch

Proceedings of the Cryptography and Coding, 2001

2000

A small OpenMath type system.

[BibT_eX]

[DOI]

SIGSAM Bull., 2000

On writing OpenMath content dictionaries.

[BibT_eX]

[DOI]

SIGSAM Bull., 2000

"According to Abramowitz and Stegun" or arccoth needn't be uncouth.

[BibT_eX]

[DOI]

SIGSAM Bull., 2000

Abstract Data Types in Computer Algebra.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

An exact real algebraic arithmetic with equality determination.

[BibT_eX]

[DOI]

Namhyun Hur

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

A Generic Root Operation for Exact Real Arithmetic.

[BibT_eX]

[DOI]

Namhyun Hur

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

Reasoning about the Elementary Functions of Complex Analysis.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1999

An Automatic Symbolic-Numeric Taylor Series ODE Solver.

[BibT_eX]

[DOI]

Brian J. Dupée

Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999

1996

An Intelligent Interface to Numerical Routines.

[BibT_eX]

[DOI]

Brian J. Dupée

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1996

1993

Computer algebra - systems and algorithms for algebraic computation (2. ed.).

[BibT_eX]

Yvon Siret

Evelyne Tournier

Academic Press, ISBN: 978-0-12-204232-4, 1993

1992

Voronoi diagrams of set-theoretic solid models.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 1992

Primality Testing Revisited.

[BibT_eX]

[DOI]

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991

Scratchpad's View of Algebra II: A Categorical View of Factorization.

[BibT_eX]

[DOI]

Patrizia M. Gianni

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990

Scratchpad's View of Algebra I: Basic Commutative Algebra.

[BibT_eX]

[DOI]

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Current Problems in Computer Algebra Systems Design.

[BibT_eX]

[DOI]

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

1988

Real Quantifier Elimination is Doubly Exponential.

[BibT_eX]

[DOI]

Joos Heintz

J. Symb. Comput., 1988

Computer Algebra Applied to Itself.

[BibT_eX]

[DOI]

J. Symb. Comput., 1988

Effective Tests for Cyclotonic Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1988

The Use of Symbolic Computation in Geometric Modelling.

[BibT_eX]

Proceedings of the 3rd IMA Conference on the Mathematics of Surfaces, 1988

1987

Factorisation of Polynominals: Old Ideas and Recent Results.

[BibT_eX]

[DOI]

Proceedings of the Trends in Computer Algebra, 1987

Applications of computer algebra in solid modelling.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '87, 1987

Polynomial factorization: An exploration of Lenstra's algorithm.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '87, 1987

1986

The Risch Differential Equation Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Elementary and Liouvillian Solutions of Linear Differential Equations.

[BibT_eX]

[DOI]

Michael F. Singer

J. Symb. Comput., 1986

A "Piano Movers" Problem.

[BibT_eX]

[DOI]

SIGSAM Bull., 1986

PowerMath: a system for the Macintosh.

[BibT_eX]

[DOI]

C. E. Roth

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

The Bath algebraic number package.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

1985

On the Parallel Risch Algorithm (II).

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1985

An Application of Factoring.

[BibT_eX]

[DOI]

Don Coppersmith

J. Symb. Comput., 1985

A remark on factorisation.

[BibT_eX]

[DOI]

SIGSAM Bull., 1985

HEUGCD: How Elementary Upperbounds Generated Cheaper Data.

[BibT_eX]

[DOI]

Julian A. Padget

Proceedings of the EUROCAL '85, 1985

Symbolic and Numeric Manipulation of Integrals.

[BibT_eX]

[DOI]

Proceedings of the Accurate Scientific Computations, 1985

1984

Factoring Medium-Sized Integers.

[BibT_eX]

[DOI]

R. J. Macmillan

Comput. J., 1984

Integration in finite terms.

[BibT_eX]

[DOI]

SIGSAM Bull., 1984

y'+ fy = g.

[BibT_eX]

[DOI]

Proceedings of the EUROSAM 84, 1984

1983

Factorization of sparse polynominals.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra, 1983

Integration - What do we want from the theory?

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra, 1983

1982

P-adic reconstruction of rational numbers.

[BibT_eX]

[DOI]

Paul S. Wang

M. J. T. Guy

SIGSAM Bull., 1982

What do we want from a high-level language?

[BibT_eX]

[DOI]

SIGSAM Bull., 1982

On the parallel Risch algorithm (III): use of tangents.

[BibT_eX]

[DOI]

SIGSAM Bull., 1982

Fast reduce: the trade-off between efficiency and generality.

[BibT_eX]

[DOI]

SIGSAM Bull., 1982

The Parallel Risch Algorithm (I).

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra, 1982

1981

MODLISP.

[BibT_eX]

[DOI]

Richard D. Jenks

SIGSAM Bull., 1981

Factorization over finitely generated fields.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

On the Integration of Algebraic Functions

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 102, Springer, ISBN: 0387102906, 1981

1979

Anatomy of an integral.

[BibT_eX]

[DOI]

SIGSAM Bull., 1979

Integration -- the dust settles? (invited).

[BibT_eX]

[DOI]

A. C. Norman

Proceedings of the Symbolic and Algebraic Computation, 1979

Integration of algebraic functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1979

The computerization of algebraic geometry.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1979

1972

The quadratic hash method when the table size is a power of 2.

[BibT_eX]

[DOI]

F. Robert A. Hopgood