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 [1]	Hilfe

Suche: Series=LNCS AND Volume=357

• The coding theory of finite geometries and designs
  E.F., Jr. Assmus
  Lecture Notes in Computer Science 357, 1989, pp. 1-6
• Recent results on covering problems
  J.H. van Lint
  Lecture Notes in Computer Science 357, 1989, pp. 7-21
• Codes and curves
  Jean Francis Michon
  Lecture Notes in Computer Science 357, 1989, pp. 22-30
• Computer and cummutative algebra
  Lorenzo Robbiano
  Lecture Notes in Computer Science 357, 1989, pp. 31-44
• The multiplicative complexity of Boolean functions
  C.P. Schnorr
  Lecture Notes in Computer Science 357, 1989, pp. 45-58
• An algorithm on quasi-ordinary polynomials
  M.E. Alonso, I. Luengo, M. Raimondo
  Lecture Notes in Computer Science 357, 1989, pp. 59-73
• A computer-aided design for sampling a nonlinear analytic system
  Jean-Pierre Barbot
  Lecture Notes in Computer Science 357, 1989, pp. 74-88
• Decoding of generalized concatenated codes
  Martin Bossert
  Lecture Notes in Computer Science 357, 1989, pp. 89-98
• Backtrack searching in the presence of symmetry
  Cynthia A. Brown, Larry Finkelstein, Paul Walton, Jr. Purdom
  Lecture Notes in Computer Science 357, 1989, pp. 99-110
• Fast serial-parallel multipliers
  Marco Bucci, Adina Di Porto
  Lecture Notes in Computer Science 357, 1989, pp. 111-121
• 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 new effectivity bounds in computational geometry
  Léandro Caniglia, André Galligo, Joos Heintz
  Lecture Notes in Computer Science 357, 1988, pp. 131-152
• 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
• A computational proof of the Noether normalization lemma
  Alessandro Logar
  Lecture Notes in Computer Science 357, 1989, pp. 259-273
• A graphics interface to REDUCE
  Jed Marti
  Lecture Notes in Computer Science 357, 1989, pp. 274-296
• VLSI designs for multiplication over finite fields GF(2^m)
  Edoardo D. Mastrovito
  Lecture Notes in Computer Science 357, 1989, pp. 297-309