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 YEAR=1989

• On the complexity of computing class groups of algebraic number fields
  J. Buchmann, M. Pohst
  Lecture Notes in Computer Science 357, 1989, pp. 122-130
• Some remarks on the differential dimension
  Giuseppa Carrà Ferro
  Lecture Notes in Computer Science 357, 1989, pp. 152-163
• On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors
  G. Castagnoli
  Lecture Notes in Computer Science 357, 1989, pp. 164-168
• Big numbers p-adic arithmetic: A parallel approach
  Attilio Colagrossi, Carla Limongelli
  Lecture Notes in Computer Science 357, 1989, pp. 169-180
• Monomial ideals, group algebras and error correcting codes
  Vesselin Drensky, Piroska Lakatos
  Lecture Notes in Computer Science 357, 1989, pp. 181-188
• Fast integer multiplication by block recursive, number theoretical
  Ricardo Ferré
  Lecture Notes in Computer Science 357, 1989, pp. 189-200
• Lambda-Upsilon-Omega: An assistant algorithms analyzer
  Philippe Flajolet, Bruno Salvy, Paul Zimmermann
  Lecture Notes in Computer Science 357, 1989, pp. 201-212
• Global dimension of associative algebras
  Tatiana Gateva-Ivanova
  Lecture Notes in Computer Science 357, 1989, pp. 213-229
• Symmetry and duality in normal basis multiplication
  Willi Geiselmann, Dieter Gollmann
  Lecture Notes in Computer Science 357, 1989, pp. 230-238
• Multiple error correction with analog codes
  Werner Henkel
  Lecture Notes in Computer Science 357, 1989, pp. 239-249
• On the complexity of satisfiability problems for algebraic structures
  H.B. Hunt III, R.E. Stearns
  Lecture Notes in Computer Science 357, 1989, pp. 250-258
• Embedding flexible control strategies into object oriented languages
  Sabina Bonamico, Gianna Cioni
  Lecture Notes in Computer Science 357, 1989, pp. 454-457
• Majority decoding of large repetition codes for the r-ary symmetric channel
  Paul Camion
  Lecture Notes in Computer Science 357, 1989, pp. 458-466
• On binary codes of order 3
  B. Courteau, A. Montpetit
  Lecture Notes in Computer Science 357, 1989, pp. 467-470
• Polynomial decomposition algorithm of almost quadratic complexity
  J. Gutiérrez, T. Recio, C. Ruiz de Velesco
  Lecture Notes in Computer Science 357, 1989, pp. 471-475
• 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