The SFB program expired on September 30, 2008. For the link to the successor project click DK Computational Mathematics
Home
Appointments
Papers
Misc
Contact

Technical Reports

Publication Lists

Annual Reports


Publications of the Project F1302


UnpublishedInvited


September 27, 2008

Bibliography

1
B. Buchberger.
Computer Support for Inventing Gröbner Bases Theory.
IMACS Conference, Prague, Czech Republic, 1998.
2
B. Buchberger.
Theorema: Theorem Proving for the Masses Using Mathematica (invited keynote).
Worldwide Mathematica Conference, Chicago, USA, 1998.
3
B. Buchberger.
Mathematics: The technology of reasoning.
Invited Keynote at the 4th Asian Technology Conference in Mathematics, Guangzhou, China, December 1999.
4
B. Buchberger.
Möglichkeiten und Grenzen mathematischer Modellierung.
Sommerakademie der Pro Scientia ueber ``Modell und Wirklichkeit'', Tainach, Kärnten, Austria, September 1999.
5
B. Buchberger.
Theorema: A new kind of mathematical system.
Invited Keynote at the COCOA Conference, Torino, Italy, June 1999.
6
B. Buchberger.
Towards algorithm verification in Theorema.
Workshop on Validated Software, Schloss Dagsthul, Germany, November 1999.
7
B. Buchberger.
Views on the future of computer science.
Invited Keynote at the Workshop of the Japanese Consortium on Formal Methods, Nagoya, Japan, December 1999.
8
B. Buchberger.
Theorem proving: Theory or practice.
Jahrestagung der DMV, Dresden, September 18-22, 2000.
9
B. Buchberger.
The Theorema project: Logic and algebra.
Workshop on Computer Algebra and Representation Theory, Universität Bielefeld, Fakultät für Mathematik, September 25-27, 2000.
10
B. Buchberger.
Theorema Proving For and With Gröbner Bases.
Second International Workshop on Multidimensional (nD) Systems, Czocha Castle, Poland, June 27-30, 2000.
11
B. Buchberger.
The vertical layers in mathematics.
Workshop on Computer Algebra and Representation Theory, Universität Bielefeld, Fakultät für Mathematik, September 25-27, 2000.
12
B. Buchberger.
Gröbner bases and Theorema.
Workshop Universal Algebra, Universität Linz, June 2001.
13
B. Buchberger.
Gröbner rings and modules.
3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'01), University of the West, Timisoara, Romania, October 2001.
14
B. Buchberger.
Schichten in der automatisierung der mathematik.
Workshop ``Symbolic Computation'', Technische Universität Wien, Institut für Simulation, January 2001.
15
B. Buchberger.
Theorema: Automated theorem proving for the practice.
Applied Informatics Conference, University of Eger, Ungarn, January 2001.
16
B. Buchberger.
Theorema: Proving, solving and computing.
International Symposium ``Proving, Solving, Computing'' on the Occasion of the 60th Birthday of Professor S. Igarashi, Tsukuba University, June 2001.
17
B. Buchberger.
Automated Proofs of Automated Geometry Provers.
Invited talk at Forth International Workshop on Automated Deduction in Geometry, RISC, Schloss Hagenberg, Austria, September 5-7 2002.
18
B. Buchberger.
Computer-Algebra: Abstieg oder Aufstieg? (Computer Algebra: Descent or Ascent ?).
Invited colloquium talk at IWR (Institut für Wissenschaftliches Rechnen), Heidelberg, Germany, May 23 2002.
19
B. Buchberger.
Computer Mathematik: Abstieg oder Aufstieg (Computer Mathematics: Descent or Ascent).
Invited colloquium talk at Fachhochschule Ohm, Mathematical Department, Nürnberg, Germany, December 12 2002.
20
B. Buchberger.
Computer verstehen und benutzen (Understanding and Using Computers).
Invited colloquium talk at Workshop of the Austrian Christian Teachers Association, at RISC, Schloss Hagenberg, Austria, March 13 2002.
21
B. Buchberger.
Focus Windows: A New Technique for Proof Presentation.
Invited talk at 2nd Workshop on Proving, Solving, Computing, Tokyo, organized by the SCORE Group, University of Tsukuba, Japan, February 17-18 2002.
22
B. Buchberger.
Forschung: Das Standortkriterium. Erfahrungen, Reflexionen, Visionen. (Research: A Decisive Criterion for Selecting Industrial Sites.).
Invited colloquium talk at ``Innovationsgespraeche'', Profactor Institute, Steyr, Austria, March 19 2002.
23
B. Buchberger.
Teaching Without Teachers?
Invited talk at VISIT-ME (Vienna International Symposium on Information Technology in Math Education), University of Vienna, http://www.acdca.ac.at/visit-me-2002/, July 10-13 2002.
24
B. Buchberger.
Theorema: A Formal Frame for Mathematics.
Invited talk at EACA - 2002, Octavo Encuentro de Algebra Computational y Applicaciones, Penaranda de Duero, Universidad de Vallodolid, pp. 11-32, September 9-11 2002.
25
B. Buchberger.
Theorema and Mathematical Knowledge Management.
Invited talk at IMA 2002 Summer Program: Special Functions in the Digital Age, University of Minnesota, Minneapolis, USA, July 22 - August 2 2002.
26
B. Buchberger.
Algorithm invention and verification by lazy thinking.
October 2003.
27
B. Buchberger.
Algorithm Invention and Verification by Lazy Thinking.
Invited colloquium talk at Department of Computer Science, Lamar University, Texas, USA, November 19 2003.
28
B. Buchberger.
Algorithm Synthesis by Failing Correctness Proofs.
Invited colloquium talk at Mathematisches Institut, Universität München, December 5 2003.
29
B. Buchberger.
Automated computing, solving, proving: A key to the information age.
Talk in Computer Science Department, University of Tsukuba, Japan, February 2003.
30
B. Buchberger.
Automated Proving, Solving, Computing: A Key to the Information Age.
Invited talk at Presentation Day of the Computer Science Department of the University of Tsukuba, Japan, February 24 2003.
31
B. Buchberger.
Computational mathematics, computational logic, and symbolic computation.
Talk in Technical University of Vienna, Computer Science Department, August 2003.
32
B. Buchberger.
Humanistische Bildung versus Learning on Demand (Humanistic Education versus Learning on Demand).
Invited talk at Conference eSchola 2003, Pädagogische Akademie, Linz, Austria, May 9 2003.
33
B. Buchberger.
Mathematik an Fachhochschulen: Fachliche und didaktische Überlegungen.
Tagung der Mathematiklehrer an Fachhochschulen, Bozen, Italy, September 2003.
34
B. Buchberger.
Mathematik und Informatik: Eine Liebeserklärung.
Talk in Tagung der österreichischen mathematischen Gesellschaft, Bozen, Italy, September 2003.
35
B. Buchberger.
Systematic Theory Exploration: The Lazy Thinking Paradigm.
Invited colloquium talk at Mathematics Department, University of Kyushu, Fukuoka, Japan, March 7 2003.
36
B. Buchberger.
Systematic Theory Exploration: The Lazy Thinking Paradigm.
Invited talk at Workshop on Computer Algebra, Research Institute of Mathematical Science, Kyoto, Japan, March 5 2003.
37
B. Buchberger.
The White-Box and Black-Box Usage of Mathematical Software Systems.
Invited talk at Symposium Mathematics and New Technologies: What do Learn, How to Teach?, Universidad Complutense de Madrid, Fondacion Ramon Areces, December 10-11 2003.
38
B. Buchberger.
Verified algorithm development by lazy thinking.
Talk in Kyushu University, Mathematical Department, Fukuoka, Japan, March 2003.
39
B. Buchberger.
Verified algorithm development by lazy thinking.
Talk in Research Institute for Mathematical Sciences, Mathematical Department, University of Kyoto, Japan, February 2003.
40
B. Buchberger.
Verified Algorithm Development by Lazy Thinking.
Talk in IMS 2003 (International Mathematica Symposium 2003, Imperial College, London, UK, July 2003.
41
B. Buchberger.
Verified Algorithm Development by Lazy Thinking.
Invited talk at International Mathematica Symposium 2003, Imperial College, London, July 7-11 2003.
42
B. Buchberger.
Algorithmic algorithm synthesis: Case study Gröbner Bases.
Invited colloquium talk at Kuyshu University, Mathematical Department, Fukuoka, Japan, August 25 2004.
43
B. Buchberger.
Algorithmic algorithm synthesis: Case study Gröbner Bases.
Invited colloquium talk at KAIST (University, Daejon), October 29 2004.
44
B. Buchberger.
Algorithmic invention of algorithms: Case study Gröbner Bases.
Invited talk at Symposium Polynomial Systems Solving, University Paris VI, November 24-26 2004.
45
B. Buchberger.
Computer algebra: A key to the future of mathematics, science, and engineering.
Invited colloquium talk at KIAS (Korean Institute of Advanced Studies, Seoul), October 28 2004.
46
B. Buchberger.
Computer-supported mathematical theory exploration: A shift of paradigm in mathematical software.
Invited talk at Mathematica Gulf Conference 2004, Sultan Qaboos University, Department of Mathematics and Statistics, organized by M. Rakha and M. Ben Rouma, January 26-28 2004.
47
B. Buchberger.
Didactic principles for using computer algebra in class.
Lecture for High-school Teachers. Invited colloquium talk at Waseda Gakuin High School, October 16 2004.
48
B. Buchberger.
Elimination and self-elimination.
Invited colloquium talk at University of Bochum, Mathematical Institute, December 15 2004.
49
B. Buchberger.
A formal knowledge base for Gröbner Bases theory.
Invited talk at Annual Conference of the Japanese Society for Symbolic and Algebraic Computation (JSSAC), Atsugi, Japan, September 1-4 2004.
50
B. Buchberger.
Gröbner Bases: Theory and applications.
Invited colloquium talk at Sultan Qaboos Universiy, Department of Mathematics and Statistics, January 25 2004.
51
B. Buchberger.
Groebner Basis: An Overview.
Invited colloquium talk at Workshop on Computer Algebra, RIMS (Research Institute of Mathematical Sciences), Kyoto University, Japan, August 2-4 2004.
52
B. Buchberger.
How I Managed to Automate Myself.
Invited talk at Conference ``The Future of Scientific Computing'', The City College of New York. (Organizer: G. Baumslag), April 30 2004.
53
B. Buchberger.
How to give talks and write papers.
Lecture for Graduate Students. Invited colloquium talk at Kyoto University, Graduate School for Computer Science, October 13 2004.
54
B. Buchberger.
How to work with the literature.
Lecture for Graduate Students. Invited colloquium talk at Kyoto University, Graduate School for Computer Science, October 4 2004.
55
B. Buchberger.
The importance of formal methods in mathematics.
Invited colloquium talk at Workshop on Computer Algebra, RIMS (Research Institute of Mathematical Sciences), Kyoto University, Japan, August 2-4 2004.
56
B. Buchberger.
Let's solve!
Teaching Experiment on Computer Algebra with High School Students. Invited colloquium talk at Waseda Gakuin High School, October 16 2004.
57
B. Buchberger.
Proving by first and intermediate principles.
Invited talk at Workshop on Types for ``Mathematics / Libraries of Formal Mathematics'', University of Nijmegen, The Netherlands, November 1-2 2004.
58
B. Buchberger.
The Algorithmic Invention of a Groebner Basis Algorithm.
Invited talk at Computer Algebra Workshop at Joint Institute for Nuclear Research (Dedicated to the Memory of G. Mescsheriakov), Dubna (Moscow), Russia, organized by V. Gerdt, May 25-26 2004.
59
B. Buchberger.
Theorema: An overview.
Invited colloquium talk at Kyoto University, Graduate School of Computer Science, July 22-23 2004.
60
B. Buchberger.
The Theorema project: An overview.
Invited talk at Workshop ``Verification and Rewriting'', Institute AIST, Amagasaki, October 21 2004.
61
B. Buchberger.
Was sie nie ueber it wissen wollten (what you never wanted to know about it).
Invited talk at ITCOM 2004 Conference, Schloss Hagenberg, Austria, (Organizer: Bruno Bischinger), April 20 2004.
62
B. Buchberger.
A Historic Introduction to Gröbner Bases.
Invited talk at Summer School on Gröbner Bases and Applications, July 9-22 2005.
63
B. Buchberger.
Algorithm Synthesis by Lazy Thinking: Case Study Gröbner Bases.
Invited colloquium talk at DFKI, Saarbrücken, Germany, November 14-15 2005.
64
B. Buchberger.
Algorithm Synthesis in Theorema: Case Study Gröbner Bases.
Invited colloquium talk at University of Edinburgh, School of Informatics, June 23 2005.
65
B. Buchberger.
Algorithmic algorithm invention in the Theorema project.
Invited talk at Conference on Algorithms and Information Theory, Vaasa, Finland, May 16-18 2005.
66
B. Buchberger.
Algorithmic algorithm invention in the Theorema project.
Invited talk at AIT (Algorithmic Information Theory), Vaasa, Finland, May, 17 2005.
67
B. Buchberger.
Algorithmic Algorithm Synthesis: Case Study Gröbner Bases.
Invited talk at East Coast Computer Algebra Day, Ohio, Ashland, USA, March 12 2005.
68
B. Buchberger.
Algorithmische Beweisverfahren: Das Ende der Mathematik?
Invited colloquium talk at Kepler Symposium, Universität Linz, April 20 2005.
69
B. Buchberger.
Das Projekt ``Austrian IT-Park in Timisoara'' (Westrumänien).
Invited talk at CATT, Linz, March, 3 2005.
70
B. Buchberger.
Formal mathematical theory exploration in Theorema (4 lectures).
Invited talk at Summer School on Theoretical Computer Science, Marktoberdorf, August 3-13 2005.
71
B. Buchberger.
From Gröbner Bases to Automated Theorem Proving and Back.
3 lectures. Invited talk at Summer School on Gröbner Bases and Applications, Zanjan, Iran, July 9-22 2005.
72
B. Buchberger.
Gröbner-Basen: Eine Einführung für LA-Kandidaten.
Invited colloquium talk at RISC, June, 2 2005.
73
B. Buchberger.
Gröbner Bases: An Introduction.
Invited colloquium talk at Softwarepark Hagenberg, Feb, 02 2005.
74
B. Buchberger.
Introduction to Gröbner Bases.
Invited talk at Introduction to Gröbner Bases, Vaasa, Finland, May 16-18 2005.
75
B. Buchberger.
Lazy thinking: A new method for algorithm synthesis.
Invited colloquium talk at Workshop ``Algebraic and Numeric Algorithms and Computer-Assisted Proofs''. Research Center Schloss Dagstuhl, Germany, September 26-30 2005.
76
B. Buchberger.
Mathematik: Die Kunst des effektiven Handelns.
Invited colloquium talk at MathSpace, Wien, May 12 2005.
77
B. Buchberger.
Symbolic computation: Current trends.
Invited talk at International Workshop on Advanced Computing and Analysis Techniques in Physics Research, Berlin, Germany, May 22-27 2005.
78
B. Buchberger.
Theorema: A system for formal mathematics.
Invited colloquium talk at North Carolina State University, Dept of Computer Science, March 15 2005.
79
B. Buchberger.
A view on the future of symbolic computation.
Invited talk at ISSAC 2005 (International Symposium on Symbolic and Algebraic Computation), Bejing, July 25-27 2005.
80
B. Buchberger.
Automated Mathematical Theory Exploration: How Far Can We Go?
Invited colloquium talk at DERI, Innsbruck, December 14-15 2006.
81
B. Buchberger.
Automated Synthesis of a Gröbner Bases Algorithm.
Talk at Workshop ``Formal Gröbner Bases Theory'', March 6 2006.
82
B. Buchberger.
Automated Synthesis of a Gröbner Bases Algorithm.
Invited talk at Workshop ``Formal Gröbner Bases Theory'', March 6 2006.
83
B. Buchberger.
Die Zukunft der algorithmischen Mathematik: Kann mathematische Forschung automatisiert werden?
Invited colloquium talk at OCG, OVE, Graz, November 21 2006.
84
B. Buchberger.
Formal mathematics: A key to the future.
Invited talk at ``Engineering and Life Sciences'', Avignon, France, June 2006.
85
B. Buchberger.
Gröbner Bases: Tutorial for Newcomers.
Invited colloquium talk at RISC, Hagenberg, Austria, April 30 2006.
86
B. Buchberger.
Mathematical theory exploration.
Invited talk at IJCAR, Seattle, USA, August 2006.
87
B. Buchberger.
Mathematical theory exploration: Case study Gröbner Bases.
Invited talk at (SYNASC'06), Timisoara, Romania, September 2006.
88
B. Buchberger.
Mathematical Theory Exploration: Case Study Gröbner Bases.
Invited talk at International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), Timisoara, Romania, September 26-29 2006.
89
B. Buchberger.
Symbolic computation: Current trends.
Talk at Max Planck Institute for Physics, München, January 31 2006.
90
B. Buchberger.
Symbolic computation: Self-application of algorithmic mathematics.
Invited talk at MAP 06 (Mathematics, Algorithms, Proofs), Mathematical Research Center, Castro-Urdiales, Spain, Jan 9-13, 2006, January 10 2006.
91
B. Buchberger.
Symbolic computation: Some thoughts about the future.
Invited talk at LL2006 (Loops and Legs in Quantum Physics), Eisenach, Germany, April 2006.
92
B. Buchberger.
The Objectives of Formal Mathematics and the Workshop on Formal Gröbner Bases Theory.
Invited talk at Workshop ``Formal Gröbner Bases Theory'', March 6 2006.
93
B. Buchberger and T. Jebelean.
The Theorema System, invited tutorial.
MFCS'98 (International Conference on Mathematical Foundations of Computer Science), Brno, Czech Republic, 1998.
94
B. Buchberger and T. Jebelean.
Using Theorema for Mathematical Education.
IMACS Conference on Applied Computer Algebra, Prague, Czech Republic, 1998.
95
M. Giese.
A logic with subtypes to talk about java objects.
Invited talk at ESF Exploratory Workshop: Challenges in Java Program Verification, Nijmegen, The Netherlands, October 2006.
96
M. Giese.
Panelist at Panel Discussion, Intl. Workshop on Implementation of Logics, Phnom Penh, Cambodia.
November 2006.
97
M. Giese.
Aspects of first-order reasoning in the KeY system.
Invited talk at First Order Theorem Proving (FTP), Liverpool, UK, September 2007.
98
T. Jebelean.
Natural Proofs in Elementary Analysis by S-Decomposition.
Invited talk at ISSAC'01: International Symposium on Symbolic and Algebraic Computation, London, Ontario, Canada, July 2001.
99
T. Jebelean.
Theorema: A system for the working mathematician.
Invited talk at International Symposium ``35 years of Automath'', Edinburgh, Scotland, August 2002.
100
T. Jebelean.
Using computer algebra for automated reasoning in the Theorema system.
Invited talk at Seventh Asian Symposium on Computer Mathematics (ASCM 2005), Seoul, Korea, December 15 2005.
101
L. Kovacs.
Automated Loop Invariant Generation by Algebraic Techniques Over the Reals.
Invited colloquium talk at Formal Methods Group, School of Computer Science, Manchester University, UK, March 2007.
102
L. Kovacs.
Polynomial invariant generation by algebraic techniques for program verification in Theorema.
Invited colloquium talk at Institut de Recherche en Informatique de Toulouse (IRIT), Paul Sabatier University, Toulouse, France, 26 March 2007.
103
L. Kovacs.
Polynomial Invariant Generation by Algebraic Techniques for Program Verification in Theorema.
Invited colloquium talk at Models and Theory of Computation, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland, February 2007.
104
L. Kovacs.
Using Symbolic Summation and Polynomial Algebra for Automated Generation of Polynomial Invariants in Theorema.
Invited colloquium talk at VERIMAG, Grenoble, France, February 2007.
105
T. Kutsia.
Matching with regular constraints.
Invited colloquium talk at Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba, Japan, March 14 2006.
106
T. Kutsia.
Matching with regular constraints.
Invited talk at SCORE Workshop on Proving and Solving, University of Aizu, Aizuwakamatsu, Japan, March 16 2006.
107
T. Kutsia and M. Marin.
Matching with regular constraints.
Invited talk at Austria-Japan Summer Workshop on Term Rewriting, Obergurgl, Austria, August 10 2005.
108
K. Nakagawa.
User-friendly features of mathematical software system Theorema.
Invited talk of the Computer Algebra Seminar at Kobe University, Japan, February 2002.
109
K. Nakagawa.
User-friendly features of mathematical software system Theorema.
Invited talk at Kyusyu University, Japan, February 2002.
110
K. Nakagawa.
User-friendly features of mathematical software system Theorema.
Invited talk at Fujitsu Laboratories LTD, Japan, March 2002.
111
N. Popov.
Verification of recursive programs in Theorema.
Invited colloquium talk at Department of Mathematical Logic, Faculty of Mathematics and Computer Science, Sofia University, Bulgaria, July 2004.
112
W. Windsteiger.
An automated theorem prover for set theory within the Theorema system.
Invited colloquium talk at Institute for Algebra, Charles University Prague, April 25 2005.
113
W. Windsteiger.
CreaComp: Neue Möglichkeiten im e-learning für Mathematik.
Invited colloquium talk at Research Net Upper Austria: Brennpunkt Forschung, Austria, 22. April 2005.
114
W. Windsteiger.
Theorema: A system for mathematical theory exploration.
Invited colloquium talk at Institute for Algebra, Charles University Prague, April 26 2005.
115
W. Windsteiger.
Computer-supported Proving in ZF Set Theory with the Theorema System.
Invited colloquium talk at Carnegie Mellon University, Math Logic seminar, March 2 2006.
116
W. Windsteiger.
Introduction to the Gröbner Bases method.
Talk given in the frame of the seminar ``Fast SAT Solvers and Practical Decision Procedures''. Invited colloquium talk at Carnegie Mellon University, Computer Science Deptartment, April 28 2006.
117
W. Windsteiger.
The Theorema system.
Invited colloquium talk at Carnegie Mellon University, Computer Science seminar, February 20 2006.




Please direct your comments or eventual problem reports to webmaster.

SpezialForschungsBereich SFB F013 | Special Research Program of the FWF - Austrian Science Fund