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

• On the (d,D,D,s)-digraph problem
  P. Morillo, M.A. Fiol, J. Guitart
  Lecture Notes in Computer Science 356, 1989, pp. 334-340
• It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free
  Paliath Narendran, Friedrich Otto
  Lecture Notes in Computer Science 356, 1989, pp. 341-349
• A shift-remainder GCD algorithm
  Graham Norton
  Lecture Notes in Computer Science 356, 1989, pp. 350-356
• New class of cyclic, random and burst error correcting codes
  E. Olcayto, A. Birse
  Lecture Notes in Computer Science 356, 1989, pp. 357-368
• A conjecture on the free distance of (2,1,m) binary convolutional codes
  Ph. Piret
  Lecture Notes in Computer Science 356, 1989, pp. 369-375
• On the construction of completely regular linear codes from distance-regular graphs
  Josep Rifà
  Lecture Notes in Computer Science 356, 1989, pp. 376-393
• Synthesis of two-dimensional linear feedback shift registers and Gröbner bases
  Shojiro Sakata
  Lecture Notes in Computer Science 356, 1989, pp. 394-407
• Constructing universal Gröbner bases
  Volker Weispfenning
  Lecture Notes in Computer Science 356, 1989, pp. 408-417