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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=1989

• A procedure to prove geometrical statements
  Giuseppa Carrà Ferro, Giovanni Gallo
  Lecture Notes in Computer Science 356, 1989, pp. 141-150
• Some applications of a classification of affine-invariant codes
  Pascale Charpin
  Lecture Notes in Computer Science 356, 1989, pp. 151-160
• On the computation of the local and global analytic branches of a real algebraic curve
  F. Cucker, L.M. Pardo, M. Raimondo, T. Recio, M.F. Roy
  Lecture Notes in Computer Science 356, 1989, pp. 161-181
• On generalized minimum distance decoding
  Arne Dür
  Lecture Notes in Computer Science 356, 1989, pp. 202-215
• Newton symmetric functions and the arithmetic of algebraically closed fields
  Roberto Dvornicich, Carlo Traverso
  Lecture Notes in Computer Science 356, 1989, pp. 216-224
• Non linear covering codes: A few results and conjectures
  Gérard Cohen
  Lecture Notes in Computer Science 356, 1989, pp. 225-229
• Gröbner bases, Ritt's algorithm and decision procedures for algebraic theories
  Alfredo Ferro, Giovanni Gallo
  Lecture Notes in Computer Science 356, 1989, pp. 230-237
• An algebraic model for the storage of data in parallel momories
  M.A. Fiol, O. Serra
  Lecture Notes in Computer Science 356, 1989, pp. 238-246
• Algebraic solution of systems of polynomial equations using Gröbner bases
  Patrizia Gianni, Teo Mora
  Lecture Notes in Computer Science 356, 1989, pp. 247-257
• How to decide whether a polynomial ideal is primary or not
  M. Grieco, B. Zucchetti
  Lecture Notes in Computer Science 356, 1989, pp. 258-268
• On the computational complexity of polynomials and bilinear mappings - A survey
  Joos Heintz
  Lecture Notes in Computer Science 356, 1989, pp. 269-300
• Coding theory and its applications in Japan
  Hideki Imai, Tsutomu Matsumoto
  Lecture Notes in Computer Science 356, 1989, pp. 301-305
• Binary sequences with good correlation properties
  Helge Elbrond Jensen, Tom Hoholdt
  Lecture Notes in Computer Science 356, 1989, pp. 306-320
• Properties of infinite words: Recent results
  J. Berstel
  Lecture Notes in Computer Science 349, 1989, pp. 36-46
• Observational implementations
  Rolf Hennicker
  Lecture Notes in Computer Science 349, 1989, pp. 59-71
• On the boundary of a union of rays
  Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
  Lecture Notes in Computer Science 349, 1989, pp. 72-83
• An O(n \log n) algorithm for computing a link center in a simple polygon
  Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
  Lecture Notes in Computer Science 349, 1989, pp. 96-107
• Polynomial graph-colorings
  Wolfgang Gutjahr, Emo Welzl, Gerhart Wöginger
  Lecture Notes in Computer Science 349, 1989, pp. 108-119
• Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
  Friedhelm Hinz
  Lecture Notes in Computer Science 349, 1989, pp. 132-143
• Linear numeration systems, \Theta-developments and finite automata
  Christiane Frougny
  Lecture Notes in Computer Science 349, 1989, pp. 144-155
• Word problems over traces which are solvable in linear time
  Volker Diekert
  Lecture Notes in Computer Science 349, 1989, pp. 168-180
• Successive approximation in parallel graph algorithms
  Donald Fussell, Ramakrishna Thurimella
  Lecture Notes in Computer Science 349, 1989, pp. 205-217
• Reversals and Alternation
  Gerhard Buntrock, Albrecht Höne
  Lecture Notes in Computer Science 349, 1989, pp. 218-228
• On the power of parity polynomial time
  Jin-yi Cai, Lane A. Hemachandra
  Lecture Notes in Computer Science 349, 1989, pp. 229-239
• Complete problems and strong polynomial reducibilities
  K. Ganesan, Steven Homer
  Lecture Notes in Computer Science 349, 1989, pp. 240-250