default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Buchberger
Person information
- affiliation: Johannes Kepler University, Linz, Austria
- award (2007): Paris Kanellakis Award
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j35]Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia
:
Preface. Ann. Math. Artif. Intell. 91(5): 563-565 (2023)- [j34]Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia:
Correction to: Preface. Ann. Math. Artif. Intell. 91(5): 567 (2023) - [j33]Bruno Buchberger:
Automated programming, symbolic computation, machine learning: my personal view. Ann. Math. Artif. Intell. 91(5): 569-589 (2023) - 2022
- [j32]Bruno Buchberger:
Vladimir Gerdt: A Computer Algebra Enthusiast. Math. Comput. Sci. 16(4): 27 (2022) - [e10]Bruno Buchberger, Mircea Marin, Viorel Negru, Daniela Zaharie:
24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2022, Hagenberg / Linz, Austria, September 12-15, 2022. IEEE 2022, ISBN 978-1-6654-6545-8 [contents] - 2021
- [c47]Bruno Buchberger:
Symbolic Computation in Software Science: My Personal View. SCSS 2021: 1-13
2010 – 2019
- 2017
- [c46]Bruno Buchberger:
Gröbner Bases Computation and Macaulay Matrices. SYNASC 2017: 16 - 2016
- [j31]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability checking and symbolic computation. ACM Commun. Comput. Algebra 50(4): 145-147 (2016) - [j30]Bruno Buchberger, Tudor Jebelean, Temur Kutsia, Alexander Maletzky, Wolfgang Windsteiger:
Theorema 2.0: Computer-Assisted Natural-Style Mathematics. J. Formaliz. Reason. 9(1): 149-185 (2016) - [c45]Bruno Buchberger:
Stam's Identities Collection: A Case Study for Math Knowledge Bases. ICMS 2016: 437-442 - [c44]Bruno Buchberger:
The GDML and EuKIM Projects: Short Report on the Initiative. ICMS 2016: 443-446 - [c43]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper). CICM 2016: 28-43 - [i5]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability Checking and Symbolic Computation. CoRR abs/1607.06945 (2016) - [i4]Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm:
Satisfiability Checking meets Symbolic Computation (Project Paper). CoRR abs/1607.08028 (2016) - 2015
- [j29]Adel Bouhoula, Bruno Buchberger, Laura Kovács, Temur Kutsia:
Special issue on symbolic computation in software science. J. Symb. Comput. 69: 1-2 (2015) - [c42]Markus Rosenkranz, Jane Liu, Alexander Maletzky, Bruno Buchberger:
Two-Point Boundary Problems with One Mild Singularity and an Application to Graded Kirchhoff Plates. CASC 2015: 406-423 - [e9]Bernhard Thalheim, Klaus-Dieter Schewe, Andreas Prinz, Bruno Buchberger:
Correct Software in Web Applications and Web Services. Texts and monographs in symbolic computation, Springer 2015, ISBN 978-3-319-17111-1 [contents] - 2014
- [c41]Bruno Buchberger:
Soft Math Math Soft. ICMS 2014: 9-15 - [c40]Alexander Maletzky, Bruno Buchberger:
Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema. ICMS 2014: 41-48 - [c39]Bruno Buchberger, Alexander Maletzky:
Groebner Bases in Theorema. ICMS 2014: 374-381 - 2013
- [c38]Bruno Buchberger:
Mathematics of 21st Century: A Personal View. SCSS 2013: 1 - 2012
- [j28]Bruno Buchberger, Markus Rosenkranz:
Transforming problems from analysis to algebra: A case study in linear boundary problems. J. Symb. Comput. 47(6): 589-609 (2012) - [i3]Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger:
Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases. CoRR abs/1210.2950 (2012) - 2011
- [j27]Bruno Buchberger, Manuel Kauers:
Buchberger's algorithm. Scholarpedia 6(10): 7764 (2011) - 2010
- [j26]Bruno Buchberger, Manuel Kauers:
Groebner basis. Scholarpedia 5(10): 7763 (2010) - [c37]Loredana Tec, Georg Regensburger, Markus Rosenkranz, Bruno Buchberger:
An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra. ICMS 2010: 245-248
2000 – 2009
- 2009
- [j25]Róbert Vajda, Tudor Jebelean, Bruno Buchberger:
Combining logical and algebraic techniques for natural style proving in elementary analysis. Math. Comput. Simul. 79(8): 2310-2316 (2009) - [c36]Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger:
A Symbolic Framework for Operations on Linear Boundary Problems. CASC 2009: 269-283 - [p4]Bruno Buchberger:
Hagenberg Research: Introduction. Hagenberg Research 2009: 1-4 - [p3]Peter Paule, Bruno Buchberger, Lena Kartashova, Manuel Kauers, Carsten Schneider, Franz Winkler:
Algorithms in Symbolic Computation. Hagenberg Research 2009: 5-62 - [p2]Tudor Jebelean, Bruno Buchberger, Temur Kutsia, Nikolaj Popov, Wolfgang Schreiner, Wolfgang Windsteiger:
Automated Reasoning. Hagenberg Research 2009: 63-101 - [e8]Bruno Buchberger, Michael Affenzeller, Alois Ferscha, Michael Haller, Tudor Jebelean, Erich-Peter Klement, Peter Paule, Gustav Pomberger, Wolfgang Schreiner, Robert Stubenrauch, Roland R. Wagner, Gerhard Weiß, Wolfgang Windsteiger:
Hagenberg Research. Springer 2009, ISBN 978-3-642-02126-8 [contents] - 2008
- [j24]Bruno Buchberger, Georg Regensburger, Markus Rosenkranz, Loredana Tec:
General polynomial reduction with TH 9 OREM 8 functors: applications to integro-differential operators and polynomials. ACM Commun. Comput. Algebra 42(3): 135-137 (2008) - 2007
- [c35]Bruno Buchberger:
Journal as Active Math-Agents: Outline of a Project with a Mathematics Publisher. SYNASC 2007: 11-12 - 2006
- [j23]Bruno Buchberger, Adrian Craciun, Tudor Jebelean, Laura Kovács, Temur Kutsia, Koji Nakagawa, Florina Piroi, Nikolaj Popov, Judit Robu, Markus Rosenkranz, Wolfgang Windsteiger:
Theorema: Towards computer-aided mathematical theory exploration. J. Appl. Log. 4(4): 470-504 (2006) - [j22]Bruno Buchberger:
Comments on the translation of my PhD thesis. J. Symb. Comput. 41(3-4): 471-474 (2006) - [j21]Bruno Buchberger:
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. 41(3-4): 475-511 (2006) - [c34]Bruno Buchberger:
Mathematical Theory Exploration. IJCAR 2006: 1-2 - [c33]Bruno Buchberger:
Mathematical Theory Exploration. SYNASC 2006: 3-4 - [p1]Wolfgang Windsteiger, Bruno Buchberger, Markus Rosenkranz:
Theorema. The Seventeen Provers of the World 2006: 96-107 - [e7]Bruno Buchberger, Shin'ichi Oishi, Michael Plum, Siegfried M. Rump:
Algebraic and Numerical Algorithms and Computer-assisted Proofs, 25.-30. September 2005. Dagstuhl Seminar Proceedings 05391, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e6]Viorel Negru, Dana Petcu, Daniela Zaharie, Ajith Abraham, Bruno Buchberger, Alexandru Cicortas, Dorian Gorgan, Joël Quinqueton:
8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 26-29 September 2006, Timisoara, Romania. IEEE Computer Society 2006, ISBN 0-7695-2740-X [contents] - 2005
- [c32]Bruno Buchberger:
A view on the future of symbolic computation. ISSAC 2005: 1 - [i2]Bruno Buchberger, Christian Jansson, Shin'ichi Oishi, Michael Plum, Siegfried M. Rump:
05391 Executive Summary - Numerical and Algebraic Algorithms and Computer-assisted Proofs. Algebraic and Numerical Algorithms and Computer-assisted Proofs 2005 - [i1]Bruno Buchberger, Shin'ichi Oishi, Michael Plum, Siegfried M. Rump:
05391 Abstracts Collection - Algebraic and Numerical Algorithms and Computer-assisted Proofs. Algebraic and Numerical Algorithms and Computer-assisted Proofs 2005 - 2004
- [c31]Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Takahashi, Bruno Buchberger:
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. Automated Deduction in Geometry 2004: 19-33 - [c30]Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu:
Proving and Constraint Solving in Computational Origami. AISC 2004: 132-142 - [c29]Bruno Buchberger:
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy. AISC 2004: 236-250 - [c28]Temur Kutsia, Bruno Buchberger:
Predicate Logic with Sequence Variables and Sequence Function Symbols. MKM 2004: 205-219 - [e5]Bruno Buchberger, John A. Campbell:
Artificial Intelligence and Symbolic Computation, 7th International Conference, AISC 2004, Linz, Austria, September 22-24, 2004, Proceedings. Lecture Notes in Computer Science 3249, Springer 2004, ISBN 3-540-23212-5 [contents] - 2003
- [j20]Bruno Buchberger, Gaston H. Gonnet, Michiel Hazewinkel:
Preface. Ann. Math. Artif. Intell. 38(1-3): 1-2 (2003) - [c27]Bruno Buchberger:
Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture). CSL 2003: 98-99 - [c26]Bruno Buchberger, Adrian Craciun:
Algorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema. MKM Symposium 2003: 24-59 - [e4]Andrea Asperti, Bruno Buchberger, James H. Davenport:
Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2594, Springer 2003, ISBN 3-540-00568-4 [contents] - 2002
- [j19]Bruno Buchberger:
Computer algebra: the end of mathematics? SIGSAM Bull. 36(1): 3-9 (2002) - [c25]Florina Piroi, Bruno Buchberger:
Focus Windows: A New Technique for Proof Presentation. AISC 2002: 337-342 - 2001
- [j18]Bruno Buchberger:
Gröbner Bases and Systems Theory. Multidimens. Syst. Signal Process. 12(3-4): 223-251 (2001) - [c24]Bruno Buchberger:
Gröbner Bases: A Short Introduction for Systems Theorists. EUROCAST 2001: 1-19 - [c23]Bruno Buchberger:
The PCS Prover in THEOREMA. EUROCAST 2001: 469-478 - [e3]Roberto Moreno-Díaz, Bruno Buchberger, José Luis Freire:
Computer Aided Systems Theory - EUROCAST 2001, Las Palmas de Gran Canaria, Spain, February 19-23, 2001, Revised Papers. Lecture Notes in Computer Science 2178, Springer 2001, ISBN 3-540-42959-X [contents]
1990 – 1999
- 1999
- [c22]Bruno Buchberger:
Theory exploration versus theorem proving. Calculemus 1999: 386 - 1997
- [c21]Bruno Buchberger, Tudor Jebelean, Franz Kriftner, Mircea Marin, Elena Tomuta, Daniela Vasaru:
A Survey of the Theorema Project. ISSAC 1997: 384-391 - [c20]Bruno Buchberger:
Computing, Solving, Proving: A Survey on the Theorema Project (Abstract). LPNMR 1997: 220-221 - 1996
- [c19]Bruno Buchberger:
Symbolic Computation: Computer Algebra and Logic. FroCoS 1996: 193-219 - 1995
- [c18]Bruno Buchberger:
What Is Symbolic Computation? CP 1995: 563 - [c17]Bruno Buchberger:
Symbolic Computation Software Systems: The Current State of Technology. EUROSIM 1995: 85-94 - [c16]Ignacy Duleba, Witold Jacak, Robert Muszynski, Bruno Buchberger:
Symbolic computation-based synthesis of neural network dynamics and controller for robots. ICNN 1995: 2720-2725 - 1994
- [e2]Bruno Buchberger, Jens Volkert:
Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings. Lecture Notes in Computer Science 854, Springer 1994, ISBN 3-540-58430-7 [contents] - 1993
- [c15]Bruno Buchberger:
Mathematica: A System for Doing Mathematics by Computer? (Abstract). DISCO 1993: 1 - 1992
- [c14]Bruno Buchberger:
Gröbner Bases: An Introduction. ICALP 1992: 378-379 - 1991
- [c13]Bruno Buchberger:
Gröbner Bases in Mathematica: Enthusiasm and Frustration. Programming Environments for High-Level Scientific Problem Solving 1991: 119-132 - 1990
- [j17]Bruno Buchberger:
Should Students Learn Integration Rules? SIGSAM Bull. 24(1): 10-17 (1990) - [j16]Erich L. Kaltofen, Bruno Buchberger:
Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9(3): 225-228 (1990)
1980 – 1989
- 1988
- [c12]Bruno Buchberger:
Algebraic Methods for Non-Linear Computational Geometry (Invited Address). SCG 1988: 81-82 - 1987
- [j15]Bruno Buchberger:
History and Basic Features of the Critical-Pair/Completion Procedure. J. Symb. Comput. 3(1/2): 3-38 (1987) - [c11]Bruno Buchberger:
Applications of Gröbner Bases in Non-linear Computational Geometry. Trends in Computer Algebra 1987: 52-80 - 1985
- [j14]Bruno Buchberger:
CAMP: a teaching project in symbolic computation at the University of Linz. ACM Commun. Comput. Algebra 18-19(4-1): 8-9 (1985) - [j13]Wolfgang Bibel, Bruno Buchberger:
Towards a connection machine for logical inference. Future Gener. Comput. Syst. 1(3): 177-188 (1985) - [j12]Franz Winkler, Bruno Buchberger, Franz Lichtenberger, Heinrich Rolletschek:
Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals. ACM Trans. Math. Softw. 11(1): 66-78 (1985) - [c10]Bruno Buchberger:
The L-Machine: An Attempt at Parallel Hardware for Symbolic Computation. AAECC 1985: 333-347 - [c9]Bruno Buchberger:
The Parallel L-Machine for Symbolic Computation. European Conference on Computer Algebra (2) 1985: 541-542 - [c8]Peter Hintenaus, Bruno Buchberger:
The L-Language for the Parallel L-Machine. ÖGAI 1985: 120-131 - [c7]Bruno Buchberger:
Basic Features and Development of the Critical-Pair/Completion Procedure. RTA 1985: 1-45 - [e1]Bruno Buchberger:
EUROCAL '85, European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985, Proceedings Volume 1: Invited Lectures. Lecture Notes in Computer Science 203, Springer 1985, ISBN 3-540-15983-5 [contents] - 1984
- [j11]S. Kamal Abdali, Bruno Buchberger:
Abstracts. SIGSAM Bull. 18(1): 2-7 (1984) - [j10]Bruno Buchberger:
Algorithms: R Sedgewick Addison-Wesley, Reading, MA, USA (1983) £13.95 pp 551. Microprocess. Microsystems 8(10): 544 (1984) - 1983
- [b3]Bruno Buchberger:
Computer algebra: symbolic and algebraic computation, 2nd Edition. Springer 1983, ISBN 038781776X, pp. I-VI, 1-283 - [j9]Franz Winkler, Bruno Buchberger:
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. SIGSAM Bull. 17(3-4): 20 (1983) - [c6]Bruno Buchberger:
A note on the complexity of constructing Gröbner-Bases. EUROCAL 1983: 137-145 - [c5]Bruno Buchberger:
A critical-pair/completion algorithm for finitely generated ideals in rings. Logic and Machines 1983: 137-161 - 1982
- [b2]Bruno Buchberger:
Computer algebra - symbolic and algebraic computation. Computing Supplementa 4, Springer 1982, ISBN 0387816844, pp. I-VI, 1-283 - [j8]Bruno Buchberger, George E. Collins, Rüdiger Loos, R. Albrecht:
Computer algebra symbolic and algebraic computation. SIGSAM Bull. 16(4): 5 (1982) - [c4]H. Michael Möller, Bruno Buchberger:
The Construction of Multivariate Polynomials with Preassigned Zeros. EUROCAM 1982: 24-31 - [c3]Bruno Buchberger:
Computer-unterstützter Algorithmenentwurf. KIFS 1982: 141-201 - 1980
- [b1]Bruno Buchberger, Franz Lichtenberger:
Mathematik für Informatiker I: Die Methode der Mathematik. Informatik-Fachberichte 35, Springer 1980, ISBN 3-540-10417-8 - [j7]Leo Bachmair, Bruno Buchberger:
A simplified proof of the characterization theorem for Gröbner-bases. SIGSAM Bull. 14(4): 29-34 (1980)
1970 – 1979
- 1979
- [j6]Bruno Buchberger, J. Fegerl, Franz Lichtenberger:
Computer trees: a concept for parallel processing. Microprocess. Microsystems 3(6): 244-248 (1979) - [c2]Bruno Buchberger:
A criterion for detecting unnecessary reductions in the construction of Groebner bases. EUROSAM 1979: 3-21 - 1978
- [j5]Christoph Kollreider, Bruno Buchberger:
An improved algorithmic construction of Gröbner-bases for polynomial ideals. SIGSAM Bull. 12(2): 27-36 (1978) - 1976
- [j4]Bruno Buchberger:
A theoretical basis for the reduction of polynomials to canonical forms. SIGSAM Bull. 10(3): 19-29 (1976) - [j3]Bruno Buchberger:
Some properties of Gröbner-bases for polynomial ideals. SIGSAM Bull. 10(4): 19-24 (1976) - 1972
- [j2]Bruno Buchberger:
Bemerkung zu den Reduzierbarkeitskriterien vonR.Albrecht für das Optimum-Mix-Problem. Z. Oper. Research 16(3): 137-143 (1972) - [c1]Bruno Buchberger:
Certain decompositions of Gödel numbering and the semantics of programming languages. International Sympoisum on Theoretical Programming 1972: 152-171 - 1970
- [j1]R. Albrecht, Bruno Buchberger:
Algorithmus 13 Lösung eines Optimum-Mix-Problemes. Computing 5(3): 324-331 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
