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

• On coordinated rewriting
  A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg
  Lecture Notes in Computer Science 199, 1985, pp. 100-111
• Elements of a general theory of combinatorial structures
  Ph. Flajolet
  Lecture Notes in Computer Science 199, 1985, pp. 112-127
• A language theoretic approach to serialization problem in concurrent systems
  M.P. Flé, G. Roucairol
  Lecture Notes in Computer Science 199, 1985, pp. 128-145
• Logic programming and substitutions
  G. Frandsen
  Lecture Notes in Computer Science 199, 1985, pp. 146-158
• A lower bound on the oscilation complexity of context-free languages
  T. Gundermann
  Lecture Notes in Computer Science 199, 1985, pp. 159-166
• Depth efficient transformations of arithmetic into Boolean circuits
  H. Jung
  Lecture Notes in Computer Science 199, 1985, pp. 167-174
• Free cost measures of trees
  R. Kemp
  Lecture Notes in Computer Science 199, 1985, pp. 175-190
• Discrete extremal problems on covering
  A.D. Korshunov
  Lecture Notes in Computer Science 199, 1985, pp. 191-207
• Parallel algorithms for connected components in a graph
  V. Koubek, J. Krsnáková
  Lecture Notes in Computer Science 199, 1985, pp. 208-217
• Statistical testing of finite sequences based on algorithmic complexity
  I. Kramosil
  Lecture Notes in Computer Science 199, 1985, pp. 218-226
• Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (Preliminary version)
  K. Kriegel, S. Waack
  Lecture Notes in Computer Science 199, 1985, pp. 227-233
• Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete
  M. Kȓivánek, J. Morávek
  Lecture Notes in Computer Science 199, 1985, pp. 234-241
• Linear comparison complexity of the n-cube membership problem
  M. Kȓivánek, J. Morávek
  Lecture Notes in Computer Science 199, 1985, pp. 242-248
• String grammars with disconnecting
  K.-J. Lange, E. Welzl
  Lecture Notes in Computer Science 199, 1985, pp. 249-256
• Array processing machines
  J. van Leeuwen, J. Wiedermann
  Lecture Notes in Computer Science 199, 1985, pp. 257-268
• A fast heuristic for covering polygons by rectangles
  C. Levcopoulos
  Lecture Notes in Computer Science 199, 1985, pp. 269-278
• On the decidability of the theory of free groups (russ.)
  G.S. Makanin
  Lecture Notes in Computer Science 199, 1985, pp. 279-284
• Products of group languages
  S.W. Margolis, J.E. Pin
  Lecture Notes in Computer Science 199, 1985, pp. 285-299
• The complexity of embedding graphs into binary trees
  B. Monien
  Lecture Notes in Computer Science 199, 1985, pp. 300-309
• On some topological properties of logic programs
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 199, 1985, pp. 310-319
• Recent results on continuous ordered algebras
  E. Nelson
  Lecture Notes in Computer Science 199, 1985, pp. 320-330
• Probabilistic algorithms in group theory
  J. Reif
  Lecture Notes in Computer Science 199, 1985, pp. 341-350
• Recent results on codes
  C. Reutenauer
  Lecture Notes in Computer Science 199, 1985, pp. 351-360
• A multiparameter analysis of the boundedness problem for vector addition systems
  L.E. Rosier, H.-C. Yen
  Lecture Notes in Computer Science 199, 1985, pp. 361-370
• About two-way transducers
  B. Rozoy
  Lecture Notes in Computer Science 199, 1985, pp. 371-379