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

• An Ackermannian polynomial ideal
  Guillermo Moreno Socías
  Lecture Notes in Computer Science 539, 1991, pp. 269-280
• Complexity of the computation of the canonical Whitney stratification of an algebraic set in C^n
  T. Mostowski, E. Rannou
  Lecture Notes in Computer Science 539, 1991, pp. 281-291
• Some undecidability results for weakly confluent monadic string-rewriting systems
  Friedrich Otto
  Lecture Notes in Computer Science 539, 1991, pp. 292-303
• Calculating multidimensional symmetric functions using Jacobi's formula
  Paul Pedersen
  Lecture Notes in Computer Science 539, 1991, pp. 304-317
• Multivariate Sturm theory.
  Paul Pedersen
  Lecture Notes in Computer Science 539, 1991, pp. 318-332
• Binary spherical geometric codes
  Marc Perret
  Lecture Notes in Computer Science 539, 1991, pp. 333-339
• An algebraic construction of generalized Beenker's codes
  Alain Poli, Mostafa Belkasmi
  Lecture Notes in Computer Science 539, 1991, pp. 340-351
• Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields
  Josep Rifà, Joan Borrell
  Lecture Notes in Computer Science 539, 1991, pp. 352-359
• Completely transitive codes and distance transitive graphs
  Josep Rifà, Jaume Pujol
  Lecture Notes in Computer Science 539, 1991, pp. 360-367
• Placement of curved polygons
  Jean-Jacques Risler
  Lecture Notes in Computer Science 539, 1991, pp. 368-383
• On the weights of the elements of the duals of binary BCH codes
  François Rodier
  Lecture Notes in Computer Science 539, 1991, pp. 384-389
• Computation of the openness of some loci of modules
  F. Rossi, W. Spangher
  Lecture Notes in Computer Science 539, 1991, pp. 390-402
• Random and byte error correcting codes for asymmetric or unidirectional error control
  Yuichi Saitoh, Hideki Imai
  Lecture Notes in Computer Science 539, 1991, pp. 403-413
• Finding a minimal polynomial vector set of a vector of nD arrays
  Shojiro Sakata
  Lecture Notes in Computer Science 539, 1991, pp. 414-425
• Covering codes and combinatorial optimization
  Patrick Solé
  Lecture Notes in Computer Science 539, 1991, pp. 426-433
• Decoding of quadrature partial response-trellis coded signals (QPR-TCM) in the presence of intersymbol interference and noise
  Osman Nuri Uçan, Ümit Aygölü, Erdal Panayirci
  Lecture Notes in Computer Science 539, 1991, pp. 434-445
• On algebraic solutions of linear differential equations with primitive unimodular Galois group
  Felix Ulmer
  Lecture Notes in Computer Science 539, 1991, pp. 446-455
• Error detection and correction in numerical computations by algebraic methods
  F.S. Vainstein
  Lecture Notes in Computer Science 539, 1991, pp. 456-464
• d-functions in V_k(F_2) and self-decimation of m-sequences
  Kencheng Zeng, Dah-Yea Wei, T.R.N. Rao
  Lecture Notes in Computer Science 539, 1991, pp. 465-476
• Multilevel modulation codes for Rayleigh fading channels
  Lin Zhang, Branka Vucetic
  Lecture Notes in Computer Science 539, 1991, pp. 477-488