4 citations · 5 across the 3 of their papers we have counts for
5 papers
Comparing the Machine Readability of Traffic Sign Pictograms in Austria and Germany
Alexander Maletzky, Stefan Thumfart, Christoph Wruß
We compare the machine readability of pictograms found on Austrian and German traffic signs. To that end, we train classification models on synthetic data sets and evaluate their c…
A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms
Alexander Maletzky
We present a generic and executable formalization of signature-based algorithms (such as Faugère's ) for computing Gröbner bases, as well as their mathematical background, in…
Gröbner Bases of Modules and Faugère's Algorithm in Isabelle/HOL
Alexander Maletzky, Fabian Immler
We present an elegant, generic and extensive formalization of Gröbner bases in Isabelle/HOL. The formalization covers all of the essentials of the theory (polynomial reduction, S-p…
Verifying Buchberger's Algorithm in Reduction Rings
Alexander Maletzky
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gröbner bases i…
Two-Point Boundary Problems with One Mild Singularity and an Application to Graded Kirchhoff Plates
M. Rosenkranz, J. Liu, A. Maletzky +1
We develop a new theory for treating boundary problems for linear ordinary differential equations whose fundamental system may have a singularity at one of the two endpoints of the…