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 YEAR=1986

• Fast computation of linear finite-dimensional operators over arbitrary rings
  Edward G. Belaga
  Lecture Notes in Computer Science 229, 1986, pp. 238-246
• Quantifier elimination for real closed fields
  W. Böge
  Lecture Notes in Computer Science 229, 1986, pp. 247-261
• Efficient decision algorithms for locally finite theories
  Volker Weispfenning
  Lecture Notes in Computer Science 229, 1986, pp. 262-273
• The algorithmic structure of sl(2, k)
  Roland Mirwald
  Lecture Notes in Computer Science 229, 1986, pp. 274-287
• Optimal algorithms for finite dimensional simply generated algebras
  Annemarie Fellmann
  Lecture Notes in Computer Science 229, 1986, pp. 288-295
• On a little but useful algorithm
  Heinz Lüneburg
  Lecture Notes in Computer Science 229, 1986, pp. 296-301
• Computation of independent units in number fields by Dirichlet's method
  J. Buchmann, A. Pethŏ
  Lecture Notes in Computer Science 229, 1986, pp. 302-305
• Some upper bounds for the multiplicity of an autoreduced subset of N^m and their applications
  Giuseppa Carrà Ferro
  Lecture Notes in Computer Science 229, 1986, pp. 306-315
• Exact computation of the characteristic polynomial of an integer matrix
  Asish Mukhopadhyay, Vangalur S. Alagar
  Lecture Notes in Computer Science 229, 1986, pp. 316-324
• An analysis of the Krönecker algorithm for factorization of algebraic polynomials
  Rüdiger Loos
  Lecture Notes in Computer Science 229, 1986, pp. 325-325
• Polynomial factorization over \mathbb{Z}[X]
  Guy Viry
  Lecture Notes in Computer Science 229, 1986, pp. 326-332
• The L-machine: An attempt at parallel hardware for symbolic computation
  B. Buchberger
  Lecture Notes in Computer Science 229, 1986, pp. 333-347
• An interactive graphical interface for symbolic algebra systems
  Wm Leler, Neil Soiffer
  Lecture Notes in Computer Science 229, 1986, pp. 348-352
• Gröbner bases for non-commutative polynomial rings
  Ferdinando Mora
  Lecture Notes in Computer Science 229, 1986, pp. 353-362
• Extending the binary GCD algorithm
  G.H. Norton
  Lecture Notes in Computer Science 229, 1986, pp. 363-372
• Integration of rational functions in SAC-2
  Trevor J. Smedley
  Lecture Notes in Computer Science 229, 1986, pp. 373-384
• Heuristic bivariate lifting
  D. Lugiez
  Lecture Notes in Computer Science 229, 1986, pp. 385-391
• Optimal evaluation of algebraic expressions
  Anthony C. Hearn
  Lecture Notes in Computer Science 229, 1986, pp. 392-403
• On deleting links in semantic graphs
  Neil V. Murray, Erik Rosenthal
  Lecture Notes in Computer Science 229, 1986, pp. 404-415
• On associative algebras of minimal rank
  Joos Heintz, Jacques Morgenstern
  Lecture Notes in Computer Science 228, 1986, pp. 1-24
• Construction of primitive idempotents for n variable codes
  A. Poli
  Lecture Notes in Computer Science 228, 1986, pp. 25-35
• Multivariate polynomials in coding theory
  Hideki Imai
  Lecture Notes in Computer Science 228, 1986, pp. 36-60
• Enumeration of self dual 2k circulant codes
  A. Poli, C. Rigoni
  Lecture Notes in Computer Science 228, 1986, pp. 61-70
• Codes, groups and invariants
  Thomas Beth
  Lecture Notes in Computer Science 228, 1986, pp. 71-78
• On a conjecture concerning coverings of Hamming space
  G.D. Cohen, A.C. Lobstein, N.J.A. Sloane
  Lecture Notes in Computer Science 228, 1986, pp. 79-89