Marc Moreno Maza

Orcid: 0000-0003-3011-0756

Affiliations:
  • University of Western Ontario, Canada


According to our database1, Marc Moreno Maza authored at least 138 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient detection of redundancies in systems of linear inequalities✱.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

Counting the Integer Points of Parametric Polytopes: A Maple Implementation.
Proceedings of the Computer Algebra in Scientific Computing - 26th International Workshop, 2024

2023
Laurent Series and Puiseux Series in Maple.
Maple Trans., 2023

Parallelization of triangular decompositions: Techniques and implementation.
J. Symb. Comput., 2023

Dynamically Finding Optimal Kernel Launch Parameters for CUDA Programs.
Proceedings of the 33rd Annual International Conference on Computer Science and Software Engineering, 2023

A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022
A Maple implementation of a modular algorithm for computing the common zeros of a polynomial and a regular chain.
Maple Trans., 2022

Computing Intersection Multiplicities with Regular Chains.
Maple Trans., 2022

Substituting Units into Multivariate Power Series.
Maple Trans., 2022

Algorithms for multivariate laurent series.
ACM Commun. Comput. Algebra, 2022

Balanced Dense Multivariate Multiplication: The General Case.
Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

Towards Automatic OpenMP-Aware Utilization of Fast GPU Memory.
Proceedings of the OpenMP in a Modern World: From Multi-device Support to Meta Programming, 2022

A Pipeline Pattern Detection Technique in Polly.
Proceedings of the Workshop Proceedings of the 51st International Conference on Parallel Processing, 2022

Computing the Integer Hull of Convex Polyhedral Sets.
Proceedings of the Computer Algebra in Scientific Computing - 24th International Workshop, 2022

Subresultant Chains Using Bézout Matrices.
Proceedings of the Computer Algebra in Scientific Computing - 24th International Workshop, 2022

2021
A Short Contribution to the Theory of Regular Chains.
Math. Comput. Sci., 2021

Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

On the Pseudo-Periodicity of the Integer Hull of Parametric Convex Polygons.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

Towards Extending Fulton's Algorithm for Computing Intersection Multiplicities Beyond the Bivariate Case.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

On the Complexity and Parallel Implementation of Hensel's Lemma and Weierstrass Preparation.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

Computational Schemes for Subresultant Chains.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020
Symbolic-numeric integration of rational functions.
Numer. Algorithms, 2020

On the Extended Hensel Construction and its application to the computation of real limit points.
J. Symb. Comput., 2020

Multivariate Power Series in Maple.
Proceedings of the Maple in Mathematics Education and Research - 4th Maple Conference, 2020

On the parallelization of triangular decompositions.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Employing C++ Templates in the Design of a Computer Algebra Library.
Proceedings of the Mathematical Software - ICMS 2020, 2020

Complexity Estimates for Fourier-Motzkin Elimination.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

Power Series Arithmetic with the BPAS Library.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019
An equivalence theorem for regular differential chains.
J. Symb. Comput., 2019

KLARAPTOR: A Tool for Dynamically Finding Optimal Kernel Launch Parameters Targeting CUDA Programs.
CoRR, 2019

A Technique for Finding Optimal Program Launch Parameters Targeting Manycore Accelerators.
CoRR, 2019

On the Parallelization of Triangular Decomposition of Polynomial Systems.
CoRR, 2019

Detecting Singularities Using the PowerSeries Library.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

The Z_Polyhedra Library in Maple.
Proceedings of the Maple in Mathematics Education and Research - Third Maple Conference, 2019

Comprehensive LU Factors of Polynomial Matrices.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

Big Prime Field FFT on Multi-core Processors.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Divergence Prior and Vessel-Tree Reconstruction.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Putting Fürer Algorithm into Practice with the BPAS Library.
CoRR, 2018

Comprehensive Optimization of Parametric Kernels for Graphics Processing Units.
CoRR, 2018

Computing the integer points of a polyhedron.
ACM Commun. Comput. Algebra, 2018

Sparse Polynomial Arithmetic with the BPAS Library.
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017
The polyhedra library in maple.
ACM Commun. Comput. Algebra, 2017

CUMODP: a CUDA library for modular polynomial computation.
ACM Commun. Comput. Algebra, 2017

Jordan Canonical Form with Parameters from Frobenius Form with Parameters.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Multithreaded programming on the GPU: pointers and hints for the computer algebraist.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

Big Prime Field FFT on the GPU.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

On the Extended Hensel Construction and its Application to the Computation of Limit Points.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Computing the Integer Points of a Polyhedron, II: Complexity Estimates.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

Computing the Integer Points of a Polyhedron, I: Algorithm.
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

2016
Quantifier elimination by cylindrical algebraic decomposition based on regular chains.
J. Symb. Comput., 2016

The basic polynomial algebra subprograms.
ACM Commun. Comput. Algebra, 2016

Real limit points of quasi-componenets of regular chains.
ACM Commun. Comput. Algebra, 2016

Computing limits with the regularchains and powerseries libraries: from rational functions to Zariski closure.
ACM Commun. Comput. Algebra, 2016

Parallel Integer Polynomial Multiplication.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

Computing Limits of Real Multivariate Rational Functions.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Doing algebraic geometry with the RegularChains library.
ACM Commun. Comput. Algebra, 2015

A Many-Core Machine Model for Designing Algorithms with Minimum Parallelism Overheads.
Proceedings of the Parallel Computing: On the Road to Exascale, 2015

MetaFork: a compilation framework for concurrency models targeting hardware accelerators and its application to the generation of parametric CUDA kernels.
Proceedings of 25th Annual International Conference on Computer Science and Software Engineering, 2015

Simplification of Cylindrical Algebraic Formulas.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

Regular Chains under Linear Changes of Coordinates and Applications.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
Zigzag Form over Families of Parametric Matrices.
ACM Commun. Comput. Algebra, 2014

Basic Polynomial Algebra Subprograms.
ACM Commun. Comput. Algebra, 2014

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

MetaFork: A Framework for Concurrency Platforms Targeting Multicores.
Proceedings of the Using and Improving OpenMP for Devices, Tasks, and More, 2014

Dense Arithmetic over Finite Fields with the CUMODP Library.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Solving Parametric Polynomial Systems by RealComprehensiveTriangularize.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Cylindrical Algebraic Decomposition in the RegularChains Library.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Real Quantifier Elimination in the RegularChains Library.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Doing Algebraic Geometry with the RegularChains Library.
Proceedings of the Mathematical Software - ICMS 2014, 2014

On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.
Proceedings of the Computer Algebra in Scientific Computing - 16th 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

An Application of Regular Chain Theory to the Study of Limit cycles.
Int. J. Bifurc. Chaos, 2013

An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain
CoRR, 2013

Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One.
Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012
On Solving Parametric Polynomial Systems.
Math. Comput. Sci., 2012

Algorithms for computing triangular decomposition of polynomial systems.
J. Symb. Comput., 2012

Generating Program Invariants via Interpolation
CoRR, 2012

Inversion Modulo Zero-Dimensional Regular Chains.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

On Fulton's Algorithm for Computing Intersection Multiplicities.
Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

Degree and Dimension Estimates for Invariant Ideals of \(P\) -Solvable Recurrences.
Proceedings of the Computer Mathematics, 2012

An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions.
Proceedings of the Computer Mathematics, 2012

2011
When does <T> equal sat(T)?
J. Symb. Comput., 2011

Balanced Dense Polynomial Multiplication on Multi-Cores.
Int. J. Found. Comput. Sci., 2011

Inverting matrices modulo regular chains.
ACM Commun. Comput. Algebra, 2011

Solving bivariate polynomial systems on a GPU.
ACM Commun. Comput. Algebra, 2011

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

Algorithms for computing triangular decompositions of polynomial systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

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

Semi-algebraic Description of the Equilibria of Dynamical Systems.
Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2010
Computing differential characteristic sets by change of ordering.
J. Symb. Comput., 2010

Abstract only: SPIRAL-generated modular FFTs.
ACM Commun. Comput. Algebra, 2010

Cache friendly sparse matrix-vector multiplication.
ACM Commun. Comput. Algebra, 2010

Almost linear time operations with triangular sets.
ACM Commun. Comput. Algebra, 2010

Complexity and performance results for non FFT-based univariate polynomial multiplication.
ACM Commun. Comput. Algebra, 2010

Cache complexity and multicore implementation for univariate real root isolation.
ACM Commun. Comput. Algebra, 2010

Efficient Evaluation of Large Polynomials.
Proceedings of the Mathematical Software, 2010

Spiral-generated modular FFT algorithms.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Parallel computation of the minimal elements of a poset.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009
Fast arithmetic for triangular sets: From theory to practice.
J. Symb. Comput., 2009

Computations modulo regular chains.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Computing cylindrical algebraic decomposition via triangular decomposition.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

FFT-Based Dense Polynomial Arithmetic on Multi-cores.
Proceedings of the High Performance Computing Systems and Applications, 2009

Real Root Isolation of Regular Chains.
Proceedings of the Computer Mathematics, 2009

2008
Change of order for regular chains in positive dimension.
Theor. Comput. Sci., 2008

A bound for the Rosenfeld-Gröbner algorithm.
J. Symb. Comput., 2008

On the verification of polynomial system solvers.
Frontiers Comput. Sci. China, 2008

Automatic variable order selection for polynomial system solving (abstract only).
ACM Commun. Comput. Algebra, 2008

The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple.
ACM Commun. Comput. Algebra, 2008

On the representation of constructible sets.
ACM Commun. Comput. Algebra, 2008

The modpn library: bringing fast polynomial arithmetic into MAPLE.
ACM Commun. Comput. Algebra, 2008

The complete root classification of a parametric polynomial on an interval.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

When does (<i>T</i>) equal sat(<i>T</i>)?
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

2007
On approximate triangular decompositions in dimension zero.
J. Symb. Comput., 2007

Component-level parallelization of triangular decompositions.
Proceedings of the Parallel Symbolic Computation, 2007

Multiprocessed parallelism support in ALDOR on SMPs and multicores.
Proceedings of the Parallel Symbolic Computation, 2007

Multithreaded parallel implementation of arithmetic operations modulo a triangular set.
Proceedings of the Parallel Symbolic Computation, 2007

On the Virtues of Generic Programming for Symbolic Computation.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Comprehensive Triangular Decomposition.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006
An implementation report for parallel triangular decompositions.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Triangular decompositions of polynomial systems: from theory to practice.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Implementation techniques for fast polynomial arithmetic in a high-level programming environment.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment.
Proceedings of the Mathematical Software, 2006

Bounds and algebraic algorithms in differential algebra: the ordinary case.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
The RegularChains library in MAPLE.
SIGSAM Bull., 2005

On the complexity of the D5 principle.
SIGSAM Bull., 2005

Lifting techniques for triangular decompositions.
Proceedings of the Symbolic and Algebraic Computation, 2005

2002
On Computer-assisted Classification of Coupled Integrable Equations.
J. Symb. Comput., 2002

Computation of canonical forms for ternary cubics.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
PARDI!.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

1999
Triangular Sets for Solving Polynomial Systems: a Comparative Implementation of Four Methods.
J. Symb. Comput., 1999

On the Theories of Triangular Sets.
J. Symb. Comput., 1999

1995
Polynomial Gcd Computations over Towers of Algebraic Extensions.
Proceedings of the Applied Algebra, 1995


  Loading...