=ADD=
=ADD==reftype=14=number=93-46=year=1993=author=Sutner; Klaus=title=Linear Cellular Automata and their Fischer Automata=month=08=keywords=automata theory=abstract=We construct a class of binary linear cellularautomata whose corresponding minimal automataexhibit exponential blow-up. The automata haveHamming distance 1 to a bideterministic automaton.Moreover, the equivalent minimal Fischer automataare obtained from the minimal automata by deletingthe sink and therefore have a maximal complexity.
=ADD==author=Denning; Peter J. + Metcalfe; Robert M.=title=Beyond Calculation. The Next Fifty Years of Computing=year=1997=publisher=Copernicus, Springer-Verlag New York=note=On the occasion of celebrating 50 years of ACM=reftype=1=source=3
=ADD==author=Gosling; James + Yellin; Frank + Team; The Java=title=The Java Application Programming Interface.Vol. 1: Core Packages=year=1996=publisher=Addison-Wesley=reftype=1=source=3
=ADD==author=Gosling; James + Yellin; Frank + Team; The Java=title=The Java Application Programming Interface.Vol. 2: Window Toolkit and Applets=year=1996=publisher=Addison-Wesley=reftype=1=source=3
=ADD==author=Bach; Erich + Shallit; Jeffrey=title=Algorithms in Number Theory.Vol. 1: Efficient Algorithms=year=1996=publisher=MIT Press=reftype=1=source=3
=ADD==editor=Miola; Alfonso + Temperini; Marco=title=Advances in the Design of the Symbolic Computation Systems=year=1997=publisher=Springer-Verlag Wien=series=RISC series: Text and Monographs in Symbolic Computation=reftype=1=source=3
=ADD==author=Erwig; Martin + Schneider; Markus=title=Vague Regions=year=1997=institution=FernUniversitaet Hagen=number=214 - 2=reftype=11=source=3
=ADD==author=Schneeweiss; Winfrid G. + Kuefner; Holger=title=Quantifying the Fault Tolerance of Multiple-Bus Based Systems=year=1997=institution=FernUniversitaet Hagen=number=216 - 2=reftype=11=source=3
=ADD==author=Gueting; Ralf Hartmut + Freundorfer; Claudia + Becker; Ludger +Dieker; Stefan + Schenk; Holger=title=Secondo/QP: Implementation of a Generic Query Processor=year=1997=institution=FernUniversitaet Hagen=number=215 - 2=reftype=11=source=3
=ADD==author=Weihrauch; Klaus=title=Computatbility on the Probability Measures on the Borel Sets of the UnitInterval=year=1997=institution=FernUniversitaet Hagen=number=212 - 2=reftype=11=source=3
=ADD==author=Buhrmann; P. + Mittrach; S. + Ollech; O. + Schlageter; G.=title=Eine Integrierte Kommunikationsumgebung fuer die Virtuelle Realitaet:Konzept und Realisierung=year=1997=institution=FernUniversitaet Hagen=number=213 - 2=reftype=11=source=3
=ADD==author=Dolzmann; A. + Sturm; Th.=title=Guarded Expressions in Practice=year=1997=institution=Universitaet Passau=number=MIP-9702=month=1=reftype=11=source=3
=ADD==author=Wang; Yaoguang=title=Bicriteria Job Sequencing with Release=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-1-005=month=2=reftype=11=source=3
=ADD==author=Lenhof; Hans-Peter=title=New Contact Measures for the Protein Docking Problem=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-1-004=month=2=note=11=source=3
=ADD==author=Jung; Bernd + Lenhof; Hans-Peter + Mueller; Peter + Rueb; Christine=title=Parallel Algorithms for MD-Simulations of Synthetic Polymers=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-1-003=month=1=reftype=11=source=3
=ADD==author=Cunnigham; William H. + Wang; Yaoguang=title=Restricted 2-Factor Polytopes=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-1-006=month=2=reftype=11=source=3
=ADD==author=Hustadt; Ullrich + Schmidt; Renate A.=title=On Evaluating Decision Procedures for Modal Logic=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-2-003=month=2=reftype=11=source=3
=ADD==author=Schmidt; Renate A.=title=Resolution is a Decision Procedure for Many Propositional Modal Logics=year=1997=institution=Max-Plank Institut fuer Informatik, Saarbruecken=number=MPI-I-97-2-002=month=1=reftype=11=source=3
=ADD==author=Rovira; Carles + Sanz-Sole; Marta=title=Large Deviations for Stochastic Volterra Equations in the Plane=year=1997=institution=Universitat de Barcelona=number=233=month=4=reftype=11=source=3
=ADD==author=Martinez; Juan Carlos=title=On Cardinal Sequences of Scattered Spaces=year=1997=institution=Universitat de Barcelona=number=234=month=4=reftype=11=source=3
=ADD==author=Pluemicke; Martin=title=Parametric Polymorphism in OBJ-3=year=1997=institution=Universitaet Tuebingen=number=WSI-97-2=reftype=11=source=3
=ADD==author=Weisskopf; Daniel + Encarnacao; L. Miguel=title=Intelligente Graphisch-Interaktive Benutzeroberflaechen:Grundlagen und aktuelle Entwicklungen=year=1997=institution=Universitaet Tuebingen=number=WSI-97-03=reftype=11=source=3
=ADD==author=Dabkowska; Monika + Mokrzycki; Wojciech=title=Computing One-View Areas of Convex Polyhedrons (in Polish)=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=823=reftype=11=source=3
=ADD==author=Grzegorek; Maria + Mokrzycki; Wojciech=title=Algorithm of Gradient Detection of Contours on Image with Autonomous Choiceof the Ground (in Polish)=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=824=reftype=11=source=3
=ADD==author=Sokolowski; Stefan=title=Intersection of Functional Subset Types=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=825=reftype=11=source=3
=ADD==author=Krupicza; Andrzej=title=Object-Oriented Image Coding Standards and Methods for CommunicationChannels at Bit-Rates Lower than 64 Kbps=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=826=reftype=11=source=3
=ADD==author=Maggiolo-Schettini; Andrea + Winkowski; Jozef=title=A Partial Order Representation of Processes of Transforming Graphs=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=827=reftype=11=source=3
=ADD==author=Przepiorkowski; Adam + Kupsc; Anna=title=Negative Concord in Polish=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=828=reftype=11=source=3
=ADD==author=Przepiorkowski; Adam + Swidzinski; Marek=title=Polish Verbal Negation Revisited: A Metamorphosis vs. HPSG Account=year=1997=institution=Institut Podstaw Informatyki, Warsaw=number=829=reftype=11=source=3
=ADD==author=Bialasik; Marcin + Konikowska; Beata=title=Reasoning with First-Order Nondeterministic Specifications=year=830=institution=Institut Podstaw Informatyki, Warsaw=number=830=reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author==editor==title==year==institution==type==number==address==month==note==reftype=11=source=3
=ADD==author=Tomuta; Ileana=title=A Library for Detecting the Intersection of Plane Convex Objects=number=94-72=year=1994=sponsor= Austrian National Science Foundation (FWF), project no. P8620-TEC=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-72.ps.gz=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr=title=Quasi-Polynomials: A Case Study in Experimental Combinatorics=number=93-18=year=1993=sponsor= Austrian Science Foundation (FWF) project no. P7220, Austrian Ministery of Science and Research=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-18.ps.gz=abstract=We prove that certain interesting combinatorialquantities (typically depending on two parameters)possess compact closed forms when one of the parametersbecomes fixed. The examples include necklaces,0,1-matrices, bipartite graohs, multigraphs and polygondissections. A subset of the examples can be treated inuniform way which resides in the generalization ofrestricted partitions by means of finite group action.The theory given in this paper bases on empiric resultsof other authors and serves as a case study of theexperimental methods in enumerative combinatorics. Acomputer algebra package for manipulatingquasi-polynomials is shortly introduced in the lastsection.=location=2=owner=2=source=3=reftype=14
=ADD==author=Buchberger; Bruno=title={\em Mathematica:} Doing Mathematics by Computer?=number=93-50=year=1993=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-50.ps.gz=abstract=This paper is presented in the form of a {\emMathematica} notebook. This fact should be conceivedas a symbolic gesture that expresses my highappreciation and admiration for the wholistic oeuvreof Stephen Wolfram with its many facets:mathematics, language design, algorithms, softwareand system design, teaching and publication tools,applications, and -- yes -- business, marketing,popularization. I like his way of doing andsucceeding in doing things many of us were onlyspeaking or dreaming about.\xparHence if, in the present paper, I will criticize thebasic tenet of {\em Mathematica} this is nit meantto decrease the invaluable merits of Stephen's work.Rather, it is my sincere hope and wish that myanalysis might help to make soon further progress inachieving, asymptotically, the goal of "doingmathematics by computer". Also, my proposal willshow that this goal may well be achieved by suitablemodifications and extensions of {\em Mathematica}and similar systems.\xpar(If the reader is not satisfied with typesetting oftext in the following {\em Mathematica} notebook, heshould be informed that, soon, a new version of {\emMathematica} will be released that incorporates afantastic pretty-print facility for mathematicaltext cells.)=howpublished=A. Miola, M. Temperini (eds), Advances in the Design of Symbolic Computation Systems,Springer Wien - New York, 1997, pp. 2-29.=note=Invited Talk at DISCO'93, Gmunden, Austria, Sept. 1993.=location=2=owner=2=source=3=reftype=14
=ADD==author=Brawley Jr.; Joel V. + Lisonek; Petr=title=Counting Equivalence Classes of Hadamard Pattern Sets by Group Action Methods=number=92-28=year=1992=sponsor= Austrian Ministery of Science and Research, Austrian Forschungsf"{o}rderungsfonds, project no. P7220.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-28.ps.gz=abstract=This paper develops mathematical methods for studyingHadamard pattern sets which are currently used as modelsof neural networks. Our main result is an explicitisomorphism between the stabilizers of Hadamard patternsand the general linear groups over the finite fieldGF(2). This isomorphism carries over the respectivegroup actions and can be used as a tool for solvingproblems related to Hadamard patterns. Two suchapplications  are presented in full detail;specifically, the enumeration of equivalence classes ofHadamard pattern sets and the evaluation of orbitlengths. Most of the Work was done with the aid ofCAYLEY, the computer algebra system for group theory=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr=title=On a Conjecture of Graffiti=number=92-67=year=1992=sponsor= Austrian Science Foundation (FWF) project no. P7220, Austrian Ministery of Science and Research=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-67.ps.gz=abstract=In this paper we disprove on of the recent conjecturesof Graffiti, a computer system which makesgraph-theoretical hypotheses. We present an entirefamily of counterexamples and, moreover, we describe theway the counterexamples are derived, which bases both onthe search of large catalogs of structures and onmathematical understanding and generalization of theresults. Such an approach fits well the area ofexperimental mathematics.=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr=title=The Performance of Gosper's Algorithm 	on Rational Function Inputs=number=91-31=year=1991=sponsor= Austrian Ministery of Science and Research, Austrian Forschungsf"{o}rderungsfonds,project no. P7220.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1991/91-31.ps.gz=abstract=We prove a new observation concerning the behaviour of Gosper's algorithm: foreach proper rational function input, i.e.\ the degree of the numerator os lessthan the degree of the denominator, Gosper's algorithm chooses the $k_0$-valueas the degree of the polynomial $f(n)$. Further we show that for properrational functions as inputs, the alternative degree bound for $f(n)$, namelydeg$p(n)$ - deg $q(n)$ + 1, also yields a solution but with less effort. Thisresults in a speed-up of Gosper's algorithm when it is running on properrational functions.=location=2=owner=2=source=3=reftype=14
=ADD==author=Ratschan; Stefan + Hong; Hoon=title=Determining the Relationship among Sets=number=96-28=month=12=year=1996=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-28.ps.gz=abstract=  Doing entailment/disentailment checks on sets is an important operation in constraint  programming. This problem is generalized to the problem of answering queries about arbitrary  sets using a certain query language.  Furthermore an efficient algorithm for solving this problem  for sets described by arbitrary non-linear polynomials is presented.=howpublished=Proceedings of IMACS ACA, Linz - Hagenberg, 1996=location=2=owner=2=source=3=reftype=14
=ADD==author=Buchberger; Bruno=title=Symbolic Computation: Computer Algebra and Logic=number=96-36=month=12=year=1996=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-36.ps.gz=abstract=In this paper we present our personal view of what should be the nextstep in the development of symbolic computation systems. The mainpoint is that future systems should integrate the power of algebraand logic. We identify four  gaps between the future ideal and thesystems available at present: the logic, the syntax, the mathematics,and the prover gap, respectively. We discuss higher order logicwithout extensionality and with set theory as a subtheory as a logicframe for future systems and we propose to start from existingcomputer algebra systems and proceed by adding new facilities forclosing the syntax, mathematics, and the prover gaps. Mathematicaseems to be a particularly suitable candidate for such an approach.As the main technique for structuring mathematical knowledge,mathematical methods (including algorithms), and also mathematicalproofs, we underline the practical importance of functors and showhow they can be naturally embedded into Mathematica.=howpublished=F.  Baader, K.U.  Schulz (eds.) Frontiers of Combining Systems.Applied Logic Series. Kluwer Academic Publishers, 1996.=location=2=owner=2=source=3=reftype=14=bibkey=TJ:1997b=author=Jebelean; Tudor=title=Auto-Configurable Array for GCD Computation=number=97-12=month=3=year=1997=sponsor=FWF project P10002-TEC=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-12.ps.gz=abstract=A novel one-directional pass-through array for the computation of integer greatest commondivisor is designed and implemented on Atmel FPGA.The design is based on the plus-minus GCD algorithm and works in LSB pipelined manner.In contrast with previous designs, the length of the new array is independent of thelength of the operands: arbitrary long integers can be processed in multiple passes.The array is auto-configurable: at each step, one new cell is configured according tothe input from the previous computation.Preliminary experiments show that for 100 bits a speed-up of 4 over software can be obtainedusing one 6010 Atmel chip.=location=2=owner=2=source=3=reftype=14
=ADD==author=Buchberger; Bruno + Jebelean; Tudor + Kriftner; Franz + Marin; Mircea + Tomuta; Elena + Vasaru; Daniela=title=A Survey on the {\em Theorema} Project=number=97-15=month=3=year=1997=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-15.ps.gz=abstract=The {\em Theorema} project aims at {\em extending current computeralgebra systems by facilities for supporting mathematical proving}. The present early-prototype version of the {\em Theorema} software system is implemented in{\em  Mathematica 3.0}.  The system consists of a general higher-order predicate logic prov\-er and a {\em  collection of special provers} that call each other depending on the particular proof situations.  The individual provers  {\em imitate the proof style of human mathematicians} and aim at {\em producing human-readable proofs in natural language} presented in {\em nested cells} that facilitate studying  the computer-generated proofs at various levels of detail. The special provers are {\em  intimately connected with the functors} that build up the various mathematical domains.=howpublished=Proceedings of ISSAC'97, in print=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr + Paule; Peter + Strehl; Volker=title=Improvement of the Degree Setting in Gosper's Algorithm=number=93-04=month=1=year=1993=howpublished=Journal of Symbolic Computation 16 (1993), 243-258=sponsor=Austrian Science Foundation (FWF) project P7220=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-04.ps.gz=abstract=A detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometricsummation is presented. In particular, we discriminate between rational and properhypergeometric input. As a result, the critical degree bound can be improved in the former case.=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr + Brawley Jr.; Joel V.=title=Counting Equivalence Classes of Hadamard Pattern Sets by Group Action Methods=number=92-28=year=1992=sponsor= Austrian Ministery of Science and Research, Austrian Forschungsf"{o}rderungsfonds, project no. P7220.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-28.ps.gz=abstract=This paper develops mathematical methods for studyingHadamard pattern sets which are currently used as modelsof neural networks. Our main result is an explicitisomorphism between the stabilizers of Hadamard patternsand the general linear groups over the finite fieldGF(2). This isomorphism carries over the respectivegroup actions and can be used as a tool for solvingproblems related to Hadamard patterns. Two suchapplications  are presented in full detail;specifically, the enumeration of equivalence classes ofHadamard pattern sets and the evaluation of orbitlengths. Most of the Work was done with the aid ofCAYLEY, the computer algebra system for group theory=location=2=owner=2=source=3=reftype=14
=ADD==author=Lisonek; Petr + Bajer; Jiri=title=Symbolic Computation Approach to Nonlinear Dynamics=journal=Journal of Modern Optics=volume=38=pages=719-729=year=1991=location=2=owner=2=source=3=reftype=0
=ADD==author=Strehl; Volker + Paule; Peter + Lisonek; Petr=title=Improvement of the Degree Setting in Gosper's Algorithm=number=93-04=month=1=year=1993=sponsor=Austrian Science Foundation (FWF) project P7220=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-04.ps.gz=abstract=A detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometricsummation is presented. In particular, we discriminate between rational and properhypergeometric input. As a result, the critical degree bound can be improved in the former case.=howpublished=Journal of Symbolic Computation 16 (1993), 243-258=location=2=owner=2=source=3=reftype=14
=ADD==author=Gosling; James + Yellin; Frank + Team; The Java=title=The Java Application Programming Interface.Vol. 2: Window Toolkit and Applets=publisher=Addison-Wesley=year=1996=location=2=owner=2=source=3=reftype=1
=ADD==author=Moritsugu; Shuichi + Kuriyama; Kazuko=title=Fraction-free Method for Computing Rational Normal Forms of Polynomial Matrices=number=97-18=month=6=year=1997=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-18.ps.gz=abstract=In this paper, we present a fraction-free algorithm for computing rationalnormal forms of matrices with univariate polynomial entries.In the traditional algorithm based on Danilevskii's method,its principal transformations are similar to Gaussian elimination.When they are carried out exactly by computeralgebra system, the elements of intermediate matricesextremely swell and it requires much CPU-timeto compute g.c.d.s of polynomials for reducing rational expressions.\parIn order to avoid such difficulty,we give a fraction-free algorithm analogous toBareiss' single-step fraction-free elimination.We have implemented it on the computer algebra system Reduce3.5.The experimental result shows the efficiency of our algorithm.=location=2=owner=2=source=3=reftype=14
=ADD==author=Fulton; William=title=Introduction to Toric Varietes=year=1993=publisher=Princeton University Press=series=Annals of Mathematics Studies, Number 131=note=copy=reftype=1=source=3=owner=2
=ADD==author=Wegerbauer; Johannes + Skokan; Peter=title=Lernen von Linz=year=1997=publisher=Hochschule fuer kuenstlerische und industrielle Gestaltung, Linz=note=Photo art=reftype=1=source=3
=ADD==author=Hong; Hoon=title=IMACS ACA 96: The 2nd IMACS Conference on Applications of Computer Algebra=year=1996=publisher=RISC-Linz=owner=1=reftype=1=source=3
=ADD==author=Kuonen; Pierre + Kontoghiorghes; Erricos J.=title=TelePar'97: 23rd SPEEDUP Workshop on Parallelism and Telecommunications=year=1997=publisher=SPEEDUP Society=series=Published as issue of SPEEDUP journal: vol 11, no 2, Nov 1997=owner=2=reftype=1=source=3
=ADD==author=Mutzel; Petra=title=An Alternative Method to Crossing Minimization on Hierarchical Graphs=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-008=month=03=reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author==title==year==institution=Max-Plank-Institut fuer Informatik=number==month==reftype=11=source=3
=ADD==author=Bajer; Jiri + Lisonek; Petr=title=symbolic computation approach to nonlinear dynamics=year=1991=journal=Journal of Modern Optics=volume=38=pages=719-729=location=2=owner=2=source=3=reftype=0
=ADD==author=Yokoyama; Kazuhiro=title=A Formulation of Hensel Construction=year=1994=note=Fujitsu techreport=location=2=owner=2=source=3=reftype=8
=ADD==author=Van Geem; Carl=title=Towards a Fast Solution Method for the General Robot Motion Planning Problem using a Manhattan-like Distance Function on a Non-uniform Grid in Configuration Space. (Proposal for Ph.D. Thesis)=number=93-66=year=1993=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-66.ps.gz=abstract=The generalized Piano Mover's Problem can beextended in several ways, e.g. by taking intoaccount kinematics and dynamic constraints, byallowing obstacles to move slightly, by asking for apath that can be seen as a good pay-off betweensafest and shortest path, by planning withuncertainty, ... All these extensions are usuallytreated separately from each other in theliterature. We will consider a combination of someof these extensions and we will investigate adirection of research that seems to be suitable forsuch combination. The approach plans inconfiguration space and is related to the potentialfield approach. The potential function however shallbe replaced by an $L^1$-distance-like function on anon-homogenous higher-dimensional grid. Thisdistance function shall be computed with a wavefrontexpanision algorithm. The approach seems to suit ina natural way to massively parallel implementation.=location=2=owner=2=source=3=reftype=14
=ADD==reftype=14=number=94-30=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-30.ps.gz=sponsor=Austrian Ministry for Science, CEI-PACT project; Austrian National Science Foundation (FWF), project no. S5302=year=1994=author=Hong; Hoon + Neubacher; Andreas + Stahl; Volker=title=The STURM Library Manual -- A C++ library for symbolic computation=howpublished=Deliverable D2H-1 of the CEI-PACT project.=location=2=owner=2=source=3
=ADD==reftype=14=number=94-31=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-31.ps.gz=sponsor=Austrian Ministry for Science, CEI-PACT project; Austrian National Science Foundation (FWF), project no. S5302=year=1994=author=Hong; Hoon + Neubacher; Andreas + Schreiner; Wolfgang + Stahl; Volker=title=The C++ Interface to the STURM Multiprocessor Kernel=howpublished=Deliverable D2H-3 of the CEI-PACT project.=location=2=owner=2=source=3
=ADD==reftype=14=number=94-32=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-32.ps.gz=sponsor=Austrian Ministry for Science, CEI-PACT project; Austrian National Science Foundation (FWF), project no. S5302=year=1994=author=Bertoli; Piergiorgio + Hong; Hoon + Neubacher; Andreas + Schreiner; Wolfgang + Stahl; Volker=title=The C++ Interface to the STURM Distributed Multiprocessor Kernel=howpublished=Deliverable D2H-2 of the CEI-PACT project.=location=2=owner=2=source=3
=ADD==author=Tomuta; Elena=title=A Library for Detecting the Intersection of Plane Convex Objects=number=94-72=year=1994=sponsor= Austrian National Science Foundation (FWF), project no. P8620-TEC=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-72.ps.gz=location=2=owner=2=source=3=reftype=14
=ADD==author=Van Geem; Carl=title=Preparations with Workspace Information for Meaningful Robot Motion Planning in Configuration Space=number=95-14=year=1995=sponsor=Austrian Ministery for Science and Research, project PARAGRAPH=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1995/95-14.ps.gz=location=2=owner=2=source=3=reftype=14
=ADD==author=Van Geem; Carl=title=Counting Cells in a Grid=number=95-29=month=6=year=1995=sponsor=Austrian Ministery for Science and Research in the frame of CEI=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1995/95-29.ps.gz=abstract=The goal of this paper ist to estimate in atheoretical way the reduction of the number of cellsof, and the overall number of neighbouring cells in,a grid when some cells in a uniform grid arereplaced by a larger cell in an overlayingnon-uniform grid. We assume that the grids arerepresented by a $2^k$-tree and the replacement ofcells preserves the representation.=location=2=owner=2=source=3=reftype=14
=ADD==author=Blurock; Edward S. + Tomuta; Elena=title=Use of Machine Learning in Economic Studies: A Tutorial Study=number=95-40=year=1995=sponsor= Uni Software Plus, Hagenberg, Austria, Labor f"{u}r Forschung und Produktentwicklung der "{O}MV AG, Schwechat, Austria=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1995/95-40.ps.gz=location=2=owner=2=source=3=reftype=14
=ADD==author=Van Geem; Carl=title=Path Planning for Manipulators with Many Degrees of Freedom Using a Discrete Representation of Configuration Space Extensively=number=95-45=year=1995=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1995/95-45.ps.gz=location=2=owner=2=source=3=reftype=14
=ADD==reftype=14=number=95-58=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/95-58.ps.gz=note=PhD Thesis=sponsor=Fellowship from BMWF (1990 -- 1992), FWF project P8573-PHY (1992 -- 1994),ESPRIT III project BRA 6846 (1994 -- 1995), also the Institute of Informatics,Slovak Academy of Sciences.=year=1995=author=Mnuk; Michal=title=Algebraic and Geometric Approach to Parametrization of Rational Curves=month=12=abstract=This thesis is devoted to the problem of parametrization of curves.It provides a good reference of known geometric methods.Some problems, e.g. constructing neighborhood graphs, are studied closely andseveral improvements are suggested.A complete binary complexity analysis of parametrization is included.This work is partially aimed at the study of the parametrization problem fromthe algebraic point of view replacing classical algorithms by new sophisticatedmethods.Some subproblems are reconsidered as problems in commutative algebra opening newhorizons.A new algorithm for computing adjoint curves based on integrally closed rings ispresented.It plays a central role in many other applications.=location=2=owner=2=source=3
=ADD==author=Van Geem; Carl=title=Enclosing Robot Links by Superellipses and Superellipsoids=number=96-01=year=1996=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-01.ps.gz=abstract=As a part of an approach for solving the robotmotion planning problem for robot arms, we want todecide whether or not a link collides with anobstacle for a given range of values for (some of)the joint parameters. We want to use the so calledRoider Method for fast collision checking, and wantto  model the link by enclosing it by superellipses(in 2 dimensional space) of by a superellipsoid (in3 dimensional space).\xparWe show in this paper that it is possible to modelthese swept areas using some elementary geometricaland trigonometrical tools. We describe for all sweptvolumes occuring for some robot arm topologies theextreme points needed for the enclosure of solids bya superellipse or by a superellipsoid. We alsocompute the volume of the swept areas and of theenclosing superellipse or superellipsoid. The ratebetween these volumes is a measure for the accuracyof the enclosure.=location=2=owner=2=source=3=reftype=14
=ADD==author=Van Geem; Carl=title=Fast Planning of a Good Path for a Manipulator Using Potential Fields on a Non-Uniform Grid in C-Space=number=96-15=month=5=year=1996=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-15.ps.gz=abstract=This Ph.D. Thesis considers the Robot Motion Planning Problem for a robot armusing the concept of Configuration Space. The approach described hereleads to a path with some particular properties. It also gives rise toa complete solution of the problem under certain conditions.The thesis tends to be applicable, since the considerations on whichthe approach is ented are practice oriented. On the other hand onlybits and parts are implemented for the moment, and some parts of thework are still in a theoretical phase. We strongly believe that theseparts can be implemented and fit together.Our original results of research are the following:We observed that the use of a non-uniform grid in combinationwith a potential field similar to the Manhattan distance on auniform grid makes the use of a repulsive potential superfluouswhen we want to end up with a safebut (in Configuration Space) short path. In order to represent thenon-uniform grid, we have chosen to use the so called GETRepresentation for a $2^k$-tree (due to Klaus Burger, diploma thesis:``A Kernel-Based Construction System (KBC)'', RISC-Linz, 1992).As a motivation for the use of a non-uniform grid as opposed toa uniform grid, we counted out for a set of polygons with a particularshape what the gain in number of cells is when using cells ofdifferent sizes.We observed that it is possible to translate the algorithms due toIrene Gargantini (``Linear Octtrees for FastProcessing of Three-Dimensional Objects'', Computer Graphics and ImageProcessing, Vol.20, 1982) for neighbour computation in quad- andoctrees to the GET Representation, and did so. The neighbourcomputation in the non-uniform grid (looking for adjacent cells of agiven cell) is an essential operation for the construction of apotential field on the grid.We implemented a non-hierarchical construction of a potential field on anon-uniform grid. We also describe a hierarchical construction.The advantage of a hierarchical construction isthat we at first can construct the non-uniform grid and a potential fieldon it up to a certain dimension and expand the model of theConfiguration Space to a higher dimension later on, when necessary. Thiscorresponds more or less to the approach of gross and fine motionplanning as it is known in the literature.When it is observed during execution of a path that anobstacle is positioned differently compared to its position duringthe planning faze, the model has to be updated.We describe how to update the representation of the grid and thepotential field (without recomputation of the whole model) whenslight changes in the position of anobstacle have occured.=note=Ph.D. thesis=location=2=owner=2=source=3=reftype=14
=ADD==reftype=14=number=96-39=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-39.ps.gz=year=1996=author=Buchberger; Bruno=title=Introduction to Groebner Bases=month=12=location=2=owner=2=source=3
=ADD==reftype=14=number=96-40=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-40.ps.gz=sponsor=Partially supported by: TARA (Tsukuba Advanced Research Alliance);IPA-AITP (Advanced InformationTechnology Program of the Information-Technology Promotion Agency, Japan);Fujitsu Labs, ISIS, Numazu, Japan.=year=1996=author=Buchberger; Bruno=title=Mathematica as a Rewrite Language=howpublished=T. Ida (ed.) ``The Second Fuji International Workshop on Functionaland Logic Programming'', Nov. 1-4, Shonan Village, Japan.=month=12=abstract=The kernel of the Mathematica language is a higher-orderconditional rewrite language with sequence variables.This fact is little known.We derive some conclusions from this for the use of Mathematica as a researchtool in the area of rewriting and related areas.=location=2=owner=2=source=3
=ADD==author=Buchberger; Bruno + Jebelean; Tudor + Kriftner; Franz + Marin; Mircea + Tomuta; Elena + Vasaru; Daniela=title=A Survey of the {\em Theorema} Project=number=97-15=month=3=year=1997=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-15.ps.gz=abstract=The {\em Theorema} project aims at {\em extending current computeralgebra systems by facilities for supporting mathematical proving}. The present early-prototype version of the {\em Theorema} software system is implemented in{\em  Mathematica 3.0}.  The system consists of a general higher-order predicate logic prov\-er and a {\em  collection of special provers} that call each other depending on the particular proof situations.  The individual provers  {\em imitate the proof style of human mathematicians} and aim at {\em producing human-readable proofs in natural language} presented in {\em nested cells} that facilitate studying  the computer-generated proofs at various levels of detail. The special provers are {\em  intimately connected with the functors} that build up the various mathematical domains.=howpublished=Proceedings of ISSAC'97 (International Symposium on Symbolic and Algebraic Computation,	Maui, Hawaii, July 21-23, 1997),        W. Kuechlin (ed.),        ACM Press 1997,        pp. 384--391.=location=2=owner=2=source=3=reftype=14
=ADD==reftype=14=number=97-16=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-16.ps.gz=note=PhD Thesis=sponsor={\"O}AD,PARAGRAPH (Parallel Computer Graphics),MEDLAR II (ESPRIT Basic Research Project, nr. 6471, FWF), PfoFactor.=year=1997=author=Sofronie-Stokkermans; Viorica=title=Fibered Structures in Computer Science and Applications to Automated Theorem Proving in Certain Classes of Finitely-Valued Logics and to Modeling Interacting Systems=month=03=keywords=automated theorem proving, non-classical logics, SHn-logics, universal algebra,Priestley duality, fiberings, sheaves.=abstract=The goal of this thesis is to study the applications of{\em fibered structures} in computer science, more preciselyin automated theorem proving in many-valued logics,and in modeling cooperating systems.We  present and study situations in which fibered structures and sheaves(possibly with respect to Grothendieck topologies on certain categories)arise.The thesis contains two main directions of work, strongly interrelated:The first direction of work is concerned with finding{\em decompositions} of given structures in terms ofsimpler structures, in such a way that certain classes of properties ofthe given structure can be reduced to properties of the simpler structures.The  main contribution in this direction of workconcerns Priestley-type representation ofdistributive lattices with operators, and its application forreducing the complexity ofautomated theorem proving in classes offinitely-valued logics.These methods are first discussed for the case of $SHn$-logics andthen extended to more general classes of logics. An implementationin Prolog is given and comparisons with related approaches are made.The second direction of work is concerned with {\em putting together}(interconnecting) different structures and studying the properties of theresult of this interconnection; in particular with studying the linkbetween the propertiesof the component parts and the result of their interconnection.We give a sheaf-theoretic approach to the study of concurrency.In studying complex systems consisting of several interconnected``agents'', given a class of agents (a description of every agent, anda description of the  way they interact) it is often necessary tostudy the properties of the system obtained by theinterconnection of the agents in this class.We propose a notion of {\em system} and several variantsof a corresponding notion of morphism, depending on the extentof the relationship between systems that we want to express.We define Grothendieck topologies on the categories defined this way,that express ``covering relationships'' between systems.It turns out that much of the information relevant for expressingproperties about systems can beexpressed by sheaves with respect to these Grothendieck topologies:for instance states and parallel actions are modeled bysheaves $St, Act$; transitions are expressed bya subsheaf of $Act \times St \times St$;andbehavior over a fixed range of time (of the form $\{ 0, 1, \dots, n \},n \in {\Bbb N}$ or ${\Bbb N}$)can be modeled as a sheaftoo.We use geometric logic in order to explain the link betweencertain properties of a given family ofinterconnected systems andthe properties of the system that results from their interconnection.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-17=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-17.ps.gz=year=1997=author=Bikker; Piet=title=Non-Admissible Orderings and Involutive Bases=month=5=abstract=It is shown that non-admissible orderings existfor which Involutive bases can be computed.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-18=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-18.ps.gz=year=1997=author=Moritsugu; Shiuchi + Kuriyama; Kazuko=title=Fraction-free Method for Computing Rational Normal Forms of Polynomial Matrices=month=06=abstract=In this paper, we present a fraction-free algorithm for computing rationalnormal forms of matrices with univariate polynomial entries.In the traditional algorithm based on Danilevskii's method,its principal transformations are similar to Gaussian elimination.When they are carried out exactly by computeralgebra system, the elements of intermediate matricesextremely swell and it requires much CPU-timeto compute g.c.d.s of polynomials for reducing rational expressions.\parIn order to avoid such difficulty,we give a fraction-free algorithm analogous toBareiss' single-step fraction-free elimination.We have implemented it on the computer algebra system Reduce3.5.The experimental result shows the efficiency of our algorithm.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-19=author=Neubacher; Andreas=title=Another Elementary Proof of Kharitonov's Theorem=abstract=In this note yet another proof of Kharitonov's theorem on robust stabilityof interval polynomials is presented.  The proof is based on an analysis ofthe critical regions where instability may occur; the ``bounding property''of the Kharitonov polynomials ensures stability in each case.  Onlyelementary results that have also been used in earlier proofs of thetheorem are applied.=sponsor=Partially suppored by the Austrian Ministry of Science and Research in theframe of the CEI PACT project.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-19.ps.gz=year=1997=month=07=location=2=owner=2=source=3
=ADD==reftype=14=number=97-20=url=http://www.risc.uni-linz.ac.at/conference/Theorema/=note=Proceedings of the workshop, including also some older papers for reference.=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.=year=1997=author=Buchberger; Bruno + Ida; Tetsuo + Vasaru; Daniela=title=First International Theorema Workshop=month=06=keywords=automated theorem proving,natural deduction, computer algebra system=location=2=owner=2=source=3
=ADD==reftype=14=number=97-20=url=http://www.risc.uni-linz.ac.at/conference/Theorema/=note=Proceedings of the workshop, including also some older papers for reference.=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.=year=1997=author=Buchberger; Bruno + Ida; Tetsuo + Vasaru; Daniela=title=First International Theorema Workshop=month=06=keywords=automated theorem proving,natural deduction, computer algebra system=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/suzuki.ps.gz=year=1997=author=Suzuki; Taro + Nakagawa; Koji + Ida; Tetsuo=title=Higher-Order Lazy Narrowing Calculus: A Computation Model for a High-Order FunctionalLogic Language=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=(Extracted from the introduction)Experiences with functional programming revealed that high-order concept leads topowerful and succint programming.Functional logic programming, and approach to integrate functional and logicprogramming, would naturally be expected to incorporate the notion of high-order-ness.In this paper we present a computation model for high-order functional and logicprogramming by using the use of applicative rewrite systems.Namely, we propose a high-order lazy narrowing calculus, to be called HLNC, that isbased on the first-order lazy narrowing calculus LNC (by Middeldorp, 1996), for whichstrong completeness and deterministic versions of the calculus have been developed.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/hamada.ps.gz=sponsor=The first author is supported by the Ministry of Education, Science and Culture(Monbusho), Japan. This work is performed in the framework of the project``Declarative Coordination Programming in Open Computiong Environments''supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan.Japan.=year=1997=author=Hamada; Mohamed + Ida; Tetsuo=title=A Deterministic Lazy Conditional Narrowing and its Implementation in Mathematica=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=Narrowing was studied in the literature to give operational semantics to functionallogic languages.In this paper we introduce a (deterministic) Lazy Conditional Narrowing Calculus(LCNC$_d$ for short).We describe a full implementation of LCNC$_d$ using Mathematica 3.0.We demonstrate that our implementation results in a (first hand) functional-logiclanguage interpreter as well as an equational theorem prover.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/hamana.ps.gz=year=1997=author=Hamana; Makoto=title=Term Rewriting with Sequences=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=This paper gives an extension of term rewriting systems, which treat not only terms butalso "sequences".We present a definition of confluent rewrite relation for this systems and matchingalgorithms used in rewriting.Application to rewriting semantics of Mathematica programming language is alsodiscussed.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/aart.ps.gz=sponsor=The work reported in this paper was initiatied in March 1995 when the author was stayingat the University of Bordeaux.The support of LaBRI and the hospitality of "Programmation Symbolique" group headed byRobert Strandh are gratefully aknowledged.=year=1997=author=Durand; Irene + Middledorp; Aart=title=Decidable Call by Need Computations in Term Rewriting=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20.=note=This is a slightly extended version of a paper that will appear in the Proceedings ofthe 14th International Conference on Automated Deduction, Townsville, Lecture Notes inArtificial Intelligence, 1997.=month=6=abstract=In this paper we study decidable approximations to call by need computations to normaland root-stable forms in term rewriting.We obtain uniform decidability proofs by making use of elementary tree automatatechniques.Surprisingly, by avoiding complicated concepts like index and sequentiality we are ableto cover much larger classes of term rewriting systems.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/yamada.ps.gz=sponsor=Partially supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan.=note=This paper was also published in the Proceedings of the 22nd International Colloquiumon Trees in Algebra and Programming (CAAP'97), Lille, France, Lecture Notes in ComputerScience 1214, pp. 141--152, 1997.=year=1997=author=Yamada; Toshiyuki + Avenhaus; Juergen + Loria-Saenz; Carlos + Middledorp; Aart=title=Logicality of Conditional Rewrite Systems=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=A conditional term rewriting system is called logical if it has the same logicalstrength as the underlying conditional equational system.In this paper we summarize known logicality results and we present new sufficientconditions for logicality of the important class of oriented conditional term rewritingsystems.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/shand.ps.gz=sponsor=Supported by EPSRC grant GR/K75767=year=1997=author=Martin; U. + Shand; D.=title=Investigating some Embedded Verification Techniques for Computer Algebra Systems=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=This paper reports some preliminary ideas on a collaborative project between St. AndrewsUniversity in the UK and NAG Ltd.The project aims to use embedded verification techniques to improve the reliability andmathematical soundness of computer algebra systems.We give some history of attempts to integrate computer algebra systems and automatedtheorem provers and discuss possible advantages and disadvantages of these approaches.We also discuss some possible case studies.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/proving-solving-computing.ps.gz=sponsor=This talk was prepared during a stay as a visiting research fellow atthe University of Tsukuba (Japan), Chair ofProfessor Tetsuo Ida, in the frame of the TARA project.This work was also supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan, in the frameof the project ``Coordination Programming in Open Computiong Environments'' andby a project grant on ``Computer Algebra'' by Fujitsu Labs, ISIS, Numazu,Japan.=year=1997=author=Buchberger; Bruno=title=Proving, Solving, Computing. A Language Environment Based on Mathematica=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=note=Invited talk at the "Multi-Paradigm Logic Programming" Workshop, Bonn, September 5-6,1996=keywords=automated reasoning=abstract=(Contents)1. Proving, Solving, Computing    \par  1.1. What Is Mathematics?       \par  1.2. What is A Problem?         \par  1.3. Provers, Solvers, Computer \par  1.4. Formal Mathematics         \par2. My Research Program            \par  2.1. Outline                    \par  2.2. The Present State          \par  2.3. An Example of a Future (Futuristic) Math Session \par3. Conclusion=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/suzuki.ps.gz=year=1997=author=Suzuki; Taro + Nakagawa; Koji + Ida; Tetsuo=title=Higher-Order Lazy Narrowing Calculus: A Computation Model for a High-Order FunctionalLogic Language=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=(Extracted from the introduction)Experiences with functional programming revealed that high-order concept leads topowerful and succint programming.Functional logic programming, and approach to integrate functional and logicprogramming, would naturally be expected to incorporate the notion of high-order-ness.In this paper we present a computation model for high-order functional and logicprogramming by using the use of applicative rewrite systems.Namely, we propose a high-order lazy narrowing calculus, to be called HLNC, that isbased on the first-order lazy narrowing calculus LNC (by Middeldorp, 1996), for whichstrong completeness and deterministic versions of the calculus have been developed.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/hamada.ps.gz=sponsor=The first author is supported by the Ministry of Education, Science and Culture(Monbusho), Japan. This work is performed in the framework of the project``Declarative Coordination Programming in Open Computiong Environments''supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan.Japan.=year=1997=author=Hamada; Mohamed + Ida; Tetsuo=title=A Deterministic Lazy Conditional Narrowing and its Implementation in Mathematica=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=Narrowing was studied in the literature to give operational semantics to functionallogic languages.In this paper we introduce a (deterministic) Lazy Conditional Narrowing Calculus(LCNC$_d$ for short).We describe a full implementation of LCNC$_d$ using Mathematica 3.0.We demonstrate that our implementation results in a (first hand) functional-logiclanguage interpreter as well as an equational theorem prover.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/hamana.ps.gz=year=1997=author=Hamana; Makoto=title=Term Rewriting with Sequences=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=This paper gives an extension of term rewriting systems, which treat not only terms butalso "sequences".We present a definition of confluent rewrite relation for this systems and matchingalgorithms used in rewriting.Application to rewriting semantics of Mathematica programming language is alsodiscussed.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/aart.ps.gz=sponsor=The work reported in this paper was initiatied in March 1995 when the author was stayingat the University of Bordeaux.The support of LaBRI and the hospitality of "Programmation Symbolique" group headed byRobert Strandh are gratefully aknowledged.=year=1997=author=Durand; Irene + Middledorp; Aart=title=Decidable Call by Need Computations in Term Rewriting=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20.=note=This is a slightly extended version of a paper that will appear in the Proceedings ofthe 14th International Conference on Automated Deduction, Townsville, Lecture Notes inArtificial Intelligence, 1997.=month=6=abstract=In this paper we study decidable approximations to call by need computations to normaland root-stable forms in term rewriting.We obtain uniform decidability proofs by making use of elementary tree automatatechniques.Surprisingly, by avoiding complicated concepts like index and sequentiality we are ableto cover much larger classes of term rewriting systems.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/yamada.ps.gz=sponsor=Partially supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan.=note=This paper was also published in the Proceedings of the 22nd International Colloquiumon Trees in Algebra and Programming (CAAP'97), Lille, France, Lecture Notes in ComputerScience 1214, pp. 141--152, 1997.=year=1997=author=Yamada; Toshiyuki + Avenhaus; Juergen + Loria-Saenz; Carlos + Middledorp; Aart=title=Logicality of Conditional Rewrite Systems=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=A conditional term rewriting system is called logical if it has the same logicalstrength as the underlying conditional equational system.In this paper we summarize known logicality results and we present new sufficientconditions for logicality of the important class of oriented conditional term rewritingsystems.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/shand.ps.gz=sponsor=Supported by EPSRC grant GR/K75767=year=1997=author=Martin; U. + Shand; D.=title=Investigating some Embedded Verification Techniques for Computer Algebra Systems=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=This paper reports some preliminary ideas on a collaborative project between St. AndrewsUniversity in the UK and NAG Ltd.The project aims to use embedded verification techniques to improve the reliability andmathematical soundness of computer algebra systems.We give some history of attempts to integrate computer algebra systems and automatedtheorem provers and discuss possible advantages and disadvantages of these approaches.We also discuss some possible case studies.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/proving-solving-computing.ps.gz=sponsor=This talk was prepared during a stay as a visiting research fellow atthe University of Tsukuba (Japan), Chair ofProfessor Tetsuo Ida, in the frame of the TARA project.This work was also supported by the Advanced Information Technology Program(AITP) of the Information-Techology Promotion Agency (IPA), Japan, in the frameof the project ``Coordination Programming in Open Computiong Environments'' andby a project grant on ``Computer Algebra'' by Fujitsu Labs, ISIS, Numazu,Japan.=year=1997=author=Buchberger; Bruno=title=Proving, Solving, Computing. A Language Environment Based on Mathematica=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=note=Invited talk at the "Multi-Paradigm Logic Programming" Workshop, Bonn, September 5-6,1996=keywords=automated reasoning=abstract=(Contents)1. Proving, Solving, Computing    \par  1.1. What Is Mathematics?       \par  1.2. What is A Problem?         \par  1.3. Provers, Solvers, Computer \par  1.4. Formal Mathematics         \par2. My Research Program            \par  2.1. Outline                    \par  2.2. The Present State          \par  2.3. An Example of a Future (Futuristic) Math Session \par3. Conclusion=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/language.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno + Kriftner; Franz=title=Theorema: The Language=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning=abstract=In this paper we describe the language on which the Theorema project is based.The description is done by examples.In particular, a piece of mathematical text from polynomial ideal theory isformulated in the language that may serve as an illustration of the way how itshould be possible to develop mathematics if the complete Theroema softwarewas available.\parThe overall design of the language is due to the first author.The second author is joining in the implementation of the language on top ofMathematica 3.0.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/induction-natural.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno=title=The Theorema prover for equalities over the natural numbers=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning, induction=abstract=This notebook describes an automated inductive prover for equalities modulogiven equalities over the natural numbers.The prover recures over the free variables in the equalities to be proved anduses the equalities in the knowledge base for rewriting.The prover is written in Mathematica 3.0.By initializing the notebook the prover can be used interactively from withinthe notebook.The prover generates abstract proof objects, i.e. nested expressions thatcontain all the relevant information on the individual steps in the proof.However, also a viewer for the proofs in nested Mathematica cells is presented.The cells of the proofs in this representation can be clicked open and closedand thus enable the user to inspect parts of proofs or the entire proof andclose other parts of the proof so that it is easy to keep the overview evenover deeply nested proofs of formulae with several free variables.\parThis prover was the first interactive prover within the Theorema project andserves as a model for the Theorema provers for other inductively defineddomains.In anticipation, in a later stage of the project, such inductive provers willbe generated automatically from the inductive definition of the domain understudy, which is contained in the functor that defines the domain.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/predicate-logic.nb.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno + Jebelean; Tudor=title=Theorema: The Predicate Logic Prover=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning=abstract=This notebook describes an automated prover for predicate logic.The style of the prover is natural deduction but the prover is not just animplementation of any of the natural deduction systems usually considered intextbooks of mathematical logic but, rather, reflects and imitates the authors'personal proof style for proofs in (high order) predicate logic.The prover is written in Mathematica 3.0.By initializing the notebook the prover can be used interactively from withinthe notebook.The prover generates abstract proof objects, i.e. nested expressions thatcontain all the relevant information on the individual steps in the proof.However, various viewers can be applied to proof objects that generate naturallanguage, easy-to-read versions of proofs.Among these viewers is one that generates representations of proofs in nestedMathematica cells that can be clicked open and closed and thus enable theuser to inspect parts of proofs at any desired level of details, or,alternatively, skip subproofs in which he is not interested.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/lists.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno + Vasaru; Daniela=title=Theorema: The Induction Prover over Lists=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning, induction=abstract=We describe the inductive prover for equalities over lists implemented in theTheorema system.The structure of the prover is very similar to the one of the induction proverover natural numbers.The main difference is the use of "sequence" variables for handling lists.The prover recurs over the universally quantified sequence variables in theequality to be proven and uses the equalities in the knowledge base forrewriting.The order used for rewriting is a recursive path ordering.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/matsuda.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Matsuda; Jun=title=A Prover for Propositional Logic in Natural (Deduction)Style: Implementation in C=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning=abstract=This paper presents a theorem prover for propositional logic.We implement a prover, written by B. Buchberger in Mathematica, in C andconnect it with Risa/Asir which is the mathematical software system developedby Fujitsu.We describe all details of this implementation including an additional outputfeature which is different from the "nested cells" output of the prover inMathematica.The time efficiency of these two provers are compared.This work is part of the Theorema project, which will be also describedbriefly in this paper.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/computing-times.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno=title=A Note on Computing Times in Different Programming Styles in Mathematica=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=In this note we study the computing time behaviour of using sequence variablesin Mathematica programs by a simple experiment.Sequence variables allow an elegant rule-based programming style inMathematica that goes beyond the capabilities of usual functional programming.Sequence variables have a bad reputation w.r.t. computational inefficiency.However, the experiment shows that the computing times for programs usingsequence variables are better than equivalent programs that organize the loopsby recursion and slightly worse than programs that organize the loops byiteration.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/simplifier.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Buchberger; Bruno + Marin; Mircea=title=Proving by Simplification=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning=abstract=This notebook describes the simplification prover implemented in the Theorema system.The prover is mainly a term rewriting system used to generate abstract proof objects,i.e. structured data that contain enough information to describe all the individualsteps in a proof.These proof objects can be ragrded as standalone proofs, or can be further integratedinto more complex proofs that use simplification for intermediary proofs.The proven is written in Mathematica 3.0 and provides a viewer that converts proofobjects into nested Mathematica cells, which are natural language, easy-to-read versionsof proofs.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/functors.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=year=1997=author=Tomuta; Elena=title=Using Functors in Organizing Proofs=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=keywords=automated reasoning=abstract=Functors are the main mechanism for structuring knowledge in the Theorema system.In this paper we give an overview of the facilities the system provides for manipulatingfunctors, domains, and domain properties and we present an approach to using thestructure introduced by functors in guiding proofs.The approach was implemented ia a prover specialized in proving statements involvingdomains and domain properties.The interface and structure of the prover are explained and a sample proof produced bythe system is given.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==container=BB_TI_DV:1997a=reftype=5=url=http://www.risc.uni-linz.ac.at/conference/Theorema/papers/simple-proofs.ps.gz=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.Japan.=note=The Japanese version of this paper appears as an invited talk in the proceedings of teh4th Tokyo Mathematica users conference, November 2-3, 1996.Distribution of the English version is not permitted without the consent of the editorsof the proceedings.=year=1997=author=Buchberger; Bruno=title=Using Mathematica for Doing Simple Mathematical Proofs=howpublished=Proceedings of the First International Theorema Workshop, RISC report 97-20=month=6=abstract=We give a few examples how Mathematica can be used for doing simple mathematical proofsby the computer.We will also show how the cell grouping feature of Mathematica helps in the presentationof proofs in such a way that students ca use the computer-generated proofs forinteractive proof training.The proof programs can be used for high school and undergraduate math education but alsogive some perspective of the future advanced potential of Mathematica as a mathematicalresearch tool.The work presented is part of the author's Theorema project, which will also be outlinedbriefly.=publisher=RISC-Linz=series=RISC reports=number=97-20=location=2=owner=2=source=3
=ADD==reftype=14=number=97-21=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-21.ps.gz=note=Diploma Thesis=year=1997=author=Aigner; Klaus=title=Symbolic Computation of and with Offset Curves=month=07=abstract=In geometry and its applications we are sometimes interested in computing theoffset curve to a given generator curve. That is, given a curve C, we wishto determine a curve O(C,d) such that, for every point p of C, there is apoint q on O(C,d) such that the distance between p and q is exactly d, andthe line determined by p and q is perpendicular to C at p and vice versa. Ifthe generator curve is an algebraic curve in implicit or parametricrepresentation, we describe procedures to compute its implicit offset curveby using methods of elimination theory (Groebner bases, resultants).However, in applications many algorithms implicitly assume that the objects aregiven parametrically. The main difficulty is that the rationality of the generatorcurve is not preserved (in general). For deciding the rationality of an offsetcurve we introduce the notion of Rational Pythagorean Hodographs (i.e. rationallyparametrized curves whose normal vector has rational lengths). For generatorcurves which are RPH we describe an algorithm to compute the offset curve inparametric representation by using the concept of reparametrizing curves.By considering higher dimensional spaces and applying a direct isometry to thenormal vector one can extend the classical notion of offsets to the concept ofgeneralized offsets to hypersurfaces. In this case we also describe criteria forthe rationality of such hypersurfaces.We have implemented serveral algorithms to compute offsets in MAPLE V and by usingthe software package CASA. CASA offers data structures to represent algebraicsets and to compute with them (parametrization, implicitation, decomposition,...).The package for computing offset curves consists of the procedures mkImplOffset,mkParaOffset and RPHcurve. Using mkImplOffset or mkParaOffset we can computethe offset curve in implicit or parametric representation, respectively, toa given generator curve (in implicit or parametric representation) at a specifiedor unspecified distance. RPHcurve checks if there exists an RPH parametrizationof a rational algebraic curve and, if there exists one, it computes the necessaryreparametrizing function.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-22=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-22.ps.gz=year=1997=author=Schreiner; Wolfgang=title=A Distributed Education Environment Based on Mathematica=howpublished=IDIMT'97 -- 5th Interdisciplinary Information Management Talks, Zadov,Czech Republic, October 15-17, 1997, Austrian Computer Society,Oldenbourg Verlag.=month=07=keywords=virtual classrooms, telelearning, teleteaching=abstract=This paper presents the concept of an environment for distributedmathematical education based on the computer algebra system\emph{Mathematica}$^{\copyright}$. Mathematica is a ``system for doingmathematics by computer'' which combines a computational engine withpowerful presentation and visualization facilities based on theconcept of \emph{notebooks} (multimedia hypertext documents). Thesystem has gained large popularity in various scientific and technicalfields and is also heavily used in education. We have designed aMathematica-based distributed environment that supports classroomscenarios such as the lecturer presenting a notebook to an audience orthe students exercising independently on personal notebook copies.This design demonstrates various aspects of the adaption of commercialsoftware to distributed applications, in particular compromises thatarise from the limitations of external control facilities. A prototypeof this environment is being implemented in the frame of a diplomathesis.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-23=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-23/index.html=note=Master Thesis=year=1997=author=Pollak; Robert=title=Specification of a Polynomial Prover in {\em Theorema} by Example Proofs=month=08=abstract=Using the logical and formal framework of the {\em Theorema}project, we select a given representation of polynomials, which isdefined formally in {\em Theorema} functor notation.This definition, taken from an interactive textbookabout Groebner bases, makes use of `sequence' variables, a special {\em Theorema}extension of the language of predicate logic.  In order to contribute tothe future goal of extracting the structure of an automatic prover from thestructure of the corresponding domain definition, we support the creation ofan automatic `polynomial theorem prover' corresponding to the aboverepresentation.  To specify how this prover will work we start developpingthe theory of polynomials.For this we give manually composed example proofs about properties of thedefined basic polynomial operators in {\em Mathematica} notebook format.We try to mimic the wanted output format, using thepossibility to structure notebook proofs into subproofs, which can be studiedat various levels of detail.  We describe the methods used to create theproofs and discuss the similarities to human proving style and the advantagesof computer support, on the levels of correctness andreadability / understandability.It should be noted that this is not astraightforward exercise, since we do not only present the proofs but alsoexplain the necessary structure of the prover program, such as the use of twodifferent induction principles or how to handle case distinction andrewriting.In order to demonstrate the feasibility of programming such aprover we implement a simplified prototype and describe it by examining anexample output of this prototype and comparing it with the correspondingmanual proof.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-24=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-24.ps.gz=year=1997=author=Schicho; Josef=title=A Degree Bound for the Parameterization of a Rational Surface=howpublished=submitted to J. Pure Appl. Alg.=month=10=abstract=The main result of this paper is an upper bound for the degreeof the smallest parameterization of a rational surface of degree $d$.We also give another such upper bound in terms of the degreeand the sectional genus of the surface.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-25=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-25.ps.gz=year=1997=author=Schicho; Josef=title=A Note on a Theorem of Fried and MacRae=howpublished=Arch. Math. (65), 1995, pp 239--243=month=10=abstract=A theorem of Fried and MacRae will be proved and generalized withcategorical methods.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-26=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-26.ps.gz=year=1997=author=Schicho; Josef=title=Inversion of Birational Maps with Gr\"obner Bases=howpublished=submitted to the Groebner bases conference=month=10=abstract=We present an efficient algorithm for the inversion of a givenbirational map. The problem is reduced to find the uniquesolution of a maximal ideal defined over an algebraic function field.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-27=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-27.ps.gz=year=1997=author=Schicho; Josef=title=Rational Parameterization of Surfaces=howpublished=submitted to JSC=month=10=abstract=The parameterization problem asks for a parameterization ofan implicitly given surface, in terms of rational functions intwo variables. We give an algorithm that decides if such aparametric representation exists, based on Castelnuovo's rationalitycriterion. If the answer is yes, then we compute such a parametricrepresentation, using the concept of adjoint functions.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-28=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-28.ps.gz=year=1997=author=Schicho; Josef=title=Embedded Desingularization of Hypersurfaces after Villamayor=month=10=abstract=This paper contains an algorithmic description of Villamayor'salgorithm for embedded desingularization of hypersurfaces.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-29=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-29.ps.gz=year=1997=author=Schicho; Josef + Hule; Harald=title=On two conjectures about systems of algebraic equations=howpublished=Riv. Mat. Univ. Parma (5) 5, 1996, pp 201--204=month=10=abstract=We give counterexamples for two conjectures relating thenumber of solutions of a system of algebraic equations to itsproperty of being maximal.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-30=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-30.ps.gz=sponsor=Supported by the Austrian Science Foundation (FWF) project HySaX,Proj. No. P11160-TEC and Partially supported by the CGAL Project,ESPRIT IV, No. 21957=year=1997=author=Quoc-Nam; Tran + Van Geem; Carl=title={NURBS} Interpolation of Surface-to-Surface Intersections=month=10=keywords=Symbolic-Numerical Method, CAGD, NURBS=abstract=We present a hybrid symbolic-numerical algorithm for piecewiseinterpolation and representation of surface-to-surface intersections --a fundamental and difficult problem in Computer Aided Geometric Design(CAGD) and solid modeling.Our method helps to get a fast and accurate insight of the intersections --This is the main contribution of the paper.The method overcomes the main difficulties of numerical tracing, namelyfinding a sample point for every real branch and marching throughsingularities by using techniques for real root isolation of polynomialswith real algebraic number coefficients.On the other hand, the method does not require the expensivecomputation of birational mapping, projections, re-constructions, etc.\ asin a pure symbolic method.Further it utilizes non-uniform rational B-spline (NURBS) to piecewiseinterpolate theintersection in order to improve the efficiency of the algorithms andthe smoothness of the plots.Experiments from surface-to-surface intersection examples found in theliterature show a dramatic speed up of the method.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-31=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-31.ps.gz=note=Master Thesis=year=1997=author=Kulczycki; Peter W.=title=An Application Framework for the Distributed Simulation of Virtual Worlds by Spatial Decomposition=month=10=keywords=Distributed Simulation, Distributed System, Multi-User Game, Spatial Decomposition, Virtual World=abstract=This thesis describes the design and the implementation of a distributedsimulation of real worlds on a network of computers. The distributed simulationenables multiple users in distant locations to interact and to share experienceswithin the same virtual world. A key problem solved is the consistency of thedifferent virtual world views under the constraint of limited networkcommunication. Examples of applicability range from traffic and factorysimulation systems to multi-user games and molecular dynamic simulations.The virtual world we have modeled is a two-dimensional imitation of the realworld. It is subdivided into an arbitrary number of regions, so-called cells,each under supervision of an independently and distantly running process. Thevirtual world is ``populated'' by virtual objects. Some of them are undercontrol of human operators, others behave like autonomous agents, fulfillingsome kind of task. In order to reduce communication between objects, severalstrategies based on the spatial property of the virtual world have been designedand implemented.We have designed, implemented, and tested an object-oriented applicationframework, depicting the distributed simulation sketched above, plus a fullfunctioning example based on this framework. Computers running differentoperating systems, e.g.\ Unix and Windows NT, may interoperate within one singlesimulation session.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-33=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-33.ps.gz=year=1997=author=Tran; Quoc-Nam + Winkler; Franz=title=CASA Reference Manual (Version 2.3)=month=10=abstract=CASA is a special-purpose system for computational algebra andconstructive algebraic geometry. The system has been developedsince 1990. With this newest version -- version 2.3 -- CASA isthe ongoing product of the Computer Algebra Group at theResearch Institute for Symbolic Computation (RISC-Linz), theUniversity of Linz, Austria, under the direction of the secondauthor.The system is built on the kernel of the widely used computeralgebra system Maple$^@$V.4. (An older version of CASA --version 2.3 ALPHA -- is still available for Maple V.3 under thesubdirectory {\tt libV3}.)=keywords=Software system CASA=location=2=owner=2=source=3=sponsor=Supported by the Austrian Science Foundation (FWF) project HySaX,Proj.\ No.\ P11160-TEC}
=ADD==reftype=14=number=97-34=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-34/submitted.nb.html=year=1997=author=Buchberger; Bruno + Jebelean; Tudor + Vasaru; Daniela=title=Theorema: A System for Formal Scientific Training in Natural Language Presentation=month=10=keywords=education=abstract=Lack of formal training is hindering the application of high-level informationtechnology in science and engineering. The Theorema project addresses this needby implementing a sophisticated automatic reasoning system with an easy-to-useinterface which can be used in various interactive ways - both locally and overthe internet. We report on the use of this software for the training ofmathematics and engineering students in problem solving and theorem proving.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-35=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-35.ps.gz=year=1997=author=Moritsugu; Shuichi + Kuriyama; Kazuko=title=A Linear Algebra Method for Solving Systems of Algebraic Equations=month=11=keywords=Stetter's method, U-resultant=abstract=We consider a linear algebra method in residue class ringsfor solving systems of algebraic equations.We construct multiplication tables using a Gr\"{o}bner basisof a zero-dimensional ideal. Then, we analyze the tablesby exactly computing their Frobenius normal forms.The derogatoriness and the diagonalizability are determinedby the normal forms, and the problem is divided into four cases:\par(1) nonderogatory and diagonalizable case,                      \par(2) nonderogatory and nondiagonalizable case,                   \par(3) derogatory and diagonalizable case,                         \par(4) derogatory and nondiagonalizable case.                      \\Subsequently, we construct common eigenvectors symbolically,and compute all the exact zeros with their multiplicities.In the appendix, we show the minute description of multiple zerosusing only the normal set basis, where we do not needexplicit computation of differential conditions.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-36=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-36.ps.gz=year=1997=author=Schreiner; Wolfgang=title=DAJ -- A Toolkit for the Simulation of Distributed Algorithms in Java=howpublished=See also the Web page http://www.risc.uni-linz.ac.at/software/daj=month=11=keywords=parallel computation, electronic publishing, multimedia software,program verification=abstract=This reports describes the DAJ toolkit for designing, implementing,testing, simulating, and visualizing distributed algorithms in Java.DAJ consists of a Java class library with a simple programminginterface that allows to develop distributed algorithms in a messagepassing model. The resulting programs may be executed in standalonemode using a Java interpreter or embedded as applets into HTML pagesand executed by Web browsers. The goal of the toolkit is to provide anuniversally accessible platform for research and education in the areaof distributed algorithms. DAJ is freely available over the World WideWeb.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-37=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-37.ps.gz=note=PhD Thesis=sponsor=ACCLAIM project sponsored by the European Community Basic Research Action(ESPRIT 7195) and the Austrian Science Foundation (FWF Project No. P9374-PHY);CEI PACT project sponsored by the Austrian Ministry of Science and Research.=year=1997=author=Neubacher; Andreas=title=Parametric Robust Stability by Quantifier Elimination=month=11=abstract=Stability analysis is a central aspect of the theory of differentialequations, especially for parameterized problems; one application areawhere parametric stability plays an important rôle is control theory.  Themain goals of this thesis are to apply a quantifier elimination frameworkconsistently to various stability problems and to develop specializedmethods that solve these problems either symbolically or numerically withmathematically guaranteed exactness more efficiently than generalquantifier elimination methods.As a first step, known parametric robust stability problems and knownmethods for solving parameter-free problems are formulated in a generalquantifier elimination framework.  This approach extends work done by otherauthors on applying quantifier elimination theory to robust control andparametric design problems.A known stability test based on positiveness of the Hurwitz determinant isgeneralized and new proofs are given for this test as well as forKharitonov's theorem.In the case where parameters appear linearly and independently, a newmethod for exactly computing the stability margin is presented.In the case where parameters appear nonlinearly and depedently, new methodsfor computing a lower bound on the stability margin and for exactlycomputing the stability margin are developed.Finally, a framework and a general method for approximate quantifierelimination are presented.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-38=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-38.ps.gz=sponsor=Austrian Fonds zur F\"orderung der wissenschaftlichen Forschung projectnumber P11160-TEC ``HySaX'' and by \"OAD, Accion Integrada 30/97.=year=1997=author=Stadelmeyer; Peter + Winkler; Franz=title=Computing the System of Adjoint Plane Curves by Puiseux Expansion=month=12=keywords=algebraic geometry, curves, adjoints, Puiseux series=abstract=Let $\pcurveC$ be an irreducible plane algebraic curve. Acurve $\pcurveD$ is called an adjoint curve of $\pcurveC$ if it meetscertainconditions on the intersection multiplicities with curve-branches of$\pcurveC$. In this paper we show how these intersectionmultiplicities can be computed and how the conditions can be checkedeasily using the polar-curve of $\pcurveC$. This is then usedto compute the linear system of adjoint curves of degree $d$ of$\pcurveC$, for some $d \in \mathbb{N}$. The main objects we deal with are curve-branches which wecompute with the Newton-Puiseux algorithm and represent using theircorresponding Puiseux-series.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-39=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-39.ps.gz=note=Master Thesis=sponsor=FWF project P11414-TEC=year=1997=author=Stoecher; Wolfgang=title=Designing and Prototyping a Functor Language Using Denotational Semantics=month=12=keywords=programming languages, functor, denotational semantics=abstract=Functors are parameterized modules. Especially for mathematical softwarethe concept of functors has increasing importance. We develop herestep by step the typing rules and denotational semantics of an imperative corelanguage with a powerful type system, which is thenextended by introducing modules and functors. Small example programsare given and tested with straight forward implementations of thetype checker written in PROLOG and an interpreter written in SML.=location=2=owner=2=source=3
=ADD==reftype=14=number=97-40=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-50/proceedings.html=year=1997=author=Bonacina; Maria Paola + Furbach; Ulrich=title=FTP97. International Workshop First-Order Theorem Proving. Abstracts.=month=10=abstract=Abstracts of the workshop held at Schloss Hagenberg, Oct 27 - 28, 1997.=location=2=owner=2=source=3
=ADD==bibkey=GC:1995a=author=Collins; George E.=title=Application of Quantifier Elimination to Solotareff's Approximation Problem=number=95-31=year=1995=sponsor= Austrian Science Foundation, grant P8572-PHY.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1995/95-31.ps.gz=abstract=Solotareff's approximation problem is that of obtainingthe best uniform approximation on the interval [-1,+1]of a real polynomial of degree $n$ by one of degree$n - 2$ or less.  Without loss of generalitywe takethe approximated polynomial to be $x^n + r x^{n-1}$,$r \geq 0$.  We treat $r$ as a parameter andseek to compute the coefficients of the bestapproximations, for small fixed values of $n$, aspiecewise algebraic functions of $r$.  We succeed onlyfor $n \leq 4$, but also find that we can easilycompute the coefficients for $n = 5$ for fixed valuesof $r$.  The results serve to display the capabilitiesand limitations of our quantifier elimination program{\bf qepcad}.  We also prove that the coefficients ofthe best approximation, for any $n$, are continuousfunctions of $r$.=location=2=owner=2=source=3=reftype=14
=ADD==author=Ardeleanu; Eugen=title=Algebra Omologica cu Aplicatii in Teoria Dimensiunii(Omological Algebra with Applications to Dimension Theory, in Romanian)=year=1985=institution=Universitatea Bucuresti=note=Master Thesis=reftype=11=source=3
=ADD==author==editor==title==year==publisher==volume==series==address==edition==note==owner==reftype=1=source=3
=ADD==author=Bluman; K. W. + Kumei; S.=title=Symmetries and Differential Equations=year=1996=publisher=Springer=volume=81=series=Applied Mathematical Sciences=owner=2=reftype=1=source=3
=ADD==author=Sattinger; D. H. + Weaver; O. L.=title=Lie Groups and Algebras with Applications to Physics, Geometry, and Mechanics=year=1986=publisher=Springer=volume=61=series=Applied Mathematical Sciences=owner=2=reftype=1=source=3
=ADD==author=Olver; Peter J.=title=Applications of Lie Groups to Differential Equations=year=1993=publisher=Springer=volume=107=series=Graduate Texts in Mathematics=edition=2=owner=2=reftype=1=source=3
=ADD==author=Smolka; Gert=title=Principles and Practice of Constraint Programming - CP97=year=1997=publisher=Springer=volume=1330=series=LNCS=owner=2=reftype=10=source=3=note=Two copies
=ADD==author=Hansen; H. R.=title=Arbeitsbuch Wirtschaftsinformatik. Lexikon, Aufgaben und Loesungen=year=1997=publisher=Lucius & Lucius=volume=5=address=Stuttgart=owner=1=reftype=1=source=3
=ADD==author=Hofer; Susanne + Doucek; Petr=title=IDIMT'97: 5th Interdisciplinary Information Management Talks=year=1997=publisher=Oesterreischische Computer Gesellschaft=volume=102=series=Schriftenreihe der OeCG=owner=2=reftype=10=source=3
=ADD==author=Lueschow; Stefan=title=Info-Server 97/98. Lieferzeichnis Daten und Telekommunikation=year=1997=publisher=DATACOM=owner=1=reftype=8=source=3
=ADD==author=Clocksin; W. F. + Mellish; C. S.=title=Programming in Prolog=year=1994=publisher=Springer=edition=4=note=2 copies=owner=2=reftype=1=source=3
=ADD==author=Freuder; Eugene C. + Mackworth; Alan K.=title=Constraint-Based Reasoning=year=1992=publisher=MIT / Elsevier=series=Special Issues of Artificial Intelligence=note=Special Issue of Artificial Intelligence 58=owner=2=reftype=15=source=3
=ADD==author=Van Henteryck; Pascal + Michel; Laurent + Deville; Yves=title=Numerica: A Modelling Language for Global Optimization=year=1997=publisher=MIT Press=owner=2=reftype=1=source=3
=ADD==author=Benhamou; Frederic + Colmerauer; Alain=title=Constraint Logic Programming: Selected Research=year=1993=publisher=MIT Press=series=Logic Programming=note=Selected papers from WCLP'91 (International Workshop on Logic Programming,Marseilles, January 1991) and additional papers=owner=2=reftype=15=source=3
=ADD==author=Saraswat; Vijay + Van Henteryck; Pascal=title=Principles and Practice of Logic Programming: The Newport Papers=year=1995=publisher=MIT Press=owner=2=reftype=15=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=1=owner=2=reftype=1=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=2=owner=2=reftype=1=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=3=owner=2=reftype=1=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=4=owner=2=reftype=1=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=5=owner=2=reftype=1=source=3
=ADD==author=Hazewinkel; Michiel=title=Encyclopaedia of Mathematics=year=1995=publisher=Kluwer Academic Publishers=volume=6=owner=2=reftype=1=source=3
=ADD==author=Vanderburg; Glenn=title=Tricks of the Java Programming Gurus=year=1996=publisher=Sams.net Publishing=note=Includes CD-ROM=owner=2=reftype=1=source=3
=ADD==author=Lemay; Laura + Perkins; Charles L.=title=Teach Yourself JAVA in 21 Days=year=1996=publisher=Sams.net Publishing=note=Includes 3 CD-ROMs=owner=2=reftype=1=source=3
=ADD==author=Gamma; Erich + Helm; Richard + Johnson; Ralph + Vlissides; John=title=Design Patterns. Elements of Reusable Object Oriented Software=year=1995=publisher=Addison-Wesley=series=Addison-Wesley Professional Computing Series=owner=2=reftype=1=source=3
=ADD==author=Meyers; Scott=title=More Effective C++. 35 New Ways to Improve Your Programs and Designs=year=1996=publisher=Addison-Wesley=series=Addison-Wesley Professional Computing Series=owner=2=reftype=1=source=3
=ADD==author=Meyers; Scott=title=Effective C++. 50 Specific Ways to Improve Your Programs and Designs=year=1998=publisher=Addison-Wesley=series=Addison-Wesley Professional Computing Series=edition=2=owner=2=reftype=1=source=3
=ADD==author=Hashim; Safaa H.=title=Exploring Hypertext Programming=year=1990=publisher=Windcrest=series=Advanced Programming Technology=owner=2=reftype=1=source=3
=ADD==author=O'Keefe; Steve=title=Publicity on the Internet=year=1997=publisher=John Wiley & Sons=owner=2=reftype=1=source=3
=ADD==author=Ardeleanu; Eugen=title=Algera omologica cu aplicatii in teoria dimensiunii=year=1985=note=In Romanian language=location=2=owner=2=reftype=7=source=3
=ADD==author=Helmig; R. + Jaeger; W. + Kinzelbach; W. + Knaber; P. + Wittum; G.=title=Modeling and Computation in Environmental Sciences=year==publisher==series==address==note==location=2=owner=2=reftype=1=source=3
=ADD==author==title==year==publisher==series==address==note==location=2=owner=2=reftype=1=source=3
=ADD==author=Rechenberg; Peter + Pomberger; Gustav=title=Informatik Handbuch=year=1997=publisher=Carl Hanser Verlag Muenchen Wien=owner=2=reftype=15=source=3
=ADD==author=Allenby; R. B. J. T.=title=Numbers and Proofs=year=1997=publisher=Arnold=owner=2=reftype=1=source=3
=ADD==author=Klein; Rolf=title=Algorithmische Geometrie=year=1997=publisher=Addison Wesley=owner=2=reftype=1=source=3
=ADD==author=Homann; Karsten=title=Symbolisches Loesen mathematischer Probleme durch Kooperation algorithmischerund Logischer Systeme=year=1997=publisher=infix=series=DISKI 152=note=PhD Thesis=owner=2=reftype=1=source=3
=ADD==author=Hachenberger; Dirk=title=Finite Fields. Normal Bases and Completely Free Elements=year=1997=publisher=Kluwer Academic Publishers=owner=2=reftype=1=source=3
=ADD==author=Felderer; Brigitte=title=Wunschmaschine - Welterfindung: Eine Geschichte der Technikvisionen seit dem 18.Jahrhundert=year=1997=publisher=Springer Wien New-York=reftype=15=note=Collection of articles by several authors=source=3=owner=2
=ADD==author=Agha; Gul A.=title=Actors. A Model of Concurrent Computation in Distributed Systems=year=1986=publisher=MIT Press=owner=2=reftype=1=source=3
=ADD==author=Lisonek; Petr=title=Closed Forms for the Number of Polygon Dissections=year=1995=journal=Journal of Symbolic Computation=volume=20=pages=595-601=location=2=owner=2=source=3=reftype=0
=ADD==author=Kuechlin; Wolfgang W.=title=ISSAC97: International Symposium on Symbolic and Algebraic Computation,Maui, Hawaii, July 1997=year=1997=publisher=ACM Press=note=Has attached the booklet with the poster abstracts.=owner=1=reftype=10=source=3
=ADD==author=Hitz; Markus + Kaltofen; Erich=title=PASCO97: Parallel Symbolic Computation, Maui, Hawaii, July 1997=year=1997=publisher=ACM Press=owner=1=reftype=10=source=3
=ADD==author=Zima; H. P.=title=ACPC91: Parallel Computation: First International ACPC Conference,Salzburg, Austria, September 1991=year=1991=publisher=Springer-Verlag=series=LNCS=number=591=owner=2=reftype=10=source=3
=ADD==author=Hudak; Paul + Jones; Neil D.=title=PEPM91: Symposium on Partial Evaluation and Semantics-Based ProgramManipulation=year=1991=publisher=ACM Press=series=SIGPLAN NOTICES=volume=26=number=9=note=Journal issue, September 1991=owner=2=reftype=10=source=3
=ADD==author=Keranen; V. + Mitic; P. + Hietamaki; A.=title=Innovation in Mathematics. The Second International Mathematica Symposium=year=1997=publisher=Computational Mechanics Publications=address=Southampton, UK=owner=1=reftype=10=source=3
=ADD==author=Dix; Juergen + Furbach; Ulrich + Nerode; Anil=title=Logic Programming and Nonmonotonic Reasoning=year=1997=publisher=Springer=series=LNAI=number=1265=owner=1=reftype=10=source=3
=ADD==author=Helmig; R. + Jaeger; W. + Kinzelbach; W. + Knaber; P. + Wittum; G.=title=Modeling and Computation in Environmental Sciences.Proceedings of the First GAMM-Seminar=year=1995=publisher=viwveg=series=Notes on Numerical Fluid Mechanics=number=59=address=Braunschweig/Wiesbaden=owner=2=reftype=10=source=3
=ADD==author=Chakravarty; Manuel M. T. + Guo; Yike + Ida; Tetsuo=title=Multi-Paradigm Logic Programming=year=1996=publisher=TU Berlin=series=Forschingsberichte der Fachbereichs Informatik=number=96-28=owner=2=reftype=10=source=3
=ADD==author=Goerigk; Wolfgang=title=Alternative Konzepte fuer Sprachen und Lernen(Alternative Concepts for Speaking and Learning, partially German)=year=1996=publisher=Gesellschaft fuer Informatik E. V.=series=PARS: Mitteilungen - Parallel-Algorithmen und Rechnerstructuren=number=15=address=Bonn=owner=2=reftype=10=source=3
=ADD==author=Calmet; Jaques + Campbell; John A. + Pfalzgraf; Jochen=title=AISMC-3: Artificial Intelligence and Symbolic Mathematical Computation=year=1996=publisher=Springer=series=LNCS=number=1138=owner=2=reftype=10=source=3
=ADD==author=nn=title=XVIII ISPRS Congress(International Society for Photogrametry and Remote Sensing):Spatial Information from Images.=year=1996=publisher=ISPRS=note=Programme only=owner=2=reftype=10=source=3
=ADD==author=Shparlinski; Igor + van der Porten; Alf + McCallum; Scott=title=CANT95: Computational Algebra and Number Theory=year=1995=publisher=Macquarie University=address=Sydney, Australia=note=Abstracts.=owner=2=reftype=10=source=3
=ADD==author=Angerer; Marie-Luise + Maier-Rabler; Ursula=title=Time after Media=year=1996=publisher=OeKG: Oesterreichisches Gesellschaft fuer Kommunikationsfragen=note=Programme only, in German=owner=2=reftype=10=source=3
=ADD==author=Lakshman; Y. N.=title=ISSAC96: International Symposium on Symbolic and Algebraic Computation=year=1996=publisher=ACM Press=note=copy 1 of 2=owner=1=reftype=10=source=3
=ADD==author=Lakshman; Y. N.=title=ISSAC96: International Symposium on Symbolic and Algebraic Computation=year=1996=publisher=ACM Press=note=copy 2 of 2=owner=2=reftype=10=source=3
=ADD==author=Danvy; Oliver + Glueck; Robert + Thiemann; Peter=title=Partial Evaluation: International Dagstuhl Seminar=year=1996=publisher=Springer=series=LNCS=number=1110=owner=2=reftype=10=source=3
=ADD==author=Wirsing; Martin + Nivat; Maurice=title=AMAST96: Algebraic Methodology and Software Technology=year=1996=publisher=Springer=series=LNCS=number=1101=owner=2=reftype=10=source=3
=ADD==author=Ablamowicz; Rafal + Lounesto; Pertti + Parra; Josep M.=title=Clifford Algebras with Numeric and Symbolic Computations=year=1996=publisher=Birkhaeuser=reftype=1=source=3
=ADD==author=Mutzel; Petra=title=An Alternative Method to Crossing Minimization on Hierarchical Graphs=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-008=month=3=reftype=11=location=2=owner=2=source=3
=ADD==author=Bachmair; Leo + Ganzinger; Harald=title=A Theory of Resolution=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-005=month=4=reftype=11=source=3=location=2=owner=2
=ADD==author=Brandenburg; Franz J. + Juenger; Michael + Mutzer; Petra=title=Algorithmen zum automatischen Zeichen von Graphen=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-007=month=3=reftype=11=source=3=location=2=owner=2
=ADD==author=Vorobyov; Sergei=title=Third Order Matching in $\lambda \rightarrow$ - {\em Curry} is Undecidable=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-006=month=5=reftype=11=source=3=location=2=owner=2
=ADD==author=Brodal; Gerth S. + Traeff; Jesper L. + Zaroliagis; Christos D.=title=A Parallel Priority Queue with Constant Time Operations=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-011=month=5=reftype=11=source=3=location=2=owner=2
=ADD==author=Garg; Naaven + Manss; Christian=title=Evaluating a 2-approximation algorithm or edge-separators in planar graphs=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-010=month=3=reftype=11=source=3=location=2=owner=2
=ADD==author=Albers; Susanne=title=Better Bounds for Online Scheduling=year=1997=institution=Max-Plank-Institut fuer Informatik=number=MPI-I-97-1-009=month=3=reftype=11=source=3=location=2=owner=2
=ADD==author=Moskaliuk; Stepan S.=title=Walter Thirring=year=1997=publisher=The Walter Thirring International Institute for Mathematical Physics,Astrophysics and Nuclear Investigations, Kyiv=series=Biographical and Bibliographical Series of Classics of World Science=reftype=15=source=3=owner=2
=ADD==author=Who; Who's=title=Who's Who in Science and Engineering (1996-1997)=year=1997=publisher=Marquis Who'sWho=edition=3=reftype=1=source=3
=ADD==author=Gruen; Oskar + Heinrich; Lutz J.=title=Wirtschaftsinformatik. Ergebnisse empirischer Forschung(Business Informatics. Results of Empirical Research, in German)=year=1997=publisher=Springer=series=SpringerWirtschaftswissenschaften=number=19=owner=2=reftype=15=source=3
=ADD==author=Abramsky;  S. + Gabbay;  Dov M. + Maibaum;  T.S.E.=title= Handbook of Logic in Computer Science. Vol 3: Semantic Structures.=year=1994=publisher=Claredon Press=note=London=location=2=owner=2=source=3=reftype=1
=ADD==reftype=14=number=98-02a=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-02a.ps.gz=year=1998=month=03=author=Rolletschek; Heinrich=title=Formal Specification and Verification (Lecture Notes)=abstract=   In these lecture notes the basic theory of program verification is introduced.   In an introductory chapter the fundamental concepts (specification, partial   and total correctness) are defined. Chapter 1 deals with the basic proof rules,   which allow to handle conditionals, while-loops and other control structures.   In chapter 2 these rules are put on a rigorous mathematical basis, using a   formal definition of the semantics of a programming language; this chapter also   presents the theory of weakest pre- and strongest postconditions. Chapter 3   briefly deals with a mixture of topics which are summarized under the headline   `Applications of program verification.' On the one hand, it is shown how   verification could be carried out for programs executed on a real rather than   idealized (mathematical) computer, and on the other hand, an application of   the verification methods for the purpose of complexity analysis is given. The   last two chapters, finally, show how to verify programs containing structured   data types and subroutines, respectively.=keywords=specification, verification=end=
=ADD==reftype=14=number=98-03=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-03.ps.gz=year=1998=month=04=author=Freiseisen; Wolfgang=title=Colored DCEL for Boolean Operations in 2D=abstract=Finding the intersection, union, or difference of two simple polygonsare well known problems in computational geometry. In this paper,new algorithms and their implementation solving these problems arepresented.Assuming that line segment intersection is done already, the common mainidea isto build up a colored doubly connected edge list (DCEL),independently of the actual operation. Colors indicate the relationshipbetween polygons and elements, i.e. every element covered by a polygonwill getits color. In order to performthe respective boolean operation the DCEL is traversed for elements witha certain color. It will be shown that the DCEL can be constructed in $O(n \log(n))$ time and using thisconstructed DCEL the boolean operations need $O(n)$ time. The given implementation, which is part of the \cgal\footnote{Computational Geometry Algorithms Library}library, is parameterized with traits classes that define geometricpredicates, number types, and representation classes. This approachmakes it easy to adapt the algorithms to other geometric types andpredicates.=sponsor=ESPRIT IV LTR Project No. 21957 (CGAL) of the European Union
=ADD==reftype=14=number=98-04=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-04.ps.gz=note=FWF proposal (SFB)=year=1998=author=Langer; Ulrich + Buchberger; Bruno=title=Numerical and Symbolic Scientific Computing=month=06=abstract=The long-term scientific goal of the SFB is the design, verification,implementation, and analysis of numerical, symbolic, and graphical methods forsolving large-scale direct and inverse problems with constraints and theirsynergetical use in scientific computing for real-life problems of highcomplexity. We have in mind the so-called field problems (usually described byPartial Differential Equations (PDEs)) and algebraic problems (e.g. involvingconstraints in algebraic formulation).The particular emphasis of this SFB is put on the integration of graphical,numerical, and symbolic methods on different levels.=location=2=owner=2=source=3
=ADD==reftype=14=number=98-05=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-05.ps.gz=year=1998=month=05=author=Schreiner; Wolfgang=title=Distributed Maple - User and Reference Manual=abstract=Distributed Maple is a system for writing parallel programs in thecomputer algebra system Maple. It allows to create concurrent tasks andhave them executed by Maple kernels running on different machines of anetwork. The system consists of two components:1. A Java class library which implements a general purpose   communication and scheduling mechanism for distributed   applications.2. A binding that allows to access the Java scheduler from Maple and   implements a parallel programming model on top.The system is portable to most kinds of computer networks and can befreely downloaded from         http://www.risc.uni-linz.ac.at/software/distmaple=keywords=parallel and distributed computing, computer algebra systems,Maple, Java=sponsor=Supported by the Austrian Science Foundation (FWF) project HySaX,Proj.No. P11160-TEC
=ADD==reftype=14=number=98-06=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-06.ps.gz=year=1998=month=05=author=Bayer; Thomas=title=Algorithmic Aspects of Invariant Theory=abstract=Description of the state of the art algorithms in invariant theoryof finite groups.=keywords=invariant theory=note=Diploma Thesis=sponsor=
=ADD==reftype=14=number=98-07=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-07.ps.gz=year=1998=month=05=author=Bayer; Thomas=title=Computing the Intersection of Invariant Rings=abstract=We propose an algorithm for computing the intersection of invariant rings$R^{G_{1}}$ and $R^{G_{2}}$ of finite groups $G_{1},G_{2}\leq GL_{n}({\bf K})$, given in terms of algebra generators.The algorithm works in the case that the characteristic of ${\bf K}$ is either $0$ or prime to the order of the group generated by $G_{1}$ and $G_{2}$, and calculates an algebra basisfor the intersection $R^{G_{1}}\cap R^{G_{2}}$.=keywords=invariant theory, computer algebra, intersection of subalgebras=howpublished=submitted to JSC=sponsor=
=ADD==reftype=14=number=98-08=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-08.ps.gz=year=1998=month=06=author=Ratschan; Stefan=title=``Approximate'' Logic - An Overview=abstract=  By ``approximate'' logics we mean extensions and modifications of classical (first order)  predicate logic which provide means for representing and reasoning with knowledge that are in  some sense finer than the classical two- valued approach. We give a classification of such  logics and an overview of the literature on the subject.=sponsor=FWF-SFB-P2
=ADD==reftype=14=number=98-09=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-09.ps.gz=year=1998=month=07=author=Blurock; Edward S.=title=Java Applet Client-Server Interface for a Complex Suite of Chemistry Applications=abstract=This paper describes a grapical interface for a complex suite ofprograms allowing users to access locally and remotely the underlyingchemical software systems.  The non-triviality of this task is rootedin the heterogeneous software (web-browsers and computers underdifferent operating systems) and language (JAVA, C++ and FORTRAN)environments that have to communicate with each other.  The system,however, is modularised in order to shield the user from thiscomplexity and to provide ease of further development.  This isaccomplished with a set of portable, public domain resources.  Thesystem is used to interface a demonstration of the chemical modelingsystem REACTION.=sponsor=
=ADD==reftype=14=number=98-10=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-10.html=year=1998=month=06=author=Buchberger; Bruno + Jebelean; Tudor=title=The Second International Theorema Workshop=abstract=The collection of papers.=sponsor=The workshop and part of the research presented here was supportedby INTAS project 96-0760. Part of the researchers from RISC-Linz are supportedby Austrian Science Fundation (FWF) project FO-1302 (SFB) andby a project grant on ``Computer Algebra'' by Fujitsu Labs, ISIS, Numazu, Japan.
=ADD==reftype=14=number=98-11=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-11.ps.gz=year=1998=month=07=author=Blurock; Edward S.=title=Characterising Complex Reaction Mechanisms using Machine Learning Clustering Techniques=abstract=A machine learning conceptual clustering method applied to reactionmechanisms provides an automatic and, hence, unbiased means todifferentiate between reactive phases within a total reactive process.Similar reactive phases were defined by means of local reactionsensitivity values.  The method was applied to the Hochgreb and Dryeraldehyde combustion mechanism of 36 reactions.  Three major timeranges were found and characterised, an initial phase of aldehydereaction, an intermediate phase where only a small amount of aldehydeis left and an end phase of reactions to final products.  Furtherrefinements of these phases into sub-time intervals were found.  Allranges found could be chemically justified.  This method is meant as asupplement to existing methods of mechanism analysis and its mainpurpose is the automatic characterisation of existing mechanisms andcan only indirectly (i.e., when supplemented with other methods) be used formechanism reduction.=sponsor=
=ADD==reftype=14=number=98-12=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-12.ps.gz=year=1998=month=07=author=Blurock; Edward S.=title=ANALYSIS++: Object-Oriented Framework for Multi-Strategy Machine Learning Methods=abstract={\bf ANALYSIS++} is a framework, written in {\bfC++}, for the manipulation and development of multi-strategy machinelearning methods and their corresponding data objects.  The frameworkconsists of a heirarchy of subframeworks, an object framework forthe management of the data used and generated by machine learningmethods and their further use by other methods, an algorithm frameworkfor the organisation of the machine learning methods and their supportroutines and  a goal framework for the management of algorithms in agoal-oriented strategy.=sponsor=ESPRIT Project 22897, UNI-SOFTWARE PLUS, A-4232 Hagenberg, Austria
=ADD==reftype=14=number=98-13=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-13.ps.gz=year=1998=month=07=author=Blurock; Edward S.=title=Use of Atomic and Bond Parameters in a Spectral Representation of a Molecule for Physical Property Determination=abstract=A method was introduced is a generalization of simple countingprocedures of atomic and bond information.  Instead of being limitedto traditional counts such as atomic number or types of bonds, amolecule is represented in terms of a {\it spectra} of atomic and bondparameters resulting from molecular calculations (semi-empirical, abinitio, etc.).  Which semi-empirical or ab initio method one uses isthe determining factor as to what information is represented in themolecular description.  The main use of this method is in inductivelearning analysis of the relationship between an experimentalmolecular property and molecular substructures.  An example is givenusing semi-empirical calculations as the basis for the spectra.  Sincethis spectral description comprises calculated physical parametersdescribing the atomic and bonding character of the molecule, theresults of the analysis can be better associated with real physicalmechanisms.=howpublished=Journal of Chemical Information and Comuputer Science, 1998=sponsor=
=ADD==reftype=14=number=98-14=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-14.ps.gz=year=1998=month=07=author=Tomuta; Elena=title=An Architecture for Combining Provers and its Applications in the Theorema System=abstract=This thesis is the result of the author's work in the Theorema project whose aimis to build a system integrating Computer Algebra and Logic. One part of thesystem is a mixed interactive-automated theorem prover which offers support tomathematicians by generating automatically the "easy" parts of mathematicalproofs. When generating proofs the system imitates the way in whichmathematicians work.Within this frame, we first investigate the problems appearing when provingwith functors. In order to do thiswe design and implement a simple language allowing the user of the Theoremasystem to define functors and domains and to state properties involving them.We design a functor prover which handles the constructs of thefunctor language and we carry out experiments with concrete proofs generatedautomatically. The functor prover is based on a combination of basic provers inTheorema, each carrying out a special type of reasoning step: higher orderpredicate logic, simplification with respect to a set of equalities, induction.During the implementation of the prover and our experiments, several problemsappeared related to the way the basic provers interact and to how thisinteraction can be adjusted easily to the type of problem at hand.We design and implement a mechanism for provers' interaction whichincludes a language for specifying strategies and interactio patterns duringproof search. This mechanism is now being used in Theorema also outside thefunctor prover. It is based on known artificial intelligence date structures andalgorithms like AND-OR graphs but has several new features which were motivatedby the particular requests of Theorema.This thesis is practice oriented and virtually all of the language constructsand algorithms are implemented in Theorema.=keywords=automatic reasoning=note=PhD Thesis=sponsor=Austrian Science Foundation (FWF), project FO-1302 (SFB).
=ADD==reftype=14=number=98-15=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-15.ps.gz=year=1998=month=10=author=Danielczyk-Landerl; Werner=title=Syntax Processing and Code Generation for a Generic Programming Language=abstract=We describe the techniques developed and used for implementing theparser and code generator for a programming language thatexploits functors, i.e., parameterized modules,for developing generic libraries. An imperative corelanguage is used for describing the implementation of the entitiesprovided by functors. The parser generates a syntax tree representing the parsed sourcetext. Several sub-parsers are called (and call each other) forparsing certain syntax domains ofthe language. In particular, the parsers for the syntax domains of theC-like core language are separated from the actual functor languageparts of the parser. This allows to easily switch to another corelanguage if desired.The parser hides the operators and literals allowed in theexpressions of the language as purely syntactic features from theother parts of the compiler, and makes them, on the other hand,user-definable. The code generator produces C++ (essentially C) code for fullyinstantiated functors. This is compiled by the GNU C++ compilerto objectcode that can be linked to C or C++ programs. The functorlanguage allows the definition of constructors and destructors foruser-defined types. The code generated for expressions serves forthe correct life-time and appropriate destruction of all temporaryvalues. Default implementations for functions are generated fromfunction specifications. Appropriateparameter passing mechanisms are chosen depending on parametermodes and types. This is possible since the semantics of the parametermodes provided by the functor language are not specified in terms ofcertain passing mechanisms. Finally, debugginginformation is included in the generated C++ code that allowstracing the execution of functor language source texts with usualsource level debugging tools.=note=Diploma Thesis=sponsor=FWF project P11414-{\"O}TE ``HPGP---High-Performance Generic Programming''
=ADD==reftype=14=number=98-16=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-16.ps.gz=year=1998=month=10=author=Hemmecke; Ralf + Hillgarter; Erik + Schreiner; Wolfgang + Winkler; Franz=title=An Evaluation of the State of the CASA System=abstract=The computer algebra software CASA (Computer Algebra Software forAlgebraic Geometry), which is based on the computer algebra systemMaple, is being developed by the computer algebra group at RISCunder the direction of F. Winkler. In this report, CASA is analyzedwith respect to its current state and possible improvements. Finally,some improvements and extensions of the system are outlined.=keywords==sponsor=FWF, Project HySaX, P11160-TEC and SFB F013, Project 1304
=ADD==reftype=14=number=98-17=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-17.ps.gz=year=1998=month=11=author=Schicho; Josef + Li; Ziming=title=A Construction of Radical Ideals in Polynomial Algebra=abstract=Given an ideal~$I$ generated by~$n$ polynomials in~$m+n$indeterminates over a field, we construct an ideal~$J$from the given basis of~$I$ and one of its Jacobians.We prove that~$J$ is radical and that~$J$ is the intersectionof some isolated prime ideals of~$I$ if~$J$ is nontrivial.The result may be regarded as a generalization of a lemmaby~D.~Lazard.
=ADD==reftype=14=number=98-18=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-18.ps.gz=year=1998=month=11=author=Pau; Petru + Freiseisen; Wolfgang=title=A Generic Plane-Sweep for Intersecting Line Segments=abstract=An algorithm for reporting all intersections ofa set of line segments is presented. Based on the Bentley-Ottmannsweep-line algorithm, it handles all degenerate casesand takes  $O((n+n_{dip}) \log(n)+k)$ time, where$n$ is the number of segments, $n_{dip}$ is the number of distinctintersection points and $k$ is the size of the output.Unlike other algorithms solving the line segment intersectionproblem, we view the degenerate cases as parts of the problem.Therefore, they are solved in the frame of a  common approach,instead of being handled separately.Some implementation details are also givenusing the generic programming mechanism of \emph{C++}in the frame of \cgal\ (Computational Geometry Algorithm Library).=keywords=computational geometry, sweep-line=sponsor=ESPRIT IV LTR Project No. 21957 (CGAL)
=ADD==reftype=14=number=98-19=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-19.ps.gz=year=1998=month=12=author=Negru; Viorel + Maruster; Stefan + Sandru ; Calin=title=Intelligent system for non-linear simultaneous equations solving=abstract=The goal of this study is to develop an intelligent system able to assistthe user in solving non-linear equation systems. Modeling the human expertise,the system must be able to choose automatically the most adequate numerical methodsor to combine numerical methods for solving a non-linear equations system.  Our study refers to: the acquisition and formalization of human expert knowledge;the task-oriented formalization of reasoning; the design of the numerical routineslibrary and of the methods base.  For this purpose we are using a knowledge based system (rules and objects based)with the possibility to combine symbolic and numerical computing. We are usingclassical numerical methods (Newton, Secant etc.), and also recent methods(conjugated gradient, Broyden etc.). A prototype was implemented using the expertsystem shell Clips.=keywords=expert systems, task-oriented model, coupling symbolic and numerical computing,numerical analysis, non-linear equation systems.
=ADD==reftype=14=number=98-20=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-20.ps.gz=year=1998=month=12=author=Schreiner; Wolfgang=title=On Engineering a Distributed Algorithm=abstract=The aim of this paper to demonstrate rigorous reasoning in the contextof concurrency. We present a small case study on the engineering of adistributed algorithm: its derivation from the problem specification,formal specifications of its behavior and of the desired correctnessproperty, and rigorous proofs that the behavior always meets thisproperty and eventually leads to a desired state.=keywords=distributed algorithms, concurrency, temporal logic, specification, verification=howpublished=Software for Communication Technologies, Third InternationalAustrian-Israeli Technion Symposium with Industrial Forum, April26-27, 1999, Hagenberg, Austria.
=ADD==reftype=14=number=98-21=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-21.ps.gz=year=1998=month=12=author=Matasaru; Bogdan + Schicho; Josef=title=The Complexity Analysis For An Algorithm To Compute Adjoints For Curves Due To Jeremy Teitelbaum=abstract=The method of adjoints is used in many CAD/CAM applications where theparametrization of curves is needed.The aim of this paper is to give an estimation of the complexityof computing adjoints for curves.=keywords=adjoints singularities=sponsor=FWF - Adjoints=end=
=ADD==reftype=14=number=98-22=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-22.ps.gz=year=1998=month=12=author=Schicho; Josef=title=Logic 2 for Mathematicians and Computer Scientists - Lecture notes=abstract=These are the lecture notes of the course given in SS98.
=ADD==reftype=14=number=98-23=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-23.ps.gz=year=1998=month=12=author=Marin; Mircea + Schreiner; Wolfgang=title=CFLP: a Distributed Constraint Solving System for Functional Logic Programming=abstract=CFLP is a distributed software system which aims at integratingconstraint solving capabilities over  various domains in a functionallogic programming environment. In this paper we report on the currentstatas of the development of the system. The general structure and thefunctionality of the system components are presented.=howpublished=P. Kacsuk and G. Kotsis (eds)., DAPSYS'98 Workshop on Distributed and Parallel Systems, September 28-30, 1998, Budapest, Hungary, pp.133-136.=keywords=functional logic programming, constraint solving, distributed systems
=ADD==reftype=14=number=98-24=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-24.ps.gz=year=1998=month=12=author=Caprotti; Olga=title=Symbolic Pattern Solving in Algebraic Structures=abstract=This thesis introduces and develops a new method for finding symbolic solutionsof equations in progressively richer algebraic structures.A symbolic solution, compared to corresponding 'numeric' answer, is advantageousbecause it is expressive, maipulatable, error-free and reusable.Intensive research in symbolic computation has already produced deep results,for instance in unification theory and computer algebra.But, it is not yet sufficient.As soon as the problems increase in complexity, whether for the number ofequations, or their degree, or for the number of symbols involved, thesymbolic methods fail to perform to the expectations of real-worldapplications.However, the problem instance often suggests a skeleton of the solution, a{\em solution pattern}.A promising approach, advocated here, uses these patterns to reduce theoriginal complexity by requesting only solutions of a specific form.Pattern solving is successful if some substitution of the unknowncoefficients, whithin the pattern, turns the pattern into a solution.The core of the method is the possibility of straightforward elimination ofuniversally quantified variables from formulas related to the input problem andsolution pattern.It is shown that fast elimination of universal quantifiers is complete ininfinite integral domains, torsion-free modules over an infinite domain,finite dimensional division algebras over infinite fields, and in gradedexterior algebras, if the underlying scalar field is infinite.These results promise that pattern solving can even be extended beyond therich algebraic structures shown.=note=PhD Thesis=sponsor=ACCLAIM (EP 7195): Advanced Concurrent Constraint Languages,CEI-PACT: Programming Environments, Algorithms, Applications, Compilers, andTools for Parallel Computation, WP4 on Computer Algebra.
=ADD==reftype=14=number=98-25=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-25.ps.gz=year=1998=month=12=author=Buchberger; Bruno + Aigner; Klaus + Dupre; Claudio + Jebelean; Tudor + Kriftner; Franz + Marin; Mircea + Nakagawa; Koji + Podisor; Ovidiu + Tomuta; Elena + Usenko; Yaroslav + Vasaru; Daniela + Windsteiger; Wolfgang=title={\em Theorema}: An Integrated System for Computation and Deduction in Natural Style=abstract=The {\em Theorema} project aims at integrating computation and deduction in asystem that can be used by the working scientist for building and checkingmathematical models, including the design and verification of new algorithms.Currently, the system uses the rewrite engine of the computer algebra system{\em Mathematica} for building and combining a number of automatic/interactiveprovers (high-order predicate-logic, induction for lists/tuples and naturalnumbers, etc.) in natural deduction style and in natural language presentation.These provers can be used for defining and proving properties ofmathematical models and algorithms, while a specially provided ``computingengine'' can execute directly the logical description of these algorithms.=howpublished=CADE 98 (Computer Aided Deduction), Lindau, Germany, July 1998, Workshop on Integrating Computation and Deduction=sponsor=Austrian Science Foundation (FWF), project FO-1302 (SFB).=keywords=automated reasoning
=ADD==reftype=14=number=98-26=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-26.ps.gz=year=1998=month=12=author=Sendra; J.Rafael + Winkler; Franz=title=Algorithms for Rational Real Algebraic Curves=abstract=We study fundamental properties of real curves, especially of rationalreal curves, and we derive several algorithms to decide the realityand rationality of curves in the complex plane.=howpublished=submitted for publication=sponsor=FWF, Proj. HySaX, P11160-TEC, and SFB F013, Proj. 1304. and Austrian-Spanish exchange program Acci\'on Integrada 30/97b.=keywords=algebraic curves, rational parametrization
=ADD==reftype=14=number=98-27=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-27.ps.gz=year=1998=month=12=author=Lichtenberger; Franz=title=Mathematik f\"{u}r Software-Ingenieure: Gibt's das \"{u}berhaupt?=abstract=Es ist unbestritten, da\ss \ in allen technischen Studien, insbesonderein den klassischen Ingenieursdisziplinen, die Mathematikausbildung einenGro{\ss}en Stellenwert besitzt. Das relativ neue Gebit des Software-Engineeringz\"{a}lt zweifelsohne zu den Ingenieurswissweschaften, doch die Relevanz derMathematik wird hier - vor allem von Seiten der Praktiker - oft nicht mehr alsso selbstverst\"{a}ndlich angesehen.Ich m\"{o}chte in diesem Artikel meine ganz pers\"{o}nliche Ansicht zu derim Titel gestallten Frage darstellen, die auf meiner nun gutzwanzigj\"{a}hrigen Lehrerfahrung aus Mathematik und Informatik beruht.Obwohl Einigkeit dar\"{u}ber besteht, da\ss \ Software-Engineering zu denIngenieurdisziplinen zu z\"{a}lehn ist, unterscheidet es sich doch in vielenAspekten von den klassischen Ingenieursf\"{a}chern. Eine ausf\"{u}rliche Diskussion der diesbez\"{u}glichen Gemeinsakeiten und Unterschiede, insbesondere zuverwandten Gebieten wie Informatik und Telematik, is im Rahmen dieses Artikelsnicht m\"{o}glich.  F\"{u}r mich is gerade f\"{u}r das jeweilige Fach relevanteMathematik, die als diskriminiender Faktor angesehen werden kann, da ich dieMathematik immer als das ``Kondensat'' der in einem Fach verwendetenProblemel\"{o}sungsmethoden ansehe. In diesem Sinne m\"{o}chte ichargumentieren, das sich das Software-Engineering {\em wesentlich} von denklassischen Ingenieurdisziplinen unterschiedet, weil es einer ganz anderenMathematik bedarf.=howpublished=Telematik. Zeitschrift des Telematik-Ingenieur-Verbandes. Vol 4. No 2/98.
=ADD==reftype=14=number=98-28=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1998/98-28.ps.gz=year=1998=month=12=author=Lichtenberger; Franz=title=Mathematics Education for Software Engineers: An Underestimated Challenge=abstract=(Note: the paper is in English.)Software Engineering ist eine junge Ingenieursdisziplin und es stellt sich inFrage, welche Art von Mathematik f\"{u}r sie notwendig bzw brauchbar ist.Entgegen der oft vertretenen Meinung, da\ss \ die klassischeIngenieursmathematik hier ebenfalls angebracht ist, wird argumentiert, da\ss \f\"{u}r Software Engineering eine ganz andere Mathematik notwendig w\"{a}re.Anhand eines Beispiels, n\"{a}mlich der mathematischen Definition des in derSoftwaretechnik fundamentalen Begriffs ``abstrakter Datentyp'' wird gezeigt,da\ss \ dazu z.B. Methodes aus der Kategorientheorie gebraucht werden.Auf diese Art von Mathematik bereitet die Schulmathematik \"{u}berhaupt nichtvor. Die Entwiklung von in diese Richtung gehenden Lehrpl\"{a}nen stellt einegro{\ss}e Herausforderung dar.=howpublished=A. Melezinek, V. M. Prichodko (Hrsg.) P\"{a}dagogische Probleme in derIngineurausbildung. Band 1. Referate des 27. Internationalen SymposiumsIngenieurp\"{a}dagogik'98.
=ADD==author=Kacsuk; Peter + Kotsis; Gabriele=title=DAPSYS98. Workshop on Distributed and Parallel Systems.Budapest, Hungary, Sep 27 - 29,=year=1998=publisher=Universitaet Wien=series=Techreports, Inst. fuer Angewandte Informatik und Informationssysteme=number=TR-98102=owner=2=reftype=10=source=3
=ADD==author=Heugl; Helmuth + Klinger; Walter + Lechner; Josef=title=Mathematikunterricht mit Computeralgebra-Systemen=year=1996=publisher=Addison-Wesley=owner=2=reftype=1=source=3
=ADD==author=Brim; Lubos + Gruska; Jozef + Zlatuska; Jiri=title=MFCS'98. Mathematica Foundations of Computer Science.23 International Symposium, Brno, Czech Republic, Aug.=year=1998=publisher=Springer=series=LNCS=number=1450=owner=2=reftype=10=source=3
=ADD==author=Kirchner; Claude + Kirchner; Helene=title=CADE-15. 15th International Conference on Automated Deduction.Lindau, Germany, July.=year=1998=publisher=Springer=series=LNAI, LNCS=address=1421=owner=2=reftype=10=source=3
=ADD==author=Bjorner; Nikolaj S. + Haenhle; Reiner + Menzel; Wolfram + Reif; Wolfgang +Schmitt; Peter H.=title=Integration of Deductive Systems.International Workshop by CADE-15. Lindau, Germany, July 5 - 6.=year=1998=publisher=none=owner=2=reftype=10=source=3
=ADD==author=Mendelson; Elliot=title=Introduction to Mathematical Logic=year=1997=publisher=Chapman & Hall=edition=4=owner=3=reftype=1=source=3
=ADD==author=Gloor; Oliver=title=ISSAC 98. International Symposium on Symbolic and Algebraic Computation.Rostock, Germany, Aug 13 - 15.=year=1998=publisher=ACM Press=owner=2=reftype=10=source=3
=ADD==author=Smolka; Gert=title=CP97. Principles and Practice of Constraint Programming.Third International Conference. Linz, Austria, Oct/Nov.=year=1997=publisher=Springer=series=LNCS=number=1330=owner=2=reftype=10=source=3
=ADD==author=Stollnitz; Eric J. + Derose; Tony D. + Salesin; David H.=title=Wavelets for Computer Graphics. Theory and Applications.=year=1996=publisher=Morgan Kaufmann=series=The Morgan Kaufmann Series in Computer Graphics and Geometric Modelling=owner=2=reftype=1=source=3
=ADD==author=Lachmayer; Herbert + Louis; Eleonora=title=Work and Culture. Buero. Inszenierung von Arbeit.=year=1998=publisher=Ritter Verlag=owner=2=reftype=1=source=3
=ADD==author=Breitenecker; F.=title=CASe. Computer Algebra Systeme. Einsatz, Anwndungen, Entwiklungen.Seminar ueber Modellbildung und Simulation. TU Wien, 21 Apr.=year=1998=publisher=ARGESIM, TU Wien=owner=2=reftype=10=source=3
=ADD==author=Kajler; N.=title=Computer-Human Interaction in Symbolic Computation=year=1998=publisher=Springer=series=Texts and Monographs in Symbolic Computation=note=Selected papers from HISC workshop, Amsterdam 1994.=owner=2=reftype=1=source=3
=ADD==author=Delzanno; Giorgio + Podelski; Andreas=title=Model checking infinite-state systems in CLP=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-2-012=month=07=reftype=11=source=3
=ADD==author=Degtyarev; Anatoli + Voronkov; Andrei=title=Equality reasoning in sequent-based calculi=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-2-011=month=07=reftype=11=source=3
=ADD==author=Krysta; Piotr + Lorys; Krzysztof=title=New approximation algorithms for the achromatic number=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-016=month=07=reftype=11=source=3
=ADD==author=Crauser; Andreas + Ferragina; Paolo + Melhorn; Kurt + Meyer; Ulrich + Ramos; Edgar=title=Randomized external-memory algorithms for some geometric problems=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-017=month=07=reftype=11=source=3
=ADD==author=Dubhashi; Devdatt + Ranjan; Desh=title=On positive influence and negative dependence=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-018=month=07=reftype=11=source=3
=ADD==author=Melhorn; Kurt=title=WAE'98: Proceedings of the 2nd Workshop on Algorithm Engineering=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-019=month=08=reftype=11=source=3
=ADD==author=Albers; Susanne + Schmidt; Guenter=title=Scehduling with unexpected machine breakdowns=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-021=month=09=reftype=11=source=3
=ADD==author=Henzinger; Monika R. + Leonardi; Stefano=title=Scheduling multicasts on unit-capacity trees and meshes=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-015=month=05=reftype=11=source=3
=ADD==author=Rueb; Christine=title=On Wallace's method for the generation of normal varieties=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-020=month=07=reftype=11=source=3
=ADD==author=Lie; Sophus=title=Theorie der transformationsgruppen. Erster Abschnitt=year=1970=publisher=Chelsea=owner=2=reftype=1=source=3
=ADD==author=Lie; Sophus=title=Theorie der transformationsgruppen. Dritter ind Letzter Abschnitt=year=1970=publisher=Chelsea2=reftype=1=source=3
=ADD==author=Lie; Sophus=title=Vorlesungen ueber continuierliche gruppen=year=1971=publisher=Chelsea=series==owner=2=reftype=1=source=3
=ADD==author=Winskel; Glynn=title=LICS'97: 12th annual IEEE Symposium on Logic in Computer Science. Warsaw, Poland=year=1997=publisher=IEEE Computer Society=owner=2=reftype=10=source=3
=ADD==author=Pratt; Vaughan=title=LICS'98: 13th annual IEEE Symposium on Logic in Computer Science. Inidianapolis, Indiana=year=1998=publisher=IEEE Computer Society=owner=2=reftype=10=source=3
=ADD==author=Anonymus; X.=title=PARS'98=year=1998=publisher=GI Deutschland=owner=2=reftype=10=source=3
=ADD==author=Ivanov; A. V.=title=Study of the double mathematical pendulum - I.Numerical investigation of homoclinic transversal intersections=year=1998=institution=Universitat de Barcelona=number=256=month=09=reftype=11=source=3
=ADD==author=Kohatsu-Higa; Arturo + Marquez-Carreras; David + Sanz-Sole; Marta=title=Asymptotioc behaviour of the density in a parabolic SPDE=year=1998=institution=Universitat de Barcelona=number=257=month=09=reftype=11=source=3
=ADD==author=Bonacina; Maria Paola + Furbach; Ulrich=title=FTP97: International Workshop on First Order Theorem Proving. Hagenberg, Austria=year=1997=publisher=RISC-Linz=note=RISC techreport 97-50=owner=2=reftype=10=source=3
=ADD==author=Van Hentenryck; Pascal + Saraswat; Vijay=title=Proceedings of the 1996 ACM Workshop on Strategic Directions in Constraint Programming=year=1997=publisher=Kluwer Academic=note=Special issue of Constraints - vol 2, no 1, April 1997=owner=2=reftype=10=source=3
=ADD==author=Drogemuller; Robin=title=PAP97. 5th International Conference on the Practical Applications of Prolog.=year=1997=publisher=PAP=owner=2=reftype=10=source=3
=ADD==author=Wallace; Mark=title=PACT97. Proceedings of the Third International Conference on the Practical Application ofConstraint Technology. London.=year=1997=publisher=PACT=owner=2=reftype=10=source=3
=ADD==author=Caviness; B. F. + Johnson; J. R.=title=Quantifier Elimination and Cylindrical Algebraic Decomposition.Proceedings of the International Symposium dedicated to George Collins.Oct. 1993, Hagenberg, Austria.=year=1998=publisher=Sringer=series=Texts and Monographs in Symbolic Computation=owner=2=reftype=10=source=3
=ADD==author=Vives; Sergi + Salicru; Miquel + Ocana; Jordi=title=Moments of the statistics associated at $(h, \theta)$-entropies=year=1998=institution=Universitat de Barcelona=number=255=month=07=location=2=owner=2=reftype=11=source=3
=ADD==author=Hamada; Mohamed Esmail Ali=title=Lazy conditional narrowing calculi and their implementation=year=1998=publisher=University of Tsukuba=note=PhD Thesis=owner=2=reftype=1=source=3
=ADD==author=Froeberg; Ralf=title=An introduction to Groebner Bases=year=1997=publisher=John Wiley & Sons=series=Pure and Applied Mathematics=owner=2=reftype=1=source=3
=ADD==author=Coplien; James A. + Schmidt; Douglas C.=title=Pattern languages of program design=year=1995=publisher=Addison-Wesley=owner=3=reftype=1=source=3
=ADD==author=Pinnock; Jonathan=title=DCOM application development=year=1998=publisher=Wrox Press=owner=3=reftype=1=source=3
=ADD==author=Stroustrup; Bjarne=title=The C++ programming language=edition=3=year=1998=publisher=AT & T=owner=3=reftype=1=source=3
=ADD==author=Law; Averill M. + Kelton; W. David=title=Simulation modeling and analysis=year=1991=publisher=McGraw-Hill=owner=3=reftype=1=source=3
=ADD==author=Broy; Manfred + Merz; Stephan + Spies; Katharina=title=Formal Systems Specification. The RPC-Memory Specification Case Study=year=1996=publisher=Springer=note=LNCS 1169=owner=3=reftype=15=source=3
=ADD==author=Apt; Krzystof R. + Olderog; Ernst-Ruediger=title=Verification of sequential and concurrent programs=year=1997=edition=2=publisher=Springer=series=Graduate Texts in Computer Science=owner=3=reftype=1=source=3
=ADD==author=Goguen; Joseph A. + Malcom; Grant=title=Algebraic Semantics of Imperative Programs=year=1996=publisher=MIT Press=series=Foundations of Computing=owner=3=reftype=1=source=3
=ADD==author=none=title=Langenscheidts Grosses Schulwoerterbuch. Englisch-Deutsch.=year=1996=publisher=Langenscheidt=owner=3=reftype=1=source=3
=ADD==author=none=title=Langenscheidts Grosses Schulwoerterbuch. Deutsch - Englisch=year=1996=publisher=Langenscheidt=owner=3=reftype=1=source=3
=ADD==author=Rogerson; Dale=title=Inside COM. Microsoft's Component Object Model=year=1997=publisher=Microsoft Press=note=Uni inventory 14574=owner=3=reftype=1=source=3
=ADD==author=Windsteiger; Wolfgang=title=Using GR\"OBNER as a "Black Box"=number=93-71=year=1993=sponsor=This work was done during a two-months visit at the Department of Electronics and Electric Engineering at the University of Pretoria, South Africa.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-71.ps.gz=abstract=This document should serve as a User's Guide to thelibrary GR\"OBNER and its accompanying I/O libraryGR\"OBNER-IO for those users who do not intend to changeany part of the library but rather want to use it as a"Gr\"obner-basis-calculator". Therefor, no deep insightinto the structure of the programs,software-technological issues, and data structures isrequired but some simple recipes, how to solve certainclasses of problems by Gr\"obner bases are desired.=location=2=owner=2=source=3=reftype=14
=ADD==author=Windsteiger; Wolfgang + Buchberger; Bruno=title=GR\"OBNER: A Library for Computing Gr\"obner Bases based on SACLIB=number=93-72=year=1993=sponsor=Austrian Ministery of Science, proj. no. 613.523/3-27a/89  (``Gr"{o}bner Bases''), POSSO project (Polynomial System Solving), Esprit III Basic Research Action 6846,  supported by the Austrian Science Foundation.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-72.ps.gz=abstract=Almost every computer algebra system contains someimplementation of the Gr\"obner bases algorithm. Thepresent implementation has the following specificfeatures:The source code is distributed and publically availablefree of charge.The library is written in C.A simple but efficient mechanism of polymorphism isimplemented that enables the user to adjust the libraryto a wide variety of coefficient domains, power productand polynomial representations, admissible orderings,selection strategies for pairs, etc.Thus, GR\"OBNER should be a useful toolfor those who want to do research in Gr\"obner basestheory and applications and, hence, need access to alldetails of the implementationand also for those who want to apply the algorithm as ablack box, possibly as a subalgorithm in a largerimplementation, and need high efficiency.=location=2=owner=2=source=3=reftype=14
=ADD==author=Vasaru; Daniela + Ida; Tetsuo + Buchberger; Bruno=title=First International Theorema Workshop=number=97-20=month=6=year=1997=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-23/index.html=keywords=automated theorem proving,natural deduction, computer algebra system=note=Proceedings of the workshop, including also some older papers for reference.=location=2=owner=2=source=3=reftype=14
=ADD==author=Buchberger; Bruno + Ida; Tetsuo + Vasaru; Daniela=title=First International Theorema Workshop=number=97-20=month=6=year=1997=sponsor=TARA project (University of Tsukuba, Japan, Chair of Professor Tetsuo Ida),project "Coordination Programming in Open Computiong Environments"(Advanced Information Technology Program - AITPof the Information-Techology Promotion Agency - IPA, Japan),grant on "Computer Algebra" by Fujitsu Labs, ISIS, Numazu, Japan.=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1997/97-20/index.html=keywords=automated theorem proving,natural deduction, computer algebra system=note=Proceedings of the workshop, including also some older papers for reference.=location=2=owner=2=source=3=reftype=14
=ADD==author=Schreiner; Wolfgang + Ida; Tetsuo + Marin; Mircea=title=CFLP: a Mathematica Implementation of a Distributed Constraint Solving System=number=99-35=month=12=year=1999=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-35.ps.gz=abstract=The need for combining and making cooperate various constraintsolvers is widely recognized. Such an integrated system would allowsolving problems that can not be solved by a single solver.CFLP (Constrained Functional Logic Programming language) is adistributed software system consisting of a functional logicinterpreter running on one machine and a number of constraint solvingengines running on other machines. The interpreter is based on adeterministic version of a lazy narrowing calculus which was extendedin two main directions: (a) the possibility to specify explicitOR-parallelism, and (b) the possibility to specify constraints overvarious domains. The OR parallel features of the interpreter allowthe decomposition of the solution space into different subspacesdenoted by varous sets of constraints; the individual sets are solvedby different constraint solving engines in parallel and joinedtogether to form the total solution set. This allows to investigateproblems with large solution spaces using the computational poweravailable in large computer networks.The system is written entirely in Mathematica and uses the MathLinkprotocol for inter-process communication. The current implementationcan solve problems expressible in functional logic and involvingconstraints such as linear, polynomial and differential equations.=keywords=functional programming, logic programming, constraint solving, distributed systems, Mathematica.=howpublished=IMS '99, Third International Mathematica Symposium, Hagenberg, Austria, August 23-25, 1999.=location=2=owner=2=source=3=reftype=14
=ADD==author=Marin; Mircea + Ida; Tetsuo + Schreiner; Wolfgang=title=CFLP: a Mathematica Implementation of a Distributed Constraint Solving System=number=99-35=month=12=year=1999=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-35.ps.gz=abstract=The need for combining and making cooperate various constraintsolvers is widely recognized. Such an integrated system would allowsolving problems that can not be solved by a single solver.CFLP (Constrained Functional Logic Programming language) is adistributed software system consisting of a functional logicinterpreter running on one machine and a number of constraint solvingengines running on other machines. The interpreter is based on adeterministic version of a lazy narrowing calculus which was extendedin two main directions: (a) the possibility to specify explicitOR-parallelism, and (b) the possibility to specify constraints overvarious domains. The OR parallel features of the interpreter allowthe decomposition of the solution space into different subspacesdenoted by varous sets of constraints; the individual sets are solvedby different constraint solving engines in parallel and joinedtogether to form the total solution set. This allows to investigateproblems with large solution spaces using the computational poweravailable in large computer networks.The system is written entirely in Mathematica and uses the MathLinkprotocol for inter-process communication. The current implementationcan solve problems expressible in functional logic and involvingconstraints such as linear, polynomial and differential equations.=keywords=functional programming, logic programming, constraint solving, distributed systems, Mathematica.=howpublished=IMS '99, Third International Mathematica Symposium, Hagenberg, Austria, August 23-25, 1999.=location=2=owner=2=source=3=reftype=14
=ADD==author=Hoare; C.A.R.=title=Communicating Sequential Processes=year=1985=publisher=Prentice/Hall International, London=location=2=owner=2=source=3=reftype=1
=ADD==reftype=14=number=99-01=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-01.ps.gz=year=1999=month=01=author=Bikker; Piet + Uteshev; Alexei Yu.=title=On the B\'{e}zout Construction of the Resultant=abstract=This paper deals with some idea of B\'{e}zout and his successorsPoisson, Netto and Laurent for solving polynomial systems.We treat them from the determinantal and from the Gr\"{o}bnerbasis point of view.This results in effective algorithms for constructing the multivariateresultant.Other problems of the Elimination Theory are discussed: how to findan eliminant for a polynomial system, how to represent its zerosas the rational functions of the roots of this eliminant and how toseparate zeros.=sponsor= 
=ADD==reftype=14=number=99-02=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-02.ps.gz=year=1999=month=01=author=Schicho; Josef=title=A direct method for polynomial parametrization of curves=abstract=The problem of finding polynomial parametrization of curves - if exist -can be solved by rational parametrization methods and subsequentimprovement of the result. In this paper we try to give a directapproach.=sponsor=FWF - adjoints project=end=
=ADD==reftype=14=number=99-03=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-03.ps.gz=year=1999=month=01=author=Bodnar; Gabor + Schicho; Josef=title=A Computer Program for the Resolution of Singularities=abstract=Villamayor's constructive proof for the resolution of singularitiesimplicitly contains an algorithm, which has been implemented bythe authors. We describe some key features which had to be addedas to make it work on the computer.=keywords=singularities=note=submitted to proceedings of Obergurgl 97=sponsor=FWF - Adjoints
=ADD==reftype=14=number=99-04=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-04.ps.gz=year=1999=month=01=author=Schicho; Josef + Tesacek; Antonin=title=An Improved Projection Operator for CAD using Groebner Bases=abstract=In this paper is presented an improvement of projection operatorin cylindrical algebraic decomposition (CAD) algorithm, which isvery useful algorithm for solving many important mathematicalproblems involving algebraic constraints.The Groebner bases computation is used in improved projectionoperator, which yields in smaller projection sets.=sponsor=SFB project 3=keywords=quantifier elimination
=ADD==reftype=14=number=99-05=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-05.ps.gz=year=1999=month=01=author=Pau; Petru=title=Translating Convex Polyhedra to Contain a Maximum Number of Points=abstract=We present a generalization of a problem of optimal placementfor convex shapes: {\it find a translation of a convex$3$-dimensional polytope such that it contains a maximum numberof points from a given set}. For a polyhedron with $m$ verticesand a set of $n$ points in space, the algorithm finds aplacement of maximal containment in $O(mnd^2\log md)$.=howpublished=Accepted for publication by the Annals of the West University ofTimisoara, Romania=keywords=optimal placement
=ADD==reftype=14=number=99-06=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-06.ps.gz=year=1999=month=01=author=Bodnar; Gabor + Schicho; Josef=title=Automated Resolution of Singularities for Hypersurfaces=abstract=We give a description of an algorithm for the resolutionof singularities, in the case of hypersurfaces in characteristic~0.It is based on a constructive existence proof due to Villamayor.The algorithm is implemented in Maple.=note=Submitted for the JSC special issue (1999)=sponsor=FWF, Adjoints project
=ADD==reftype=14=number=99-07=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-07.ps.gz=year=1999=month=03=author=Pau; Petru + Schicho; Josef=title=Quantifier Elimination for Trigonometric Polynomials by Cylindrical Trigonometric Decomposition=abstract=Given a formula $\Phi$ in $r$ variables, some of them quantifiedand/or occurring as arguments in trigonometric functions, weconsider in this paper the problem of finding a quantifier-freeformula equivalent to $\Phi$.We present an algorithm that computes first a decomposition of the spaceso that the polynomials occurring in $\Phi$ are sign-invariant overeach cell of this decomposition. Then the cells over which $\Phi$ istrue are collected: their description gives a quantifier-free formulaequivalent to $\Phi$. The algorithm is an adaption of a well-knownalgorithm for the same problem with polynomial functions.=sponsor=FWF project SFB F1303=end=
=ADD==reftype=14=number=99-08=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-08.ps.gz=year=1999=month=03=author=Schreiner; Wolfgang=title=A Parallel Computer Algebra System Based on Maple and Java=abstract=Distributed Maple is a system for writing parallel programs in thecomputer algebra system Maple. It allows to create concurrent tasksand to execute them by Maple kernels running on different machines ofa network. The system consists of two components:* A Java class library which implements a general purpose communicationand scheduling mechanism for distributed applications.* A binding that allows to access the Java scheduler from Maple andimplements a parallel programming model on top.The system is portable to most kinds of computer networks and isfreely available.=howpublished=Software for Communication Technologies, Third International Austrian-Israeli Technion Symposium with Industrial Forum, April 26-27, 1999, Hagenberg, Austria.=sponsor=FWF project P11160-TEC "HySaX"=keywords=distributed systems, computer algebra, Maple, Java.
=ADD==reftype=14=number=99-09=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-09.ps.gz=year=1999=month=04=author=Schreiner; Wolfgang=title=Developing a Distributed System for Algebraic Geometry=abstract=We report on a project on parallelizing parts of the software libraryCASA for computing with and reasoning about objects in algebraicgeometry with applications in computer aided geometric design andsolid modeling. CASA is implemented in the language of the computeralgebra system Maple; we therefore have developed ``DistributedMaple'' as an environment for executing parallel Maple programs onmultiple computers of a network. Using this environment, we havestarted the parallelization of some important CASA algorithms; for aparticular subproblem we achieve a speedup of 15 on a heterogeneousnetwork with 24 processors distributed among PCs, workstations, andshared memory multiprocessors.=howpublished=EURO-CM-PAR'99 Third Euro-conference on Parallel and DistributedComputing for Computational Mechanics, Weimar, Germany, March 20--25,1999, Barry H.V. Topping (ed.), Civil-Comp Press, Edinburgh.=sponsor=FWF project P11160-TEC (HySaX)=keywords=parallel computing, computer networks, CASA, Maple, Java
=ADD==reftype=14=number=99-10=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-10.ps.gz=year=1999=month=04=author=Caruso; Fabrizio + Schneider; Carsten + Van De Weyer; Geert + Schreiner; Wolfgang=title=A Student Dictionary System=abstract=In this paper we present a detailed case study of formal systemsspecification with the aid of the term rewriting system cafeOBJ. Thesoftware system we use for this case study is a rather straightforwardand uncomplicated system that we call a "Student DictionarySystem". This is basically an electronic dictionary that has somefunctions allowing its users to test their knowledge of the vocabularyof a certain language.We demonstrate, using this example, how an informal notion of thefunctionality of a software system is translated into a formalformulation of the functionality of this software system using notionsfrom the theory of formal systems specification. Furthermore, wedemonstrate how implementing this formal specification in a termrewriting language helps the software designer to test the currentfunctionality of his or her system and in that way helps him or her toresolve ambiguities in the initial design of the system.=keywords=algebraic specifications, formal methods, software engineering, cafeOBJ
=ADD==reftype=14=number=99-11=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-11.ps.gz=year=1999=month=04=author=Hillgarter; Erik=title=The Classification Problem for (Point) Symmetries of 2nd Order PDE's in one Dependent and two Independent Variables=abstract=This report deals with the most important means for finding closed formsolutions of differential equations, namely the so callednon-trivial symmetries that a given DE may admit.=note=SFB Report=sponsor=FWF project F013, SFB F013
=ADD==reftype=14=number=99-12=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-12.ps.gz=year=1999=month=05=author=Chyzak; Frederic=title=Holonomic Functions in Computer Algebra --- Slides of a Series of Talks=abstract=The present document collects the slides from a series of talks givenby the author in Winter 1999 at the {\em Combinatorics Seminar\/} heldby Peter Paule in RISC-Linz (Austria).  Its main goal is to presentalgorithms for symbolic summation and integration, and also for otheralgorithmic manipulations of special functions and combinatorialsequences.  But it also provides the detailed background on holonomyrequired in algorithmic applications.=note=slides of a series of talks=sponsor=SFB grant F1305 of the Austrian Science Foundation (FWF)=keywords=computer algebra, holonomic functions, symbolic integration, symbolic summation, polynomial elimination, Groebner bases, D-modules, Zeilberger's algorithm, Ore operators
=ADD==reftype=14=number=99-13=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-13.ps.gz=year=1999=month=05=author=Szigeti; Ferenc + De Sarrazin; Gisela + Cardillo; Juan=title=Computer aided problem solving via optimization=abstract=Assuming a finite  set of tools with a rulebased implementation, we define a language. The active tools aredefined at each word of language. Suppose that a valuationfunction is given on our language, which indicates whether asequence of tools (word) solves a certain task. Then we constructa minimal realization, a graded state space representation of thevaluation function. Finally, by calculating an ``optimal control"problem for a multi-(two) objective function, we can compute thatafter making a ``move" (applying a new active tool) the solutionof our task is approaching, moving away, or that the step does notaffect our ability to solve our task. Hence, after theimplementation of our algorithm, the problem solving is supervisedby an intelligent computer, capable of the evaluation and decisionmaking.=keywords=language, discrete events dynamics system, minimum principle, multi-objetive function, intelligent dialogue.
=ADD==reftype=14=number=99-14=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-14.ps.gz=year=1999=month=06=author=Marin; Mircea + Ida; Tetsuo + Middeldorp; Aart + Yanagi; Takura=title=LNCA: A Lazy Narrowing Calculus for Applicative Term Rewriting Systems=abstract=We propose a new calculus, called LNCA, to deal efficiently with confluentapplicative term rewriting systems, and prove its soundness andcompleteness.=note=Also published as Technical Report ISE-TR-99-158, Tsukuba, Japan=sponsor==keywords=functional logic programming, lazy narrowing
=ADD==reftype=14=number=99-15=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-15.tar.gz=year=1999=month=06=author=Windsteiger; Wolfgang=title=Theorema: Overview on Using the System and Details on Composing Hierarchical Knowledge Bases=abstract=Parts of the contents of this presentation were contributed by members of the Theorema group at RISC, Hagenberg, Austria.The Intention of the Theorema SystemOrganizing Structured Knowledge in TheoremaSome ExamplesProspects for the Future=note=Presented at the Edinburgh Sommer School in Logic, Language, and Computation, 1999.=sponsor=Austrian Science Fundation (FWF), SFB project P1302 (Theorema)=keywords=automatic reasoning
=ADD==reftype=14=number=99-16=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-16.ps.gz=note=Diploma Thesis, FHS Hagenberg. Also available as Mathematica notebook ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-16.nb.gz=year=1999=month=07=author=Kirchner; Martin=title=Program Verification with the Mathematical Software System Theorema=abstract=With Theorema, the Research Institute for Symbolic Computation inHagenberg attempts to develop an integrated and comprehensivemathematical environment, with emphasis on a "natural" mathematicallanguage with clear semantics and the support of mathematical proving.Within the scope of the thesis we have extended Theorema by averification system for simple sequential programs.The verification system is designed for educational purposes. Itprovides an environment for Software Engineering students to learn thebasics of formal methods in software development: the formalspecification of programs, the annotation of programs and the formalproof of correctness.The most important part of the verification system is a tool, whichtakes a specification and an annotated program and generatesso-called verification conditions. These are mathematicalstatements which are to be proved; either by "hand", using an existingautomated Theorema prover, or with an interactive interface to aTheorema prover. In the thesis we discuss the implementation of such averification condition generator based on a "predicate transformer"function, and describe the verification rules in  detail.The user interfaces for specifications and programs follow theconventions of Theorema and are also presented elaborately. The programsto verify are written in Theorema Procedural Language, a small languagedesigned in the scope of this thesis to enable procedural programmingwithin the functional environment of Theorema. The embedding of thislanguage into the Theorema system allows to specify, implement, verifyand execute programs within one uniform environment. We demonstrate theuse of the system in numerous examples and provide a tutorial for futureusers.=keywords=program verification, verification condition generator, mathematical education=end=
=ADD==reftype=14=number=99-17=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-17.ps.gz=year=1999=month=07=author=Blurock; Edward S.=title=ANALYSIS++: Object-Oriented Framework for Generalized Machine Learning Algorithms=abstract=  ANALYSIS++ is a system, written in C++, for the  manipulation and development of generalized machine learning methods  within a multi-strategy approach.  The system's flexibility is a  result of the object-oriented principles used in the design of its  component frameworks: object, algorithm and run.  The object  framework is for the management of the data used and generated by  machine learning methods. The algorithm framework organizes the  machine learning methods and their support routines.  The run  framework manages algorithms in a goal-oriented strategy.  This  paper outlines the essential classes of each framework with examples  on how they are used in the design of generalized machine learning  methods.=sponsor=UNI-Software Plus, FLLL=keywords=machine learning, framework, object-oriented
=ADD==reftype=14=number=99-18=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-18.ps.gz=year=1999=month=07=author=Blurock; Edward S.=title=Generalized Fuzzy Rule Induction: An Object-Oriented Approach=abstract=This paper outlines the implementation of generalized fuzzy ruleinduction methods in an object-oriented framework.  A key to thegeneralization process is the formulation of partial characterizationsand probabilities within a generalized logical framework.  The logicand the algorithms are implemented in a general way within anobject-oriented framework.  The pattern of the methods are defined ina super class and specific variations of the algorithms and logicaldata are either defined in the derived classes or during runtimespecifications.=keywords=fuzzy logic, machine learning, object-oriented
=ADD==reftype=14=number=99-19=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-19.ps.gz=year=1999=month=07=author=Kossak; Felix=title=An Interface for Interactive Proving with the Mathematical Software System Theorema=abstract=The Theorema project develops an integrated mathematical softwaresystem with special focus on a natural-style language with clearsemantics and support for proving. Based on the existing automatedproving power, we developed an interface for interactive proving.We describe the combination of automated and interactive proving in detail,including the changes we had to make to the existing automated system. The onlydifference in the proof function call is the setting of an additional option'Interaction' with three possible values for interactive, semi-interactive andfully-automated mode.Two main windows give a survey over the current proof situation, theinitial proof situation, and the past proof steps. Special inputwindows are created if required. The user has control over theknowledge base and is able to determine each proof step by selectingformulae and available inference rules. Additional input may be given,for instance, in the form of terms for substituting variables.In addition to the technical details, we demonstrate the use of the interactiveproving environment with examples.=note=Master Thesis, Polytechnical University of Upper Austria, Department for Software Engineering, A-4232 Hagenberg, Austria=sponsor=Austrian Science Fundation (FWF) - project FO-1302 (FB).=keywords=interactive proving, proof training, automated proving, ATP
=ADD==reftype=14=number=99-20=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-20.ps.gz=year=1999=month=07=author=Cucu; Lucian=title=Depth of Field Simulation in Ray-Traced Images=abstract=Images ray-traced using the pinhole-camera-model show all objects of thescene in focus. This is rarely the case with real lenses. Therefore,adding depth of field to such images increases the degree of realism.Adding DoF to ray-traced images is a very computationally intensive taskin itself, usually performed while ray-tracing the image..     Wepropose a post-processing approach to the simulation of depth of fieldin ray-traced images. The  POV-Ray ray-tracer was modified to generate adepth map which was then used to check the postprocessor.=sponsor=The SOCRATES programme.=keywords=depth of field,  ray-tracing
=ADD==reftype=14=number=99-21=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-21.ps.gz=year=1999=month=08=author=Caruso; Fabrizio=title=A Macsyma Implementation of Zeilberger's Fast Algorithm=abstract=The details of the first implementation of Zeilberger'salgorithm in the Macsyma computer algebra system andthe basic theorical ideas behind this algorithm are explained.=note=SFB and RISC Report=sponsor=SFB grant F1305 of the Austrian FWF=keywords=Zeilberger, Gosper, hypergeometric
=ADD==reftype=14=number=99-22=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-22.ps.gz=year=1999=month=08=author=Deischinger ; Harald=title=Algebraic Geometric Codes=abstract=In this work it is shown, how methods from algebraic geometrycan be used to construct valuable codes.In the first chapters a brief summary of algebraic geometry andcoding theory is given. It is also demonstrated, how well knownclassed of codes, especially Reed-Solomon codes, can be constructedas special cases of algebraic geometric codes.The Skorobogatov-Vl{\u a}du{\c t} and Duurmsa decoding algorithmsare presented in detail.As part of this diploma thesis a tutorial implementation was done,which is presented at the end.=note=Diploma Thesis=sponsor= =keywords=Goppa code, Gilbert-Varshamov bound
=ADD==reftype=14=number=99-23=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-23.ps.gz=year=1999=month=08=author=Rodriguez-Millan; Jesus=title=Symbolic PID Control of Second Order Linear Control Systems=abstract=In this work we search for answers to the following questions:i) Under what conditions can a PID controller asymptotically stabilize a secondorder linear plant?ii) Given a set of design specifications for the closed loop system, does thedesign problem admit a pole assignment solution?iii) Can the design procedure be constructively seystematized to allow asymbolic computation implementation?=keywords=control systems
=ADD==reftype=14=number=99-24=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-24.ps.gz=year=1999=month=08=author=Rodriguez-Millan; Jesus=title=Nonlinear Control by Extended Linearization: A Symbolic Computation Approach=abstract=Table of Contents:<p>1. Introduction<p>1.1. The origin of our work on symbolic computation for nonlinear control<p>2. Jacobian and extended linearization<p>2.1. General design strategy<p>2.2. Which systems might be stabilized by extended linearization?<p>3. Extended state-feedback control<p>3.1. The PDE leading to the nonlinear control law<p>3.2. Iterative calculation of the nonlinear state-feedback control law<p>3.3. NLFeedback and NLFeedback 2.0<p>4. Extended PID control<p>5. Control devices as filters<p>5.1. The two-blocks decomposition approach<p>5.2. Design of nonlinear extended filters<p>6. Extended Lag-Lead Control<p>6.1. Two-blocks decomposition of a linear lag-lead compensator<p>6.2. Symbolic algorithmic calculation of the linear gains<p>7. NLControl<p>8. Concluding remarks<p>References<p>Appendix 1. Symbolic computation tools for nonlinear control<p>Complementary references=keywords=control systems
=ADD==reftype=14=number=99-25=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-25.ps.gz=year=1999=month=08=author=Rodriguez-Millan; Jesus=title=Integrated Symbolic--Graphic--Numeric Computation Tools for Dynamical Nonlinear Control Systems=abstract=In this work we extend our previous two-blocks decomposition approach for thedesign of nonlinear extension of linear series compensators, to the design ofa nonlinear extension of a typical combination of linear series and parallelcompensators for the n-th order nonlinear dynamical control systems.This particular extension shows how the two-blocks decomposition approachwould allow to design nonlinear extensions of virtually any combination ofcompensators.We illustrate the results by applying them to a model of the centrifugalpendulum in Watt's governor.=keywords=control systems
=ADD==reftype=14=number=99-26=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-26.ps.gz=year=1999=month=09=author=Herfort; Wolfgang + Landsmann; G\"unter=title=Simultaneous Existence of right Inverses for $1-ab$ and $1-ba$=abstract=A well known fact in any associative ring with an identity elementensures the existence of a right-inverse for $1-ba$ provided the one for$1-ab$ exists. We present a {\em natural} proof by employing a suitableterm rewriting procedure.=sponsor=Austrian Science Foundation=keywords=term rewriting
=ADD==reftype=14=number=99-27=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-27.ps.gz=year=1999=month=09=author=Hillgarter; Erik + Landsmann; G\"unter + Schicho; Josef + Winkler; Franz=title=Generalized Offsets as Envelopes of a One-parameter Set of Spheres=abstract=A generalized offset of a parametrized curve $m(t)$ in ${\R}^n$ is theset of all pointshaving a normal distance $r(t)$ from $m(t).$ Thus the concept coversthe classical offsets (for $r(t)=const$) of plane curves as well aspipes and canal surfaces. In this paper we develop methods forgenerating a rational parametrization ofgeneralized offsets of rational curves $m(t)$ with rational radiusvariation $r(t),$ in case such a parametrization exists. In additionwe try to select those methods, which allow animplementation, that provides solutions in reasonable time.=sponsor=Austrian Science Fund (FWF), Proj.Nr. P11160-TEC (HySax), Proj.Nr.P12662-TEC (Adjoints), and the special researcharea SFB F013, subprojects 03 and 04.=keywords=canal surface, sum of two squares=end=
=ADD==reftype=14=number=99-28=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-28.ps.gz=year=1999=month=07=author=Schicho; Josef=title=Proper Parametrization of Real Algebraic Surfaces=abstract=It is well-known that a real algebraic surface is real-rationalif and only if it is complex-rational and connected. In this paper,we give an explicit construction for a large class of surfaces thatsatisfy this criterion.=keywords=real, rational=note=also submitted to JSC=sponsor=FWF (SFB)
=ADD==reftype=14=number=99-29=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-29.ps.gz=year=1999=month=10=author=Schicho; Josef=title=The Multiple Conical Surfaces=abstract=A pencil of conics is a one-parameter family of conics.A conical surface is a surface which is generated as the union of conicsin a pencil. A multiple conical surface is a surface which is a conicalsurface in more than one way. In this paper, we give a completeclassification of the multiple conical surfaces.=keywords=conic, cyclide=note=submitted to Beitr. Alg. Geom.=sponsor=FWF
=ADD==reftype=14=number=99-30=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-30.ps.gz=year=1999=month=10=author=Schicho; Josef=title=The Parametrization Problem for Algebraic Surfaces=abstract=The parameterization problem asks for a parameterization ofan implicitly given surface, in terms of rational functions intwo variables. We give an overview on the history of this problem,including recent algorithmic solutions and open questions.The problem is related to the parametrization problem for curves andto the problem of resolution of singularities.=keywords=parametrization, algebraic, surfaces=note=invited talk at the EACA'99, Septmeber 8-11, Tenerife=howpublished=Proc. EACA'99=sponsor=FWF
=ADD==reftype=14=number=99-31=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-31.ps.gz=year=1999=month=11=author=Kutsia; Teimuraz + Schicho; Josef=title=Numerical Solving of Constraints of Multivariate Polynomial Strict Inequalities=abstract=We consider the problem of safe numerical solving of constraints in aform of disjunctions and/or conjunctions of multivariate polynomialstrict inequalities with real coefficients. We use a modified bisectionmethod and present an algorithm that computes a solution of the problem.=sponsor= 
=ADD==reftype=14=number=99-32=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-32.ps.gz=year=1999=month=11=author=Schreiner; Wolfgang=title=Formal Foundations of Computer Science 1=abstract=We introduce basic mathematical domains and techniques as a foundation for theformal treatment of various concepts in computer science andengineering. Mathematical domains like numbers, functions, and relations areconstructed on the basis of the fundamental notions of set theory thusexhibiting their inner structure and properties. As for mathematicaltechniques, we present the language of logic for the precise description ofmathematical objects and facts and give rules for correct reasoning andarguing. The constructions are partially implemented with the help of aninterpreter that executes a simple subset of logic and set theory.=sponsor= =note=Lecture notes=howpublished=(c) 1999 Wolfgang Schreiner, see http://www.risc.uni-linz.ac.at/courses/formal=keywords=Mathematical education, logic, set theory, executable contents, Java.
=ADD==reftype=14=number=99-33=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-33.ps.gz=year=1999=month=11=author=Heiss; Werner=title=An Implementation for the Rational Parametrization of Surfaces=abstract=The parametrization problem for rational algebraic surfaces had beensolved algorithmically only for a very limited class of surfaces untilthe first complete algorithm was formulated and proven in $1995$. Thisalgorithm parametrizes an implicitly given surface by first computing abirational map to  an easier-to-parametrize surface of one of fivedifferent types. Then this surface is parametrized and theparametrization is composed with the inverse of the birational map toobtain a parametrization of the original surface.The method used by the parametrization algorithm is based on the conceptof adjoints. In the first step the parametrization algorithm computesadjoint vectorspaces of a given surface to construct a birational mapto a simpler surface. The second part of the parametrizationthen consists in the parametrization of the birationally equivalentsurface.The topic of this thesis was the implementation of this second part oftheentire algorithm. The goal was reached, i.e. we now have animplementationcomputing the parametrization of a given rational surface, using aninterface to an algorithm that computes the adjoint vectorspaces of animplicitly given surface.We will not go into technical details for the first part of thealgorithm,adjoints computation.We will just briefly sketch an algorithmand use adjoints as a black box for the rest of the paper.During the implementation  several theoretical and practical changesand refinements turned out to be useful. We describe here this secondpart of the algorithm in detail, discuss the underlying theory and practical aspects ofthe implementation. Detailed proofs for  the various subalgorithmswe use are given.=keywords=parametrization, rational, surfaces=note=Master Thesis (supervisor J. Schicho)=sponsor=FWF (adjoints)
=ADD==reftype=14=number=99-34=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-34.ps.gz=year=1999=month=10=author=Konev; Boris=title=Metavariable Method for Natural Deduction within {\em Theorema}=abstract=The problem of finding of terms that have to be substituted during the proofsearch in places of quantified variables (like in the case of $\exists xP(x)$)is a well-known problem of automated theorem proving. In this paper we presentan efficient implementation of the metavariable method for Natural Deduction.We show how to find terms when the proof search is performed in \AND{}-\OR{}tree like structures; the implementation does not depend on the searchstrategy and allows integration with other provers.=keywords=Theorema, automated reasoning, natural deduction, metavariable=sponsor=INTAS project 96-760
=ADD==reftype=14=number=99-35=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-35.ps.gz=year=1999=month=12=author=Marin; Mircea + Ida; Tetsuo + Schreiner; Wolfgang=title=CFLP: a Mathematica Implementation of a Distributed Constraint Solving System=abstract=The need for combining and making cooperate various constraintsolvers is widely recognized. Such an integrated system would allowsolving problems that can not be solved by a single solver.CFLP (Constrained Functional Logic Programming language) is adistributed software system consisting of a functional logicinterpreter running on one machine and a number of constraint solvingengines running on other machines. The interpreter is based on adeterministic version of a lazy narrowing calculus which was extendedin two main directions: (a) the possibility to specify explicitOR-parallelism, and (b) the possibility to specify constraints overvarious domains. The OR parallel features of the interpreter allowthe decomposition of the solution space into different subspacesdenoted by varous sets of constraints; the individual sets are solvedby different constraint solving engines in parallel and joinedtogether to form the total solution set. This allows to investigateproblems with large solution spaces using the computational poweravailable in large computer networks.The system is written entirely in Mathematica and uses the MathLinkprotocol for inter-process communication. The current implementationcan solve problems expressible in functional logic and involvingconstraints such as linear, polynomial and differential equations.=howpublished=IMS '99, Third International Mathematica Symposium, Hagenberg, Austria, August 23-25, 1999.=keywords=functional programming, logic programming, constraint solving, distributed systems, Mathematica.
=ADD==reftype=14=number=99-36=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-36.ps.gz=year=1999=month=12=author=Schreiner; Wolfgang + Danielczyk-Landerl; Werner + Marin; Mircea + Stoecher; Wolfgang=title=A Generic Programming Environment for High Performance Mathematical Libraries=abstract=We report on a programming environment for the development of genericmathematical libraries based on functors (parameterized modules) that haverigorously specified but very abstract interfaces. We focus on thecombination of the functor-based programming style with software engineeringprinciples in large development projects. The generated target code is highlyefficient and can be easily embedded into foreign application environments.=howpublished=Workshop on Generic Programming, Castle Dagstuhl, Wadern, Germany, April 27-30, 1998. R{\"u}diger Loos, David Musser (eds), Lecture Notes in Computer Science, Springer, Berlin.bTo appear in 2000.=sponsor=FWF project P11414-TE "HPGP - High-Performance Generic Programming"=keywords=functors, modules, specifications, software engineering, code instantiation
=ADD==reftype=14=number=99-37=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-37.ps.gz=year=1999=month=12=author=Kossak; Felix + Nakagawa; Koji=title=User--System Interaction within Theorema=abstract=The purpose of {\em Theorema} is to provide various ranges of users, fromstudents to experts in mathematics, with an integrated environment forcomputing, solving, and proving. To make the system convenient, it isnecessary to have sophisticated user--system interaction. In this paper wediscuss the user--system interaction of {\em Theorema} from two aspects,namely remote interaction with {\em Theorema} over the internet anduser--prover interaction within {\em Theorema}. The remote interactionincreases the possibilities of using the system in various situations andof collaborative work. The user--prover interaction allows us to combinethe proving power of fully automated provers and human creativity as a wellas to train students.=howpublished=Proceedings of the CALCULEMUS '99 Workshop, Electronic Notes in Theoretical Computer Science, Elsevier, 1999.=sponsor=FWF (Austrian Science Fundation), SFB project P1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-38=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-38.ps.gz=year=1999=month=12=author=Windsteiger; Wolfgang=title=Building up Hierarchical Mathematical Domains Using Functors in Theorema=abstract=The world of mathematical domains isstructured hierarchically. There are elementary domains and there arewell-known techniques how to build up new domains from existingones. Which of the domains to view as the actual basis of thehierarchy is the freedom of the mathematician who wants to workwith these domains and it depends of course on the intention oftheir use. The strength of the concept lies, however, in the factthat a new domain is constructed from given domains bywell-defined rules, which {\em do not depend} on the actuallygiven domains but only rely on {\em certain properties} that hold{\em in the given domains}, and the construction rules guarantee{\em certain properties for the new domain} then.In the {\em Theorema} system, B. Buchberger introduced the concept of{\em functors} to represent these domain construction rules. A functorcan actually be viewed as a function that produces a new domainfrom given domains by {\em describing}, which objects andoperations are available in the new domain, and by {\em defining},how new objects can be constructed from known objects and howoperations on the new objects can be carried out using knownoperations in the underlying domains. Following the generalphilosophy of the {\em Theorema} system, functors play a role bothin {\em proving} and in {\em computing}. The domain descriptioncontained in the functor holds structural information, which can beused by a prover for the new domain in order to find anappropriate structure of proofs for formulae containing objects ofthe new domain. The domain definitions, on the other hand, containrules, which can be used by an evaluator for executing computationsinvolving objects of the new domain.In the sequel, we will demonstrate the facilities that are providedin {\em Theorema} to define functors, to build up a hierarchy ofdomains using functors, and to do computations in the constructeddomains.=howpublished=Proceedings of the CALCULEMUS '99 Workshop, Electronic Notes in Theoretical Computer Science, Elsevier, 1999.=sponsor=FWF (Austrian Science Fundation), SFB project P1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-39=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-39.zip=year=1999=month=12=author=Buchberger; Bruno=title=Computer-Mathematik in der Schule=abstract=Schulung fuer AHS-Lehrer (6 Stunden), RISC, Hagenberg, 13. Dezember 1999.=keywords=automatic reasoning
=ADD==reftype=14=number=99-40=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-40.ppt.gz=year=1999=month=12=author=Buchberger; Bruno=title=Views on the Future of Computer Science=abstract=Real world, machines, and formal methods.=howpublished=Invited Keynote at the Workshop of the Japanese Consortium on Formal Methods, Nagoya, Japan, December 16, 1999.=sponsor=FWF/SFB project F1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-41=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-41.ppt.gz=year=1999=month=12=author=Buchberger; Bruno=title=Mathematics: The Technology of Reasoning=abstract=Contents:  Mathematics and technology.  The technology of reasoning.  Theorema: practical automated reasoning=howpublished=Invited Keynote at the 4 th Asian Technology Conference in Mathematics, Guangzhou, China, December 18, 1999.=sponsor=FWF/SFB project F1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-42=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-42.ps.gz=year=1999=month=12=author=Buchberger; Bruno + Dupre; Claudio + Jebelean; Tudor + Kriftner; Franz + Nakagawa; Koji + Vasaru; Daniela + Windsteiger; Wolfgang=title=Theorema: A Progress Report=abstract=The Theorema project aims at supporting, within one consistent logic andone coherent software system, the entire mathematical exploration cycleincluding the phase of proving. In this paper we report on some of the newfeatures of Theorema that have been designed and implemented since the firstexpository version of Theorema in 1997. These features are: - the Theorema formal text language - the Theorema computational sessions - the Prove-Compute-Solve (PCS) prover of Theorema - the Theorema set theory prover - special provers within Theorema - the cascade meta-strategy for Theorema provers - proof simplification in TheoremaIn the conclusion, we formulate the design goals for the next version ofTheorema=howpublished=Submitted to ISSAC 2000.=sponsor=SFB/FWF project F1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-43=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-43.doc.gz=year=1999=month=12=author=Buchberger; Bruno + Jebelean; Tudor=title=Distance Teaching of Mathematics Using Theorema.=abstract=The Theorema system integrates computing and automated reasoning in an on-linetutoring system which uses natural language presentation and deduction innatural style. The system has an easy-to-use interface accessible both locallyand over the internet (see http://www.theorema.org). We report on the variouspossibilities of using Theorema for tele-teaching, as well as on a small-scaleexperiment demonstrating its usefullness for training graduate students inpredicate-logic proving.=howpublished=In: Proceedings of the 3rd Technion Symposium on "Software for Communication" (H. Gutmann ed.), April 1-3, 1999, Hagenberg, Austria.=sponsor=SFB/FWF project F1302=keywords=automatic reasoning
=ADD==reftype=14=number=99-44=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-44.ps.gz=year=1999=month=12=author=Paule; Peter + Strehl; Volker=title=Definite Summation and Hypergeometric Identities=abstract=This is a concise survey about recent developmentsin the mentioned field, which isto appear as a section of the{\em Computer Algebra Handbook},E. Kaltofen, J. Grabmeier, V. Weispfenning (eds.),Springer-Verlag, 2000.=howpublished=Book contribution; to appear in: {\em Computer Algebra Handbook}, E. Kaltofen, J. Grabmeier, V. Weispfenning (eds.), Springer-Verlag, 2000.=sponsor=SFB/FWF project F1305=keywords=symbolic summation, hypergeometric sums
=ADD==reftype=14=number=99-45=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-45.tar.gz=year=1999=month=12=author=Buchberger; Bruno + Dupre; Claudio + Jebelean; Tudor + Kriftner; Franz + Nakagawa; Koji + Vasaru; Daniela + Windsteiger; Wolfgang=title=Theorema: A Short Demo=abstract=The Theorema system is a system for proving, solving, and simplifyingmathematical formulae. It is programmed in the Mathematica language,version 3.0 or later, and also heavily uses the front-end of Mathematica.Theorema can therefore be used on all machines on which Mathematica,version 3.0 or later, is installed.Theorema is being developed by the Theorema Working Group at the RISCinstitute under the direction of Bruno Buchberger. The current members of theTheorema Working Group are B. Buchberger, C. Dupre, F.Kriftner, T. Jebelean,K. Nakagawa, D. Vasaru, and W.Windsteiger.The Theorema demo presented in this notebook demonstrates the most importantfunctionalities of Theorema Version 1.0 (1999). I used this demo 1999 in acouple of talks on Theorema at various occasions. The varying parts of thesetalks, emphasizing various different aspects of the system,  are contained inextra files (which will soon be available over the web) and refer to this filefor the demo part.This .nb file can be read if you have Mathematica installed on your machine.If not, you can read the postscript version Theorema-Demo-1999.ps of this file.If you are an alpha tester of Theorema you can execute and play with the commands given in this file.Currently, we do not accept any more alpha testers. The beta version of Theorema will most probablybe released in Fall 2000. If you want to be informed about the release, i.e. if you want to become a betatester, please, write to Theorema@Theorema.org.=sponsor=SFB/FWF project F1302=keywords=automated reasoning
=ADD==reftype=14=number=99-46=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-46.tar.gz=year=1999=month=07=author=Buchberger; Bruno=title=Theory Exploration Versus Theorem Proving=abstract=Computer-aided Theorem Proving is often considered to be the problem ofgenerating a proof for (or, at least, deciding about the truth of) a givengoal proposition under given assumptions. The power of automated orinteractive theorem provers is then measured by the class of propositionsand assumptions for which proofs can be generated. In this talk, we want tointroduce and study a different paradigm, {\em Computer-Aided TheoryExploration}, which models the actual research and teaching situation ofmathematicians in a more natural way. We will show, by examples fromvarious parts of mathematics, how an {\em exploration situation} ischaracterized by the following parameters: "known notions", "known factsabout known notions", a "new notion", "axioms that relate the new notionwith the known notions", and finally, "a class of goal propositions thatcompletely explore the relation of the new notion with the known notions".We will argue that these parameters suggest the construction of a special(automated or semi-automated) prover that is "appropriate" for the givenexploration situation. In the construction of the appropriate prover, itseems to be crucial that some of the facts about the known notions aretransformed from their status as being just propositions into the status ofestablishing special inference rules (or, more generally, prooftechniques). This transformation seems to be crucial for arriving at theautomated generation of "short" proofs that imitate the natural proof styleof mathematicians. Our study will be given in the frame of the{\em Theorema}software system, which is currently being developed by the {\em Theorema}Working Group at RISC under the direction of the author(www.theorema.org).=howpublished=Invited talk at Calculemus 99, Trento, Italy, July 1999=sponsor=SFB/FWF project F1302=keywords=automatic reasoning
=ADD==author=Matasaru; Bogdan + Jebelean; Tudor=title=FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers=number=99-48=month=11=year=1999=sponsor=Partially supported by a PhD fellowship from the Upper Austrian Government=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-48.ps.gz=abstract=We present the FPGA implementation of an extension of the binary{\em plus--minus} systolic algorithm which computes the GCD (greatestcommon divisor) and also the normal form of a rational number,without using division.A sample array for 8 bit operands consumes 83.4\% of an Atmel 40K10 chipand operates at 25 MHz.=keywords=systolic array, rational normalization=howpublished=Submitted to FPLA 2000, Villach, Austria=location=2=owner=2=source=3=reftype=14
=ADD==reftype=14=number=99-49=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-49.ps.gz=year=1999=month=06=author=Winkler; Franz=title=Advances and Problems in Algebraic Computation=abstract=In the last years there has been dramatic progress in all areasof algebraic computation. Many working mathematicians have access toand actually use algebraic software systems for their research.No end of this development is in sight.We report on some active topics in algebraic computation, namelythe theory of integration and symbolic solution of systems of differentialequations, the solution of systems of algebraic equations, thefactorization of polynomials, andthe design and analysis of algebraic curves and surfaces.=howpublished=Invited talk at 58th Workshop on General Algebra (AAA58), Technical Univ. Vienna, June 1999, to appear in Contributions to General Algebra 12, D. Dorninger et al. (eds.), Verlag Johannes Heyn, Klagenfurt (2000)=sponsor=FWF project P11160-TEC and SFB F013/1304=keywords=computer algebra, algebraic computation
=ADD==author=Wagner; Klaus W.=title=Einfuehrung in die Theoretische Informatik. Grundlage und Modelle.=year=1994=publisher=Springer=series=Springer-Lehrbuch=owner=3=note=Uni inventory 14576=reftype=1=source=3
=ADD==author=Gonzales-Vega; Laurenzo + Recio; Tomas=title=Algorithms in Algebraic Geometry=year=1996=publisher=Birkhauser=series=Progress in Mathematics=owner=3=note=Uni inventory 14572=reftype=15=source=3
=ADD==author=Aigner; Martin + Ziegler; Guenter M.=title=Proofs from THE BOOK=year=1998=publisher=Springer=owner=3=note=Uni inventory 14571=reftype=1=source=3
=ADD==author=Sperschneider; Volker + Hammer; Barbara=title=Theoretische Informatik. Eine problemorientierte Einfuehrung.=year=1996=publisher=Springer=series=Springer-Lehrbuch=owner=3=note=Uni inventory 14575=reftype=1=source=3
=ADD==author=Eyssette; Frederic + Galligo; Andre=title=Computational Geometry=year=1993=publisher=Birkhauser=series=Progress in Mathematics=owner=3=note=Uni inventory 14573=reftype=15=source=3
=ADD==author=Gelfand; I. M. + Kapranov; M. M. + Zelevinsky; A. V.=title=Discriminants, Resultants and Multidimensional Determinants=year=1994=publisher=Birkhauser=series=Mathematics: Theory and Applications=owner=3=note=Uni inventory 14569=reftype=1=source=3
=ADD==author=Bandini; S + Serra; R. + Liverani; F. Suggi=title=Cellular Automata: Research Towards Industry. ACRI 98 - Proceedings of the Third Conference on Cellular Automata for Research and Industry, Trieste, Oct. 1998=year=1998=publisher=Springer=owner=3=note=Uni inventory 14568=reftype=10=source=3
=ADD==author=Skiena; Steven S.=title=The Algorithm Design Manual=year=1998=publisher=Telos=owner=3=note=Uni inventory 14570; CD-ROM=reftype=1=source=3
=ADD==author=Abelson; H. + Dybvig; R. K. + Haynes; C. T. + Rozas; G. J. + Adams; N. I. + Friedman; D. P + Kohlbecker; E. + Steele; G. L. + Bartley; D. H. + Halstead; R. + Oxley; D. + Sussman; G. J. + Brooks; G. + Hanson; C. + Pitman; K. M. + Wand; M.=title=Revised Report on the Algorithmic Language Scheme=year=1998=journal=High-Order and Symbolic Computation=volume=11=pages=7 -- 105=location=2=owner=2=source=3=reftype=0
=ADD==author=Gruver; A. William + de Silva; Clarence W.=title=1995 IEEE International Conference on Systems, Man and Cybernetics. Vancouver, Canada, Oct 1995. Vol 1.=year=1995=volume=1=publisher=IEEE Systems, Man and Cybernetics Society=owner=2=reftype=10=source=3
=ADD==author=Gruver; A. William + de Silva; Clarence W.=title=1995 IEEE International Conference on Systems, Man and Cybernetics. Vancouver, Canada, Oct 1995. Vol 2.=year=1995=volume=2=publisher=IEEE Systems, Man and Cybernetics Society=owner=2=reftype=10=source=3
=ADD==author=Gruver; A. William + de Silva; Clarence W.=title=1995 IEEE International Conference on Systems, Man and Cybernetics. Vancouver, Canada, Oct 1995. Vol 3.=year=1995=volume=3=publisher=IEEE Systems, Man and Cybernetics Society=owner=2=reftype=10=source=3
=ADD==author=Gruver; A. William + de Silva; Clarence W.=title=1995 IEEE International Conference on Systems, Man and Cybernetics. Vancouver, Canada, Oct 1995. Vol 4.=year=1995=volume=4=publisher=IEEE Systems, Man and Cybernetics Society=owner=2=reftype=10=source=3
=ADD==author=Gruver; A. William + de Silva; Clarence W.=title=1995 IEEE International Conference on Systems, Man and Cybernetics. Vancouver, Canada, Oct 1995. Vol 5.=year=1995=volume=5=publisher=IEEE Systems, Man and Cybernetics Society=owner=2=reftype=10=source=3
=ADD==author=none=title=Proceedings of the 1995 RWC Symposium. TEPIA, Tokyo, Japan, June 1995.=year=1995=note=RWC TechReport TR-95001=publisher=RWC - Real World Computing Partnership=owner=2=reftype=10=source=3
=ADD==author=Sundararajan; N.=title=ICARCV 94. The Third International Conference on Automation, Robotics and Computer Vision. Vol 1.=year=1994=publisher=School of EEE, Nanyang Technological University, Singapore=owner=2=reftype=10=source=3
=ADD==author=Sundararajan; N.=title=ICARCV 94. The Third International Conference on Automation, Robotics and Computer Vision. Vol 2.=year=1994=publisher=School of EEE, Nanyang Technological University, Singapore=owner=2=reftype=10=source=3
=ADD==author=Chemla; Karine + Ekeland; Ivar + Aubert; Bernard=title=Mathematiques a Venir. Quels Mathematiciens pour l'An 2000? Colloque, Paris, Dec 1987.=year=1987=publisher=Gauthier-Villars=note=Supplement of Bulletin de la Societe Mathematique de France, 1987, vol 115=owner=2=note=Uni inventory=reftype=10=source=3
=ADD==author=Nye; Adrian + O'Reilly; Tim=title=X Toolkit Intrinsics Programming Manual. Vol 4.=volume=4=year=1992=publisher=O'Reilly and Associates, Inc.=owner=2=reftype=1=source=3
=ADD==author=Trappl; Robert=title=Cybernetics and Systems 96. Proceedings of the 13th European Meeting on Cybernetics and Systems Research, Vienna, Austria, April 1996. Vol 1.=year=1996=volume=1=publisher=Austrian Society for Cybernetics Studies=owner=2=reftype=10=source=3
=ADD==author=Trappl; Robert=title=Cybernetics and Systems 96. Proceedings of the 13th European Meeting on Cybernetics and Systems Research, Vienna, Austria, April 1996. Vol 2.=year=1996=volume=2=publisher=Austrian Society for Cybernetics Studies=owner=2=reftype=10=source=3
=ADD==author=Retti; J. + Bibel; W. + Buchberger; B. + Buchberger; E. + Horn; W. + Kobsa; A + Steinacker; I. + Trappl; R. + Trost; H.=title=Artificial Intelligence - Eine Einfuehrung. 2., ueberarbeitete Auflage.=year=1986=edition=2=publisher=B. G. Teubner Stuttgart=owner=2=note=copy 2=reftype=1=source=3
=ADD==author=Noro; Masayuki + Shimoyama; Takeshi=title=Asir User's Manual (in Japanese)=year=1995=publisher=none=owner=2=reftype=1=source=3
=ADD==author=de Boer; Frank S. + Gabbrielli; Maurizio=title=Constraint Programming for Time Critical Applications. Informal Proceedings of the COTIC Workshop, Schloss Hagenberg, Austria, Oct 1997=year=1997=publisher=University of Pisa=owner=2=reftype=10=source=3
=ADD==author=Hubbers; E.=title=Differential and Difference Equations and Computer Algebra=year=1997=publisher=University of Nijmegen, The Netherlands=owner=2=reftype=1=source=3
=ADD==author=Zaddach; Arno=title=Grassmanns Algebra in der Geometrie. Mit Seitenblicken auf verwandte Strukturen=year=1994=publisher=Wissenschaftsverlag Mannheim=owner=1=note=Uni inventory 13320=reftype=1=source=3
=ADD==author=Brandenburg; G.=title=IFAC (International Federation of Automatic Control). Proceedings Motion Control, Munich, Germany, Oct 1995.=year=1995=publisher=Lehrstuhl B fuer Mechanik, T U Munchen=owner=2=reftype=10=source=3
=ADD==author=Bubnicki; Zdzislaw=title=Proceedings of the 12th International Conference on Systems Science, Wroclaw, Poland, Sep 1995. Vol 1.=year=1995=volume=1=publisher=Politechnical Institute of Wroclaw, Poland=owner=2=reftype=10=source=3
=ADD==author=Bubnicki; Zdzislaw=title=Proceedings of the 12th International Conference on Systems Science, Wroclaw, Poland, Sep 1995. Vol 2.=year=1995=volume=2=publisher=Politechnical Institute of Wroclaw, Poland=owner=2=reftype=10=source=3
=ADD==author=Bubnicki; Zdzislaw=title=Proceedings of the 12th International Conference on Systems Science, Wroclaw, Poland, Sep 1995. Vol 3.=year=1995=volume=3=publisher=Politechnical Institute of Wroclaw, Poland=owner=2=reftype=10=source=3
=ADD==author=Ottmann; Thomas + Tomek; Ivan=title=ED-MEDIA and ED-TELECOM 98. 10th World Conference on Educational Multimedia and Hypermedia and World Conference on Educational Telecommunications, Freiburg, Germany, June 1998. Abstracts and CD-ROM.=year=1998=note=Includes CD-ROM=publisher=AACE. Association for the Advancement of Computing in Education.=owner=2=reftype=10=source=3
=ADD==author=Ottmann; Thomas + Tomek; Ivan=title=ED-MEDIA and ED-TELECOM 98. 10th World Conference on Educational Multimedia and Hypermedia and World Conference on Educational Telecommunications, Freiburg, Germany, June 1998. Vol 1.=year=1998=volume=1=publisher=AACE. Association for the Advancement of Computing in Education.=owner=2=reftype=10=source=3
=ADD==author=Ottmann; Thomas + Tomek; Ivan=title=ED-MEDIA and ED-TELECOM 98. 10th World Conference on Educational Multimedia and Hypermedia and World Conference on Educational Telecommunications, Freiburg, Germany, June 1998. Vol 2.=year=1998=volume=2=publisher=AACE. Association for the Advancement of Computing in Education.=owner=2=reftype=10=source=3
=ADD==author=Desarmenien; Jacques + Kerber; Adalbert + Strehl; Volker=title=The Foata Festschrift=year=1996=publisher=Neil J. Calkin and Herbert S. Wilf=note=Reprint of the Electronic Journal of Combinatorics. Vol 3, no 2, 1996.=reftype=15=source=3
=ADD==author=Buchberger; Bruno + Winkler; Franz=title=Groebner Bases and Applications=year=1998=publisher=Cambridge University Press=number=251=series=London Mathematical Society Lecture Notes=note=Uni inventory 14432. Includes Proceedings of the Conference "33 Years of Groebner Bases".=reftype=15=source=3=owner=3
=ADD==author=Becker; Thomas + Weispfeinning; Volker + Kredel; Heinz=title=Groebner Bases. A Computational Approach to Commutative Algebra=year=1993=publisher=Springer=series=Graduate Texts in Mathematics=owner=2=reftype=1=source=3
=ADD==author=Mishra; Bhubaneswar=title=Algorithmic Algebra=year=1993=publisher=Springer=series=Texts and Monographs in Computer Science=owner=2=reftype=1=source=3
=ADD==author=Wu; Wen-tsuen=title=Mechanical Theorem Proving in Geometries=year=1994=publisher=Springer=series=Texts and Monographs in Symbolic Computation=owner=2=reftype=1=source=3
=ADD==author=Sturmfels; Bernd=title=Algorithms in Invariant Theory=year=1993=publisher=Springer=series=Texts and Monographs in Symbolic Computation=owner=2=reftype=1=source=3
=ADD==author=Buendgen; Reinhard=title=Termersetzungsysteme=year=1998=publisher=vieweg=owner=1=reftype=1=source=3
=ADD==author=Julia; B.=title=Les Objectifs de la Formation Scientifique. Paris, Apr 1990.=year=1990=publisher=Ecole Polytechnique Paris=owner=2=reftype=10=source=3
=ADD==author=Zaddach; Arno=title=Grassmanns Algebra in der Geometrie. Mit Seitenblicken anf verwandte Strukturen=year=1994=publisher=Wissenschaftsverlag Mannheim=owner=1=note=Uni inventory 13320=reftype=1=source=3
=ADD==author=Matzat; B. H. + Greuel; G.-M. + Hiss; G.=title=Algorithmic Algebra and Number Theory. Selected Papers from the Conference in Heidelberg, Oct 1997.=year=1997=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Becker; Herbert + Schumann; Horst=title=100 Jahre Mathematisches Seminar der Karl-Marx-Universitaet Leipzig=year=1981=publisher=VEB Deutscher Verlag der Wissenschaften=owner=2=reftype=15=source=3
=ADD==author=Cipra; Barry=title=What's Happening in the Mathematical Sciences. Vol 4. 1998-1999.=year=1999=publisher=AMS (American Mathematical Society)=owner=2=reftype=1=source=3
=ADD==author=Pinchot; Gifford=title=Intrapreneuring. Mitarbeiter als Unternehmer.=year=1985=publisher=GABLER=reftype=1=source=3
=ADD==author=Bronstein; Manuel=title=Symbolic Integration I. Transcendental Functions.=year=1997=publisher=Springer=series=Algorithms and Computation in Mathematics=number=1=owner=1=note=Uni inventory 14385=reftype=1=source=3
=ADD==author=Elbers; Hugo Johannes=title=Connecting Informal and Formal Mathematics=year=1998=publisher=T U Eindhoven, The Netherlands=owner=2=note=PhD Thesis=reftype=1=source=3
=ADD==author=Hlavicka; Jan + Kveton; Karel=title=RUFIS 97. International Conference on Role of the Universities in the Future Information Society. Prague, Sep 1997.=year=1997=publisher=CTU Prague=owner=2=reftype=10=source=3
=ADD==author=Breitenecker; F.=title=CASe. Computer Algebra Systeme. Einsatz, Anwendungen, Entwicklungen.Seminar ueber Modellbildung und Simulation. TU Wien, 21 Apr.=year=1998=publisher=ARGESIM, TU Wien=owner=2=reftype=10=source=3
=ADD==author=Albers; Susanne + Schmidt; Guenter=title=Scheduling with unexpected machine breakdowns=year=1998=institution=Max-Planck-Institut fuer Informatik=number=MPI-I-98-1-021=month=09=reftype=11=source=3
=ADD==author=Lie; Sophus=title=Theorie der Transformationsgruppen. Erster Abschnitt=year=1970=publisher=Chelsea=owner=2=reftype=1=source=3
=ADD==author=Lie; Sophus=title=Theorie der Transformationsgruppen. Dritter ind Letzter Abschnitt=year=1970=publisher=Chelsea2=reftype=1=source=3
=ADD==author=Lie; Sophus=title=Vorlesungen ueber continuierliche Gruppen=year=1971=publisher=Chelsea=owner=2=reftype=1=source=3
=ADD==author=Emiris; Ioannis Z. + Mourrain; Bernard=title=SNAP 96. Workshop on Symbolic-Numeric Algebra for Polynomials. INRIA Sophia-Antipolis, France, July 1996.=year=1996=publisher=INRIA=owner=2=reftype=10=source=3
=ADD==author=Wang; Dongming=title=Elimination Methods and Applications=year=1999=publisher=INPG=owner=2=note=Habillitation Thesis=reftype=1=source=3
=ADD==author=Kudlicza; Peter=title=Das A bis Z der Elektronik=year=1996=publisher=FEI=owner=2=reftype=1=source=3
=ADD==author=Brough; Sonia=title=Langenscheidts Grosses Schulwoertebuch Deutsch-Englisch=year=1996=publisher=Langenscheidt=owner=3=note=Uni inventory 14578=reftype=1=source=3
=ADD==author=Messinger; Heinz=title=Langenscheidts Grosses Schulwoertebuch Englisch-Deutsch=year=1996=publisher=Langenscheidt=owner=3=note=Uni inventory 14577=reftype=1=source=3
=ADD==author=Meinel; Christoph + Theobald; Thorsten=title=Algorithms and Data Structures in VLSI Design. OBDD - Foundations and Applications=year=1998=publisher=Springer=owner=3=note=Uni inventory 14589=reftype=1=source=3
=ADD==author=none; none=title=Interactive Math Dictionary (CD-ROM)=year=1998=publisher=Math Resources Inc.=owner=1=note=CD-ROM. Uni inventory 14950=reftype=1=source=3
=ADD==author=Hajek; Petr + Pudlak; Pavel=title=Metamathematics of First-Order Logic=year=1998=publisher=Springer=edition=2=owner=1=note=Uni inventory 14582=reftype=1=source=3
=ADD==author=Bruederlin; B. + Roller; D.=title=Geometric Constraint Solving and Applications=year=1998=publisher=Springer=owner=1=note=Uni inventory 14588=reftype=15=source=3
=ADD==author=Harrison; John=title=Theorem Proving with the Real Numbers=year=1998=publisher=Springer=series=Distinguished Dissertations=owner=1=note=Uni inventory 14586=reftype=1=source=3
=ADD==author=Harris; John W. + Stocker; Horst=title=Handbook of Mathematics and Computational Science=year=1998=publisher=Springer=owner=1=note=Uni inventory 14587=reftype=1=source=3
=ADD==author=none; none=title=Red Hat Linux 5.1. The Official Red Hat Linux Installation Guide=year=1998=publisher=Red Hat Software Inc.=owner=1=note=Uni inventory 14580=reftype=1=source=3
=ADD==author=Kyas; Othmar=title=ATM-Netzwerke. Aufbau - Funktion - Performance=year=1996=edition=3=publisher=DATACOM=owner=1=note=Uni inventory 14579=reftype=1=source=3
=ADD==author=Paun; Gheorghe + Rozenberg; Grzegorz + Salomaa; Arto=title=DNA Computing. New Computing Paradigms=year=1998=publisher=Springer=owner=1=note=Uni inventory 14583=reftype=1=source=3
=ADD==author=Caviness; B. F. + Johnson; J. R.=title=Quantifier Elimination and Cylindrical Algebraic Decomposition. Proceedings of the International Symposium held in Hagenberg, Austria, Oct 1993.=year=1998=publisher=Springer=series=Texts and Monographs in Symbolic Computation=owner=1=note=Uni inventory 14581=reftype=10=source=3
=ADD==author=Mora; Teo + Mattson; Harold=title=AAECC-12. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. 12th International Symposium, Toulouse, France, June 1997.=year=1997=publisher=Springer=series=LNCS=number=1255=owner=1=note=Uni inventory 14585=reftype=10=source=3
=ADD==author=Cohen; Gerard + Giusti; Marc=title=AAECC-11. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. 11th International Symposium, Paris, France, July 1995.=year=1995=publisher=Springer=series=LNCS=number=948=owner=1=note=Uni inventory 14584=reftype=10=source=3
=ADD==author=Winkler; Franz=title=Polynomial Algorithms in Computer Algebra=year=1996=publisher=Springer=series=Texts and Monographs in Symbolic Computation=note=copy 1=owner=2=reftype=1=source=3
=ADD==author=Winkler; Franz=title=Polynomial Algorithms in Computer Algebra=year=1996=publisher=Springer=series=Texts and Monographs in Symbolic Computation=note=copy 2=owner=2=reftype=1=source=3
=ADD==author=Bronstein; I. N. + Semendjajew; K. A.=title=Taschenbuch der Mathematik=year=1991=publisher=Teubner, Leipzig und Nauka, Moskow=location=2=owner=2=reftype=1=source=3
=ADD==author=Bronstein; I. N. + Semendjajew; K. A.=title=Taschenbuch der Mathematik, Ergaenzungen=year=1991=publisher=Teubner, Leipzig=location=2=owner=2=reftype=1=source=3
=ADD==author=Knuth; D.=title=The TEXbook=year=1984=publisher=Addison-Wesley Publishing Company=location=2=owner=2=reftype=1=source=3
=ADD==author=Heinemann; B. +  Weihrauch; K.=title=Logik fuer Informatiker=year=1992=publisher=Teubner, Stuttgart=location=2=owner=1=reftype=1=source=3
=ADD==author=Poli; A. + Huguet; L.=title=Codes Correcteurs Theorie et applications=year=1989=publisher=Masson, Paris=location=2=owner=1=reftype=1=source=3
=ADD==author=Beutelspacher; A.=title=Das ist o.B.d.A. trivial!=year=1991=publisher=Vieweg, Braunschweig/Wiesbaden=location=2=owner=1=reftype=1=source=3
=ADD==author=Kredel; H.=title=Solvable Polynomial Rings=year=1993=publisher=Verlag Shaker=location=2=owner=1=reftype=1=source=3
=ADD==author=Becker; T. +  Weispfenning; V.=title=Groebner Bases A Computational Approach to Commutative Algebra=year=1993=publisher=Springer-Verlag=location=2=owner=1=reftype=1=source=3
=ADD==author=Renschuch; B.=title=Elementare und praktische Idealtheorie=year=1976=publisher=VEB Deutscher Verlag der Wissenschaften=location=2=owner=1=reftype=1=source=3
=ADD==author=Knuth; D.=title=The Art of Computer Programming, Vol.1 Fundamental Algorithms=year=1973=publisher=Addison-Wesley=location=2=owner=3=reftype=1=source=3
=ADD==author=Shoenfield; J.=title=Mathematical Logic=year=1967=publisher=Addison-Wesley=location=2=owner=3=reftype=1=source=3
=ADD==author=Forshman; K.=title=Constructive Commutative Algebra in Nonlinear Control Theory=year=1991=publisher=Linkoping University=location=2=owner=1=reftype=1=source=3
=ADD==author=Kreuzer; F.=title=Goedel-Satz, Moebius-Schleife, Computer-Ich=year=1986=publisher=Franz Deuticke, Wien=location=2=owner=1=reftype=1=source=3
=ADD==author=Valleman; D. J.=title=How to Prove It. A structured Approach=year=1994=publisher=Cambridge University Press=location=2=owner=1=reftype=1=source=3
=ADD==author=Leitl; Ch.=title=Wirschaft Morgen=year=1990=publisher=Universitaetsverlag Rudolf Trauner, Linz=location=2=owner=1=reftype=1=source=3
=ADD==author=Kutzler; B. + Lichtenberger; F. + Winkler; F.=title=Softwaresysteme zur Formelmanipulation=year=1990=publisher=Expert Verlag=location=2=owner=1=reftype=1=source=3
=ADD==author=Buchberger; B. + Winkler; F.=title=Groebner Bases and Applications=year=1998=publisher=Cambridge University Press=volume=251=series=London Mathematical Society Lecture Notes=location=2=owner=1=reftype=15=source=3
=ADD==author=Baader; F. +  Schulz; K. U.=title=Frontiers of Combining Systems=year=1996=publisher=Kluwer Academic Publishers=volume=3=series=Applied Logic Series=location=2=owner=1=reftype=15=source=3
=ADD==author=Bose; N. K.=title=Multidimensional Systems Theory=year=1985=publisher=D.Reidel Publishing Company=location=2=owner=1=reftype=15=source=3
=ADD==author=Schwichtenberg; H.=title=Logic of Computation=year=1997=publisher=Springer=volume=157=series=Nato ASI Series, Series F: Computer and System Sciences=location=2=owner=1=reftype=15=source=3
=ADD==author=Ida; T. + Ohari; A. + Takeichi; M.=title=Second Fuji International Workshop on Functional and Logic Programming=year=1997=publisher=World Scientific=owner=2=reftype=10=source=3
=ADD==author=Alos; Elisa + Mazet; Olivier + Nualart; David=title=Stochastic calculus with respect to fractional brownian motion with hurst parameter less than 1/2=year=1999=institution=Universitat de Barcelona=number=262=month=02=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Burgos ; Jose Ignatio + Wang ; Steve=title=Higher bott chern forms and beilinson's regulator=year=1996=institution=Universitat de Barcelona=number=22O=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Martinez ;Juan Carlos=title=Fundamentos de demostration automatica de teoremas=year=1996=institution=Universitat de Barcelona=number=219=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Lavila ; Olga=title=On the cohen-macaulayness of diagonal subalgebras of the rees algebra=year=1996=institution=Universitat de Barcelona=number=221=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Gil ; Angel J. + Rebagliato ; Jordi + Verdu ; Ventura=title=A strong completeness theorem associated with finite algebras=year=1996=institution=Universitat de Barcelona=number=218=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Cascante ;Carme + Ortega ; Joaquin M.=title=Convergence within nonisotropic regions of harmonic functions in $B^n$-=year=1996=institution=Universitat de Barcelona=number=223=month=12=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Leon ; Jorge A. + Nualart ; David=title=Stochastic evolution equations with random generators=year=1996=institution=Universitat de Barcelona=number=224=month=12=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Caballero ; Maria Emilia + Fernandes ; Begona + Nualart ; David=title=Estimation of densities and applications=year=1996=institution=Universitat de Barcelona=number=222=month=12=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Rovira ; Carles + Sanz-Sole ; Marta=title=Stochastic volterra equations in the plane : smoothness of the law=year=1997=institution=Universitat de Barcelona=number=226=month=01=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Crespo ;Teresa=title=Construction of $2^m S_n$-fields containing a $C_{2^m}$-field=year=1997=institution=Universitat de Barcelona=number=228=month=01=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Gelfreich ; V. G.=title=Analytical invariants of conformal transformations. A dynamical system approach=year=1997=institution=Universitat de Barcelona=number=229=month=02=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Gispert ; Joan + Torrens ; Antoni=title=Locally finite quasivarieties of mv-algebras=year=1997=institution=Universitat de Barcelona=number=23O=month=02=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Marquez-Carreras ;David + Sanz-Sole ; Marta=title=Development of the density: a Wiener-chaos approach=year=1997=institution=Universitat de Barcelona=number=231=month=02=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Adillon ; Roma J. + Verdu ; Ventura=title=Product logic and the deduction theorem=year=1997=institution=Universitat de Barcelona=number=232=month=03=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Cortadellas ; Teresa + Zarzuella ; Santiago=title=On the cohen-macaulay property of the fiber cone of ideals with reduction number at most one=year=1997=institution=Universitat de Barcelona=number=227=month=01=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Blancafort ; Cristina + Nollet ; Scott=title=Hilbert polynomials over artinian local rings=year=1996=institution=Universitat de Barcelona=number=225=month=12=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Cohen; Arjeh M. + Cuypers; Hans + Sterk; Hans=title=Some Tapas of Computer Algebra=year=1999=publisher=Springer=series=Algorithms and Computation in Mathematics vol 4=owner=2=reftype=1=source=3
=ADD==author=Kodama; Fumio=title=Analyzing Japanese High Technologies: The Techno-Paradigm Shift=year=1991=publisher=Pinter Publishers=owner=1=reftype=1=source=3
=ADD==author=Hoare; C.A.R. + Jifeng; He=title=Unifying Theories of Programming=year=1998=publisher=Prentice Hall=series=Series Editors C.A.R. Hoare and Richard Bird=owner=2=reftype=1=source=3
=ADD==author=Gathen; Joachim + Gerhard; Juergen=title=Modern Computer Algebra=year=1999=publisher=Cambrigde university press=owner=1=reftype=1=source=3
=ADD==author=Bruederlin; B. + Roller; D.=title=Geometric Constraint Solving and Applications=year=1998=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Preining; Norbert=title=Sketch-as-proof : A proof-theoretic analysis of axiomatic projektive geometry=year=1999=publisher=University of Vienna=note=Diplomarbeit=owner=2=reftype=1=source=3
=ADD==author=Roque; W. L. + Barone; D. A=title=WRI'97. Workshops on Intelligent Robotics=year=1997=publisher=Brazilian Computer Society - SBC=owner=1=reftype=10=source=3
=ADD==author=Gutmann; Helmut=title=3rd International Austrian-Israeli Technion Symposium cum Industrial Forum "Technology for Peace - Science for Mankind"=year=1999=publisher=Austrian Technion Society=owner=2=reftype=10=source=3
=ADD==author=Almelder; Christian + Rahmi; Shabnam + Seits; Klaus=title=S56. Symbolic Computation. Seminar Unterlagen=year=1999=publisher=ARGESIM=owner=2=reftype=10=source=3
=ADD==reftype=1=author=Pachl; J\"orn=title=Systemtechnik des Schinenverkehrs=year=1999=publisher=B. G. Teubner Stuttgart - Leipzig=owner=3
=ADD==reftype=14=number=00-01=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-01.ps.gz=year=2000=month=01=author=Schicho; Josef=title=Proper Parametrization of Surfaces with a Rational Pencil=abstract=We give an algorithm for the following problem: given a surfacedefined over $\mathbb{Q}$, and a rational pencil on it,compute a proper parametrization with coefficients in $\mathbb{Q}$.=note=submitted to ISSAC 2000=sponsor=FWF/SFB project F1302
=ADD==reftype=14=number=00-02=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-02.ps.gz=year=2000=month=01=author=Schicho; Josef=title=The Parametrization Problem for Algebraic Surfaces=abstract=The parameterization problem asks for a parameterization ofan implicitly given surface, in terms of rational functions intwo variables. In this survey paper, we give an overview on theexisting results, with a strong emphasize on algorithmic questions.=keywords=survey=note=submitted to MEGA 2000=sponsor=FWF
=ADD==reftype=14=number=00-03=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-03.ps.gz=year=2000=month=01=author=Bodnar; Gabor + Schicho; Josef=title=Improvements of the Algorithm for Resolution of Singularities=abstract=This paper contains several improvements of Villmayor's algorithmfor the problem of resolution of singularities of hypersurfaces.First, a condition is presented for avoiding superfluousintermediate resolution problems to be generated (computation ofcoefficient objects with respect to many hypersurfaces).  Then a newrepresentation of algebraic sets is developed to avoid rising thegenerators of their vanishing ideals to extremely high powers.Based on this improvement, a new representation of basic objects(i.e. resolution problems) is introduced, enabling the algorithm toexploit special structures appearing in them.  Finally, a techniqueis presented for the efficient management of charts of thedescribing atlas of blown up varieties.=sponsor=FWF project "Computation of Adjoints for Surfaces"=end=
=ADD==reftype=14=number=00-04=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-04.ps.gz=year=2000=month=02=author=Stadelmeyer; Peter=title=Computing the System of Adjoint Plane Curves by Puiseux Expansion, Part II: Algorithm=abstract=Let $\acurveC$ be an irreducible algebraic curve in the affine plane.We present an algorithm to compute the linear system of adjoint curvesof $\curveC$ of some given degree based on Puiseux-series expansions.An important part of the algorithm is, that a priori to the adjointcomputation a degree bound for the Puiseux-series expansions can begiven, so that lazy evaluation of the coefficients of thePuiseux-series can be avoided.=sponsor=FWF project number P11160-TEC ``HySaX''=keywords=algebraic geometry, plane curves, adjoints, Puiseux expansion, Newton polygon, algorithm
=ADD==reftype=14=number=00-05=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-05.ps.gz=year=2000=month=02=author=Hackl; Michaela=title=Multivariate Polynomial Codes=abstract=We decribe the construction of multi-dimensional cyclic codes and 1-pointAG-codes and showhow they can be decoded using the Berlekamp Massey Sakata algorithm.To enable the reader to experiment with the codes and the decodingalgorithm, we present a tutorialimplementation, which will be included in the CASA system.=note=Diploma Thesis=keywords=Goppa codes, multi-dimensional cyclic codes, Sakata's algorithm, codingtheory
=ADD==reftype=14=number=00-06=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-06.ps.gz=year=2000=month=01=author=Pau; Ioana-Cleopatra + Rents; Igor + Schreiner; Wolfgang=title=Verifying Mutual Exclusion and Liveness Properties with TLA=abstract=In this paper we prove the correctness of Peterson's mutual exclusionalgorithm using the Temporal Logic of Actions (TLA).We present a precise analysis of the algorithm for two processes:the formal specification of the algorithm,of the mutual exclusion property and of the liveness property andthe proof that the algorithm satisfies these two properties.=sponsor=FWF=end=
=ADD==reftype=14=number=00-07=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-07.ps.gz=year=2000=month=03=author=Mittermaier ; Christian=title=Parallel Algorithms in Constructive Algebraic Geometry=abstract=The computer algebra software library CASA provides numerousalgorithms for constructive algebraic geometry on the top of the Maplesystem.Usually, CASA functions operate on polynomials or rational functionsand the algorithms work fine for inputs of moderate degree.However, when the degree increases, computing time explodesdramatically, making interactive usage of the system almostimpossible.In this work we investigate parallelization ideas for three importantCASA algorithms, namely for plotting plane algebraic curves, plottingsurface-to-surface intersections and for resolution of singularities.Besides the parallel algorithms we also give some improvements of thesequential programs which already reduce computing time significantly.We have systematically tested and benchmarked our algorithms using the{\em Distributed Maple} environment on various machine configurationsemploying different numbers of processors.We have achieved significant speedups which  reduce computing time toa moderate size.=note=Diploma Thesis=sponsor=FWF project P11160-TEC and SFB013 project number F1304=keywords=computer algebra, maple, parallel algorithm, cluster
=ADD==reftype=14=number=00-08=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-08.ps.gz=year=2000=month=03=author=Pau; Petru=title=Anchored Sweep: A Paradigm=abstract=The subject of this thesis is situated in the frame of computationalgeometry. We give here a unified exposition of the utilities ofthe {\it anchored sweep}. We focus on applications in problems ofoptimal placement.Derived from the well established {\it line sweep} paradigm, theanchored sweep is used for spaces that are topologically homeomorphicto a circle or a segment -- usually not a straight line. It has a verystrong intuition behind it, as it consists basically inmoving an object with a point anchored on the boundary ofanother object, and processing all events that occur duringthis movement.In this thesis, the anchored sweep is used to detect specialposition of convex objects in two- and three-dimensional spaces,namely, positions in which these objects contain a maximumnumber of points from a given set. These positions can be attainedby applying either a translation or a rigid motion.Thus, we present solutions for the following problems: Let $P$be a convex planar polygon or a polyhedron in three-dimensional space,and let $S$ be a set of points in plane respectively in space.Find a translation or a rigid motion $\tau$ such that $\tau(P)$contains a maximum number of points in $S$.A first discretization of the search space is given by the{\it stable placements}, i.e., special transformation under whichthe boundary of the convex object contains a number of pointsfrom the initial set. We relate the stable placements to theintersection of a number of certain translated copies of $P$. Byintersecting a number of copies of the initial object a polygon isobtained; it will be used afterwards as the space that will be swept.During the anchored sweep, $P$ is kept with one vertex on thepolygon given by the intersection. As $P$ traverses the perimeter,the points in $S$ traverse the boundary of $P$. The positionof $P$ with maximum $S$-points inside is stored.It is shown here that the lower bound for problems of this typeis $\Omega(n\log n)$, where $n$ is the number of vertices of $P$.=note=PhD Thesis=sponsor=RISC-Linz scholarship=keywords=computational geometry, anchored sweep, optimal placement=end=
=ADD==reftype=14=number=00-09=url=ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-09.ps.gz=year=2000=month=02=author=Petcu; Dana=title=Numerical Solution of ODEs with Distributed Maple=abstract=We describe a {\tt Maple} package named {\tt D-NODE (Distributed NumericalSolver for ODEs)}, implementing a number of difference methods for initialvalue problems. The distribution of the computational effort follows theidea of parllelism across method. We have benchmarked the package in a clusterenvironment. {\tt Distributed Maple} ensures the inter-processor communication.Numerical experiments show that parallel implicit Runge-Kutta methods canattain speed-ups close to the ideal values when the initial value problemis stiff and has between ten and hundred equations. The stage equations of theimplicit methods are solved on different processors using {\tt Maple}'s facilities.=sponsor=FWF/SFB project F1303=keywords=parallel numerical methods for ordinary differential equations, distributed computer algebra systems, performance analysis
=ADD==author=Foupouagnigni; Mama + Ronveaux; Andre + Hounkonnou; Mahouton Norbert=title=The Fourth-Order Difference Equation Satisfied by the Associated Orthogonal Polynomials of the Laguerre-Hahn Class=year=1997=institution=Konrad-Zuse-Zentrum=number=71=location=2=owner=2=reftype=11=source=3
=ADD==author=Wolf; Thomas + Brand; Andreas + Mohammadzadeh; Majid=title=Computer algebra algorithms and routines for the computation of conversation laws and fixing of gauge in differential expressions=year=1998=institution=Konrad-Zuse-Zentrum=number=05=location=2=owner=2=reftype=11=source=3
=ADD==author=Wolters; Christof=title=GOS Thesaurus-Handbuch=year=1997=institution=Konrad-Zuse-Zentrum=number=19=location=2=owner=2=reftype=11=source=3
=ADD==author=Clemens; Hans-H.=title=Systemanalyse und Datenkatalog=year=1997=institution=Konrad-Zuse-Zentrum=number=18=location=2=owner=2=reftype=11=source=3
=ADD==author=Clemens; Hans-H. + Saro; Carlos=title=Abschlussbericht=year=1997=institution=Konrad-Zuse-Zentrum=number=17=location=2=owner=2=reftype=11=source=3
=ADD==author=Saro; Carlos + Schroeder; Beate + Volkmann; Katrin=title=GOS Benutzer-Handbuch=year=1997=institution=Konrad-Zuse-Zentrum=number=16=location=2=owner=2=reftype=11=source=3
=ADD==author=Wolff; Thomas=title=A Study of Genetic Algorithms solving a Combinatorical Puzzle=year=1998=institution=Konrad-Zuse-Zentrum=number=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Foupouagnigni; M. + Koepf; W. + Ronveaux; A.=title=Fourth Order Difference Equation for the Associated Classical Discrete Orthogonal Polynomials=year=1997=institution=Konrad-Zuse-Zentrum=number=72=location=2=owner=2=reftype=11=source=3
=ADD==author=Koepf; W. + Schmersau; D.=title=Algorithms for Classical Orthogonal Polynomials=year=1996=institution=Konrad-Zuse-Zentrum=number=23=location=2=owner=2=reftype=11=source=3
=ADD==author=Koepf; Wolfram=title=A Package on Orthogonal Polynomials and Special Functions=year=1996=institution=Konrad-Zuse-Zentrum=number=53=location=2=owner=2=reftype=11=source=3
=ADD==author=Wolf; Thomas=title=Killing Pairs in Flat Space=year=1997=institution=Konrad-Zuse-Zentrum=number=58=location=2=owner=2=reftype=11=source=3
=ADD==author=Deuflhard; P.=title=Jahresbericht 1996=year=1996=institution=Konrad-Zuse-Zentrum=location=2=owner=2=reftype=11=source=3
=ADD==author=Moret; S. + Nualart; D.=title=Generalization of ITO's formula for smooth nondegenerate martingales=year=1999=institution=Universitat de Barcelona=number=263=location=2=owner=2=reftype=11=source=3
=ADD==author=Zaidi; N.Lanjri + Nualart; D.=title=Backward stochastic differential equations in the plane=year=1999=institution=Universitat de Barcelona=number=264=location=2=owner=2=reftype=11=source=3
=ADD==author=Curras-Bosch; Carlos + Miranda; Eva=title=Symplectic germs of singular lagrangian foliations=year=1999=institution=Universitat de Barcelona=number=265=location=2=owner=2=reftype=11=source=3
=ADD==author=Leon; Jorge A. + Nualart; David + Pettersson; Roger=title=The stochastic burgers equation: finite moments and smoothness of the density=year=1999=institution=Universitat de Barcelona=number=274=location=2=owner=2=reftype=11=source=3
=ADD==author=Zheng; Xizhong=title=Weak Computability and Semi-Continuity in Analysis=year=1998=institution=Fernuniversitaet Hagen - Informatik=number=246=location=2=owner=2=reftype=11=source=3
=ADD==author=Westhoff; Dirk=title=AAPI : an Agent Application Programming Interface=year=1999=institution=FernUniversitaet Hagen - Informatik=number=247=location=2=owner=2=reftype=11=source=3
=ADD==author=Widera; Manfred + Beierle; Christoph=title=Local normalisation of funktional programs=year=1999=institution=FernUniversitaet Hagen - Informatik=number=248=location=2=owner=2=reftype=11=source=3
=ADD==author=Nualart; David + Viens; Frederich=title=Evolution equation of a stochastic semigroup with white-noise drift=year=1998=institution=Universitat de Barcelona=number=251=month=O4=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Adillon; Roma J. + Verdu; Ventura=title=On the {$\longrightarrow, \and, \or, \dotcircle, 0$}-contraction-less intuitionistic propositional calculus=year=1998=institution=Universitat de Barcelona=number=249=month=O3=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Sanz-Sole; Marta + Sarra; Monica=title=Logarithmic estimates for the density of an anticipating stochastic differential equation=year=1998=institution=Universitat de Barcelona=number=254=month=O6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Bolotin; S. + Treschev; D.=title=Unbounded growth of energy in nonautonomous hamiltonian systems=year=1998=institution=Universitat de Barcelona=number=252=month=O6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Moret; S. + Nualart; D.=title=Quadratic covariation and Itos's formula for smooth nondegenerate martingales=year=1998=institution=Universitat de Barcelona=number=253=month=O6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Rovira; Carles + Sanz-Sole; Marta=title=Large deviation for stochastic Volterra equations in the plane=year=1997=institution=Universitat de Barcelona=number=233=month=O4=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Martinez; Juan Carlos=title=On cardinal sequences of scattered spaces=year=1997=institution=Universitat de Barcelona=number=234=month=O4=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Leon; Jorge A. + Nualart; David=title=Anticipating integral euations=year=1997=institution=Universitat de Barcelona=number=24O=month=O9=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Alos; Elisa + Leon; Jorge A. + Nualart; David=title=Stochastic heat equation with random coefficients=year=1997=institution=Universitat de Barcelona=number=24=month=O9=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Gyongy; Istvan + Nualart; David=title=On the stochastic Burgers equation in the real line=year=1997=institution=Universitat de Barcelona=number=239=month=O9=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Carreras-Marquez; David + Sanz -Sole; Marta=title=Taylor expansion of the density in a stochastic heat equation=year=1997=institution=Universitat de Barcelona=number=238=month=O9=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Ruiz-Morales; Juan J. + Ramis; Jean Pierre=title=A note on the non-integrability of some hamiltonian systems with a homogeneous potential=year=1997=institution=Universitat de Barcelona=number=236=month=O6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Rovira; Carles + Tindel; Samy=title=Sharp Laplace asymptotics for SPDEs: the parabolic and elliptic cases=year=1997=institution=Universitat de Barcelona=number=243=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Zaidi; N. Lanjri + Nualart; David=title=Burgers equation driven by space-time white noise : absolute continuity of the solution=year=1997=institution=Universitat de Barcelona=number=242=month=11=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Vegas; Esteban + Ocana; Jordi=title=Variance reduction in the study of a new test concerning the Behrens-Fischer problem=year=1997=institution=Universitat de Barcelona=number=244=month=l2=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3 
=ADD==author=Geser; Alfons=title=On Normalising, Non-terminating One-rule String Rewriting Systems=year=1996=institution=Universitaet Tuebingen=number=34=month=1O=location=2=owner=2=reftype=11=source=3  
=ADD==author=Sanz-Sole; Marta + Sarra; Monica=title=Path properties of a class of martingale measures with applications to SPDE`s=year=1999=institution=Universitat de Barcelona=number=268=month=7=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Fortiana; J. + Grane; A.=title=A scale-free goodness-of-fit statistic for the exponential distribution based on maximum correlations=year=1999=institution=Universitat de Barcelona=number=267=month=6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Zaidi; N. Lanjri=title=A class of two parameter backward stochastic differential equations driwen by a brownian sheet=year=1999=institution=Universitat de Barcelona=number=266=month=6=note=Mathematics Preprint Series=location=2=owner=2=reftype=11=source=3
=ADD==author=Ringel; C.M.=title=Algorithms and Computer Applications in Representations Theory of Finite Dimensional Algebras=year=1996=institution=Universitaet Bielefeld=number=009=note=Sonderforschungsbereich 343=location=2=owner=2=reftype=11=source=3
=ADD==author=Draexler; Peter + Noerenberg; Rainer=title=CREP Manual Part III=year=1999=institution=Universitaet Bielefeld=number=007=note=Sonderforschungsbereich 343=location=2=owner=2=reftype=11=source=3
=ADD==author=Draexler; Peter + Noerenberg; Rainer=title=CREP Manual II=year=1997=institution=Universitaet Bielefeld=number=009=note=Sonderforschungsbereich 343=location=2=owner=2=reftype=11=source=3
=ADD==author=Draexler; Peter + Noerenberg; Rainer=title=CREP Manual Version 1.0 Using Maple as Surface=year=1996=institution=Universitaet Bielefeld=number=002=note=Sonderforschungsbereich 343=location=2=owner=2=reftype=11=source=3
=ADD==author=Draexler; Peter + Noerenberg; Rainer=title=Classification Problems IN the Representation Theory of Finite-Dimensional Algebras=year=1997=institution=Universitaet Bielefeld=number=008=note=Sonderforschungsbereich 343=location=2=owner=2=reftype=11=source=3
=ADD==author=Brueggemann-Klein; Anne + Klein; Rolf + Landgraf; Britta=title=BibRelEx: Erschliessung bibliographischer Datenbasen durch Visualisierung von annotierten inhaltsbasierten Beziehungen=year=1999=institution=FernUniversitaet Hagen=number=252=month=6=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Jacobs; Bart + Leavens; Gary T. + Mueller; Peter + Poetzsch-Heffter; Arnd=title=Formal Techniques for Java Programs=year=1999=institution=FernUniversitaet Hagen=number=251=month=5=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Dieker; Stefan + Gueting; Ralf Hartmut=title=Plug and Play with Query Algebras: SECONDO A Generic DBMS Development Environment*=year=1999=institution=FernUniversitaet Hagen=number=249=month=2=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Icking; Christian + Klein; Rolf + Le; Ngoc-Minh + Ma; Lihong + Santos; Francisco=title=On Bisectors for Convex Distance Functions in 3-Space=year=1999=institution=FernUniversitaet Hagen=number=250=month=5=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Biedebach; A. + Laskowski; F. + Neuhaus; U. + Schlageter; G.=title=Funktionsbeschreibung der "Virtuellen Universitet"=year=1999=institution=FernUniversitaet Hagen=number=253=month=6=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Kulas; M.=title=Port Annotations for Prolog=year=1999=institution=FernUniversitaet Hagen=number=254=month=6=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Brattka; V.=title=Recursive and Computable Operations over Topological Structures=year=1999=institution=FernUniversitaet Hagen=number=255=month=7=note=Informatik Berichte=location=2=owner=2=reftype=11=source=3
=ADD==author=Henzinger; Thomas + Raskin; Jean-Francois + Schobbens; Pierre-Yves=title=Axioms for Real-Time Logics=year=1999=institution=Max Planck Institut fuer Informatik=number=005=month=8=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Raskin; Jean-Francois + Schobbens; Pierre-Yves=title=Proving a conjecture of Andreka on temporal logic=year=1999=institution=Max Planck Institut fuer Informatik=number=004=month=8=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Raskin; Jean-Francois + Schobbens; Pierre-Yves=title=The Logic of Event Clocks=year=1999=institution=Max Planck Institut fuer Informatik=number=002=month=8=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Vorobyov; Sergei=title=New Lower Bounds for the Expressiveness and the Higher-Order Matching Problem in the Simply Typed Lambda Calculus=year=1999=institution=Max Planck Institut fuer Informatik=number=001=month=7=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Wu; Jinzhao=title=Symmetries in Logic Programs=year=1999=institution=Max Planck Institut fuer Informatik=number=005=month=4=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Cortier; Veronique + Ganzinger; Harald + Jaquemard; Florent + Veanes; Margus=title=Decidable fragments of simultaneous rigid reachability=year=1999=institution=Max Planck Institut fuer Informatik=number=004=month=3=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Sanders; Peter + Egner; Sebastian + Korst; Jan=title=Fast Concurrent Access to Parallel Disks=year=1999=institution=Max Planck Institut fuer Informatik=number=003=month=6=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Boghossian; N.P. + Kohlbacher; O. + Lenhof; H.-P.=title=BALL: Biochemical Algorithms Library=year=1999=institution=Max Planck Institut fuer Informatik=number=002=month=4=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Henzinger; Thomas + Raskin; Jean-Francois + Schobbens; Pierre-Yves=title=Fully Decidable Logics, Automata and Classical Theories for Defining Regular Real-Time Languages=year=1999=institution=Max Planck Institut fuer Informatik=number=003=month=8=note=Forschungsbericht=location=2=owner=2=reftype=11=source=3
=ADD==author=Rueck; H.G. + Tipp; U.=title=Heegner points and L-series of automorphic cusp forms of Drinfeld type=year=1998=institution=Universitaet Essen=number=19=location=2=owner=2=reftype=11=source=3
=ADD==author=Stinson; D.R. + Trung;  Tran van=title=Some New Results on Key Distribution Patterns and Broadcast Encryption=year=1998=institution=Universitaet Essen=number=16=location=2=owner=2=reftype=11=source=3
=ADD==author=Mathon; R. + Trung; Tran van=title=Directed t-Packing and Directed t-Steiner Systems=year=1998=institution=Universitaet Essen=number=18=location=2=owner=2=reftype=11=source=3
=ADD==author=Stinson; D.R. + Trung; Tran van + Wei; R.=title=Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures=year=1998=institution=Universitaet Essen=number=17=location=2=owner=2=reftype=11=source=3
=ADD==author=Trung; Tran van=title=Constructions for Near Resolvable Desings and BIBDs=year=1998=institution=Universitaet Essen=number=15=location=2=owner=2=reftype=11=source=3
=ADD==author=Fleischmann; P.=title=Relative trace ideals and Cohen-Macaulay quotients of modular invariant rings=year=1998=institution=Universitaet Essen=number=13=location=2=owner=2=reftype=11=source=3
=ADD==author=Boeckle; G.=title=The generic fiber of the universal deformation space associated to a tame Galios representation=year=1997=institution=Universitaet Essen=number=5=location=2=owner=2=reftype=11=source=3
=ADD==author=Weber; H.J.=title=Algorithmische Konstruktion hyperelliptischer Kurven mit kryptographischer Relevanz und einem Endomorphismenring echt groesser als ^Z^=year=1997=institution=Universitaet Essen=number=3=location=2=owner=2=reftype=11=source=3
=ADD==author=Razon; A.=title=Abundance of Hilbertian Domains=year=1997=institution=Universitaet Essen=number=7=location=2=owner=2=reftype=11=source=3
=ADD==author=Suprunenko; I.D.=title=The minimal polynomials of unipotent elements in irreducible representations of the classical groups in characteristic p with p-large highest weights=year=1997=institution=Universitaet Essen=number=6=location=2=owner=2=reftype=11=source=3
=ADD==author=Razon; A.=title=Existentially Closed r-Domains in Regular Extensions=year=1997=institution=Universitaet Essen=number=8=location=2=owner=2=reftype=11=source=3
=ADD==author=Gangl; H. + Frey; G. + Rueck; H.-G.=title=PROCEDINGS Workshop on PolylogarithmsEssen, Germany, May 1-4, 1997=year=1997=institution=Universitaet Essen=number=9=location=2=owner=2=reftype=11=source=3
=ADD==author=Green; D.J.=title=Implementing the Anick-Green resolution for p-group algebras=year=1997=institution=Universitaet Essen=number=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Braun; V.=title=Ueber Modulation, Kodierung und Signalverarbeitung fuer Optische und Magnetische Datenspeichersysteme=year=1997=institution=Universitaet Essen=number=4=location=2=owner=2=reftype=11=source=3
=ADD==author=Frey; G.=title=Number Theory and Arithmetical Geometry: Arithmetical Applications of Modular Forms=year=1998=institution=Universitaet Essen=number=14=location=2=owner=2=reftype=11=source=3
=ADD==author=Lam;T.Y.=title=A First Course in Noncommutative Rings=note=copy 1=year=1991=publisher=Springer=series=Graduate Texts in Mathematics=owner=2=reftype=1=source=3
=ADD==author=Lam;T.Y.=title=A First Course in Noncommutative Rings=note=copy 2; Uni inventory 13018=year=1991=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=reftype=1=source=3
=ADD==author=Wechler;W.=title=Universal Algebra for Computer Scientists=year=1992=publisher=Springer=series=EATCS Monographs on Theoretical Computer Scientists=owner=2=reftype=1=source=3
=ADD==author=McCarty; Bill=title=Learning DEBIAN GNU/LINUX=year=1999=publisher=O'Reilly=owner=2=reftype=1=source=3
=ADD==author=Taschner; Rudolf=title=Das UnendlicheMathematiker ringen um einen Begriff=year=1995=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Okasaki; Chris=title=Purely Functional Data Structures=year=1998=publisher=Cambridge University Press=owner=2=reftype=1=source=3
=ADD==author=Maccone; Claudio=title=The sun as a gravitational lens:proposed space missions=year=1997=publisher=IPI Press=series=Monographs in Science and Mathematics=owner=2=reftype=1=source=3
=ADD==author=Hitz; Martin + Kappel; Gerti=title=UML @ WorkVon der Analyse zur Realisierung=year=1999=publisher=dpunkt.verlag GmbH=owner=2=reftype=1=source=3
=ADD==author=Trott; Michael=title=The imaginary made real: The images of Michael Trott=year=1999=publisher=Wolfram Media=series=Graphica 1: The World of Mathematica Graphichs=owner=2=reftype=1=source=3
=ADD==author=Char; Bruce W. + Geddes; Keith O. + Gonnet; Gaston H. + Leong; Benton L. + Monagan;  Michael B. + Watt; Stephen M.=title=Maple VLibrary Reference Manual=year=1991=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Char; Bruce W. + Geddes; Keith O. + Gonnet; Gaston H. + Leong; Benton L. + Monagan; Michael B. + Watt; Stephen M.=title=MAPLE VLanguage Reference Manual=year=1991=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Prehofer; Christian=title=Solving Higher-Order Equations From Logic to Programming=year=1998=publisher=Birkhauser=series=Progress in Theoretical Computer Science=owner=2=reftype=1=source=3
=ADD==author=Jones; Oliver=title=Introduction to the X Window System=year=1989=publisher=Prentice-Hall=owner=2=reftype=1=source=3
=ADD==author=Busse; Johannes=title=Dozentenhandbuch=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Ott; Konrad + Busse; Johannes=title=Ethik in der Informatik=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Klischewski; Ralf=title=Informatik und Gesellschaft - eine Einfuehrung=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Reisin; Fanny-Michaela + Renn; Ortwin=title=Ueber Informatik reden=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Kubicek; Herbert=title=Moeglichkeiten und Gefahren der "Informationsgesellschaft"=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Broedner; Peter=title=Informatik in der Arbeitswelt=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Floyd; Christiane + Klaeren; Herbert=title=Informatik als Praxis und Wissenschaft=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Schinzel; Britta + Parpart; Nadja + Westermayer; Til=title=Informatik und Geschlechterdifferenz=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Schelhowe; Heidi=title=Technikentwicklung als sozialer Gestaltungsprozess=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Wetzstein; Thomas A. + Dahm; Hermann + Eckert; Roland=title=Informatik im persoenlichen Leben=year=1999=publisher=Universitaet Tuebingen=series=Tuebinger Studientexte Informatik und Gesellschaft=owner=2=reftype=1=source=3
=ADD==author=Bajnov; Drumi=title=The eighth international colloquium on numerical analysis and computer science with applications=year=1999=publisher=Mathematical Society,Technical University-Plovdiv=owner=2=reftype=10=source=3
=ADD==author=Buber; V. + Hietamaeki; A. + Keranen; V.=title=Mathematics with PowerIMS'99=year=1999=publisher=International Mathematica Symposium Sekreteriat=owner=2=reftype=10=source=3
=ADD==author=Tipping; B.H.V.=title=Developments in computational mechanics with high performance computing=year=1999=publisher=Civil-Comp Press=owner=2=reftype=10=source=3
=ADD==author=Dooley; Sam=title=International Symposium on Symbolic and Algebraic Computation=year=1999=publisher=ACM PRESS=owner=2=reftype=10=source=3
=ADD==author=Titsworth; Frances M.=title=14th Symposium on Logic in Computer Science=year=1999=publisher=IEEE=owner=2=reftype=10=source=3
=ADD==author=Dennison; Avery=title=Mathematica Developer Conference=publisher=Wolfram Research Inc.=year=1999=location=2=owner=2=source=3=reftype=10
=ADD==author=Amestoy; P. + Berger; P .+ Dayde; M. + Duff; I.+ Fraysse; V. + Giraud; L.+Ruiz; D.=title=Euro-Par'99  Parallel Processing=year=1999=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Gottlob; Georg + Grandjean; Etienne + Seyr; Katrin=title=Computer Science Logic=year=1998=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Ganzinger; Harald=title=Automated Deduction-CADE-16=year=1999=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Narendran; Paliath + Rusinovitch; Michael=title=Rewriting Techniques and Applications=year=1999=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Halbwachs; Nicolas + Peled; Doron=title=Computer Aided Verification=year=1999=publisher=Springer=owner=2=reftype=10=source=3
=ADD==author=Reisdorph; Kent=title=Borland C++ Builder 4 Unleashed=year=1999=publisher=SAMS=owner=2=note=Uni inventory: 14959=reftype=1=source=3
=ADD==author=Eddon; Guy + Eddon; Henry=title=Inside Distributed COM=year=1998=publisher=Microsoft Press=series=Microsoft Programming Series=owner=2=note=Uni inventory=reftype=1=source=3
=ADD==author=Reselman; Bob + Peasley; Richard + Pruchniak; Wayne=title=Using Visual Basic 6=year=1998=publisher=QUE=owner=2=note=Uni inventory:14971=reftype=1=source=3
=ADD==author=Thayer; Bob=title=Visual Basic 6 Unleashed=year=1998=publisher=Sams=owner=2=note=Uni inventory:14957=reftype=1=source=3
=ADD==author=Suokup; Ron + Delaney; Kalen=title=Inside Microsoft SQL Server 7.0=year=1997=publisher=Microsoft Press=series=Microsoft Programming Series=owner=2=note=Uni inventory :14960=reftype=1=source=3
=ADD==author=Scheetz; Dale=title=The Debian Linux User's Guide=year=1998=publisher=Linux Press=owner=2=note=Uni inventory:14966=reftype=1=source=3
=ADD==author=Scheetz; Dale=title=The Debian Linux User's Guide=year=1998=publisher=Linux Press=owner=2=note=Uni inventory:14967=reftype=1=source=3
=ADD==author=McConnell; Steve=title=Software Project Survival Guide=year=1998=publisher=Microsoft Press=owner=2=note=Uni inventory:14976=reftype=1=source=3
=ADD==author=Larman; Craig=title=Applying UML and Patterns=year=1998=publisher=Prentice Hall PTR=owner=2=note=Uni inventory:14972=reftype=1=source=3
=ADD==author=Fowler; Martin=title=AnalysemusterWiederverwendbare Objektmodelle=year=1999=publisher=Addison-Wesley=series=Professionelle Softwareentwicklung=owner=2=note=Uni inventory:14975=reftype=1=source=3
=ADD==author=Petzold; Charles=title=Programming Windows=year=1999=publisher=Microsoft Press=series=Microsoft Programming Series=owner=2=note=Uni inventory:14974=reftype=1=source=3
=ADD==author=Fowler; Martin + Scott; Kendall=title=UML Distilled=year=1999=publisher=Addison-Wesley=series=The Addison-Wesley Object Technology Series=owner=2=note=Uni inventory:14973=reftype=1=source=3
=ADD==author=Balzert; Helmut=title=Lehrbuch der Software-TechnikSoftware-Entwicklung=year=1996=publisher=Spektrum=series=Lehrbuecher der Informatik=owner=2=note=Uni inventory:14978=reftype=1=source=3
=ADD==author=Balzert; Helmut=title=Lehrbuch der Software-TechnikSoftware-Management;  Software-Qualitaetssicherung;  Unternehmensmodellierung=year=1998=publisher=Spektrum=series=Lehrbuecher der Informatik=owner=2=note=Uni inventory:14977=reftype=1=source=3
=ADD==author=Buchmann; Johannes=title=Einfuerung in die Kryptographie=year=1999=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Wolfram; Stephen=title=MATHEMATICA Version 4=year=1999=publisher=Wolfram;  Cambridge University Press=owner=2=reftype=1=source=3
=ADD==author=Wolfram; Stephen=title=Mathematica 4Standard Add-on Packages=year=1999=publisher=Wolfram=owner=2=reftype=1=source=3
=ADD==author=Wolfram; Stephen=title=Getting Started with Mathematica under Microsoft Windows=year=1999=publisher=Wolfram=owner=2=reftype=1=source=3
=ADD==author=Foesmeier; Ulrich + Kaufmann; Michael=title=On Exact Solutions for the Rectilinear Steiner Problem:Part I: Theoretical Results=year=1996=institution=Universitaet Tuebingen=number=O9=location=2=owner=2=reftype=11=source=3
=ADD==author=Thiemann; Peter=title=A Safety Analysis for Functional Languages=year=1992=institution=Universitaet Tuebingen=number=13=location=2=owner=2=reftype=11=source=3
=ADD==author=Lauer; Harald=title=A Dynamically Extensible Platform for Interactive Graph Algorithms=year=1997=institution=Universitaet Tuebingen=number=O4=location=2=owner=2=reftype=11=source=3
=ADD==author=Geser; Alfons=title=Decidability of Termination in a Large Class of One-rule String Rewriting Systems=year=1997=institution=Universitaet Tuebingen=number=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Eckel; Bruce=title=Thinking in JAVA=year=1998=publisher=Prentice Hall PTR=owner=2=reftype=1=source=3
=ADD==author=Hellwagner; Hermann + Reinefeld; Alexander=title=SCI: Scalable Coherent Interface Architecture and Software for High-Performance Computer Clusters=year=1999=publisher=Springer=owner=2=reftype=1=source=3
=ADD==author=Lehmann; E.=title=Lineare Algebra mit dem Computer=year=1983=publisher=B.G.Teubner Stuttgart=owner=2=reftype=1=source=3
=ADD==author=Graf; Klaus-D.=title=Computer in der Schule 2=year=1988=publisher=B.G.Teubner Stuttgart=owner=2=reftype=1=source=3
=ADD==author=Kelman; P. + Bardige; A. + Choate; J. + Hanify; G. + Richards; J. + Roberts; N. + Walters; J. + Tornrose; M.K.=title=Computers in teaching mathematics=year=1983=publisher=Addison=Wesley=owner=2=reftype=1=source=3
=ADD==author=Abeln; Olaf=title=Die CA...-Techniken in der industriellen Praxis=note=Uni inventory: 11981=year=1990=publisher=Hanser=owner=3=reftype=1=source=3
=ADD==author=Law; Averill M. + Kelton; W.David=title=Simulation Modeling and Analysis=year=1991=publisher=McGraw-Hill=owner=2=reftype=1=source=3
=ADD==author=Garthen; Joachim von zur + Gerhard; Juergen=title=Modern Computer Algebra=year=1999=publisher=Cambridge University Press=owner=2=reftype=1=source=3
=ADD==author=Lang; Serge=title=Real and Functional Analysis=year=1993=publisher=Springer=series=Graduate Texts in Mathematics=owner=2=reftype=1=source=3
=ADD==author=Kreher; Donald L. + Stinson;  Douglas R.=title=Combinatorial AlgorithmsGeneration,Enumeration,and Search=year=1999=publisher=CRC Press=series=Discrete Mathematics and Its Applications=owner=2=reftype=1=source=3
=ADD==author=Stanley; Richard P.=title=Enumerative CombinatoricsVolume 2=year=1999=publisher=Cambridge University Press=series=Cambridge Studies in Advanced Mathematics 62=owner=2=reftype=1=source=3
=ADD==author=Milner; Robin + Tofte; Mads=title=Commentary on Standard ML=year=1991=publisher=The MIT Press=owner=2=reftype=1=source=3
=ADD==author=Lusztig; George=title=Introduction to Quantrum Groups=year=1994=publisher=Birkhauser=series=Progress in Mathematics=owner=2=reftype=1=source=3
=ADD==author=Wolfram; Stephen=title=Mathematica 3.0=year=1999=publisher=Wolfram Media , Cambridge University Press=owner=2=reftype=1=source=3
=ADD==author=Cohn; P.M.=title=Skew FieldsTheory of General Divisions Rings=year=1995=publisher=Cambridge University Press=series=Encyclopedia of Mathematics and Its Applications=owner=2=reftype=1=source=3
=ADD==author=Bird; Richard=title=Introduction to Functional Programming using Haskell=year=1998=publisher=Prentice Hall Europe=series=Prentice Hall Series in Computer Science=owner=2=reftype=1=source=3
=ADD==author=van der Put; Marius + Singer; Michael F.=title=Galois Theory of Difference Equations=year=1997=publisher=Springer=series=Lecture Notes in Mathematics=owner=2=reftype=1=source=3
=ADD==author=Bronstein; Manuel=title=Symbolic Integration ITranscendental Functions=year=1997=publisher=Springer=series=Algorithms and Computation in MathematicsVolume 1=owner=2=reftype=1=source=3
=ADD==author=Abramowitz; Milton + Stegun; Irene A.=title=Handbook of Mathematical Functions=year=1972=publisher=Dover Publications,Inc.=owner=2=reftype=1=source=3
=ADD==author=Coutinho; S.C.=title=A Primer of Algebraic D-modules=year=1995=publisher=Cambridge University Press=series=London Mathematical SocietyStudent Texts 33=owner=2=reftype=1=source=3
=ADD==author=Andrews; George E.=title=The Theory of Partitions=year=1984=publisher=Cambridge University Press=series=Cambridge Mathematical Library=owner=2=reftype=1=source=3
=ADD==author=Graham; Ronald L. + Knuth; Donald E. + Patashnik; Oren=title=Concrete Mathematics=year=1994=publisher=Addison-Wesley=series=A Foundation for Computer Science=owner=2=reftype=1=source=3
=ADD==author=Andrews; George E. + Askey; Richard + Roy; Ranjan=title=Special Functions=year=1999=publisher=Caambridge University Press=series=Encyclopedia of Mathematics and Its Applications=owner=2=reftype=1=source=3
=ADD==author=Jacquemard; Florent + Meyer; Christoph + Weidenbach; Christoph=title=Unification in Extensions of Shallow Equational Theories=year=1998=institution=Max-Planck Institut=number=002=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Charatonik; Witold=title=Automata on DAG Representations of Finite Trees=year=1999=institution=Max-Planck Institut=number=001=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Klau; Gunnar W. + Mutzel; Petra=title=Optimal Compaction of Orthogonal Grid Drawings=year=1998=institution=Max-Planck Institut=number=031=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Broennimann; Herve + Kettner; Lutz + Schirra; Stefan + Veltkamp; Remco=title=Application of the Generic Programming Paradigm in the Design of CGAL=year=1998=institution=Max-Planck Institut=number=030=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Mutzel; Petra + Weiskircher; Rene=title=Optimizing Over All Combinatorial Embeddings of a Planar Graph=year=1998=institution=Max-Planck Institut=number=029=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Crauser; Andreas + Ferragina; Paolo=title=Research Report: A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory=year=1999=institution=Max-Planck Institut=number=001=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Waldmann; Uwe=title=Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups=year=1999=institution=Max-Planck Institut=number=003=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Christoph; Thomas + Juenger; Michael + Kececioglu; John + Mutzel; Petra + Reinelt; Gerhard=title=A branch-and-cut approach to physical mapping with end-probes=year=1996=institution=Max-Planck Institut=number=027=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Reinert; Knut + Lenhof; Hans-Peter + Muntzel; Petra + Mehlhorn; Kurt + Kececioglu; John D.=title=A Branch-and-Cut Algorithm for Multiple Sequence Alignment=year=1996=institution=Max-Planck Institut=number=028=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Bradford; Philip G. + Reinert; Knut=title=Lower Bounds for Row Minima Searching=year=1996=institution=Max-Planck Institut=number=029=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Yang; Wei-Chi + Wang; Dongming + Chu; Sung-Chi + Fitz-Gerald; Gary=title=Proceedings of the Fourth Asian Technology Conference in Mathematics=year=1999=publisher=ATCM=owner=2=reftype=1=source=8
=ADD==author=Jacquemard; Florent + Meyer; Christoph + Weidenbach; Christoph=title=Unification in Extensions of Shallow Equational Theories=year=1998=institution=Max-Planck Institut=number=002=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Charatonik; Witold=title=Automata on DAG Representations of Finite Trees=year=1999=institution=Max-Planck Institut=number=001=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Klau; Gunnar W. + Mutzel; Petra=title=Optimal Compaction of Orthogonal Grid Drawings=year=1998=institution=Max-Planck Institut=number=031=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Broennimann; Herve + Kettner; Lutz + Schirra; Stefan + Veltkamp; Remco=title=Application of the Generic Programming Paradigm in the Design of CGAL=year=1998=institution=Max-Planck Institut=number=030=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Mutzel; Petra + Weiskircher; Rene=title=Optimizing Over All Combinatorial Embeddings of a Planar Graph=year=1998=institution=Max-Planck Institut=number=029=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Crauser; Andreas + Ferragina; Paolo=title=Research Report: A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory=year=1999=institution=Max-Planck Institut=number=001=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Waldmann; Uwe=title=Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups=year=1999=institution=Max-Planck Institut=number=003=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Christoph; Thomas + Juenger; Michael + Kececioglu; John + Mutzel; Petra + Reinelt; Gerhard=title=A branch-and-cut approach to physical mapping with end-probes=year=1996=institution=Max-Planck Institut=number=027=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Reinert; Knut + Lenhof; Hans-Peter + Muntzel; Petra + Mehlhorn; Kurt + Kececioglu; John D.=title=A Branch-and-Cut Algorithm for Multiple Sequence Alignment=year=1996=institution=Max-Planck Institut=number=028=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Bradford; Philip G. + Reinert; Knut=title=Lower Bounds for Row Minima Searching=year=1996=institution=Max-Planck Institut=number=029=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Vorobyov; Sergej=title=On the Decision Complexity of the Bounded Theories of Trees=year=1996=institution=Max-Planck Institut=number=008=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Gasieniec; Leszek + Jansson; Jesper + Lingas; Andrzej + Oestlin; Anna=title=On the complexity of computing evolutionary trees=year=1996=institution=Max-Planck Institut=number=031=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Gasieniec; Leszek + Indyk; Piotr + Krysta; Piotr=title=External Inverse Pattern Matching=year=1996=institution=Max-Planck Institut=number=030=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Juurlink; Ben H.H. + Rao; P.S. + Sibeyn; Jop F.=title=Gossiping on Meshes and Tori=year=1996=institution=Max-Planck Institut=number=018=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Finkler; Ulrich + Mehlhorn; Kurt=title=Runtime Prediction of Real Programs on Real Mashines=year=1996=institution=Max-Planck Institut=number=032=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Sibeyn; Jop F. + Kaufmann; Michael=title=BSP-Like External-Memory Computation=year=1997=institution=Max-Planck Institut=number=001=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Garg; Naveen=title=Approximating Sparsest Cuts=year=1997=institution=Max-Planck Institut=number=002=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Basin; David + Matthews; Sean + Vigano; Luca=title=Labelled Modal Logics: Quantifiers=year=1997=institution=Max-Planck Institut=number=001=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Wang; Yaoguang=title=Bicriteria Job Sequencing with Release Dates=year=1997=institution=Max-Planck Institut=number=005=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Lenhof; Hans Peter=title=New Contact Measures for the Protein Docking Problem=year=1997=institution=Max-Planck Institut=number=004=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Jung; Bernd + Lenhof; Hans Peter + Mueller; Peter + Rueb; Christine=title=Parallel Algorithms for MD-Simulations of Syntetic Polymers=year=1997=institution=Max-Planck Institut=number=003=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Cunningham; William H. + Wang; Yaoguang=title=Resticted 2-Factor Polytopes=year=1997=institution=Max-Planck Institut=number=006=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Hustadt; Ullrich and Schmidt; Renate A.=title=On evaluating decision procedures for modal logic=year=1997=institution=Max-Planck Institut=number=003=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Schmidt; Renate A.=title=Resulution is a Decision Procedure for Many Propositional Modal Logics=year=1997=institution=Max-Planck Institut=number=002=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Crauser; A. + Mehlhorn; K. + Althaus; E. + Brengel; K. + Buchheit; T. + Keller; J. + Krone; H. + Lambert; O. + Schulte; R. + Thiel; S. + Westphal; M. + Wirth; R.=title=Research Report: On the performance of LEDA-SM=year=1998=institution=Max-Planck Institut=number=028=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Burnikel; Christoph=title=Delaunay Graphs by Divide and Conquer=year=1998=institution=Max-Planck Institut=number=027=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Jansen; Klaus + Porkolab; Lorant=title=Improved Approximation Schemes for Scheduling Unrelated Parallel Machines=year=1998=institution=Max-Planck Institut=number=026=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Jansen; Klaus + Porkolab; Lorant=title=Linear-time Approximation Schemes for Scheduling Malleable Parallel Tasks=year=1998=institution=Max-Planck Institut=number=025=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Burkhardt; Stefan + Crauser; Andreas + Ferragina; Paolo + Lenhof; Hans Peter + Rivals; Eric + Vingron; Martin=title=q-gram Based Database Searching Using a Suffix Array (QUASAR)=year=1998=institution=Max-Planck Institut=number=024=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Burnikel; Christoph=title=Rational Points on Circles=year=1998=institution=Max-Planck Institut=number=023=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Burnikel; Christoph + Ziegler; Joachim=title=Fast Recursive Division=year=1998=institution=Max-Planck Institut=number=022=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Eisenbrand; Friedrich=title=A Note on the Membership Problem for the First Elementary Closure of a Polyhedron=year=1998=institution=Max-Planck Institut=number=028=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Blackburn; Patrick + Tzakova; Miroslava=title=Hybridising Concept Languages=year=1998=institution=Max-Planck Institut=number=017=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Gurevich; Yuri + Veanes; Margus=title=Partisan Corroboration, and Shifted Pairing=year=1998=institution=Max-Planck Institut=number=014=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Ganzinger; Harald + Jacquemard; Florent + Veanes; Marcus=title=Rigid Reachability=year=1998=institution=Max-Planck Institut=number=013=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Hagerup; Torben=title=Datenstrukturen und Algorithmen=year=1997=institution=Max-Planck Institut=number=013=month=07=location=2=owner=2=reftype=11=source=3
=ADD==author=Althaus; Ernst + Mehlhorn; Kurt=title=Maximum Network Flow with Floating Point Arithmetic=year=1997=institution=Max-Planck Institut=number=022=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Alberts; David + Gutwenger; Carsten + Mutzel; Petra + Naeher; Stefan=title=AGD-Library: A Library of Algorithms for Graph Drawing=year=1997=institution=Max-Planck Institut=number=019=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Bockmayer; Alexander; + Kasper; Thomas=title=A Unifying Framework for Integer and Finite Domain Constraint Programming=year=1997=institution=Max-Planck Institut=number=008=month=08=location=2=owner=2=reftype=11=source=3
=ADD==author=Thorup; Mikkel=title=Faster deterministic sorting and priority queues in linear space=year=1997=institution=Max-Planck Institut=number=016=month=07=location=2=owner=2=reftype=11=source=3
=ADD==author=Sibeyn; Jop F.=title=From Parallel to External List Ranking=year=1997=institution=Max-Planck Institut=number=021=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Stolting Brodal; Gert=title=Finger Search Trees with Constant Insertion Time=year=1997=institution=Max-Planck Institut=number=020=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Fleischer; Rudolf=title=On the Bahncard Problem=year=1997=institution=Max-Planck Institut=number=018=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Bockmayer; Alexander + Eisenbrand; Friedrich=title=On the Chvatal Rank of Polytopes in the 0/1 Cube=year=1997=institution=Max-Planck Institut=number=009=month=09=location=2=owner=2=reftype=11=source=3
=ADD==author=Leonardi; Stefano + Marchetti-Spaccamela; Alberto + Presciutti; Alessio + Rosen; Adi=title=On-line Randomized Call Control Revisited=year=1997=institution=Max-Planck Institut=number=023=month=10=location=2=owner=2=reftype=11=source=3
=ADD==author=Bachmair; Leo + Ganzinger; Harald + Voronkov; Andrei=title=Elimination of Equality via Transformation with Ordening Constraints=year=1997=institution=Max-Planck Institut=number=012=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Bachmair; Leo + Ganzinger; Harald=title=Strict Basic Superposition and Chaining=year=1997=institution=Max-Planck Institut=number=011=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Vorobyov; Sergej + Voronkov; Andrei=title=Complexity of Nonrecursive Logic Programs with Complex Values=year=1997=institution=Max-Planck Institut=number=010=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Fiat; Amos + Leonardi; Stefano=title=On-line Network Routing - A survey=year=1997=institution=Max-Planck Institut=number=026=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Garg; Naveen + Konjevod; Goran + Ravi; R.=title=A polylogarithmic approximation algorithm for the group Steiner tree problem=year=1997=institution=Max-Planck Institut=number=027=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Albers; Susanne + Garg; Naveen + Leonardi; Stefano=title=Minimizing Stall Time in Single and Parallel Disk Systems=year=1997=institution=Max-Planck Institut=number=024=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Garg; Naveen + Koenemann; Jochan=title=Faster and Simpler Algorithm for Multicommodity Flow and other Fractional Packing Problems=year=1997=institution=Max-Planck Institut=number=025=month=11=location=2=owner=2=reftype=11=source=3
=ADD==author=Lermen; Martin + Reinert; Kurt=title=The Practical Use of the { A^* } Algorithm for Exact Multiple Sequence Alignment=year=1997=institution=Max-Planck Institut=number=028=month=12=location=2=owner=2=reftype=11=source=3
=ADD==author=Hagerup; Torben=title=Simpler and Faster Static {$AC^o$}  Dictionaries=year=1998=institution=Max-Planck Institut=number=001=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Stolting Brodal; Gerth + Pinotti; M. Christina=title=Comparator Networks for Binary Heap Construction=year=1998=institution=Max-Planck Institut=number=002=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Schirra; Stefan=title=Parameterized Implementations of Classical Planar Convex Hull Algoriths and Externe Point Computations=year=1998=institution=Max-Planck Institut=number=003=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Schirra; Stefan=title=Robustness and Precision Issues in Geometric Computation=year=1998=institution=Max-Planck Institut=number=004=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Jansen; Klaus=title=The mutual exclusion scheduling problem for permutation and comparability graphs=year=1998=institution=Max-Planck Institut=number=005=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Jansen; Klaus=title=A new characterization for parity graphs and a coloring problem with costs=year=1998=institution=Max-Planck Institut=number=006=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Blackburn; Patrick + Tzakova; Miroslava=title=Hybrid Languages and Temporal Logic=year=1998=institution=Max-Planck Institut=number=006=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Fabri; Andreas + Gieseman; Geert-Jan + Kettner; Lutz + Schirra; Stefan + Schoenherr; Sven=title=On the Design of CGAL, the Computational Geometry Algorithms Library=year=1998=institution=Max-Planck Institut=number=007=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Vorobyov; Sergej=title=Satisfiability of Functional+Record Subtype Constraints is NP-Hard=year=1998=institution=Max-Planck Institut=number=004=month=01=location=2=owner=2=reftype=11=source=3
=ADD==author=Juergen; Michael + Leipert; Sebastian + Mutzel; Petra=title=A Note on Computing a Maximal Planar Subgraph using {PQ}- Trees=year=1998=institution=Max-Planck Institut=number=008=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Frigioni; Daniele + Marchetti-Spaccamela; Alberto + Nanni; Umberto=title=Fully Dynamic Shortest Paths and Negative Cycle Detection on Digraphs with Arbitrary Arc Weights=year=1998=institution=Max-Planck Institut=number=009=month=03=location=2=owner=2=reftype=11=source=3
=ADD==author=Solis-Oba; Roberto=title=2-Approximation Algorithm for Finding a Spanning Tree With Maximum Number of Leaves=year=1998=institution=Max-Planck Institut=number=010=month=04=location=2=owner=2=reftype=11=source=3
=ADD==author=Schmidt; Renate A.=title={E}-Unification for Subsystems of {S4}=year=1998=institution=Max-Planck Institut=number=003=month=04=location=2=owner=2=reftype=11=source=3
=ADD==author=Veanes; Margus=title=The Relation Between Second-Order Unification and Simultaneous Rigid {E}-Unification=year=1998=institution=Max-Planck Institut=number=005=month=02=location=2=owner=2=reftype=11=source=3
=ADD==author=Vorobyov; Sergei=title=The Most Nonelementary Theory (A Direct Lower Bound Proof)=year=1998=institution=Max-Planck Institut=number=007=month=04=location=2=owner=2=reftype=11=source=3
=ADD==author=Becker; T. + Weispfenning; V. + Kreidel; H.=title=Groebner Bases. A Computational Approach to Commutative Algebra=note=copy 1=publisher=Springer-Verlag=year=1993=location=2=owner=2=source=3=reftype=1
=ADD==author=Becker; T. + Weispfenning; V. + Kreidel; H.=title=Groebner Bases. A Computational Approach to Commutative Algebra=note=copy 2=publisher=Springer-Verlag=year=1993=location=2=owner=2=source=3=reftype=1
=ADD==author=Becker; T. + Weispfenning; V. + Kreidel; H.=title=Groebner Bases. A Computational Approach to Commutative Algebra=note=copy 3; Uni inventory 13019=publisher=Springer-Verlag=year=1993=location=2=owner=3=source=3=reftype=1
=ADD==author=Wu; Wen-Tsuen=title=Mechanical theorem proving in geometries=year=1994=publisher=Springer=location=2=owner=2=source=3=reftype=1
=ADD==author=Tucker; Allen B. + Bernat; Andrew P. + Bradley; W.James + Cupper; Robert D. + Scragg; Greg W.=title=Fundamentals of Computing I=year=1995=publisher=McGraw-Hill=series=Fundamentals of Computing and Programming=owner=3=note=Uni inventory 14732=reftype=1=source=3
=ADD==author=Lang; Serge=title=Introduction to Linear Algebra=year=1986=publisher=Springer=series=Undergraduate Texts in Mathematics=owner=3=note=Uni inventory 14724=reftype=1=source=3
=ADD==author=Geddes; Keith O. + Czapor; Stephen R. + Labahn; George=title=Algorithms for Computer Algebra=year=1992=publisher=Kluwer Academic Publishers=owner=3=note=Uni inventory 14723=reftype=1=source=3
=ADD==author=Tucker; Allen B. + Cupper; Robert D. + Bradley; W.James + Epstein; Richard G. + Kelemen; Chares F.=title=Fundamentals of Computing II=year=1995=publisher=McGraw-Hill=series=Fundamentals of Computing and Programming=owner=3=note=Uni inventory 14733=reftype=1=source=3
=ADD==author=Arbarello; E. + Cornalba; M. + Griffiths; P.A. + Harris; J.=title=Geometry of Algebraic Curves   Volume I=year=1985=publisher=Springer=series=Grundlehren der mathematischen Wissenschaften=owner=3=note=Uni inventory 14729=reftype=1=source=3
=ADD==author=van der Waerden; B.L.=title=Algebra  Volume II=year=1991=publisher=Springer=owner=3=note=Uni inventory 14731=reftype=1=source=3
=ADD==author=Zariski; Oskar + Samuel; Pierre=title=Commutative AlgebraVolume I=year=1958=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14727=reftype=1=source=3
=ADD==author=Zariski; Oscar + Samuel; Pierre=title=Commutative AlgebraVolume II=year=1960=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14728=reftype=1=source=3
=ADD==author=Jacobson; Nathan=title=Basic Algebra I=year=1985=publisher=Freeman and Company=owner=3=note=Uni inventory 14725=reftype=1=source=3
=ADD==author=Jacobson; Nathan=title=Basic Algebra II=year=1989=publisher=Freeman and Company=owner=3=note=Uni inventory 14726=reftype=1=source=3
=ADD==author=Bosma; Wieb + van der Poorten; Alf=title=Computational Algebra and Number Theory=year=1995=publisher=Kluwer Academic Publishers=series=Mathematics and Its Applications=owner=3=note=Uni inventory 14769=reftype=1=source=3
=ADD==author=Piacentini Cattaneo; G.M. + Strickland; E.=title=Topics in Computational Algebra=year=1990=publisher=Kluwer Academic Publishers=owner=3=note=Uni inventory 14761=reftype=1=source=3
=ADD==author=Kumar; Vipin + Grama; Anath + Gupta; Anshul + Karypis; George=title=Introduction to Parallel ComputingDesign and Analysis of Algorithms=year=1994=publisher=The Benjamin/Cummings Publishing Company=owner=3=note=Uni inventory 14696=reftype=1=source=3
=ADD==author=van der Waerden; B.L.=title=AlgebraVolume I=year=1991=publisher=Springer=owner=3=note=Uni inventory 14730=reftype=1=source=3
=ADD==author=Serre; Jean-Pierre=title=Algebraic Groups and Class Fields=year=1988=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14707=reftype=1=source=3
=ADD==author=Cohen; Henri=title=A Course in Computational Algebraic Number Theory=year=1993=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14718=reftype=1=source=3
=ADD==author=Cox; David + Little; John + O'Shea; Donal=title=Using Algebraic Geometry=year=1998=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14715=reftype=1=source=3
=ADD==author=Hartshorne; Robin=title=Algebraic Geometry=year=1977=publisher=Springer=series=Graduate Texts in Mathematics=owner=3=note=Uni inventory 14712=reftype=1=source=3
=ADD==author=Adams; William W. + Loustaunau; Phlippe=title=An Introduction to Groebner Bases=year=1994=publisher=American Mathematical Society=series=Graduate Studies in MathematicsVolume 3=owner=3=note=Uni inventory 14710=reftype=1=source=3
=ADD==author=Adams; William W. + Loustauanu; Philippe=title=An Introduction to Groebner Bases=year=1994=publisher=American Mathematical Society=series=Graduate Studies in MathematicsVolume 3=owner=3=note=Uni inventory 14711=reftype=1=source=3
=ADD==author=Cox; David + Little; John + O'Shea; Donal=title=Ideals, Varieties, and Algorythms=year=1997=publisher=Springer=series=Undergraduate Texts in Mathematics=owner=3=note=Uni inventory 14757=reftype=1=source=3
=ADD==author=Cox; David + Little; John + O'Shea; Donal=title=Ideals, Varieties, and Algorithms=year=1997=publisher=Springer=series=Undergraduate Texts in Mathematics=owner=3=note=Uni inventory 14706=reftype=1=source=3
=ADD==author=Lidl; Rudolf + Pilz; Guenter=title=Applied Abstract Algebra=year=1998=publisher=Springer=series=Undergraduate Texts in Mathematics=owner=3=note=Uni inventory 14716=reftype=1=source=3
=ADD==author=Mishra; Bhubaneswar=title=Algorythmic Algebra=year=1993=publisher=Springer=series=Texts and Monographs in Computer Science=owner=3=note=Uni inventory 14713=reftype=1=source=3
=ADD==author=Mishra; Bhubaneswar=title=Algorythmic Algebra=year=1993=publisher=Springer=series=Texts and Monographs in Computer Science=owner=3=note=Uni inventory 14714=reftype=1=source=3
=ADD==author=Ganzha; V.G. + Mayer; E.W. + Vorozhtsov; E.V.=title=Computer Algebra in Scientific ComputingCASC'99=year=1999=publisher=Springer=owner=3=note=Uni inventory 14800=reftype=1=source=3
=ADD==author=Vasconcelos; Wolmer V.=title=Computational Methods in Commutative Algebra and Algebraic Geometry=year=1998=publisher=Springer=series=Algorithms and Computation in Mathematics=owner=3=note=Uni inventory 14717=reftype=1=source=3
=ADD==author=Akritas; Alkividias G.=title=Elements of Computer Algebra with Applications=year=1989=publisher=John Wile & Sons=owner=3=note=Uni inventory 14697=reftype=1=source=3
=ADD==author=Lidl; Rudolf + Niederreiter; Harald=title=Introduction to finite fields and their applications=year=1994=publisher=Cambridge University Press=owner=3=note=Uni inventory 14720=reftype=1=source=3
=ADD==author=Orzech; Grace + Orzech; Morris=title=Plane Algebraic Curves=year=1981=publisher=Marcel Dekker,Inc=series=Monographs and textbooks in pure and applied mathematics=owner=3=note=Uni inventory 14721=reftype=1=source=3
=ADD==author=Sima; Dezsoe + Fountain; Terence + Kacsuk; Peter=title=Advenced Computer ArchitecturesA Design Space Approach=year=1997=publisher=Addison-Wesley=series=International Computer Science Series=owner=3=note=Uni inventory 14722=reftype=1=source=3
=ADD==author=Mitchell; John=title=Foundations for Programming Languages=year=1996=publisher=The MIT Press=series=Foundations of Computing=owner=3=note=Uni inventory 14695=reftype=1=source=3
=ADD==author=Moreno; Carlos J.=title=Algebraic Curves over Finite Fields=year=1991=publisher=Cambridge University Press=series=Cambridge Tracts in Mathematics=owner=3=note=Uni inventory 14699=reftype=1=source=3
=ADD==author=Kirwan; Frances=title=Complex Algebraic Curves=year=1992=publisher=Cambridge University Press=series=London Mathematical Society Student Texts 23=owner=3=note=Uni inventory 14700=reftype=1=source=3
=ADD==author=Bruce; J.W. + Giblin; P.J.=title=Curves and Singularities=year=1992=publisher=Cambridge University Press=owner=3=note=Uni inventory 14701=reftype=1=source=3
=ADD==author=Marar; W.L.=title=Real and complex singularities=year=1995=publisher=Longman=series=Pitman Research Notes in Mathematics=owner=3=note=Uni inventory 14705=reftype=1=source=3
=ADD==author=Benedetti; Riccardo + Risler; Jean-Jacques=title=Real algebraic and semi-algebraic sets=year=1990=publisher=Hermann=series=Actualites Mathematiques=owner=3=note=Uni inventory 14708=reftype=1=source=3
=ADD==author=Grossman; Robert=title=Symbolic ComputationApplications to Scientific Computing=year=1989=publisher=Society for Industrial and Applied Mathematics=series=Frontiers in Applied Mathematics=owner=3=note=Uni inventory 14703=reftype=1=source=3
=ADD==author=Hartley; Stephen=title=Concurrent ProgrammingThe JAVA Programming Language=year=1998=publisher=Oxford University Press=owner=3=note=Uni inventory 14704=reftype=1=source=3
=ADD==author=Rosenberg; Alexander L.=title=Noncommutative Algebraic Geometry and Representations of Quantized Algebras=year=1995=publisher=Kluwer Academic Publishers=series=Mathematics and Its Applications=owner=3=note=Uni inventory 14719=reftype=1=source=3
=ADD==author=Gunter; Carl A.=title=Semantics of Programming LanguagesStructures and Techniques=year=1992=publisher=The MIT Press=series=Foundations of Computing=owner=3=note=Uni inventory 14698=reftype=1=source=3
=ADD==author=Tel; Gerard=title=Introduction to Distributed Algorithms=year=1994=publisher=Cambridge University Press=owner=3=note=Uni inventory 14709=reftype=1=source=3
=ADD==author=Friedman; Daniel + Wand; Mitchell + Haynes; Christopher T.=title=Essentials of Programming Languages=year=1992=publisher=The MIT Press=owner=3=note=Uni inventory 14702=reftype=1=source=3
=ADD==author=named; not=title=COmputational COmmutative Algebra (COCOA VI)Abstracts of the talks and posters=note=Villa Gualino, Torino, Italy, June 3 - 5, 1999=year=1999=publisher=not mentioned=owner=2=reftype=1=source=3
=ADD==author=Vorobyov; Sergei=title={$\forall\exists^*$}-Equational Theory of Context Unification is {$\Pi^0_1}-Hard=year=1998=institution=Max-Planck Institut=number=008=month=04=location=2=owner=2=reftype=11=source=3