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 Volume=965

• Distributed catenation and Chomsky hierarchy
  Manfred Kudlek, Alexandru Mateescu
  Lecture Notes in Computer Science 965, 1995, pp. 313-322
• The power of frequency computation
  Martin Kummer, Frank Stephan
  Lecture Notes in Computer Science 965, 1995, pp. 323-332
• Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
  Ngọc-Minh Lê
  Lecture Notes in Computer Science 965, 1995, pp. 333-342
• Properties of probabilistic pushdown automata
  Ioan I. Macarie, Mitsunori Ogihara
  Lecture Notes in Computer Science 965, 1995, pp. 343-352
• Formal parametric equations
  G.S. Makanin, H. Abdulrab, M.N. Maksimenko
  Lecture Notes in Computer Science 965, 1995, pp. 353-362
• PRAM's towards realistic parallelism: BRAM's
  Rolf Niedermeier, Peter Rossmanith
  Lecture Notes in Computer Science 965, 1995, pp. 363-373
• Some results concerning two-dimensional Turing machines and finite automata
  H. Petersen
  Lecture Notes in Computer Science 965, 1995, pp. 374-382
• How hard is to compute the edit distance
  Giovanni Pighizzini
  Lecture Notes in Computer Science 965, 1995, pp. 383-392
• On the synchronization of semi-traces
  Klaus Reinhardt
  Lecture Notes in Computer Science 965, 1995, pp. 393-403
• Tiling with bars and satisfaction of boolean formulas
  Eric Rémila
  Lecture Notes in Computer Science 965, 1995, pp. 404-413
• Axiomatizing Petri net concatanable processes
  Vladimiro Sassone
  Lecture Notes in Computer Science 965, 1995, pp. 414-423
• Functional sorts in data type specifications: A geometric approach to semantics
  Klaus-Dieter Schewe
  Lecture Notes in Computer Science 965, 1995, pp. 424-433