Bruno Buchberger

Affiliations:
  • Johannes Kepler University, Linz, Austria


According to our database1, Bruno Buchberger authored at least 92 papers between 1970 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Automated programming, symbolic computation, machine learning: my personal view.
Ann. Math. Artif. Intell., October, 2023

Correction to: Preface.
Ann. Math. Artif. Intell., October, 2023

Preface.
Ann. Math. Artif. Intell., October, 2023

2022
Vladimir Gerdt: A Computer Algebra Enthusiast.
Math. Comput. Sci., 2022

2021
Symbolic Computation in Software Science: My Personal View.
Proceedings of the 9th International Symposium on Symbolic Computation in Software Science, 2021

2017
Gröbner Bases Computation and Macaulay Matrices.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

2016
Theorema 2.0: Computer-Assisted Natural-Style Mathematics.
J. Formaliz. Reason., 2016

Satisfiability Checking meets Symbolic Computation (Project Paper).
CoRR, 2016

Satisfiability checking and symbolic computation.
ACM Commun. Comput. Algebra, 2016

SC<sup>2</sup>: Satisfiability Checking Meets Symbolic Computation - (Project Paper).
Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

The GDML and EuKIM Projects: Short Report on the Initiative.
Proceedings of the Mathematical Software - ICMS 2016, 2016

Stam's Identities Collection: A Case Study for Math Knowledge Bases.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2015
Special issue on symbolic computation in software science.
J. Symb. Comput., 2015

Two-Point Boundary Problems with One Mild Singularity and an Application to Graded Kirchhoff Plates.
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Groebner Bases in Theorema.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Soft Math Math Soft.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Mathematics of 21st Century: A Personal View.
Proceedings of the 5th International Symposium on Symbolic Computation in Software Science, 2013

2012
Transforming problems from analysis to algebra: A case study in linear boundary problems.
J. Symb. Comput., 2012

Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
CoRR, 2012

2011
Buchberger's algorithm.
Scholarpedia, 2011

2010
Groebner basis.
Scholarpedia, 2010

An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra.
Proceedings of the Mathematical Software, 2010

2009
Combining logical and algebraic techniques for natural style proving in elementary analysis.
Math. Comput. Simul., 2009

A Symbolic Framework for Operations on Linear Boundary Problems.
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

Algorithms in Symbolic Computation.
Proceedings of the Hagenberg Research, 2009

Automated Reasoning.
Proceedings of the Hagenberg Research, 2009

Hagenberg Research: Introduction.
Proceedings of the Hagenberg Research, 2009

2008
General polynomial reduction with TH 9 OREM 8 functors: applications to integro-differential operators and polynomials.
ACM Commun. Comput. Algebra, 2008

2007
Journal as Active Math-Agents: Outline of a Project with a Mathematics Publisher.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

2006
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal.
J. Symb. Comput., 2006

Comments on the translation of my PhD thesis.
J. Symb. Comput., 2006

Theorema: Towards computer-aided mathematical theory exploration.
J. Appl. Log., 2006

Theorema.
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

Mathematical Theory Exploration.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
A view on the future of symbolic computation.
Proceedings of the Symbolic and Algebraic Computation, 2005

05391 Abstracts Collection - Algebraic and Numerical Algorithms and Computer-assisted Proofs.
Proceedings of the Algebraic and Numerical Algorithms and Computer-assisted Proofs, 2005

05391 Executive Summary - Numerical and Algebraic Algorithms and Computer-assisted Proofs.
Proceedings of the Algebraic and Numerical Algorithms and Computer-assisted Proofs, 2005

2004
Predicate Logic with Sequence Variables and Sequence Function Symbols.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

Proving and Constraint Solving in Computational Origami.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness.
Proceedings of the Automated Deduction in Geometry, 5th International Workshop, 2004

2003
Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema.
Proceedings of the Mathematical Knowledge Management Symposium, 2003

Preface.
Ann. Math. Artif. Intell., 2003

Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Computer algebra: the end of mathematics?
SIGSAM Bull., 2002

Focus Windows: A New Technique for Proof Presentation.
Proceedings of the Artificial Intelligence, 2002

2001
Gröbner Bases and Systems Theory.
Multidimens. Syst. Signal Process., 2001

The PCS Prover in THEOREMA.
Proceedings of the Computer Aided Systems Theory, 2001

Gröbner Bases: A Short Introduction for Systems Theorists.
Proceedings of the Computer Aided Systems Theory, 2001

1999
Theory exploration versus theorem proving.
Proceedings of the Systems for Integrated Computation and Deduction, 1999

1997
Computing, Solving, Proving: A Survey on the Theorema Project (Abstract).
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

A Survey of the Theorema Project.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Symbolic Computation: Computer Algebra and Logic.
Proceedings of the Frontiers of Combining Systems, 1996

1995
Symbolic computation-based synthesis of neural network dynamics and controller for robots.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995

Symbolic Computation Software Systems: The Current State of Technology.
Proceedings of the EUROSIM'96, 1995

What Is Symbolic Computation?
Proceedings of the Principles and Practice of Constraint Programming, 1995

1993
Mathematica: A System for Doing Mathematics by Computer? (Abstract).
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992
Gröbner Bases: An Introduction.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
Gröbner Bases in Mathematica: Enthusiasm and Frustration.
Proceedings of the Programming Environments for High-Level Scientific Problem Solving, 1991

1990
Special Issue Computational Algebraic Complexity Editorial.
J. Symb. Comput., 1990

Should Students Learn Integration Rules?
SIGSAM Bull., 1990

1988
Algebraic Methods for Non-Linear Computational Geometry (Invited Address).
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
History and Basic Features of the Critical-Pair/Completion Procedure.
J. Symb. Comput., 1987

Applications of Gröbner Bases in Non-linear Computational Geometry.
Proceedings of the Trends in Computer Algebra, 1987

1985
Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals.
ACM Trans. Math. Softw., 1985

Towards a connection machine for logical inference.
Future Gener. Comput. Syst., 1985

CAMP: a teaching project in symbolic computation at the University of Linz.
ACM Commun. Comput. Algebra, 1985

Basic Features and Development of the Critical-Pair/Completion Procedure.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

The L-Language for the Parallel L-Machine.
Proceedings of the Österreichische Artificial Intelligence-Tagung, 1985

The Parallel L-Machine for Symbolic Computation.
Proceedings of the EUROCAL '85, 1985

The L-Machine: An Attempt at Parallel Hardware for Symbolic Computation.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1984
Algorithms: R Sedgewick Addison-Wesley, Reading, MA, USA (1983) £13.95 pp 551.
Microprocess. Microsystems, 1984

Abstracts.
SIGSAM Bull., 1984

1983
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm.
SIGSAM Bull., 1983

A critical-pair/completion algorithm for finitely generated ideals in rings.
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

A note on the complexity of constructing Gröbner-Bases.
Proceedings of the Computer Algebra, 1983

Computer algebra: symbolic and algebraic computation, 2nd Edition.
Springer, ISBN: 038781776X, 1983

1982
Computer algebra symbolic and algebraic computation.
SIGSAM Bull., 1982

Computer-unterstützter Algorithmenentwurf.
Proceedings of the Künstliche Intelligenz, 1982

The Construction of Multivariate Polynomials with Preassigned Zeros.
Proceedings of the Computer Algebra, 1982

Computer algebra - symbolic and algebraic computation.
Computing Supplementa 4, Springer, ISBN: 0387816844, 1982

1980
A simplified proof of the characterization theorem for Gröbner-bases.
SIGSAM Bull., 1980

Mathematik für Informatiker I: Die Methode der Mathematik
Informatik-Fachberichte 35, Springer, ISBN: 3-540-10417-8, 1980

1979
Computer trees: a concept for parallel processing.
Microprocess. Microsystems, 1979

A criterion for detecting unnecessary reductions in the construction of Groebner bases.
Proceedings of the Symbolic and Algebraic Computation, 1979

1978
An improved algorithmic construction of Gröbner-bases for polynomial ideals.
SIGSAM Bull., 1978

1976
Some properties of Gröbner-bases for polynomial ideals.
SIGSAM Bull., 1976

A theoretical basis for the reduction of polynomials to canonical forms.
SIGSAM Bull., 1976

1972
Bemerkung zu den Reduzierbarkeitskriterien von<i>R.Albrecht</i> für das Optimum-Mix-Problem.
Z. Oper. Research, 1972

Certain decompositions of Gödel numbering and the semantics of programming languages.
Proceedings of the International Sympoisum on Theoretical Programming, 1972

1970
Algorithmus 13 Lösung eines Optimum-Mix-Problemes.
Computing, 1970


  Loading...