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: Series=LNCS AND Volume=378

• An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal
  K.-P. Schemmel
  Lecture Notes in Computer Science 378, 1989, pp. 300-310
• Singularities of moduli spaces
  B. Martin, G. Pfister
  Lecture Notes in Computer Science 378, 1989, pp. 311-312
• Radical simplification using algebraic extension fields
  T.J. Smedley
  Lecture Notes in Computer Science 378, 1989, pp. 313-314
• Hermite normal forms for integer matrices
  R.J. Bradford
  Lecture Notes in Computer Science 378, 1989, pp. 315-316
• Mr.~Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices
  E. Kaltofen, M.S. Krishnamoorthy, B.D. Saunders
  Lecture Notes in Computer Science 378, 1989, pp. 317-322
• Fonctions symétriques et changements de bases
  A. Valibouze
  Lecture Notes in Computer Science 378, 1989, pp. 323-332
• Complexity of standard bases in projective dimension zero
  M. Giusti
  Lecture Notes in Computer Science 378, 1989, pp. 333-335
• Gröbner bases for polynomial ideals over commutative regular rings
  V. Weispfenning
  Lecture Notes in Computer Science 378, 1989, pp. 336-347
• Some algebraic algorithms based on head term elimination over polynomial rings
  T. Sasaki
  Lecture Notes in Computer Science 378, 1989, pp. 348-354
• Algorithmic determination of the Jacobson radical of monomial algebras
  T. Gateva-Ivanova
  Lecture Notes in Computer Science 378, 1989, pp. 355-364
• A recursive algorithm for computation of the Hilbert polynomial
  M.V. Kondratéva, E.V. Pankratév
  Lecture Notes in Computer Science 378, 1989, pp. 365-375
• An affine point of view on minima finding in integer lattices of lower dimensions
  B. Vallée
  Lecture Notes in Computer Science 378, 1989, pp. 376-378
• A combinatorial and logical approach to linear-time computability
  P. Scheffler, D. Seese
  Lecture Notes in Computer Science 378, 1989, pp. 379-380
• Complexity of computation of embedded resolution of algebraic curves
  J.P.G. Henry, M. Merle
  Lecture Notes in Computer Science 378, 1989, pp. 381-390
• Polynomial factorization: An exploration of Lenstra's algorithm
  J.A. Abbott, J.H. Davenport
  Lecture Notes in Computer Science 378, 1989, pp. 391-402
• A matrix-approach for proving inequalities
  A. Ferscha
  Lecture Notes in Computer Science 378, 1989, pp. 403-411
• Using automatic program synthesizer as a problem solver: Some interesting experiments
  P. Návrat, L̑. Molnár, V. Vojtek
  Lecture Notes in Computer Science 378, 1989, pp. 412-423
• Strong splitting rules in automated theorem proving
  M. Baaz, A. Leitsch
  Lecture Notes in Computer Science 378, 1989, pp. 424-425
• Towards a refined classification of geometric search and computation problems
  T. Fischer
  Lecture Notes in Computer Science 378, 1989, pp. 426-437
• Matrix-Padé fractions
  G. Labahn, S. Cabay
  Lecture Notes in Computer Science 378, 1989, pp. 438-449
• Computation of generalized Padé approximants
  G. Németh, M. Zimányi
  Lecture Notes in Computer Science 378, 1989, pp. 450-451
• A critical pair criterion for completion modulo a congruence
  L. Bachmair, N. Dershowitz
  Lecture Notes in Computer Science 378, 1989, pp. 452-453
• Shortest paths of a disc inside a polygonal region
  G. Werner
  Lecture Notes in Computer Science 378, 1989, pp. 454-455
• Rabin's width of a complete proof and the width of a semialgebraic set
  T. Recio, L.M. Pardo
  Lecture Notes in Computer Science 378, 1989, pp. 456-462
• Practical aspects of symbolic integration over Q(x)
  D.M. Gillies, B.W. Char
  Lecture Notes in Computer Science 378, 1989, pp. 463-464