|
![](/people/pictures/amaletzk-screen.jpg?id=861182438")
| |
Alexander Maletzky, DI Dr.
Former member of RISC
Publications
|
Alexander Maletzky. A generic and executable formalization of signature-based Gröbner basis algorithms. J. Symb. Comput. 106, pp. 23-47. 2021. Elsevier, ISSN 0747-7171. arXiv:2012.02239 [cs.SC], https://doi.org/10.1016/j.jsc.2020.12.001. [url] [bib]
|
|
A. Maletzky. Formalization of Dubé's Degree Bounds for Gröbner Bases in Isabelle/HOL. In: Intelligent Computer Mathematics (Proceedings of CICM 2019, Prague, Czech Republic, July 8-12), Cezary Kaliszyk and Edwin Brady and Andrea Kohlhase and Claudio Sacerdoti-Coen (ed.), Proceedings of CICM 2019, Lecture Notes in Computer Science , pp. ?-?. 2019. Springer, to appear. [pdf] [bib]
|
|
A. Maletzky. Gröbner Bases and Macaulay Matrices in Isabelle/HOL. RISC, JKU Linz. Technical report, 2019. Submitted to Formal Aspects of Computing. [pdf] [bib]
|
|
A. Maletzky. Theorema-HOL: Classical Higher-Order Logic in Theorema. Technical report no. 19-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. June 2019. [pdf] [bib]
|
|
A. Maletzky, F. Immler. Gröbner Bases of Modules and Faugère's F4 Algorithm in Isabelle/HOL. In: Intelligent Computer Mathematics (Proceedings of CICM 2018, Hagenberg, Austria, August 13-17), Florian Rabe and William Farmer and Grant Passmore and Abdou Youssef (ed.), Proceedings of CICM 2018, Lecture Notes in Computer Science 11006, pp. 178-193. 2018. Springer, ISBN 978-3-319-96811-7. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-96812-4_16. [url] [bib]
|
|
A. Maletzky, F. Immler. Gröbner Bases of Modules and Faugère's F4 Algorithm in Isabelle/HOL (extended version). RISC, JKU Linz. Technical report, May 2018. arXiv:1805.00304 [cs.LO]. [url] [bib]
|
|
A. Maletzky. Gröbner Bases and Macaulay Matrices in Isabelle/HOL. RISC. Technical report, December 2018. [pdf] [bib]
|
|
A. Maletzky. A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms. RISC. Technical report, September 2018. Submitted. [pdf] [bib]
|
|
A. Maletzky. A New Reasoning Framework for Theorema 2.0. RISC, Johannes Kepler University Linz. Technical report, May 2017. Accepted as work-in-progress paper at CICM 2017 (10th Conference on Intelligent Computer Mathematics, Edinburgh, UK, July 17-21). [pdf] [bib]
|
|
A. Maletzky, W. Windsteiger. The Formalization of Vickrey Auctions: A Comparison of Two Approaches in Isabelle and Theorema. In: Intelligent Computer Mathematics: 10th International Conference, CICM 2017, Edinburgh, UK, July 17-21, H. Geuvers, M. England, O. Hasan, F. Rabe, O. Teschke (ed.), Lecture Notes in Computer Science 10383, pp. 25-39. 2017. Springer, ISBN 978-3-319-62075-6. doi 10.1007/978-3-319-62075-6_3. [url] [pdf] [bib]
|
|
Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger. Theorema 2.0: Computer-Assisted Natural-Style Mathematics. JFR 9(1), pp. 149-185. 2016. ISSN 1972-5787. [url] [bib]
|
|
A. Maletzky. Mathematical Theory Exploration in Theorema: Reduction Rings. In: Intelligent Computer Mathematics (Proceedings of CICM 2016, Bialystok, Poland, July 25-29), Michael Kohlhase, Moa Johansson, Bruce Miller, Leonardo de Moura, Frank Tompa (ed.), Proceedings of CICM 2016, Lecture Notes in Artificial Intelligence 9791, pp. 3-17. July 2016. Springer-Verlag, ISBN 978-3-319-42546-7. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-42547-4_1. Preprint on arXiv: 1602.04339 [cs.SC]. [url] [bib]
|
|
A. Maletzky. Interactive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0. In: Mathematical Software - ICMS 2016, Gert-Martin Greuel and Peter Paule and Andrew Sommese (ed.), Proceedings of 5th International Congress on Mathematical Software, Berlin, Germany, July 11-14, Lecture Notes in Computer Science 9725, pp. 59-66. 2016. Springer-Verlag, ISBN 978-3-319-42432-3. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-42432-3_8. [url] [pdf] [bib]
|
|
A. Maletzky. Computer-Assisted Exploration of Gröbner Bases Theory in Theorema. Technical report no. 16-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. May 2016. PhD thesis. [pdf] [bib]
|
|
A. Maletzky. Computer-Assisted Exploration of Gröbner Bases Theory in Theorema. RISC, Johannes Kepler University Linz. PhD Thesis. May 2016. [bib]
|
|
A. Maletzky. Automated Reasoning in Reduction Rings using the Theorema System. In: Computer Algebra in Scientific Computing, Vladimir P. Gerdt and Wolfram Koepf and Werner M. Seiler and Evgenii V. Vorozhtsov (ed.), Proceedings of CASC 2015 (September 14-18, Aachen, Germany), LNCS 9301, pp. 305-319. 2015. Springer-Verlag Berlin Heidelberg, ISSN 0302-9743. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-24021-3_23. [url] [pdf] [bib]
|
|
A. Maletzky. Exploring Reduction Ring Theory in Theorema. Technical report no. 15-11 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. July 2015. [pdf] [bib]
|
|
A. Maletzky. Verifying Buchberger's Algorithm in Reduction Rings. In: Proceedings of the 4th International Seminar on Program Verification, Automated Debugging, and Symbolic Computation, Tudor Jebelean and Dongming Wang (ed.), Proceedings of PAS'2015, Beijing, China, October 21-23, pp. 16-23. October 2015. ??. arXiv:1604.08736 [cs.SC]. [url] [bib]
|
|
A. Maletzky, B. Buchberger. Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema. In: Mathematical Software - ICMS 2014, Hoon Hong and Chee Yap (ed.), Proceedings of The 4th International Congress on Mathematical Software (ICMS'2014), Seoul, Korea, August 5-9, 2014, Lecture Notes in Computer Science 8592, pp. 41-48. 2014. Springer Berlin Heidelberg, ISBN 978-3-662-44198-5. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44199-2_8. [url] [pdf] [bib]
|
|
B. Buchberger, A. Maletzky. Groebner Bases in Theorema. In: Mathematical Software - ICMS 2014, Hoon Hong and Chee Yap (ed.), Proceedings of The 4th International Congress on Mathematical Software (ICMS'2014), Seoul, Korea, August 5-9, 2014, Lecture Notes in Computer Science 8592, pp. 374-381. 2014. Springer Berlin Heidelberg, ISBN 978-3-662-44198-5. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44199-2_58. [url] [pdf] [bib]
|
|
A. Maletzky, B. Buchberger. Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema. Technical report no. 14-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. October 2014. [zip] [bib]
|
|
A. Maletzky. Efficient Rewriting by Object Reuse and Compiling. Research Institute for Symbolic Computation (RISC), Johannes Kepler University of Linz. Technical report no. 13-05, 2013. Master's Thesis. [pdf] [bib]
|
|
