Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413 Most geometric algorithms are idealistic in the sense that they are designed for the Real-RAM model...
An Algorithm for Permuting Variables of Recursively Represented Polynomials (2008)
Abstract. A straightforward way to represent multivariate polynomial in software is to implement them recursively as univariate polynomials over a polynomial ring. This is especially common in an...
An object oriented concept for elliptic curves (2007)
We describe objects and methods for an object oriented concept of elliptic curves. In order to achieve this, the representation of elliptic curves in the computer algebra systems LiDIA and SIMATH is...
Vertical microbial transmission in Caribbean bacteriosponges (2007)
Bakterienhaltige Schwämme sind durch große Mengen an morphologisch und phylogenetisch unterschiedlichen Mikroorganismen im Mesohyl gekennzeichnet. Diese mikrobiellen Konsortien sind permanent,...
Algebraic Issues in Computational Geometry (2007)
Mourrain, Bernard, Pion, Sylvain, Schmitt, Susanne, Técourt, Jean-Pierre, Tsigaridas, Elias, Wolpert, Nicola
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients (2006)
Mehlhorn, Kurt, Eigenwillig, Arno, Kettner, Lutz, Krandick, Werner, Schmitt, Susanne, Wolpert, Nicola
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In...
Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt
controlled perturbation, floating
Exacus: Efficient and exact algorithms for curves and surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Abstract. We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness,...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Kr, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
Abstract. The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite)...
Exacus: Efficient and exact algorithms for curves and surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Abstract. We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness,...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Kr, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
Abstract. The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite)...
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces (2005)
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
We present the first release of the EXACUS C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of...
A Descartes Algorithm for Polynomials with Bit-Stream Coefficients (2005)
Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In...
Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, ...
Project funded by the European Community under the “Information Society Technologies” Programme (1998–2002)
The diamond operator - Implementation of exact real algebraic numbers (2005)
Schmitt, Susanne, Ganzha, Victor G., Mayr, Ernst W., Vorozhtsov, Evgenii V.
The LEDA number type real is extended by the diamond operator, which allows to compute exactly with real algebraic numbers given as roots of polynomials. The coefficients of these polynomials can be...
Controlled Perturbation for Delaunay Triangulations (2005)
Funke, Stefan, Klein, Christian, Mehlhorn, Kurt, Schmitt, Susanne
Most geometric algorithms are idealistic in the sense that they are designed for the Real-RAM model of computation and for inputs in general position. Real inputs may be degenerate and floating point...
A Descartes algorithm for polynomials with bit-stream coefficients (2005)
Eigenwillig, Arno, Kettner, Lutz, Krandick, Werner, Mehlhorn, Kurt, Schmitt, Susanne, Wolpert, Nicola, ...
EXACUS: Efficient and exact algorithms for curves and surfaces (2005)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, ...
We present the first open-source release of the C\texttt{++} libraries of the \textsc{Exacus} project of the Max-Planck-Institut f{\"u}r Informatik. Our software computes arrangements of curves and...
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich,Eric, Eigenwillig,Arno, Hemmer,Michael, Hert,Susan, Kettner,Lutz, Mehlhorn,Kurt, ...
The LEDA class real number - extended version (2004)
Funke,Stefan, Mehlhorn,Kurt, Schmitt,Susanne, Burnikel,Christoph, Fleischer,Rudolf, Schirra,Stefan
EXACUS : Efficient and Exact Algorithms for Curves and Surfaces (2004)
Berberich, Eric, Eigenwillig, Arno, Hemmer, Michael, Hert, Susan, Kettner, Lutz, Mehlhorn, Kurt, ...
The LEDA class real number - extended version (2004)
Funke, Stefan, Mehlhorn, Kurt, Schmitt, Susanne, Burnikel, Christoph, Fleischer, Rudolf, Schirra, Stefan
Elliptic Curves : A Computational Approach (2003)
Schmitt,Susanne, Zimmer,Horst G.
The purpose of the present text is to give an elementary introduction to the arithmetic of elliptic curves over number fields from a computational point of view. This branch of number theory is...
Elliptic Curves : A Computational Approach (2003)
Schmitt, Susanne, Zimmer, Horst G.
The purpose of the present text is to give an elementary introduction to the arithmetic of elliptic curves over number fields from a computational point of view. This branch of number theory is...
Elliptic Curves: A Computational Approach (2003)
The basics of the theory of elliptic curves should be known to everybody, be he (or she) a mathematician or a computer scientist. Especially everybody concerned with cryptography should know the...
A separation bound for real algebraic expressions (2001)
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for integral k, and taking...
A Separation Bound for Real Algebraic Expressions (2001)
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for integral k, and taking...
A separation bound for real algebraic expressions (2001)
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for integral k, and taking...
A Separation Bound for Real Algebraic Expressions (2001)
Burnikel, Christoph, Funke, Stefan, Mehlhorn, Kurt, Schirra, Stefan, Schmitt, Susanne
Bestimmung der Mordell-Weil Gruppe elliptischer Kurven über algebraischen Zahlkörpern / (1999)
Saarbrücken, Universiẗat, Diss., 1999.
Inhalt, verfassungsrechtliche Stellung und Bedeutungsgehalt der kommunalen Finanzhoheit / (1996)
Zugl.: Würzburg, Universiẗat, Diss., 1995.
Mikrofiche-Ausg.: 1 Mikrofiche : 24x
Schmitt, Susanne, Weisz, Jeremy B., Lindquist, Niels, Hentschel, Ute
Many marine demosponges contain large amounts of phylogenetically complex yet highly sponge-specific microbial consortia within the mesohyl matrix, but little is known about how these microorganisms...
Schmitt, Susanne, Angermeier, Hilde, Schiller, Roswitha, Lindquist, Niels, Hentschel, Ute
Many marine sponges, hereafter termed high-microbial-abundance (HMA) sponges, harbor large and complex microbial consortia, including bacteria and archaea, within their mesohyl matrices. To...