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

• Bounds for degrees and number of elements in Gröbner bases
  Lorenzo Robbiano
  Lecture Notes in Computer Science 508, 1991, pp. 292-303
• Standard bases of differential ideals
  François Ollivier
  Lecture Notes in Computer Science 508, 1991, pp. 304-321
• Complexity of standard bases in projective dimension zero II
  Marc Giusti
  Lecture Notes in Computer Science 508, 1991, pp. 322-328
• Systolic architectures for multiplication over finite field GF(2^m)
  Menouer Diab
  Lecture Notes in Computer Science 508, 1991, pp. 329-340
• PARSAC-2: A parallel SAC-2 based on threads
  Wolfgang Kuechlin
  Lecture Notes in Computer Science 508, 1991, pp. 341-353
• Exponentiation in finite fields using dual basis multiplier
  Masakatu Morii, Yuzo Takamatsu
  Lecture Notes in Computer Science 508, 1991, pp. 354-366
• Applications of Cayley graphs
  G. Cooperman, L. Finkelstein, N. Sarawagi
  Lecture Notes in Computer Science 508, 1991, pp. 367-378
• Duality between two cryptographic primitives
  Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
  Lecture Notes in Computer Science 508, 1991, pp. 379-390