Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="M{\"u}ller-Quade, J{\"o}rn"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing restrictions of ideals in finitely generated
k
-algebras by means of Buchberger's algorithm
Thomas Beth
,
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
41
(3-4), 2006, pp. 372-380
Gröbner bases applied to finitely generated field extensions
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
30
(4), 2000, pp. 469-490
Decomposing a matrix into circulant and diagonal factors
Michael Schmid
,
Rainer Steinwandt
,
Jörn Müller-Quade
,
Martin Rötteler
,
Thomas Beth
Linear Algebra and its Applications
306
, 2000, pp. 131-143
Calculating generators for invariant fields of linear algebraic groups
Jörn Müller-Quade
,
Thomas Beth
Lecture Notes in Computer Science
1719
, 1999, pp. 392-403
Basic algorithms for rational function fields
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
27
(2), 1999, pp. 143-170
Deciding linear disjointness of finitely generated fields
Jörn Müller-Quade
,
Martin Rötteler
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC'98 (University of Rostock, Germany, August 13-15, 1998)
, 1998, pp. 153-160
An application of Gröbner bases to the decomposition of rational mappings
Jörn Müller-Quade
,
Rainer Steinwandt
,
Thomas Beth
London Mathematical Society Lecture Note Series
251
, 1998, pp. 448-462