% % Reports and other publications related to RISC-Linz published earlier % than 1988. % 65-1 \> BUCHBERGER B. \\ 65-1 \> Ein Algorithmus zum Auffinden der Basiselemente des \\ 65-1 \> Restklassenringes nach einem nulldimensionalen Polynomideal \\ 65-1 \> Universit{\"a}t Innsbruck, Dissertation \\ 65-1 \> Gr{\"o}bner Bases \\ \\ 69-1 \> BUCHBERGER B.\\ 69-1 \> Grundbegriffe der Algorithmentheorie \\ 69-1 \> Steierm{\"a}rkisches Math. Symposium, Grattenhof, Vortragsauszug \\ 69-1 \> Algorithm Theory\\ \\ 70-1 \> BUCHBERGER B. \\ 70-1 \> Ein algorithmisches Kriterium f{\"u}r die L{\"o}sbarkeit eines\\ 70-1 \> algebraischen Gleichungssystems \\ 70-1 \> Aequationes Math., vol. 4, fasc. 3, pp. 374-383, Birkh{\"a}user\\ 70-1 \> Verlag, Basel \\ 70-1 \> Gr{\"o}bner Bases\\ \\ 71-1 \> BUCHBERGER B., EMELYANENKO G. A. \\ 71-1 \> Methods of Inverting Tridiagonal Matrices (Rushian) \\ 71-1 \> Joint Institute for Nuclear Research, Dubna, Preprint P11-5686 \\ 71-1 \> Parallel Computation\\ \\ 71-2 \> BUCHBERGER B. \\ 71-2 \> An extension of ALGOL 60 (Rushian) \\ 71-2 \> Joint Institute for Nuclear Research, Dubna, Preprint E5-5787 \\ 71-2 \> Computer Algebra Languages\\ \\ 71-3 \> BUCHBERGER B. \\ 71-3 \> On the Values $S_i$ determined by the Recursion\\ 71-3 \> $ S_{i+1}=U_iS_i + V_iS_{i-1} $ (Rushian) \\ 71-3 \> Communications of the Joint Institute for Nuclear Research,\\ 71-3 \> Dubna, P5-5789, 1971 \\ 71-3 \> Recursion and Iteration\\ \\ 71-4 \> BUCHBERGER B. \\ 71-4 \> A Comment on Blum's Signal Functions \\ 71-4 \> Univ. Innsbruck, Inst. f. numerische Mathematik u. elektronische\\ 71-4 \> Informationsverarbeitung, Bericht Nr. 71-3 \\ 71-4 \> Algorithm Theory. Semantics of Programming Languages. 71-4 \> Comlexity Theory\\ \\ 71-5 \> BUCHBERGER B. \\ 71-5 \> Associating Functions and the Operator of Conditioned Iteration \\ 71-5 \> Univ. Innsbruck, Inst. f. numerische Mathematik u. elektronische\\ 71-5 \> Informationsverarbeitung, Bericht Nr. 71-4 \\ 71-5 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 71-6 \> BUCHBERGER B. \\ 71-6 \> Bemerkung zu den Reduzierbarkeitskriterien von R. Albrecht\\ 71-6 \> f{\"u}r das Optimum-Mix-Problem \\ 71-6 \> Univ. Innsbruck, Inst. f. numerische Mathematik u. elektronische\\ 71-6 \> Informationsverarbeitung, Bericht Nr. 71-5 \\ 71-6 \> Operations Research\\ \\ 72-1 \> BUCHBERGER B. \\ 72-1 \> Bemerkung zu den Reduzierbarkeitskriterien von R. Albrecht f{\"u}r\\ 72-1 \> das Optimum-Mix-Problem \\ 72-1 \> Zeitschrift f{\"u}r Operations Research, Bd. 16, pp. 137-143 \\ 72-1 \> Operations Research\\ \\ 72-2 \> BUCHBERGER B. \\ 72-2 \> A Basic Problem in the Theory of Programming Languages \\ 72-2 \> Univ. Innsbruck, Inst. f. numerische Mathematik u. elektronische\\ 72-2 \> Informationsverarbeitung, Bericht Nr. 72-1 \\ 72-2 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 72-3 \> BUCHBERGER B. \\ 72-3 \> Certain Decompositions of G{\"o}del Numberings and Semantics\\ 72-3 \> Programming Languages \\ 72-3 \> Proc. Symp. on Theoretical Programming, Novosibirsk, LNCS, vol.\\ 72-3 \> 5, pp. 152-171, Springer 1974, (Zentralblatt, vol. 278, no.\\ 72-3 \> 68022, 1974) \\ 72-3 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 72-4 \> BUCHBERGER B., ROIDER B. \\ 72-4 \> A Study on Universal Functions \\ 72-4 \> Univ. Innsbruck, Inst. f. numerische Mathematik u. elektronische\\ 72-4 \> Informationsverarbeitung, Bericht Nr. 72-5 \\ 72-4 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 73-1 \> BUCHBERGER B., EMELYANENKO G. A. \\ 73-1 \> Methoden f{\"u}r die Inversion tridiagonaler Matrizen (Russisch) \\ 73-1 \> J. vytschisl. mat. i mat. fisiki, 13/3, pp. 546-554 \\ 73-1 \> Parallel Computation.\\ \\ 73-2 \> BUCHBERGER B., JENEWEIN F. \\ 73-2 \> Implementierung einer Metasprache zur Definition von \\ 73-2 \> Programmiersprachen \\ 73-2 \> Univ. Innsbruck, Inst. f. Informatik u. numerische Mathematik,\\ 73-2 \> Programmbibliothek Nr. 228 (ZUSE Z 23V) \\ 73-2 \> Semantics of Programming Languages. \\ \\ 74-1 \> BUCHBERGER B. \\ 74-1 \> On Certain Decompositions of G{\"o}del Numberings \\ 74-1 \> Arch. math. Logik, vol. 16, pp. 85-96 \\ 74-1 \> Semantics of Programming Languages.\\ \\ 74-2 \> SCHINDLER K. \\ 74-2 \> Blum'sche Komplexit{\"a}tsma{\ss}e in der verallgemeinerten \\ 74-2 \> Rekursionstheorie von Moschowokis \\ 74-2 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 16 \\ 74-2 \> Algorithm Theory. Complexity Theory.\\ \\ 74-3 \> PLONER H. \\ 74-3 \> Ein ALGOL 60 Interpreter \\ 74-3 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 18 \\ 74-3 \> Semantics of Programming Languages.\\ \\ 74-4 \> BUCHBERGER B. \\ 74-4 \> Programmverifikation mit Interpreterunterst{\"u}tzung \\ 74-4 \> Univ. Linz, Inst. f. Mathematik, Erl{\"a}uterung eines\\ 74-4 \> Forschungsvorhabens \\ 74-4 \> Program Verification. Semantics of Programming Languages.\\ \\ 74-5 \> JENEWEIN F. \\ 74-5 \> Eine Metasprache zur Definition von Programmiersprachen und ihre\\ 74-5 \> Implementierung \\ 74-5 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 15 \\ 74-5 \> Semantics of Programming Languages.\\ \\ 75-1 \> SUTTER P. \\ 75-1 \> Vergleichende Analyse von implementierten Systemen zur \\ 75-1 \> Programmverifikation \\ 75-1 \> Univ. Linz, Inst. f. Mathematik \\ 75-1 \> Program Verification.\\ \\ 75-2 \> SUTTER P. \\ 75-2 \> Fallstudien zur Programmverifikation \\ 75-2 \> Univ. Linz, Lehrkanzel Mathematik III, Notiz 75/1 \\ 75-2 \> Program Verification.\\ \\ 75-3 \> SUTTER P. \\ 75-3 \> Implementierung einer Metasprache zur Definition von\\ 75-3 \> Interpretern mit Variablenbehandlung \\ 75-3 \> Semantics of Programming Languages.\\ \\ 75-4 \> SUTTER P. \\ 75-4 \> Lineare und semilineare Programme \\ 75-4 \> Univ. Linz, Inst. f. Mathematik, Notiz 75/2 \\ 75-4 \> Program Verification.\\ \\ 75-5 \> SUTTER P. \\ 75-5 \> Implementierung einer Metasprache zur Definition von auf\\ 75-5 \> symbolischen Daten operierenden Interpretern und ihr Einsatz in der\\ 75-5 \> Programmverifikation \\ 75-5 \> Univ. Linz, Inst. f. Mathematik \\ 75-5 \> Semantics of Programming Languages. Program Verification. \\ \\ 75-6 \> BUCHBERGER B. \\ 75-6 \> 1. Jahresbericht {\"u}ber das Forschungsprojekt\\ 75-6 \> Programmverifikation mit Interpreterunterst{\"u}tzung" (Forschungspr.\\ 75-6 \> 2661 des Fonds zur F{\"o}rderung der wissenschaftlichen Forschung) \\ 75-6 \> Univ. Linz, Inst. f. Mathematik \\ 75-6 \> Program Verification. Semantics of Programming Languages.\\ \\ 75-7 \> BUCHBERGER B., ROIDER B. \\ 75-7 \> Some Results on Universal Automata and Input/Output Codings \\ 75-7 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 34 \\ 75-7 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 76-1 \> BUCHBERGER B. \\ 76-1 \> Das Problem der Programmverifikation \\ 76-1 \> Jahrbuch {\"U}berblicke Mathematik, pp. 163-188, Bibl. Inst. \\ 76-1 \> Mannheim, (Math. Rev. vol. 53, no. 4594) \\ 76-1 \> Program Verification.\\ \\ 76-2 \> PLASSER K. \\ 76-2 \> Axiome f{\"u}r Speicherfunktionen \\ 76-2 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 69 \\ 76-2 \> Abstract Data Types. \\ \\ 76-3 \> BUCHBERGER B. \\ 76-3 \> A Theoretical Basis for the Reduction of Polynomials to\\ 76-3 \> Canonical Forms (Part I) \\ 76-3 \> SIGSAM Bulletin, vol. 10, no. 3, pp. 19-29 \\ 76-3 \> Gr{\"o}bner Bases\\ \\ 76-4 \> BUCHBERGER B. \\ 76-4 \> Some Properties of Gr{\"o}bner-Bases for Polynomial Ideals \\ 76-4 \> SIGSAM Bulletin, vol. 10, no. 4, pp. 19-24 \\ 76-4 \> Gr{\"o}bner Bases\\ \\ 76-5 \> SUTTER P. \\ 76-5 \> Implementierung einer Metasprache zur Definition von auf\\ 76-5 \> symbolischen Daten operierenden Interpreten und ihr Einsatz in der\\ 76-5 \> Programmverifikation \\ 76-5 \> Univ. Linz, Inst. f. Mathematik, Dissertation \\ 76-5 \> Semantics of Programming Languages. Program Verification.\\ \\ 76-6 \> PAVLICEK P. \\ 76-6 \> Resolution zum Automatischen Beweisen \\ 76-6 \> Univ. Linz, Inst. f. Mathematik, Diplomarbeit \\ 76-6 \> Automated Theorem Proving.\\ \\ 76-7 \> MINICHSHOFER W. \\ 76-7 \> Das Klassenkonzept von Simula \\ 76-7 \> Univ. Linz, Inst. f. Mathematik, Diplomarbeit \\ 76-7 \> Programming Languages.\\ \\ 76-8 \> BUCHBERGER B. \\ 76-8 \> On Certain Bases of Polynomial Ideals \\ 76-8 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 53 \\ 76-8 \> Gr{\"o}bner Bases.\\ \\ 77-1 \> BUCHBERGER B. \\ 77-1 \> Simulation-universal Automata \\ 77-1 \> Univ. Karlsruhe, Inst. f. Informatik, Interner Bericht Nr. 14/77 \\ 77-1 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 77-2 \> NEUBAUER R. \\ 77-2 \> Eine Systematik f{\"u}r Kreativit{\"a}tsbegriffe \\ 77-2 \> Univ. Linz, Inst. f. Mathematik, Diplomarbeit \\ 77-2 \> Algorithm Theory.\\ \\ 77-3 \> SEEBER G. \\ 77-3 \> Rekursiv aufz{\"a}hlbare Zylinder, Splinter und \\ 77-3 \> Verallgemeinerungen von kreativen Mengen \\ 77-3 \> Univ. Innsbruck, Naturwissenschaftliche Fakult{\"a}t, Diplomarbeit \\ 77-3 \> Algorithm Theory.\\ \\ 77-4 \> RUDALICS M. \\ 77-4 \> Beurteilung von Softwarefehlererkennungs- und Behebungsverfahren\\ 77-4 \> in Abh{\"a}ngigkeit von Fehlerklassen \\ 77-4 \> Univ. Linz, Inst. f. Mathematik, Diplomarbeit \\ 77-4 \> Program Verification.\\ \\ 77-5 \> GRUBER H. \\ 77-5 \> Stufenweise Software-Entwicklung demonstriert an der\\ 77-5 \> Implementierung einer zentralen Ger{\"a}testeuerung f{\"u}r\\ 77-5 \> Hintergrundspeicher im TNS440 \\ 77-5 \> Univ. Linz, Inst. f. Mathematik, Institutsbericht Nr. 94 \\ 77-5 \> Software Technology.\\ \\ 78-1 \> BUCHBERGER B., FEGERL J. \\ 78-1 \> A Universal Module for the Hardware-Implementation of Recursion \\ 78-1 \> Univ. Linz, Inst. f. Mathematik, Bericht Nr. 106 \\ 78-1 \> Parallel Computation.\\ \\ 78-2 \> FALKINGER J. \\ 78-2 \> Universalit{\"a}t und Reduzierbarkeit von Partiell rekursiven \\ 78-2 \> Funktionen, Automaten und deren Numerierung \\ 78-2 \> Univ. Linz, Inst. f. Mathematik, Dissertation \\ 78-2 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 78-3 \> FALKINGER J. \\ 78-3 \> Reduzierbarkeit von berechenbaren Numerierungen von $P_1$ \\ 78-3 \> Zeitschrift f. Mathem. Logik und Grundlagen d. Mathem., Bd. 26/5,\\ 78-3 \> pp. 445-458 \\ 78-3 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 78-4 \> KOLLREIDER C. \\ 78-4 \> Polynomial Reduction: The Influence of the Ordering of Terms on\\ 78-4 \> a Reduction Algorithm \\ 78-4 \> Univ. Linz, Inst. f. Mathematik, Bericht Nr. 124 \\ 78-4 \> Gr{\"o}bner Bases.\\ \\ 78-5 \> ROLLETSCHEK H. \\ 78-5 \> Two Lattice-Theoretic Problems on Recursively Enumerable Sets \\ 78-5 \> Univ. Linz, Inst. f. Mathematik, Bericht Nr. 129 \\ 78-5 \> Algorithm Theory.\\ \\ 78-6 \> LICHTENBERGER F. \\ 78-6 \> Speeding Up Algorithms on Graphs by Using Computer Trees \\ 78-6 \> Univ. Linz, Inst. f. Mathematik, Bericht Nr. 130 + Nagl/\\ 78-6 \> Schneider eds.: Graphs, Data Structures, Algorithms, Applied\\ 78-6 \> Computer Science 13, pp. 65-79, Hanser Verlag \\ 78-6 \> Parallel Computation.\\ \\ 78-7 \> KOLLREIDER C. \\ 78-7 \> Polynomial Reduction: A Termination Proof for a Reduction\\ 78-7 \> Algorithm \\ 78-7 \> Unvi. Linz, Inst. f. Mathematik, Bericht Nr. 123 \\ 78-7 \> Gr{\"o}bner Bases.\\ \\ 78-8 \> BUCHBERGER B., ROIDER B. \\ 78-8 \> Input/Output Codings and Transition Functions in Effective\\ 78-8 \> Systems \\ 78-8 \> Int. J. General Systems, 1978, vol. 4, pp. 201-209 \\ 78-8 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 78-9 \> BUCHBERGER B., KOLLREIDER C. \\ 78-9 \> An Improved Algorithmic Construction of Gr{\"o}bner Bases for\\ 78-9 \> Polynomial Ideals \\ 78-9 \> ACM-SIGSAM Bulletin, vol. 12/2, pp. 27-36 \\ 78-9 \> Gr{\"o}bner Bases.\\ \\ 78-10 \> BUCHBERGER B., QUATEMBER B. \\ 78-10 \> Systems with Universal Outsystems, Realization and Application \\ 78-10 \> Progress in Cybernetics and Systems Research, vol. VII, pp. 25-\\ 78-10 \> 32, Hemisphere Publ. Corp. \\ 78-10 \> Parallel Computation.\\ \\ 78-11 \> BUCHBERGER B. \\ 78-11 \> Computer-Trees and their Programming \\ 78-11 \> Troisieme Colloque de Lille "Les arbres en algebre et en\\ 78-11 \> programmation" \\ 78-11 \> Parallel Computation.\\ \\ 78-12 \> WINKLER F. \\ 78-12 \> Implementierung eines Algorithmus zur Konstruktion von Gr{\"o}bner\\ 78-12 \> Basen \\ 78-12 \> Diplomarbeit \\ 78-12 \> Gr{\"o}bner Bases.\\ \\ 79-1 \> FALKINGER J. \\ 79-1 \> Universalit{\"a}t von berechenbaren Numerierungen von primitiv\\ 79-1 \> rekursiven Funktionen \\ 79-1 \> Zeitschrift f{\"u}r Mathem. Logik und Grundlagen d. Mathem., \\ 79-1 \> Bd. 26/6, pp. 523-528 \\ 79-1 \> Algorithm Theory. Semantics of Programming Languages.\\ \\ 79-2 \> BUCHBERGER B. \\ 79-2 \> A Criterion for Detecting Unnecessary Reductions in the\\ 79-2 \> Construction of Gr{\"o}bner-Bases \\ 79-2 \> Proc. EUROSAM 79, Marseille, LNCS 72 \\ 79-2 \> Gr{\"o}bner Bases.\\ \\ 79-3 \> PRINI G., RUDALICS M. \\ 79-3 \> The LAMBDINO Storage Management System \\ 79-3 \> Institutsbericht Nr. 138 + Byte Publications 79/08, pp. 26-32 \\ 79-3 \> Software Technology.\\ \\ 79-4 \> BUCHBERGER B., WINKLER F. \\ 79-4 \> Miscellaneous Results on the Construction of Gr{\"o}bner-Bases for\\ 79-4 \> Polynomial Ideals \\ 79-4 \> Institutsbericht Nr. 137 \\ 79-4 \> Gr{\"o}bner Bases.\\ \\ 79-5 \> BUCHBERGER B., NEUBAUER R., ROLLETSCHEK H., SEEBER G. \\ 79-5 \> A Note on Some Variants of the Notion of Creative Set \\ 79-5 \> Institutsbericht Nr. 139 \\ 79-5 \> Algorithm Theory.\\ \\ 79-6 \> BUCHBERGER B., FEGERL J., LICHTENBERGER F. \\ 79-6 \> Computer-Trees: A Multimicrocomputer Concept for Special Purpose\\ 79-6 \> Parallel Processing \\ 79-6 \> Microprocessors and Microsystems vol. 3, no. 6, special issue on\\ 79-6 \> Multimicroprocessor systems, pp. 244-248 \\ 79-6 \> Parallel Computation. \\ 79-7 \> BUCHBERGER B. \\ 79-7 \> Operationale Lernzielbeschreibung und Problemorientierter\\ 79-7 \> Unterricht \\ 79-7 \> Vortrag beim Mathematisch-Didaktischen Kolloquium am 6./7. Sept.\\ 79-7 \> 1979 in Linz \\ 79-7 \> Education.\\ \\ 79-8 \> BUCHBERGER B. \\ 79-8 \> Multi-Microcomputer Systeme \\ 79-8 \> Vortrag im Rahmen des Aufbauseminars Informationstechnische\\ 79-8 \> Behandlung kryptologischer Probleme am Inst. f.\\ 79-8 \> Systemwissenschaften, Univ. Linz \\ 79-8 \> Parallel Computation.\\ \\ 79-9 \> BUCHBERGER B. \\ 79-9 \> Automatisches Beweisen und k{\"u}nstliche Intelligenz \\ 79-9 \> Vortrag im Rahmen des Aufbauseminars Informationstechnische\\ 79-9 \> Behandlung kryptologischer Probleme am Inst. f.\\ 79-9 \> Systemwissenschaften, Univ. Linz \\ 79-9 \> Automated Theorem Proving. Artificial Intelligence.\\ \\ 80-1 \> BUCHBERGER B. \\ 80-1 \> Eine Fallstudie in systematischer Algorithmenentwicklung und \\ 80-1 \> Algorithmenverifikation: Ein Algorithmus f{\"u}r ein Nimmspiel \\ 80-1 \> Bericht Nr. 162 \\ 80-1 \> Program Verification.\\ \\ 80-2 \> SEEBER G. \\ 80-2 \> Kreativit{\"a}t und Universalit{\"a}t \\ 80-2 \> Dissertation \\ 80-2 \> Algorithm Theory.\\ \\ 80-3 \> RUDALICS M. \\ 80-3 \> A Simulator for TRAMPS - Treelike Restructurable Systems of\\ 80-3 \> Autonomous Modular Processes \\ 80-3 \> Proc. 6th Int. Symp. on Mini- and Microcomputers, Budapest 1980,\\ 80-3 \> pp. 314-318 \\ 80-3 \> Parallel Computation.\\ \\ 80-4 \> BUCHBERGER B., ASPETSBERGER K. \\ 80-4 \> A Universal Variable-Topology Multi-Microprocessor-System \\ 80-4 \> Proc. 6th Int. Symp. on Mini- and Microcomputers, Budapest 1980,\\ 80-4 \> pp. 136-140 \\ 80-4 \> Parallel Computation.\\ \\ 80-5 \> QUATEMBER B. \\ 80-5 \> A Hardware Realization of a Variable-Topology Multi-\\ 80-5 \> Microprocessor System - The Implementation Principles \\ 80-5 \> Proc. 6th Int. Symp. on Mini- and Microcomputers, Budapest 1980,\\ 80-5 \> pp. 141-147 \\ 80-5 \> Parallel Computation.\\ \\ 80-6 \> ROLLETSCHEK H. \\ 80-6 \> Beitr{\"a}ge zur Systematik der Kreativit{\"a}tsbegriffe \\ 80-6 \> Dissertation \\ 80-6 \> Algorithm Theory.\\ \\ 80-7 \> BACHMAIR L., BUCHBERGER B. \\ 80-7 \> A Simplified Proof of the Characterizatioin Theorem for Gr{\"o}bner-\\ 80-7 \> Bases \\ 80-7 \> Institutsbericht Nr. 167, in ACM Sigsam Bulletin, vol. 14/4,\\ 80-7 \> pp. 29-34 \\ 80-7 \> Gr{\"o}bner Bases.\\ \\ 80-8 \> ASPETSBERGER K. \\ 80-8 \> Algorithmentypen f{\"u}r Multi-Microcomputer Systeme \\ 80-8 \> Diplomarbeit \\ 80-8 \> Parallel Computation.\\ \\ 81-1 \> BUCHBERGER B., LICHTENBERGER F. \\ 81-1 \> Mathematik f{\"u}r Informatiker I (Die Methode der Mathematik). \\ 81-1 \> Springer-Verlag, Berlin, Heidelberg, New York 1980, 315 pages, \\ 81-1 \> second edition 1981 \\ 81-1 \> Mathematics for Computer Science.\\ \\ 81-2 \> BUCHBERGER B. \\ 81-2 \> H-Bases and Gr{\"o}bner-Bases for Polynomial Ideals \\ 81-2 \> Internal Report \\ 81-2 \> Gr{\"o}bner Bases.\\ \\ 81-3 \> ASPETSBERGER K., BUCHBERGER B. \\ 81-3 \> Proving the Correctness of Programs for Networks of L-Modules \\ 81-3 \> Internal Report \\ 81-3 \> Parallel Computation.\\ \\ 81-4 \> QUATEMBER B. \\ 81-4 \> Modular Crossbar Switch for Large-Scale Multi-Processor Systems:\\ 81-4 \> Structure and Implementation \\ 81-4 \> In AFIPS Proc. of the Nat. Computer Conf. 1981, vol. 50, pp. 125\\ 81-4 \> -135 \\ 81-4 \> Parallel Computation.\\ \\ 81-5 \> QUATEMBER B. \\ 81-5 \> New Design Philosophy for Large-Scale Systems Based on Outboard-\\ 81-5 \> Migration: Presentation of an Architectural Example \\ 81-5 \> Internal Report \\ 81-5 \> Parallel Computation.\\ \\ 81-6 \> BACHMAIR L., BUCHBERGER B. \\ 81-6 \> Simplification and Program Verification (An Annotated Bibliography)\\ 81-6 \> Internal Technical Report \\ 81-6 \> Program Verification. Simplification.\\ \\ 81-7 \> BUCHBERGER B., LICHTENBERGER F., WALLMUELLER E. \\ 81-7 \> Ein KWIC-Index System als Hilfsmittel zur Abfassung \\ 81-7 \> fremdsprachlicher wissenschaftlicher Literatur \\ 81-7 \> Internal Technical Report \\ 81-7 \> Organisation.\\ \\ 81-8 \> BUCHBERGER B. \\ 81-8 \> Publications and Reports of the Working Group. 1979-1981 \\ 81-8 \> Documentation \\ 81-8 \> Organisation.\\ \\ 81-9 \> BUCHBERGER B. \\ 81-9 \> Computer-unterst{\"u}tztes mathematisches Probleml{\"o}sen: Eine\\ 81-9 \> {\"U}bersicht \\ 81-9 \> In "Artificial Intelligence" ed.: Horn, 1983 \\ 81-9 \> Education.\\ \\ 81-10 \> BUCHBERGER B., LICHTENBERGER F., ROLLETSCHEK H., WINKLER F. \\ 81-10 \> An Algorithm for Constructing Canonical Bases (Gr{\"o}bner-Bases)\\ 81-10 \> of Polynomial Ideals \\ 81-10 \> ACM-TOMS, vor II, (1985) no. 1, pp. 66-78 \\ 81-10 \> Gr{\"o}bner Bases.\\ \\ 81-11 \> LICHTENBERGER F. \\ 81-11 \> Reduce: Ein Beispiel eines Software-Systems f{\"u}r symbolisches\\ 81-11 \> und algebraisches Rechnen \\ 81-11 \> Lecture Notes (Vortrag gehalten im Rahmen der Vortragsreihe\\ 81-11 \> "Computerunterst{\"u}tztes Mathematisches Probleml{\"o}sen" am\\ 81-11 \> 29. 10. 1981) \\ 81-11 \> Computer Algebra Languages.\\ \\ 81-12 \> WINKLER F. \\ 81-12 \> SAC-2: Ein Beispiel eines Software-Systems f{\"u}r symbolisches\\ 81-12 \> und algebraisches Rechnen \\ 81-12 \> Lecture Notes (Vortrag gehalten im Rahmen der Vortragsreihe\\ 81-12 \> "Computerunterst{\"u}tztes Mathematisches Probleml{\"o}sen" am\\ 81-12 \> 5. 11. 1981)\\ 81-12 \> Computer Algebra Languages.\\ \\ 81-13 \> DAVENPORT J. H. \\ 81-13 \> Symbolic Integration \\ 81-13 \> Lecture Notes (Vortrag gehalten im Rahmen der Vortragsreihe\\ 81-13 \> "Computerunterst{\"u}tztes Mathematisches Probleml{\"o}sen" am\\ 81-13 \> 12. 11. 1981) \\ 81-13 \> Computer Analysis\\ \\ 81-14 \> BUCHBERGER B., FEGERL J. \\ 81-14 \> A Hardware-Realization of l-networks with Fixed and Flexible\\ 81-14 \> Interconnections: Bit-parallel Version \\ 81-14 \> Internal Technical Report \\ 81-14 \> Parallel Computation.\\ \\ 81-15 \> LICHTENBERGER F. \\ 81-15 \> Einf{\"u}hrung in das Programmieren in LISP \\ 81-15 \> In: Bericht der Fr{\"u}hjahrsschule 1982 "K{\"u}nstliche\\ 81-15 \> Intelligenz", Teisendorf \\ 81-15 \> Functional Programming.\\ \\ 81-16 \> BUCHBERGER B. \\ 81-16 \> Detailbeschreibung des Forschungsprojekts "Programmverifikation:\\ 81-16 \> Teilprojekt Simplifikation" \\ 81-16 \> Proposal \\ 81-16 \> Program Verification. Simplification.\\ \\ 81-17 \> BUCHBERGER B. \\ 81-17 \> Mathematik f{\"u}r Informatiker (P{\"a}dagogisches Konzept eines\\ 81-17 \> Vorlesungszyklus an der Universit{\"a}t Linz) \\ 81-17 \> Vortrag gehalten am 12. Mai 1981 in Bad Honneff\\ 81-17 \> (Arbeitsausschu{\ss} "Ausbildung" GI) \\ 81-17 \> Mathematics for Computer Science.\\ \\ 81-18 \> BUCHBERGER B. \\ 81-18 \> Berufsaussichten des Technikstudiums \\ 81-18 \> Vorbereitung eines Radiointerviews (ORF Linz, Nov. 1981) \\ 81-18 \> Politics.\\ \\ 82-1 \> WINKLER F. \\ 82-1 \> A Theorem on the Headterms of a Gr{\"o}bner-Bases \\ 82-1 \> Univ. Linz, Institut f. Mathematik, Bericht Nr. 213 \\ 82-1 \> Gr{\"o}bner Bases.\\ \\ 82-2 \> WINKLER F. \\ 82-2 \> Attempts to Establish a General Critical Pair - Completion\\ 82-2 \> Algorithm \\ 82-2 \> Univ. Linz, Institut f. Mathematik, Bericht Nr. 215 \\ 82-2 \> Gr{\"o}bner Bases. Critical Pair Completion.\\ \\ 82-3 \> KUTZLER B. \\ 82-3 \> Erste Erfahrungen mit muSIMP/muMATH-80 von Microsoft - Ein\\ 82-3 \> Softwarepaket f{\"u}r Symbolisches Rechnen auf einem 8 bit\\ 82-3 \> Microcomputer \\ 82-3 \> Lecture Notes \\ 82-3 \> Computer Algebra Languages.\\ \\ 82-4 \> BUCHBERGER B. \\ 82-4 \> Studienschwerpunkt CAMP (Computer-Aided Mathematical Problem\\ 82-4 \> Solving) an der Universit{\"a}t Linz \\ 82-4 \> Proposal \\ 82-4 \> Education. Organisation.\\ \\ 82-5 \> NESTROY U. \\ 82-5 \> Algebraische Simplifikation: Grundbegriffe, Satz von Richardson-\\ 82-5 \> Caviness-Matijasevic und Simplifikation von Exponentialtermen \\ 82-5 \> Diplomarbeit \\ 82-5 \> Simplification.\\ \\ 82-6 \> STREICHER T. \\ 82-6 \> {\"U}ber ein ungel{\"o}stes Vollst{\"a}ndigkeitsproblem in der\\ 82-6 \> denotationalen Semantik von Programmiersprachen \\ 82-6 \> In: Sprache-Information-Wirklichkeit, Herausgeber: Rainer Born,\\ 82-6 \> Conceptus Sondernummer, Wien/Linz 1982, pp. 79-90 \\ 82-6 \> Semantics of Programming Languages.\\ \\ 82-7 \> STREICHER T. \\ 82-7 \> Scott Domains, Computability and the Denotability Problem \\ 82-7 \> Diplomarbeit \\ 82-7 \> Semantics of Programming Languages.\\ \\ 82-8 \> BACHMAIR L. \\ 82-8 \> Special Theorem Proving and Program Verification \\ 82-8 \> Lecture Note \\ 82-8 \> Automated Theorem Proving. Program Verification.\\ \\ 82-9 \> KUTZLER B., LICHTENBERGER F. \\ 82-9 \> Bibliography on Abstract Data Types \\ 82-9 \> Informatik-Fachbericht, Bd. 68, Springer Verlag, 194 pages \\ 82-9 \> Abstract Data Types.\\ \\ 82-10 \> FUNK G. \\ 82-10 \> Implementierung eines Abstrakten Datentyps durch einen\\ 82-10 \> iterativen Modul: eine Fallstudie \\ 82-10 \> Interner Bericht \\ 82-10 \> Abstract Data Types. Software Technology.\\ \\ 82-11 \> COLLINS G.E., MIGNOTTE M., WINKLER F. \\ 82-11 \> Arithmetic in Basic Algebraic Domains \\ 82-11 \> In: Buchberger/Collins/Loos eds.: Computer Algebra-Symbolic and\\ 82-11 \> Algebraic Computation, Computing Supplement 4, Springer Verlag \\ 82-11 \> Computer Algebra Algorithms. \\ \\ 82-12 \> BUCHBERGER B., LOOS R. \\ 82-12 \> Algebraic Simplification \\ 82-12 \> In: Buchberger/Collins/Loos eds.: Computer Algebra-Symbolic and\\ 82-12 \> Algebraic Computation, Computing Supplement 4, Springer Verlag \\ 82-12 \> Simplification.\\ \\ 82-13 \> BUCHBERGER B., LICHTENBERGER F. \\ 82-13 \> Mathematik f. Informatiker II (Problemtypen, Datentypen,\\ 82-13 \> Algorithmentypen: Ein {\"U}berblick {\"u}ber die Mathematik) \\ 82-13 \> Vorlesungsskriptum \\ 82-13 \> Mathematics for Computer Science.\\ \\ 82-14 \> BUCHBERGER B., COLLINS G.E., LOOS R. \\ 82-14 \> Computer Algebra - Symbolic and Algebraic Computation \\ 82-14 \> Computer Supplement 4, Springer, 270 pages \\ 82-14 \> Computer Algebra Algorithms. Computer Algebra Languages.\\ 82-14 \> Computer Algebra Applications.\\ \\ 82-15 \> BUCHBERGER B. et al \\ 82-15 \> Arbeitsplan 1983 f. das Forschungsprojekt Programmverifikation\\ 82-15 \> (Teilprojekt: Simplifikation) \\ 82-15 \> Interner Bericht \\ 82-15 \> Program Verification.\\ \\ 82-16 \> BUCHBERGER B. \\ 82-16 \> Computer-unterst{\"u}tzter Algorithmenentwurf \\ 82-16 \> Proc. Fr{\"u}hjahrsschule K{\"u}nstliche Intelligenz, Teisendorf, \\ 82-16 \> Informatik Fachberichte, Springer Verlag\\ 82-16 \> Automatic Programming.\\ \\ 82-17 \> BACHMAIR L. \\ 82-17 \> The Nelson-Oppen Method for Combining Special Theorem Provers: \\ 82-17 \> Implementation and Application to Program Verification \\ 82-17 \> Diplomarbeit \\ 82-17 \> Automated Theorem Proving.\\ \\ 82-18 \> BACHMAIR L. \\ 82-18 \> Implementation of the Nelson-Oppen Method for Combining Decision\\ 82-18 \> Procedures: Implementation Guide \\ 82-18 \> Technical Report \\ 82-18 \> Automated Theorem Proving.\\ \\ 82-19 \> KUTZLER B. \\ 82-19 \> {\"U}berblick zu: King/Floyds "An Interpretation Oriented Theorem\\ 82-19 \> Prover over Integers" \\ 82-19 \> Internal Report \\ 82-19 \> Automated Theorem Proving. \\ \\ 82-20 \> WINKLER F. \\ 82-20 \> An Algorithm for Constructing Detaching Bases in the Ring of\\ 82-20 \> Polynomials over a Field \\ 82-20 \> Technical Report \\ 82-20 \> Gr{\"o}bner Bases. Computer Algebra Algorithms.\\ \\ 82-21 \> WINKLER F. \\ 82-21 \> An Algorithm for Constructing Detaching Bases in the Ring of\\ 82-21 \> Polynomials over a Field \\ 82-21 \> Proc. EUROCAL'83, LNCS, London \\ 82-21 \> Gr{\"o}bner Bases. Computer Algebra Algorithms.\\ \\ 82-22 \> M{\"O}LLER H.M., BUCHBERGER B. \\ 82-22 \> The Construction of Multivariate Polynomials with Preassigned\\ 82-22 \> Zeros \\ 82-22 \> Proc. EUROCAM'82, LNCS 144, pp. 24-31 \\ 82-22 \> Gr{\"o}bner Bases.\\ \\ 82-23 \> BUCHBERGER B. \\ 82-23 \> Miscellaneous Results on Gr{\"o}bner-Bases for Polynomial Ideals II\\ 82-23 \> Technical Report + Univ. of Delaware, DCS, TR 83-1 \\ 82-23 \> Gr{\"o}bner Bases.\\ \\ 82-24 \> ASPETSBERGER K., BUCHBERGER B., STREICHER T. \\ 82-24 \> Random Simultaneous Access of Two Processes to a Resource: \\ 82-24 \> Realization by L-Networks \\ 82-24 \> Internal Technical Report \\ 82-24 \> Parallel Computation.\\ \\ 82-25 \> BUCHBERGER B. \\ 82-25 \> Zu den Arbeitstechniken des Mathematikers: B) Allgemeine \\ 82-25 \> methodische und didaktische Techniken zur Vermittlung von\\ 82-25 \> mathematischen Inhalten (f{\"u}r Lehramtskandidaten und\\ 82-25 \> Technische Mathematiker) \\ 82-25 \> Arbeitspapiere f{\"u}r den Unterricht an AHS, Heft 12 \\ 82-25 \> Education.\\ \\ 82-26 \> BUCHBERGER B. \\ 82-26 \> A Note on the Complexity of Constructing Gr{\"o}bner-Bases \\ 82-26 \> Proc. EUROCAL'83, LNCS, London \\ 82-26 \> Gr{\"o}bner Bases.\\ \\ 82-27 \> WINKLER F. \\ 82-27 \> Computer Algebra I \\ 82-27 \> Vorlesungsskriptum \\ 82-27 \> Computer Algebra Algorithms.\\ \\ 83-1 \> KUTZLER B. \\ 83-1 \> Erfahrungen mit Micro-Prolog von LPA \\ 83-1 \> Lecture Note \\ 83-1 \> Logic Programming.\\ \\ 83-2 \> BUCHBERGER B. \\ 83-2 \> Beispiele von Diplomarbeitsthemen im Rahmen der Arbeitsgruppe \\ 83-2 \> CAMP-Linz \\ 83-2 \> Interner Bericht \\ 83-2 \> Organisation. Education.\\ \\ 83-3 \> BUCHBERGER B., LICHTENBERGER F., RUNCK P.O., SCHL{\"O}GLMANN W. \\ 83-3 \> Empfehlung f{\"u}r die EDV-Ausbildung der Mathematik-\\ 83-3 \> Lehramtskandidaten \\ 83-3 \> Proposal \\ 83-3 \> Education. \\ \\ 83-4 \> BUCHBERGER B. \\ 83-4 \> Anleitung zum wissenschaftlichen Arbeiten (Bereich CAMP) \\ 83-4 \> Vorlesungsskriptum \\ 83-4 \> Education. Organisation.\\ \\ 83-5 \> BUCHBERGER B. \\ 83-5 \> A Critical-Pair/Completion Algorithm for Finitely Generated\\ 83-5 \> Ideals in Rings \\ 83-5 \> In: Proc. Symposium "Rekursive Kombinatorik", M{\"u}nster, May 23-28,\\ 83-5 \> LNCS, vol. 171, pp. 137-161 \\ 83-5 \> Gr{\"o}bner Bases.\\ \\ 83-6 \> STREICHER T. \\ 83-6 \> Proving Inductive Properties of Abstract Data Types Without \\ 83-6 \> Induction \\ 83-6 \> Report \\ 83-6 \> Automatic Programming. Abstract Data Types.\\ \\ 83-7 \> CAMP \\ 83-7 \> Publications and Reports of the Working Group 1982 \\ 83-7 \> Documentation \\ 83-7 \> Organisation.\\ \\ 83-8 \> BACHMAIR L., BUCHBERGER B., LICHTENBERGER F., STREICHER T. \\ 83-8 \> Vortr{\"a}ge bei der Tagung "Berichte aus Informatikinstituten",\\ 83-8 \> Innsbruck, 1.-3. M{\"a}rz 1983 \\ 83-8 \> Lecture Notes \\ 83-8 \> Organisation. Automated Theorem Proving. Abstract Data Types.\\ \\ 83-9 \> BUCHBERGER B. \\ 83-9 \> The Application of Algorithm Types. An Approach to Automatic\\ 83-9 \> Programming \\ 83-9 \> Internal Report \\ 83-9 \> Automatic Programming.\\ \\ 83-10 \> GOTTLOB G., LEITSCH A., ORTNER H. \\ 83-10 \> VTP - Ein Automatisches Beweisprogramm \\ 83-10 \> Wirtschaftsuniv. Wien, Institut f. Statistik \\ 83-10 \> Internal Report \\ 83-10 \> Automated Theorem Proving.\\ \\ 83-11 \> BUCHBERGER B., REICHL E. \\ 83-11 \> Vorschlag f{\"u}r einen Studienschwerpunkt K{\"u}nstliche\\ 83-11 \> Intelligenz an der TNF der Universit{\"a}t Linz \\ 83-11 \> Proposal \\ 83-11 \> Artificial Intelligence.\\ \\ 83-12 \> ASPETSBERGER K. \\ 83-12 \> Parallel Algorithm for the Minimum Cost Spending Tree Problem on\\ 83-12 \> L-Networks \\ 83-12 \> Technical Report \\ 83-12 \> Parallel Computation.\\ \\ 83-13 \> BUCHBERGER B. \\ 83-13 \> Components for Restructurable Multi-Micro-Processor Systems of\\ 83-13 \> Arbitrary Topology \\ 83-13 \> Proc. of MIMI 83, Lugano, pp. 67-71 \\ 83-13 \> Parallel Computation.\\ \\ 83-14 \> BUCHBERGER B., WINKLER F. \\ 83-14 \> A Criterion for Eliminiating Unnecessary Reductions in the\\ 83-14 \> Knuth-Bendix Algorithm \\ 83-14 \> Technical Report \\ 83-14 \> Critical Pair Completion.\\ \\ 83-15 \> BACHMAIR L. \\ 83-15 \> Einf{\"u}hrung in die Programmverifikation \\ 83-15 \> Vorlesungsskriptum \\ 83-15 \> Program Verification.\\ \\ 83-16 \> BACHMAIR L. \\ 83-16 \> Datenflu{\ss}analyse: Grundlagen und Anwendungen in der\\ 83-16 \> Softwaretechnik \\ 83-16 \> Technical Report \\ 83-16 \> Software Technology. \\ \\ 83-18 \> BACHMAIR L., FUNK G. \\ 83-18 \> Implementation of the Nelson-Oppen Method for Combining Decision \\ 83-18 \> Procedures: Implementation Guide (Second Version) \\ 83-18 \> Technical Report \\ 83-18 \> Automated Theorem Proving.\\ \\ 83-19 \> ROLLETSCHEK H. \\ 83-19 \> Proof that $ Z_Z $ is a Reduction Ring \\ 83-19 \> Technical Report \\ 83-19 \> Gr{\"o}bner Bases.\\ \\ 83-20 \> KUTZLER B. \\ 83-20 \> The Loveland/Shostak Procedure - A Method to Simplify\\ 83-20 \> Interpreted Formulas \\ 83-20 \> Diplomarbeit \\ 83-20 \> Automated Theorem Proving.\\ \\ 83-21 \> BUCHBERGER B. \\ 83-21 \> A Critical-Pair/Completion Algorithm in Reduction Rings \\ 83-21 \> Technical Report \\ 83-21 \> Gr{\"o}bner Bases.\\ \\ 83-22 \> WINKLER F., BUCHBERGER B. \\ 83-22 \> A Criterion for Eliminating Unnecessary Redctions in the\\ 83-22 \> Knuth-Bendix Algorithm \\ 83-22 \> In: Proc. Coll. on Algebra, Combinatorics and Logic in Computer \\ 83-22 \> Science, Gy{\"o}r 1983, pp. 846-869 \\ 83-22 \> Critical Pair Completion.\\ \\ 83-23 \> RUDALICS M. \\ 83-23 \> An Intelligent Graphics Terminal's Intermediate Database \\ 83-23 \> Eurographics'83, North Holland \\ 83-23 \> Graphics.\\ \\ 83-24 \> BUCHBERGER B. \\ 83-24 \> Gr{\"o}bner Bases: A Method in Symbolic Mathematics \\ 83-24 \> Invited paper for the 5th Int. Conf. on Simulation, Programming\\ 83-24 \> and Math. Methods for Solving Physical Problems, JINR, Dubna \\ 83-24 \> Gr{\"o}bner Bases.\\ \\ 83-25 \> WINKLER F. \\ 83-25 \> On the Complexity of the Gr{\"o}bner-Bases Algorithm over K[x,y,z] \\ 83-25 \> Technical Report \\ 83-25 \> Gr{\"o}bner Bases.\\ \\ 83-26 \> WINKLER F. \\ 83-26 \> On the Complexity of the Gr{\"o}bner-Bases Algorithm over K[x,y,z] \\ 83-26 \> Proc. EUROSAM 84, Cambridge, LNCS \\ 83-26 \> Gr{\"o}bner Bases.\\ \\ 83-27 \> KRISHNAMURTHY E.V. \\ 83-27 \> Hensel's Methods in Linear Algebraic Computing I \\ 83-27 \> Technical Report \\ 83-27 \> Computer Algebra Algorithms.\\ \\ 83-28 \> KRISHNAMURTHY E.V. \\ 83-28 \> Hensel's Methods in Linear Algebraic Computing II \\ 83-28 \> Technical Report \\ 83-28 \> Computer Algebra Algorithms.\\ \\ 83-29 \> BUCHBERGER B. \\ 83-29 \> Gr{\"o}bner Bases: An Algorithmic Method in Polynomial Ideal \\ 83-29 \> Theory \\ 83-29 \> As chapter 6 in: N.K. Bose ed.: "Recent Trends in\\ 83-29 \> Multidimensional Systems Theory", D. Reidel Publ. Company \\ 83-29 \> Gr{\"o}bner Bases.\\ \\ 83-30 \> BUCHBERGER B., KRISHNAMURTHY E.V., WINKLER F. \\ 83-30 \> Gr{\"o}bner Bases, Polynomial Remainder Sequences and Decoding of\\ 83-30 \> Multivariable Codes \\ 83-30 \> In: N.K. Bose ed.: "Recent Trends in Multidimensional Systems\\ 83-30 \> Theory", D. Reidel Publ. Company \\ 83-30 \> Gr{\"o}bner Bases. Hensel Codes.\\ \\ 83-31 \> KRISHNAMURTHY E.V. \\ 83-31 \> Parallel Relaxation Algorithm for Sub-Structure Snatching Using\\ 83-31 \> Restructurable Multi-Microprocessor Systems \\ 83-31 \> Technical Report \\ 83-31 \> Parallel Computation.\\ \\ 83-32 \> KUTZLER B., LICHTENBERGER F. \\ 83-32 \> Grundkurs Programmierung \\ 83-32 \> Fernstudienskriptum \\ 83-32 \> Education. Programming.\\ \\ 83-33 \> BUCHBERGER B. \\ 83-33 \> A Survey of G{\"o}bner Bases for Solving Problems in Connection\\ 83-33 \> with Systems of Multi-variable Polynomials \\ 83-33 \> In: N. Inada, T. Soma (eds.) Proc. Symb. and Algebr. Comp. by\\ 83-33 \> Computers, pp. 69-83, World Scientific Publ. (1985) \\ 83-33 \> Gr{\"o}bner Bases.\\ \\ 84-1 \> WINKLER F. \\ 84-1 \> Eine ausf{\"u}hrliche Darstellung des Gosper-Algorithmus zur\\ 84-1 \> Berechnung von Partialsummen von Reihen \\ 84-1 \> Technical Report \\ 84-1 \> Computer Algebra Algorithms.\\ \\ 84-2 \> BUCHBERGER B. \\ 84-2 \> The Present State of the L-Networks Project \\ 84-2 \> Proc. MIMI 84. Bari, pp. 178-181 \\ 84-2 \> Parallel Computation.\\ \\ 84-3 \> BUCHBERGER B. \\ 84-3 \> Automatisches Programmieren \\ 84-3 \> chapter 8 in Retti et al (eds.): K{\"u}nstliche Intelligenz\\ 84-3 \> Teubner-Verlag \\ 84-3 \> Automatic Programming.\\ \\ 84-4 \> BUCHBERGER B. \\ 84-4 \> Mathematik f{\"u}r Informatiker II\\ 84-4 \> (Probleml{\"o}sestrategien und Algorithmentypen) \\ 84-4 \> Vorlesungsskriptum \\ 84-4 \> Mathematics for Computer Science.\\ \\ 84-5 \> GOTTLOB G., LEITSCH A. \\ 84-5 \> On the Efficiency of Subsumption Algorithms \\ 84-5 \> Technical Report \\ 84-5 \> Automated Theorem Proving.\\ \\ 84-6 \> ZASSENHAUS H. \\ 84-6 \> Symbol Manipulation and Symmetry Breaking \\ 84-6 \> Technical Report \\ 84-6 \> Computer Algebra Algorithms.\\ \\ 84-7 \> BIBEL W. \\ 84-7 \> Automatische Inferenz \\ 84-7 \> Chapter 7 in Retti et al (eds.): K{\"u}nstliche Intelligenz, \\ 84-7 \> Teubner-Verlag \\ 84-7 \> Automated Theorem Proving.\\ \\ 84-8 \> LEITSCH A. \\ 84-8 \> On the Theorem of Rice in Subrecursive Classes \\ 84-8 \> Technical Reports \\ 84-8 \> Algorithm Theory.\\ \\ 84-9 \> BAAZ M., LEITSCH A. \\ 84-9 \> Eine Methode zur Reduktion des Synthese-Problems \\ 84-9 \> Technical Report \\ 84-9 \> Automatic Programming.\\ \\ 84-10 \> LICHTENBERGER F. \\ 84-10 \> Computer-Algebra: Die n{\"a}chste Herausforderung an die Didaktik\\ 84-10 \> der Mathematik \\ 84-10 \> in: R. Schoper ed.: Proc. Tagung Hochschuldidaktik Mathematik,\\ 84-10 \> 4.-6.10.83, Kassel, BRD \\ 84-10 \> Education. Computer Algebra Applications.\\ \\ 84-11 \> LICHTENBERGER F. \\ 84-11 \> Algebraically Specified Abstract Data Types in PL/I \\ 84-11 \> In: M. H. Hamza ed.: Applied Mathematics, IASTED, Aeta Press \\ 84-11 \> Abstract Data Types.\\ \\ 84-12 \> ASPETSBERGER K. \\ 84-12 \> Some Examples of Parallel Algorithms for L-Networks \\ 84-12 \> In: Proc. MIMI 84, Bori, Haly, pp. 182-185 \\ 84-12 \> Parallel Computation.\\ \\ 84-13 \> WINKLER F. \\ 84-13 \> The Church-Rosser Property in Computer Algebra and Special\\ 84-13 \> Theorem Proving: An Investigation of Critical-Pair/Completion\\ 84-13 \> Algorithms \\ 84-13 \> Dissertation \\ 84-13 \> Gr{\"o}bner Bases. Critical Pair Completion.\\ \\ 84-14 \> LICHTENBERGER F. \\ 84-14 \> Computer-Algebra am Arbeitsplatz des Ingeneurs und in der Schule\\ 84-14 \> der Zukunft \\ 84-14 \> In J. M{\"u}hlbacher ed.: Proc. of "Microelektronic f{\"u}r den\\ 84-14 \> Menschen", Linz \\ 84-14 \> Computer Algebra Application. Education. Politics.\\ \\ 84-15 \> BIBEL W., ASPETSBERGER K. \\ 84-15 \> A Bibliography on Parallel Inference Machines \\ 84-15 \> In: J. Symbolic Computation (1985), 1/1, pp. 115-118, Academic\\ 84-15 \> Press Inc., London \\ 84-15 \> Parallel Computation. Automated Theorem Proving.\\ \\ 84-17 \> LICHTENBERGER F. \\ 84-17 \> Self-Explanatory Symbolic Computation for Math Education \\ 84-17 \> Position Paper presented at ICME 5, Australien \\ 84-17 \> In SIGSAM-Bulletin, vol. 18, no. 4. \\ 84-17 \> Computer Algebra Application. Education. Politics.\\ \\ 84-18 \> ASPETSBERGER K., FUNK G. \\ 84-18 \> Experiments with muMATH in Austrian High Schools \\ 84-18 \> In SIGSAM-Bulletin, vol. 18, no. 4, pp. 4--7. \\ 84-18 \> Computer Algebra Applications. Education.\\ \\ 84-19 \> BIBEL W., BUCHBERGER B. \\ 84-19 \> Towards a Connection Machine for Logical Inference \\ 84-19 \> In "Future Generations Computer Systems", North Holland,\\ 84-19 \> pp. 177-188 \\ 84-19 \> Parallel Computation. Automated Theorem Proving.\\ \\ 84-20 \> MORA F. \\ 84-20 \> An Algorithmic Approach to Local Rings \\ 84-20 \> Technical Report \\ 84-20 \> Gr{\"o}bner Bases.\\ \\ 84-21 \> M{\"O}LLER H.M., MORA F. \\ 84-21 \> Computational Aspects of Reduction Strategies to Construct\\ 84-21 \> Resolutions of Monomial Ideals \\ 84-21 \> Technical Report \\ 84-21 \> Gr{\"o}bner Bases.\\ \\ 84-22 \> BUCHBERGER B., LICHTENBERGER F. \\ 84-22 \> Mathematik f. Informatiker: Ein algorithmenorientierter Ansatz\\ 84-22 \> an der Universit{\"a}t Linz \\ 84-22 \> In: Tagungsband "Symposium Lehr- und Lernprozesse in der\\ 84-22 \> Ingenieurausbildung, Graz, Okt. 84 \\ 84-22 \> Mathematics for Computer Science.\\ \\ 84-23 \> LICHTENBERGER F. \\ 84-23 \> Computer-Algebra im Mathematikunterricht der Zukunft \\ 84-23 \> In Proc. 4. K{\"a}rntner Symposium Didaktik der Mathematik,\\ 84-23 \> Klagenfurt \\ 84-23 \> Computer Algebra Applications. Education. \\ \\ 85-1 \> ASPETSBERGER K. \\ 85-1 \> Substitution Expressions: Extracting Solutions of Non-Horn \\ 85-1 \> Clause Proofs \\ 85-1 \> In B.F. Caviness ed.: Proc. EUROCAL'85, Linz, Austria, April 1-3,\\ 85-1 \> 1986, Springer Verlag, Lecture Notes in Computer Science, vol.\\ 85-1 \> 204, pp. 78-86 \\ 85-1 \> Automated Theorem Proving. Parallel Computation. Logic 85-1 \> Programming\\ \\ 85-2 \> BUCHBERGER B. \\ 85-2 \> CAMP-{\"U}berblick \\ 85-2 \> Lecture Notes \\ 85-2 \> Symbolic Computation.\\ \\ 85-3 \> BUCHBERGER B. \\ 85-3 \> Mathematik f{\"u}r Informatiker II - Mathematische Modelle,\\ 85-3 \> Strukturen, Datentypen \\ 85-3 \> Lecture Notes \\ 85-3 \> Mathematics for Computer Science.\\ 85-3 \> \\ \\ 85-4 \> BUCHBERGER B., HINTENAUS P. \\ 85-4 \> The L-Language for the Parallel L-Machine - A Parallel\\ 85-4 \> Architecture for AI Applications \\ 85-4 \> In Trost/Retti eds.: Proc. {\"O}GAI-Tagung 1985, Wien, Austria,\\ 85-4 \> Sept. 24-27, Springer Verlag, Informatik Fachberichte, vol. 106,\\ 85-4 \> pp. 120-131 \\ 85-4 \> Parallel Computation.\\ \\ 85-5 \> PADAWITZ P. \\ 85-5 \> Abstrakte Datentypen \\ 85-5 \> Lecture Notes \\ 85-5 \> Abstract Data Types.\\ \\ 85-6 \> BUCHBERGER B. \\ 85-6 \> History and Basic Features of the Critical-Pair/Completion\\ 85-6 \> Approach \\ 85-6 \> In Proc. Rewriting Techniques and Applications 1985, Dijon,\\ 85-6 \> France, May 20-22, Springer Verlag, Lecture Notes in Computer\\ 85-6 \> Sience, vol. 202, pp. 1-45 \\ 85-6 \> Critical Pair Completion.\\ \\ 85-7 \> BAUMG{\"A}RTLER T. \\ 85-7 \> An MProlog Primer (VM/CMS Version) \\ 85-7 \> Technical Report \\ 85-7 \> Logic Programming.\\ \\ 85-8 \> ASPETSBERGER K., BAYERL S. \\ 85-8 \> Two Parallel Versions of the Connection Method for Propositional\\ 85-8 \> Logic on the L-Machine \\ 85-8 \> Proc. GWAI'85, Dassel/Solingen, FRG, Sept. 23-28, Springer\\ 85-8 \> Verlag, Informatik Fachbericht \\ 85-8 \> Parallel Computation. Automated Theorem Proving. \\ \\ 85-9 \> ASPETSBERGER K. \\ 85-9 \> Towards Parallel Machines for Artificial Intelligence:\\ 85-9 \> Realization of the Alice Architecture by the L-Components \\ 85-9 \> In Trost/Retti eds.: Proc. {\"O}GAI-Tagung 1985, Wien, Austria,\\ 85-9 \> Sept. 24-27, Springer Verlag, Informatik Fachberichte, vol. 106,\\ 85-9 \> pp 108-119 \\ 85-9 \> Parallel Computation. Artificial Intelligence.\\ \\ 85-10 \> RUDALICS M. \\ 85-10 \> Parallel Memory Management on a Multimecroprocessor System \\ 85-10 \> Proc. EUROMICRO'85 Symposium, Brussels, Belgium, Sept., North\\ 85-10 \> Holland, pp. 335-344 \\ 85-10 \> Parallel Computation. Software Technology.\\ \\ 85-11 \> LINEMAYR I., RUDALICS M. \\ 85-11 \> Parallele Speicherverwaltung f{\"u}r einen graphischen\\ 85-11 \> Arbeitsplatzrechner \\ 85-11 \> In Proc. GI/OCG/{\"O}GI Jahrestagung'85, Wien, Austria, Springer\\ 85-11 \> Verlag, Informatik Fachberichte, vol. 108, pp. 427-438 \\ 85-11 \> Parallel Computation. Software Technology. Graphics.\\ \\ 85-12 \> RUDALICS M. \\ 85-12 \> Multiprocessing Memory Management on a Graphic Workstation \\ 85-12 \> In Proc. Int. Symp. New Directions in Computing, Trondheim,\\ 85-12 \> Norway, Aug. 12-14, IEEE Computer Society Press, 368-377 \\ 85-12 \> Parallel Computation. Software Technology. Graphics.\\ \\ 85-13 \> LINEMAYR I., RUDALICS M. \\ 85-13 \> Storage Management Bibliography \\ 85-13 \> Technical Report \\ 85-13 \> Software Technology.\\ \\ 85-14 \> HENZINGER T. A., HOFBAUER H. \\ 85-14 \> Proof-Pad: An Interactive Proof Generating System Using Natural\\ 85-14 \> Language Deduction \\ 85-14 \> In Trost/Retti eds.: Proc. {\"O}GAI-Tagung 1985, Wien, Austria,\\ 85-14 \> Sept. 24-27, Springer Verlag, Informatik Fachberichte, vol. 106,\\ 85-14 \> pp. 173-184 \\ 85-14 \> Automated Theorem Proving.\\ \\ 85-15 \> RUDALICS M. \\ 85-15 \> A Modeller-Friendly Device Interface \\ 85-15 \> In Proc. 6th Int. Symp. Computer Aided Design, Zagreb,\\ 85-15 \> Yugoslavia, Oct. 1984, pp. 33-38 \\ 85-15 \> Software Technology.\\ \\ 85-16 \> NAUMANN B., RUDALICS M. \\ 85-16 \> Text Processing in a Small Scale Environment \\ 85-16 \> In Proc. 4th Int. Microcomputer Applications Conf., Hibiya,\\ 85-16 \> Japan, May 28-30, 1984, pp. 102-109 \\ 85-16 \> Software Technology.\\ \\ 85-17 \> KUTZLER B., STIFTER S. \\ 85-17 \> On the Application of Buchberger's Algorithm to Automated\\ 85-17 \> Geometry Theorem Proving \\ 85-17 \> In Journal of Symbolic Computation, vol. 2, pp. 389--397 \\ 85-17 \> Geo Theorem Proving.\\ \\ 85-18 \> DITTENBERGER K. \\ 85-18 \> Hensel Codes: An Efficient Method for Exact Numerical\\ 85-18 \> Computation \\ 85-18 \> Diploma Thesis \\ 85-18 \> Computer Algebra Algorithms.\\ \\ 85-19 \> DITTENBERGER K. \\ 85-19 \> Hensel Codes: Program Documentation \\ 85-19 \> Technical Report \\ 85-19 \> Computer Algebra Algorithms.\\ \\ 85-20 \> HENZINGER T. A. \\ 85-20 \> Bibliography on First-Order Non-Resolution Theorem Proving\\ 85-20 \> Techniques \\ 85-20 \> Technical Report \\ 85-20 \> Automated Theorem Proving.\\ \\ 85-21 \> HENZINGER T. A. \\ 85-21 \> Resolution: A Special Case of the Manna-Waldinger Relation\\ 85-21 \> Replacement Rule \\ 85-21 \> Technical Report \\ 85-21 \> Automated Theorem Proving.\\ \\ 85-22 \> BUCHBERGER B. \\ 85-22 \> EUROCAL'85 - Proceedings Vol. 1: Invited Lectures \\ 85-22 \> Springer Verlag, Lecture Notes in Computer Science, vol. 203 \\ 85-22 \> Symbolic Computation. Computer Algebra.\\ \\ 85-23 \> CAVINESS B. F. \\ 85-23 \> EUROCAL'85 - Proceedings Vol. 2: Research Contributions \\ 85-23 \> Springer Verlag, Lecture Notes in Computer Science, vol. 204 \\ 85-23 \> Symbolic Computation. Computer Algebra.\\ \\ 85-24 \> BUCHBERGER B. \\ 85-24 \> The L-Machine: An Attempt at Parallel Hardware for Symbolic\\ 85-24 \> Computation \\ 85-24 \> In J. Calmet ed.: Proc. 3rd Int. Conf. Algebraic Algorithms and\\ 85-24 \> Error-Correcting Codes, Grenoble, France, July 15-19, 1985,\\ 85-24 \> Springer Verlag, Lecture Notes in Computer Science, vol. 229,\\ 85-24 \> 333-347 \\ 85-24 \> Parallel Computation.\\ \\ 85-25 \> BUCHBERGER B., DITTENBERGER K. \\ 85-25 \> Exact Computation by Hensel Codes: Complete Procedures \\ 85-25 \> Conf. Computer Algebra and Its Applications in Theoretical\\ 85-25 \> Physics, Dubna, USSR, Sept. 17-20, Invited Paper \\ 85-25 \> Computer Algebra Algorithms.\\ \\ 85-26 \> FUNK G. \\ 85-26 \> Verifikation der Prozedur TA-NORMAL aus dem PATH-TRACE-COUNTER ---\\ 85-26 \> Eine Fallstudie \\ 85-26 \> Technical Report \\ 85-26 \> Program Verification\\ \\ 85-27 \> ASPETSBERGER K., KASS P., KURFESS F. \\ 85-27 \> Report on Several Possible Multiprocessor Machine Architectures \\ 85-27 \> Deliverable for the ESPRIT Project 415-F \\ 85-27 \> Parallel Computation.\\ \\ 85-28 \> STIFTER S. \\ 85-28 \> Computation of Gr{\"o}bner Bases over the Integers and in General\\ 85-28 \> Reduction Rings \\ 85-28 \> Diploma Thesis \\ 85-28 \> Gr{\"o}bner Bases. \\ \\ 85-29 \> KUTZLER B., STIFTER S. \\ 85-29 \> Automated Geometry Theorem Proving Using Buchberger's Algorithm \\ 85-29 \> In B. W. Char ed.: Proc. SYMSAC'86, Waterloo, Canada, July 21-23,\\ 85-29 \> 1986, ACM Publications, pp. 209-214 \\ 85-29 \> Geo Theorem Proving. Gr{\"o}bner Bases.\\ \\ 85-30 \> ROIDER B. \\ 85-30 \> Withdrawing Keys from a Scatter Table \\ 85-30 \> Technical Reports \\ 85-30 \> Combinatorics. Software Technology. Data Structures.\\ \\ 86-1 \> KUTZLER B., STIFTER S. \\ 86-1 \> A Geometry Theorem Prover Based on Buchberger's Algorithm \\ 86-1 \> In: J.H. Siekmann ed. Proc. CADE-8, Oxford, England, July 27 -- \\ 86-1 \> Aug 1, 1986, LNCS, vol. 230, pp. 693--694, Springer Verlag \\ 86-1 \> VOEST-ALPINE AG Linz \\ 86-1 \> Geo Theorem Proving. Gr{\"o}bner Bases.\\ \\ 86-2 \> HINTENAUS P. \\ 86-2 \> The L-Compiler and the L-Monitor. Two Tools for Programming the \\ 86-2 \> Parallel L-Machine \\ 86-2 \> Diploma Thesis \\ 86-2 \> SIEMENS AG M{\"u}nchen \\ 86-2 \> Parallel Computation.\\ \\ 86-3 \> HADZIKADIZ M., LICHTENBERGER F., YUN D.Y.Y. \\ 86-3 \> An Application of Knowledge-Base Technology in Education: A Geometry\\ 86-3 \> Theorem Prover \\ 86-3 \> In: B.W. Char ed. Proc. SYMSAC'86, Waterloo, Canada, July 21--23,\\ 86-3 \> 1986, ACM Publications no. 505860, pp. 141--147 \\ 86-3 \> Southern Methodist Univ. \\ 86-3 \> Geo Theorem Proving. Education.\\ \\ 86-4 \> KASS P. \\ 86-4 \> The L-Assembler --- A Basic Software Tool for Programming the\\ 86-4 \> Parallel L-Machine \\ 86-4 \> Diploma Thesis \\ 86-4 \> SIEMENS AG M{\"u}nchen \\ 86-4 \> Parallel Computation.\\ \\ 86-5 \> KUTZLER B., STIFTER S. \\ 86-5 \> New Approaches to Computerized Proofs of Geometry Theorems \\ 86-5 \> European Community (project COST 13) \\ 86-5 \> Geo Theorem Proving.\\ \\ 86-6 \> SAKATA S. \\ 86-6 \> Finding a Minimal Set of Linear Recurring Relations Capable of \\ 86-6 \> Generating a Given Finite Two-Dimensional Array \\ 86-6 \> Submitted to J. Symbolic Computation\\ 86-6 \> SIEMENS AG M{\"u}nchen \\ 86-6 \> Gr{\"o}bner Bases. Coding Theory.\\ \\ 86-7 \> BUCHBERGER B., KUTZLER B. \\ 86-7 \> Computer-Algebra fuer den Ingenieur \\ 86-7 \> In Buchberger et al: Rechnerorientierte Verfahren, Teubner Verlag, \\ 86-7 \> pp. 11-68\\ 86-7 \> IBM Vienna, IBM Yorktown Heights, SIEMENS AG M{\"u}nchen \\ 86-7 \> Computer Algebra.\\ \\ 86-8 \> ROIDER B., STADLBAUER H. \\ 86-8 \> The Forward Kinematics of Robots in Computer-Aided Design \\ 86-8 \> Technical Report \\ 86-8 \> VOEST-ALPINE AG Linz \\ 86-8 \> Robot Programming.\\ \\ 86-9 \> STADLBAUER H. \\ 86-9 \> Decomposition of Univariate Polynomials --- Algorithms and \\ 86-9 \> Theoretical Results \\ 86-9 \> Diploma Thesis \\ 86-9 \> SIEMENS AG M{\"u}nchen \\ 86-9 \> Computer Algebra Algorithms.\\ \\ 86-10 \> GAERTNER J. \\ 86-10 \> Summation in Finite Terms --- Presentation and Implementation of \\ 86-10 \> M. Karr's Algorithm \\ 86-10 \> Diploma Thesis (internal use only) \\ 86-10 \> SIEMENS AG M{\"u}nchen \\ 86-10 \> Computer Analysis. Computer Algebra Algorithms.\\ \\ 86-11 \> STIFTER S. \\ 86-11 \> Intersection of Superellipsiods with Spheres and Planes \\ 86-11 \> Technical Report \\ 86-11 \> VOEST-ALPINE AG Linz \\ 86-11 \> Computational Geometry. Robot Programming.\\ \\ 86-12 \> KUTZLER B., STIFTER S. \\ 86-12 \> Collection of Computerized Proofs of Geometry Theorems \\ 86-12 \> Technical Reports \\ 86-12 \> VOEST-ALPINE AG Linz \\ 86-12 \> Geo Theorem Proving.\\ \\ 86-13 \> BAAZ M., LEITSCH. \\ 86-13 \> Strong Inference in Automated Theorem Proving \\ 86-13 \> Technical Report \\ 86-13 \> VOEST-ALPINE AG Linz \\ 86-13 \> Automated Theorem Proving.\\ \\ 86-14 \> RUDALICS M. \\ 86-14 \> Distributed Copying Garbage Collection \\ 86-14 \> In Proc. LISP and Functional Programming, Cambridge, USA, Aug. \\ 86-14 \> 4-6, 1986, ACM Publications (order no. 552860), pp. 364-372\\ 86-14 \> SIEMENS AG M{\"u}nchen \\ 86-14 \> Software Technology. Functional Programming. Parallel Computation.\\ \\ 86-15 \> BAUMG{\"A}RTLER T. \\ 86-15 \> PROLOG for Geometric Construction \\ 86-15 \> Diploma Thesis \\ 86-15 \> VOEST-ALPINE AG Linz \\ 86-15 \> Geo Theorem Proving. Logic Programming.\\ \\ 86-16 \> HENZINGER T. A. \\ 86-16 \> Denotational Equivalence of Goal-Driven and Data-Driven \\ 86-16 \> Interpretation of Applicative Programs \\ 86-16 \> Diploma Thesis \\ 86-16 \> Univ. Delaware \\ 86-16 \> Semantics of Programming Languages.\\ \\ 86-17 \> LICHTENBERGER F. \\ 86-17 \> Programmverifikation und Programmsynthese \\ 86-17 \> In: Handbuch der Modernen Datenverarbeitung --- Formale Methoden\\ 86-17 \> in der Systementwicklung, Forkel-Verlag, Heft 130, Juli 1986, \\ 86-17 \> 23. Jahrgang, ISSN 0723-5208, pp. 117-127\\ 86-17 \> Automatic Programming.\\ \\ 86-18 \> WINKLER F. \\ 86-18 \> Solution of Equations I: Polynomial Ideals and Gr{\"o}bner Bases\\ 86-18 \> Lecture Notes in Pure and Applied Mathematics 125, 86-18 \> D.V. Chudnovsky, R.D. Jenks (eds.), 86-18 \> Marcel Dekker Inc., 1990. 86-18 \> Univ. Delaware \\ 86-18 \> Gr{\"o}bner Bases.\\ \\ 86-19 \> LEITSCH A. \\ 86-19 \> H{\"o}here Programmiersprachen f{\"u}r das Assemblierungsproblem bei\\ 86-19 \> Robotern \\ 86-19 \> Technical Report \\ 86-19 \> VOEST-ALPINE AG Linz \\ 86-19 \> Robot Programming.\\ \\ 86-20 \> IMHOFF R. \\ 86-20 \> Subsumptionsalgorithmen und ihre Effizienz \\ 86-20 \> Diploma Thesis \\ 86-20 \> Automated Programming.\\ \\ 86-21 \> BUCHBERGER B., ASPETSBERGER K., FUNK G., HINTENAUS P., KASS P.,\\ 86-21 \> KUSCHE K., LICHTENBERGER F. \\ 86-21 \> The New L-Machine: A Parallel Machine for Symbolic and Numeric\\ 86-21 \> Computation \\ 86-21 \> Proposal (internal use only) \\ 86-21 \> NIXDORF Computer AG Paderborn \\ 86-21 \> Parallel Computation.\\ \\ \normal{ \newrep \ypar{87-1 } WINKLER F. \ypar{87-1 } A p-adic Approach to the Computation of Gr{\"o}bner Bases \kind{Technical Report } \spons{{\"O}sterreichische Forschungsgemeinschaft } \key{Gr{\"o}bner Bases.} } \publ{ \newrep \ypar{87-2 } ROIDER B., STIFTER S. \ypar{87-2 } Collision of Convex Objects \kind{J. Davenport ed., Proc. EUROCAL'87, Leipzig, GDR, June 2--5, 1987, LNCS 378, Springer, pp. 258--259. } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. Robot Programming.} } \publ{ \newrep \ypar{87-3 } STIFTER S., ROIDER S. \ypar{87-3 } Collision of Convex Objects in the Plane \kind{In: G. Pernul, A Min Tjoa eds. Proc. 10. Tagung - Berichte aus Informatik Forschungsinstitutionen, Vienna, Austria, Feb. 25--27, 1987, pp. 359--368, Oldenburg Verlag } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. Robot Programming.} } \publ{ \newrep \ypar{87-4 } HEINZELREITER J., KUSCHE K., KUTZLER B., MAYR H. \ypar{87-4 } A Geometry Theorem Proving Package in SCRATCHPAD II \kind{In: G. Pernul, A Min Tjoa eds. Proc. 10. Tagung - Berichte aus Informatik Forschungsinstitutionen, Vienna, Austria, Feb. 25--27, 1987, pp. 349--358, Oldenburg Verlag } \spons{VOEST-ALPINE AG Linz } \key{Geo Theorem Proving.} } \publ{ \newrep \ypar{87-5 } HELD M. \ypar{87-5 } Extensions and Improvements of a Pocket Machining Algorithm by Means \ypar{87-5 } of Computational Geometry \kind{In: G. Pernul, A Min Tjoa eds. Proc. 10. Tagung - Berichte aus Informatik Forschungsinstitutionen, Vienna, Austria, Feb. 25--27, 1987, pp. 477--486, Oldenburg Verlag } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. CAM. } } \publ{ \newrep \ypar{87-6 } MAYR H. \ypar{87-6 } Automatisches Generieren von Stanzwegen f{\"u}r beliebige Blechkonturen \kind{In: G. Pernul, A Min Tjoa eds. Proc. 10. Tagung - Berichte aus Informatik Forschungsinstitutionen, Vienna, Austria, Feb. 25--27, 1987, pp. 467--476, Oldenburg Verlag } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. CAM.} } \publ{ \newrep \ypar{87-7 } BAUMG{\"A}RTLER T. \ypar{87-7 } PROLOG for Geometric Construction \kind{In: G. Pernul, A Min Tjoa eds. Proc. 10. Tagung - Berichte aus Informatik Forschungsinstitutionen, Vienna, Austria, Feb. 25--27, 1987, pp. 233--242, Oldenburg Verlag } \spons{VOEST-ALPINE AG Linz } \key{Geo Theorem Proving. Logic Programming.} } \normal{ \newrep \ypar{87-8 } STIFTER S. \ypar{87-8 } On the Programming of Robot Manipulators --- An Annotated Bibliography \spons{VOEST-ALPINE AG Linz } \key{Robot Programming.} } \normal{ \newrep \ypar{87-9 } WINKLER F. \ypar{87-9 } A Recursive Method for Computing a Gr{\"o}bner Basis of a Module in $K[x_{1},\ldots,x_{n}]^{r}$ \kind{Technical Report } \spons{{\"O}sterreichische Forschungsgemeinschaft } \key{Gr{\"o}bner Bases.} } \normal{ \more{ \newrep \ypar{87-10 } HIRSCHBERG W. \ypar{87-10 } Symbolische und Numerische Methoden der Dynamik (Mit Anwendungen auf Industrieroboter) \kind{Lecture Notes } \key{Robot Programming.} }} \normal{ \newrep \ypar{87-11 } WINKLER F. \ypar{87-11 } Turing-Maschinen: Grenzen der Berechenbarkeit \kind{Lecture Notes } \spons{{\"O}sterreichische Forschungsgemeinschaft } \key{Algorithm Theory.} } \publ{ \newrep \ypar{87-12 } BUCHBERGER B. \ypar{87-12 } The Parallelization of Critical-Pair/Completion Procedures on the \ypar{87-12 } L-Machine \kind{Proc. Japanese Symp. on Functional Programming (invited paper), Feb. 1987} \key{Parallel Computation. Critical Pair Completion.} } \publ{ \newrep \ypar{87-13 } BUCHBERGER B. \ypar{87-13 } What Can Gr{\"o}bner Bases Do For Computational Geometry and Robotics? \kind{In: Proc. Workshop on Geometric Reasoning (invited paper), Oxford, England, June 1986 } \spons{VOEST-ALPINE AG Linz } \key{Gr{\"o}bner Bases. Geo Reasoning.} } \publ{ \newrep \ypar{87-14 } KUTZLER B. \ypar{87-14 } Introduction to Buchberger's Gr{\"o}bner Bases Method \kind{In: H. Crapo ed. Proc. Workshop on Computer-Aided Geometric Reasoning (invited tutorial), INRIA Sophia Antipolis, France, June 22--26, 1987 pp. 5--26 } \spons{VOEST-ALPINE AG Linz, European Community (Project COST 13) } \key{Gr{\"o}bner Bases.} } \publ{ \newrep \ypar{87-15 } BUCHBERGER B. \ypar{87-15 } Application of Gr{\"o}bner Bases in Non-Linear Computational Geometry \kind{Proc. Workshop on Scientific Software (invited lecture) IMA, Minneapolis, USA, March 23--26, 1987, pp. 59-88, IMA Volumes in Mathematics and its Applications 14, Springer Verlag } \spons{VOEST-ALPINE AG Linz, SIEMENS AG M{\"u}nchen } \key{Gr{\"o}bner Bases. Geo Reasoning.} } \internal{ \newrep \ypar{87-16 } KUTZLER B. \ypar{87-16 } Expert System Tools --- A Comparative Study \kind{Technical Report (internal use only) } \spons{SPORT AG } \key{Expert Systems.} } \publ{ \newrep \ypar{87-17 } STIFTER S. \ypar{87-17 } A Generalization of Reduction Rings \kind{In: Journal of Symbolic Computation, vol. 4(1987), pp. 351--364 } \spons{VOEST-ALPINE AG Linz } \key{Gr{\"o}bner Bases.} } \internal{ \newrep \ypar{87-18 } HINTENAUS P. \ypar{87-18 } The Inverse Kinematics System (Installation Guide, User's Manual, \ypar{87-18 } Program Documentation) \kind{Technical Report (internal use only) } \spons{VOEST-ALPINE AG Linz } \key{Robot Programming. Computer Algebra Applications.} } \special{ \newrep \ypar{87-19 } F{\"o}rderkreis RISC-LINZ \key{Politics. Organisation.} } \internal{ \newrep \ypar{87-20 } BUCHBERGER B. \ypar{87-20 } RISC: Interne Regelung f{\"u}r Projekte, Anstellungen, etc. \kind{Technical Report (internal use only) } \key{Organisation.} } \internal{ \newrep \ypar{87-21 } BAUMG{\"A}RTLER T. \ypar{87-21 } Bericht zur Vorstudie Expertensysteme in der SPORT AG \kind{Report (internal use only) } \spons{SPORT AG } \key{Expert Systems.} } \normal{ \newrep \ypar{87-22 } KALKBRENER M., STIFTER S. \ypar{87-22 } Some Examples for Using Quantifier Elimination for the Collision Problem \kind{Technical Report } \spons{VOEST-ALPINE AG Linz } \key{Robot Programming.} } \normal{ \more{ \newrep \ypar{87-23 } HELD M. \ypar{87-23 } Fully Automated Pocket Machinig by Means of Computational Geometry \kind{Diploma Thesis } \spons{VOEST-ALPINE AG Linz CAM} }} \normal{ \newrep \ypar{87-24 } MCCALLUM S. \ypar{87-24 } On Determination of the Topology of a Real Algebraic Curve Near a Point \kind{Technical Report } \spons{VOEST-ALPINE AG Linz } \key{Computer Algebra Algorithms. Robot Programming.} } \normal{ \newrep \ypar{87-25 } MCCALLUM S. \ypar{87-25 } Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition \kind{Technical Report } \spons{VOEST-ALPINE AG Linz } \key{Computer Algebra Algorithms. Robot Programming.} } \internal{ \newrep \ypar{87-26 } WINKLER F. \ypar{87-26 } Algorithmen und Software f{\"u}r die Algebraische Geometrie \kind{Proposal Project P6763, FFWF (internal use only) } \spons{{\"O}sterreichische Forschungsgemeinschaft } \key{Computer Algebra. Geo Reasoning.} } \publ{ \newrep \ypar{87-27 } PAULE P. \ypar{87-27 } A Remark on the Lemma of Ingleton and Pfiff and the Construction of \ypar{87-27 } Bijections \kind{In: Bayreuther Mathematische Schriften, Heft 25, pp. 123--127, 1987 Univ. Bayreuth } \key{Combinatorics.} } \internal{ \newrep \ypar{87-28 } STADLBAUER H. \ypar{87-28 } The Extension of a Robot Programming System for Providing \ypar{87-28 } Multitasking \kind{Technical Report (internal use only) } \spons{VOEST-ALPINE AG Linz } \key{Robot Programming. Parallel Computation.} } \internal{ \more{ \newrep \ypar{87-29 } KASS P., STEINACKER I. \ypar{87-29 } UIMS Benutzerhandbuch \kind{Technical Report (internal use only) } \spons{VOEST-ALPINE AG Linz } }} \normal{ \newrep \ypar{87-30 } KALKBRENER M. \ypar{87-30 } Application of Gr{\"o}bner Bases: Solution of Algebraic Equations and Decomposition of Radicals \kind{Diploma Thesis } \key{Gr{\"o}bner Bases.} } \internal{ \newrep \ypar{87-31 } BAUMGARTNER G., LICHTENBERGER F. \ypar{87-31 } Trusted Software in the Frame of the EUREKA-Project OASIS \kind{Proposal project OASIS, EUREKA (internal use only)} \spons{VOEST-ALPINE AG Linz, EUREKA project OASIS } \key{Program Verification.} } \normal{ \newrep \ypar{87-32 } MAYR H. \ypar{87-32 } An Efficient Moving Algorithm for Nesting Metal Sheets \kind{ $2^{nd}$ International Conference on Computer Aided Drafting, Design and manufacturing Technology (CADDM'89), Oct. 23-28, 1989, Hangzhou, China.} \spons{ Austrian Bundesministerium zur F{\"o}rderung des Wissenschaftl. Forschung, Project no. 609.506/1-26/88, and AIS Ges.m.b.H.} \key{Computational Geometry. CAM. Robotics.} } \publ{ \newrep \ypar{87-33 } LANGEMYR L., MCCALLUM S. \ypar{87-33 } The Computation of Polynomial Greatest Common Divisors Over an \ypar{87-33 } Algebraic Number Field \kind{Submitted to J. Symbolic Computation } \spons{VOEST-ALPINE AG Linz } \key{Computer Algebra Algorithms.} } \normal{ \newrep \ypar{87-34 } DITTENBERGER K. \ypar{87-34 } How to Enclose Boxes, Cylinders, Cones, and Pyramides Using Superellipsoids \kind{Technical Report } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. Robot Programming.} } \publ{ \newrep \ypar{87-35 } WINKLER F. \ypar{87-35 } Computer Algebra \kind{In: Encyclopedia of Physical Sciences and Technology vol. 3, pp. 328--356, Academic Press } \spons{Univ. Delaware } \key{Computer Algebra.} } \normal{ \newrep \ypar{87-36 } BLUROCK E. S. \ypar{87-36 } Automatic Synthetic Planning Project - System Philosophy and Developments \kind{Technical Report } \spons{CHEMIE LINZ AG } \key{Chemistry. Expert Systems.} } \publ{ \newrep \ypar{87-37 } ASPETSBERGER K., KUTZLER B. \ypar{87-37 } Symbolic Computation --- A New Chance For Education \kind{Proc. European Conference on Computers in Education, ECCE'88, Lausanne, Switzerland, July 24--29, 1988 } \spons{European Community (Project COST-13)} \key{87-37 } Symbolic Computation. Education.} } \internal{ \newrep \ypar{87-38 } BUCHBERGER B. \ypar{87-38 } User's Manual for GROEBNER, a Gr{\"o}bner Bases Package in the \ypar{87-38 } muMATH System \kind{Manual } \spons{Soft Warehouse, Inc., Hawaii } \key{ Gr{\"o}bner Bases.} } \internal{ \newrep \ypar{87-39 } BAUMGARTNER G. \ypar{87-39 } Floating-Slash Arithmetic: An Implementation in Common Lisp \kind{Technical Report (internal use only) }} } \normal{ \newrep \ypar{87-40 } WINKLER F. \ypar{87-40 } A Geometrical Decision Algorithm Based on the Gr{\"o}bner Bases Algorithm \kind{Technical Report } \spons{{\"O}sterreichische Forschungsgemeinschaft } \key{Gr{\"o}bner Bases. Geo Theorem Proving.} } \internal{ \newrep \ypar{87-41 } BUCHBERGER B., ASPETSBERGER K., FUNK G., KUSCHE K. \ypar{87-41 } Design and Implementation of a New Universal High-Level Parallel \ypar{87-41 } Language for Symbolic Computation \kind{Proposal (internal use only) } \key{Parallel Computation.} } \publ{ \newrep \ypar{87-42 } BUCHBERGER B., COLLINS G. E., KUTZLER B. \ypar{87-42 } Algebraic Methods for Geometric Reasoning \kind{In: Annual Reviews in Computer Science, vol. 3, pp. 85--119, 1988 } \spons{VOEST-ALPINE AG Linz } \key{Geo Reasoning.} } \more{ \newrep \ypar{87-43 } MAYR H. \ypar{87-43 } FAAST - Fully Automatic Area Stamping \kind{Diploma Thesis } \spons{VOEST-ALPINE AG Linz } \key{Computational Geometry. CAM.} } \publ{ \newrep \ypar{87-44 } PAULE P. \ypar{87-44 } A Note on Bailey's Lemma \kind{In: J. Combinatorial Theory, vol. 44, no. 1, pp. 164-167} \spons{Univ. Bayreuth } \key{Combinatorics.} } \special{ \newrep \ypar{87-45 } BUCHBERGER B. \ypar{87-45 } RISC-LINZ \kind{Description } \key{Politics. Organisation.} } \internal{ \newrep \ypar{87-46 } BUCHBERGER B. \ypar{87-46 } Sketch of Two Possible Research Projects \kind{Report {\tt (internal use only)}.} \key{Parallel Computation. Geo Reasoning.} } \normal{ \newrep \ypar{87-47 } BAAZ M. \ypar{87-47 } Quantifier Elimination for Heterogeneous Quantifiers \kind{Technical Report } \spons{VOEST ALPINE AG } \key{Automated Theorem Proving. Computer Algebra Algorithms. } } \publ{ \newrep \ypar{87-48 } KUSCHE K., KUTZLER B., MAYR H. \ypar{87-48 } Implementation of a Geometry Theorem Proving Package in SCRATCHPAD II \kind{Proc. Int. Symp. Symbolic and Algebraic Computation EUROCAL'87, Leipzig, GDR, June 2--5, 1987, J. Davenport ed., Springer, LNCS 378.} \spons{VOEST ALPINE AG, European Community (Project COST 13) } \key{Geo Theorem Proving.} }