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=6244

• Construction of irreducible polynomials over finite fields
  Sergey Abrahamyan
  Lecture Notes in Computer Science 6244, 2010, pp. 1-3
• Factorization of polynomials and GCD computations for finding universal denominators
  S.A. Abramov, A. Gheffar, D.E. Khmelnov
  Lecture Notes in Computer Science 6244, 2010, pp. 4-18
• A role of symbolic computations in beam physics
  Serge N. Andrianov
  Lecture Notes in Computer Science 6244, 2010, pp. 19-30
• Thomas decomposition of algebraic and differential systems
  Thomas Bächler, Vladimir Gerdt, Markus Lange-Hegermann, Daniel Robertz
  Lecture Notes in Computer Science 6244, 2010, pp. 31-54
• On multivariate homogeneous polynomial decomposition
  Paula Bustillo, Jaime Gutierrez
  Lecture Notes in Computer Science 6244, 2010, pp. 55-60
• Computing matrix representations of filiform Lie algebras
  Manuel Ceballos, Juan Núñez, Ángel F. Tenorio
  Lecture Notes in Computer Science 6244, 2010, pp. 61-72
• Type specialization in Aldor
  Laurentiu Dragan, Stephen M. Watt
  Lecture Notes in Computer Science 6244, 2010, pp. 73-84
• An algebraic implicitization and specialization of minimum KL-divergence models
  Ambedkar Dukkipati, Joel George Manathara
  Lecture Notes in Computer Science 6244, 2010, pp. 85-96
• On sufficient conditions for integrability of a planar system of ODEs near a degenerate stationary point
  Victor Edneral, Valery G. Romanovski
  Lecture Notes in Computer Science 6244, 2010, pp. 97-105
• Symbolic-numeric algorithms for computer analysis of spheroidal quantum dot models
  A.A. Gusev, O. Chuluunbaatar, V.P. Gerdt, V.A. Rostovtsev, S.I. Vinitsky, V.L. Derbov, V.V. Serov
  Lecture Notes in Computer Science 6244, 2010, pp. 106-122
• On reduction of Lagrange systems
  Valentin Irtegov, Tatyana Titorenko
  Lecture Notes in Computer Science 6244, 2010, pp. 123-133
• Series transformations to improve and extend convergence
  G.A. Kalugin, D.J. Jeffrey
  Lecture Notes in Computer Science 6244, 2010, pp. 134-147
• Differential resultant, computer algebra and completely integrable dynamical systems
  Zoia Kostova, Nikolay Kostov, Vladimir Gerdjikov
  Lecture Notes in Computer Science 6244, 2010, pp. 148-161
• Generic, type-safe and object oriented computer algebra software
  Heinz Kredel, Raphael Jolly
  Lecture Notes in Computer Science 6244, 2010, pp. 162-177
• Implementing data parallel rational multiple-residue arithmetic in Eden
  Oleg Lobachev, Rita Loogen
  Lecture Notes in Computer Science 6244, 2010, pp. 178-193
• Fast generalized Bruhat decomposition
  Gennadi Malaschonok
  Lecture Notes in Computer Science 6244, 2010, pp. 194-202
• Computational science in Armenia (invited talk)
  H. Marandjian, Yu. Shoukourian
  Lecture Notes in Computer Science 6244, 2010, pp. 203-203
• From Petri nets to polynomials: Modeling, algorithms, and complexity (abstract) (invited talk)
  Ernst W. Mayr
  Lecture Notes in Computer Science 6244, 2010, pp. 204-204
• Supporting global numerical optimization of rational functions by generic symbolic convexity tests
  Winfried Neun, Thomas Sturm, Stefan Vigerske
  Lecture Notes in Computer Science 6244, 2010, pp. 205-219
• Term cancellations in computing floating-point Gröbner bases
  Tateaki Sasaki, Fujio Kako
  Lecture Notes in Computer Science 6244, 2010, pp. 220-231
• One class of third-order linear ODE's
  S.Yu. Slavyanov
  Lecture Notes in Computer Science 6244, 2010, pp. 232-237
• GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
  Akira Terui
  Lecture Notes in Computer Science 6244, 2010, pp. 238-249
• Derivation of explicit difference schemes for ordinary differential equations with the aid of Lagrange-Burmann expansions
  Evgenii V. Vorozhtsov
  Lecture Notes in Computer Science 6244, 2010, pp. 250-266
• Parametric qualitative analysis of ordinary differential equations: Computer algebra methods for excluding oscillations (invited talk)
  Andreas Weber, Thomas Sturm, Werner M. Seiler, Essam O. Abdel-Rahman
  Lecture Notes in Computer Science 6244, 2010, pp. 267-279
• An analytical model for the probability characteristics of a crack hitting an encapsulated self-healing agent in concrete
  Serguey V. Zemskov, Henk M. Jonkers, Fred J. Vermolen
  Lecture Notes in Computer Science 6244, 2010, pp. 280-292