Christian   Eder
Computer Algebra
Symbolic Computation
Polynomial System Solving

Peer-reviewed Papers

Christian Eder, Viktor Levandovskyy, Julien Schanz, Simon Schmidt, Andreas Steenpass, Moritz Weber
Existence of Quantum Symmetries for Graphs on up to Seven Vertices: a Computer Based Approach,
ISSAC 2022: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, 311-318, 2022. [doi]

Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
msolve: A Library for Solving Polynomial Systems,
ISSAC 2021: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 51-58, 2021. [doi]

Wolfram Decker, Christian Eder, Viktor Levandovskyy, Sharwan K. Tiwari
Modular Techniques For Noncommutative Gröbner Bases,
Mathematics in Computer Science, 14, 19-33, 2020. [doi]

Christian Eder, Tommy Hofmann
Efficient Gröbner Bases Computation over Principal Ideal Ring,
Journal of Symbolic Computation, 103, 1-13, 2019. [doi]

Christian Eder, Gerhard Pfister, Adrian Popescu
Standard Bases over Euclidean Domains,
Journal of Symbolic Computation, 102, 21-36, 2019. [doi]

Christian Eder, Gerhard Pfister, Adrian Popescu
On Signature-based Gröbner Bases over Euclidean Rings,
ISSAC 2017: Proceedings of the 2017 International Symposium on Symbolic and Algebraic Computation, 141-148, 2017. [doi]

Christian Eder, Jean-Charles Faugère
A survey on signature-based Gröbner basis computations,
Journal of Symbolic Computation 80: 719-784, 2017. [doi]

Brice Boyer, Christian Eder, Jean-Charles Faugère, Sylvian Lachartre, Fayssal Martani
GBLA - Gröbner Basis Linear Algebra Package,
ISSAC 2016: Proceedings of the 2016 International Symposium on Symbolic and Algebraic Computation, 135-142, 2016. [doi]

Christian Eder
Predicting zero reductions in Gröbner basis computations,
SNC '14: Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, 109-110, 2014. [doi]

Christian Eder
An analysis of inhomogeneous signature-based Groebner basis computations,
Journal of Symbolic Computation, 59, 21-35, 2013 [doi]

Christian Eder
Improving incremental signature-based Groebner bases algorithms,
ACM SIGSAM Communications in Computer Algebra, 47(1), 1-13, 2013. [doi]

Christian Eder, Bjarke Hammersholt Roune
Signature Rewriting in Groebner Basis Computation,
ISSAC 2013: Proceedings of the 2013 International Symposium on Symbolic and Algebraic Computation, 331-338, 2013. [doi]

Christian Eder, Justin Gash, John Perry
Modifying Faugère's F5 algorithm to ensure termination,
ACM SIGSAM Communications in Computer Algebra, 45(2), 70-89, 2011. [doi]

Christian Eder, John Perry
Signature-based algorithms to compute Groebner bases,
ISSAC 2011: Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, 99-106, 2011. [doi]

Christian Eder, John Perry
F5C: A variant of Faugère's F5 algorithm with reduced Groebner bases,
Journal of Symbolic Computation (MEGA2009 special issue), 45(12), 1442-1458, 2010. [doi]


Preprints

Jérémy Berthomieu, Christian Eder, Mohab Safey El Din
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon),
2022. [arXiv]

Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din
A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System,
2022. [arXiv]

Christian Eder
Breaking the Hidden Irreducible Polynomials Scheme,
2019. [eprint]

Thesis

Christian Eder
Signature-based algorithms to compute standard bases,
Technische Universität Kaiserslautern, 2012. [kluedo]