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

Suche: Series=LNCS AND YEAR=1988

• On s-sum-sets (s odd) and three-weight projective codes
  Mercè Griera
  Lecture Notes in Computer Science 307, 1988, pp. 68-76
• On the integration of numeric and algebraic computations
  Gianfranco Mascari, Alfonso Miola
  Lecture Notes in Computer Science 307, 1988, pp. 77-87
• A symbolic manipulation system for combinatorial problems
  P. Massazza, G. Mauri, P. Righi, M. Torelli
  Lecture Notes in Computer Science 307, 1988, pp. 88-97
• Standard bases and non-noetherianity: Non-commutative polynomial rings
  Teo Mora
  Lecture Notes in Computer Science 307, 1988, pp. 98-109
• Embedding self-dual codes into projective space
  H. Opolka
  Lecture Notes in Computer Science 307, 1988, pp. 110-112
• The finite Fourier-transform as a modular substitution
  H. Opolka
  Lecture Notes in Computer Science 307, 1988, pp. 113-119
• On computers and modular representations of SL_n(K)
  Marilena Pittaluga, Elisabetta Strickland
  Lecture Notes in Computer Science 307, 1988, pp. 120-129
• Construction of SDMC codes over GF (2) or GF (3)
  A. Poli
  Lecture Notes in Computer Science 307, 1988, pp. 130-138
• Fast16 : A software program for factorising polynomials over large GF(p)
  A. Poli, M.C. Gennero
  Lecture Notes in Computer Science 307, 1988, pp. 139-156
• Characterization of completely regular codes through P-polynomial association schemes
  Josep Rifà, Llorenç Huguet
  Lecture Notes in Computer Science 307, 1988, pp. 157-167
• Codes on Hermitian curves
  Mohammad Amin Shokrollahi
  Lecture Notes in Computer Science 307, 1988, pp. 168-176
• Analysis of a class of algorithms for problems on trace languages
  A. Bertoni, M. Goldwurm, N. Sabadini
  Lecture Notes in Computer Science 307, 1988, pp. 202-214
• Geometry of numbers and integer programming
  C.P. Schnorr
  Lecture Notes in Computer Science 294, 1988, pp. 1-7
• Getting back to the past in the union-find problem
  G. Gambosi, G.F. Italiano, M. Talamo
  Lecture Notes in Computer Science 294, 1988, pp. 8-17
• On the construction of optimal time adders
  B. Becker, R. Kolla
  Lecture Notes in Computer Science 294, 1988, pp. 18-28
• On computations with integer division
  B. Just, F. Meyer auf der Heide, A. Wigderson
  Lecture Notes in Computer Science 294, 1988, pp. 29-37
• Maintaining range trees in secondary memory
  M.H. Overmars, M.H.M. Smid
  Lecture Notes in Computer Science 294, 1988, pp. 38-51
• Solving parametric problems on trees
  D. Fernández-Baca, G. Slutzki
  Lecture Notes in Computer Science 294, 1988, pp. 52-60
• Functional equations for data structures
  F. Bergeron, G. Labelle, P. Leroux
  Lecture Notes in Computer Science 294, 1988, pp. 73-80
• The power of polynomial size \Omega-branching programs
  Ch. Meinel
  Lecture Notes in Computer Science 294, 1988, pp. 81-90
• Collapsing oracle hierarchies, census functions and logarithmically many queries
  U. Schöning, K.W. Wagner
  Lecture Notes in Computer Science 294, 1988, pp. 91-97
• Domino games with an application to the complexity of Boolean algebras with bounded quantifier alternations
  E. Grädel
  Lecture Notes in Computer Science 294, 1988, pp. 98-107
• Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
  B. Jenner, B. Kirsig
  Lecture Notes in Computer Science 294, 1988, pp. 118-125
• Hotz-isomorphism theorems in formal language theory
  V. Diekert, A. Möbus
  Lecture Notes in Computer Science 294, 1988, pp. 126-135
• First-order properties of trees, star-free expressions and aperiodicity
  U. Heuter
  Lecture Notes in Computer Science 294, 1988, pp. 136-148