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

• Non simple tournaments: Theoretical properties and a polynomial algorithm
  A. Astie-Vidal, A. Matteo
  Lecture Notes in Computer Science 356, 1989, pp. 1-15
• Covering radius for codes obtained from T(m) triangular graphs
  J.M. Basart, J. Rifà
  Lecture Notes in Computer Science 356, 1989, pp. 16-24
• Searching for weakly autocorrelated binary sequences
  Michel Bauderon, François Laubie
  Lecture Notes in Computer Science 356, 1989, pp. 25-34
• On the prefixes of a random trace and the membership problem for context-free trace languages
  Alberto Bertoni, Massimiliano Goldwurm
  Lecture Notes in Computer Science 356, 1989, pp. 35-59
• On decoding binary quadratic residue codes
  Martin Bossert
  Lecture Notes in Computer Science 356, 1989, pp. 60-68
• Pseudometrics associated with fuzzy relations having weak properties
  Pedro J. Burillo, León A. González
  Lecture Notes in Computer Science 356, 1989, pp. 69-74
• Towards an expert system for error correcting codes: SECC
  Jacques Calmet
  Lecture Notes in Computer Science 356, 1989, pp. 75-87
• An iterative Euclidean algorithm
  P. Camion
  Lecture Notes in Computer Science 356, 1989, pp. 88-128
• Gröbner bases and differential algebra
  Giuseppa Carrà Ferro
  Lecture Notes in Computer Science 356, 1989, pp. 129-140
• Gröbner bases and differential algebra
  Giuseppa Carrà Ferro
  Lecture Notes in Computer Science 356, 1989, pp. 129-140
• A procedure to prove geometrical statements
  Giuseppa Carrà Ferro, Giovanni Gallo
  Lecture Notes in Computer Science 356, 1989, pp. 141-150
• Some applications of a classification of affine-invariant codes
  Pascale Charpin
  Lecture Notes in Computer Science 356, 1989, pp. 151-160
• On the computation of the local and global analytic branches of a real algebraic curve
  F. Cucker, L.M. Pardo, M. Raimondo, T. Recio, M.F. Roy
  Lecture Notes in Computer Science 356, 1989, pp. 161-181
• Distribution of codewords and decoding error rate in RS codes with application to performance evaluation from optical disc
  Ding-jia Xin
  Lecture Notes in Computer Science 356, 1989, pp. 182-201
• On generalized minimum distance decoding
  Arne Dür
  Lecture Notes in Computer Science 356, 1989, pp. 202-215
• Newton symmetric functions and the arithmetic of algebraically closed fields
  Roberto Dvornicich, Carlo Traverso
  Lecture Notes in Computer Science 356, 1989, pp. 216-224
• Non linear covering codes: A few results and conjectures
  Gérard Cohen
  Lecture Notes in Computer Science 356, 1989, pp. 225-229
• Gröbner bases, Ritt's algorithm and decision procedures for algebraic theories
  Alfredo Ferro, Giovanni Gallo
  Lecture Notes in Computer Science 356, 1989, pp. 230-237
• An algebraic model for the storage of data in parallel momories
  M.A. Fiol, O. Serra
  Lecture Notes in Computer Science 356, 1989, pp. 238-246
• Algebraic solution of systems of polynomial equations using Gröbner bases
  Patrizia Gianni, Teo Mora
  Lecture Notes in Computer Science 356, 1989, pp. 247-257
• How to decide whether a polynomial ideal is primary or not
  M. Grieco, B. Zucchetti
  Lecture Notes in Computer Science 356, 1989, pp. 258-268
• On the computational complexity of polynomials and bilinear mappings - A survey
  Joos Heintz
  Lecture Notes in Computer Science 356, 1989, pp. 269-300
• Coding theory and its applications in Japan
  Hideki Imai, Tsutomu Matsumoto
  Lecture Notes in Computer Science 356, 1989, pp. 301-305
• Binary sequences with good correlation properties
  Helge Elbrond Jensen, Tom Hoholdt
  Lecture Notes in Computer Science 356, 1989, pp. 306-320
• Hankel matrices and polynomials
  Juan Llovet, Juan R. Sendra
  Lecture Notes in Computer Science 356, 1989, pp. 321-333