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

• From T(m) triangular graphs to single-error-correcting codes
  J.M. Basart, L. Huguet
  Lecture Notes in Computer Science 307, 1988, pp. 5-12
• Integration of graphical tools in a computer algebra system
  Guilherme Bittencourt
  Lecture Notes in Computer Science 307, 1988, pp. 13-24
• Type inference using unification in computer algebra
  J. Calmet, H. Comon, D. Lugiez
  Lecture Notes in Computer Science 307, 1988, pp. 25-28
• The weight distribution of double-error-correcting Goppa codes
  Arne Dür
  Lecture Notes in Computer Science 307, 1988, pp. 29-42
• A simple analysis of the Blokh-Zyablov decoding algorithm
  Thomas Ericson
  Lecture Notes in Computer Science 307, 1988, pp. 43-57
• Design of a Viterbi decoder with microprocessor-based serial implementation
  F.J. García-Ugalde, R.H. Morelos-Zaragoza A.
  Lecture Notes in Computer Science 307, 1988, pp. 58-67
• On s-sum-sets (s odd) and three-weight projective codes
  Mercè Griera
  Lecture Notes in Computer Science 307, 1988, pp. 68-76
• On the integration of numeric and algebraic computations
  Gianfranco Mascari, Alfonso Miola
  Lecture Notes in Computer Science 307, 1988, pp. 77-87
• A symbolic manipulation system for combinatorial problems
  P. Massazza, G. Mauri, P. Righi, M. Torelli
  Lecture Notes in Computer Science 307, 1988, pp. 88-97
• Standard bases and non-noetherianity: Non-commutative polynomial rings
  Teo Mora
  Lecture Notes in Computer Science 307, 1988, pp. 98-109
• Embedding self-dual codes into projective space
  H. Opolka
  Lecture Notes in Computer Science 307, 1988, pp. 110-112
• The finite Fourier-transform as a modular substitution
  H. Opolka
  Lecture Notes in Computer Science 307, 1988, pp. 113-119
• On computers and modular representations of SL_n(K)
  Marilena Pittaluga, Elisabetta Strickland
  Lecture Notes in Computer Science 307, 1988, pp. 120-129
• Construction of SDMC codes over GF (2) or GF (3)
  A. Poli
  Lecture Notes in Computer Science 307, 1988, pp. 130-138
• Fast16 : A software program for factorising polynomials over large GF(p)
  A. Poli, M.C. Gennero
  Lecture Notes in Computer Science 307, 1988, pp. 139-156
• Characterization of completely regular codes through P-polynomial association schemes
  Josep Rifà, Llorenç Huguet
  Lecture Notes in Computer Science 307, 1988, pp. 157-167
• Codes on Hermitian curves
  Mohammad Amin Shokrollahi
  Lecture Notes in Computer Science 307, 1988, pp. 168-176
• Symmetries of cyclic extended Goppa codes over \mathbb{F}_q
  J.A. Thiong-Ly
  Lecture Notes in Computer Science 307, 1988, pp. 177-194
• Some bounds for the construction of Gröbner bases
  Volker Weispfenning
  Lecture Notes in Computer Science 307, 1988, pp. 195-201
• Analysis of a class of algorithms for problems on trace languages
  A. Bertoni, M. Goldwurm, N. Sabadini
  Lecture Notes in Computer Science 307, 1988, pp. 202-214