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

• A primality test using cyclotomic extensions
  Preda Mihailescu
  Lecture Notes in Computer Science 357, 1989, pp. 310-323
• The method of syndrome coding and its application for data compression and processing in high energy physics experiments
  N.M. Nikityuk
  Lecture Notes in Computer Science 357, 1989, pp. 324-335
• Nonassociative degree five identities not implied by commutativity: A computer approach
  G.M. Piacentini Cattaneo
  Lecture Notes in Computer Science 357, 1989, pp. 336-340
• On completely regular propelinear codes
  J. Rifà, J.M. Basart, L. Huguet
  Lecture Notes in Computer Science 357, 1989, pp. 341-355
• N-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros
  Shojiro Sakata
  Lecture Notes in Computer Science 357, 1989, pp. 356-376
• Covering radius: Improving on the sphere-covering bound
  Juriaan Simonis
  Lecture Notes in Computer Science 357, 1989, pp. 377-385
• On Goldman's algorithm for solving first-order multinomial autonomous systems
  William Y. Sit
  Lecture Notes in Computer Science 357, 1989, pp. 386-395
• A covering problem in the odd graphs
  Patrick Solé, Arif Ghafoor
  Lecture Notes in Computer Science 357, 1989, pp. 396-406
• On the computation of Hilbert-Samuel series and multiplicity
  Walter Spangher
  Lecture Notes in Computer Science 357, 1989, pp. 407-414
• Succinct representations of counting problems
  Jacobo Torán
  Lecture Notes in Computer Science 357, 1989, pp. 415-426
• How to guess \ell-th roots modulo n by reducing lattice bases
  Brigitte Vallée, Marc Girault, Philippe Toffin
  Lecture Notes in Computer Science 357, 1989, pp. 427-442
• A study on Imai-Hirakawa Trellis-coded modulation schemes
  Kazuhiko Yamaguchi, Hideki Imai
  Lecture Notes in Computer Science 357, 1989, pp. 443-453
• 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
• The weights of the orthogonals of certain cyclic codes or extended Goppa codes
  J. Wolfmann
  Lecture Notes in Computer Science 357, 1989, pp. 476-480