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

• Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
  Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
  Lecture Notes in Computer Science 775, 1994, pp. 649-660
• Nondeterminism in patterns
  Alexandru Mateescu, Arto Salomaa
  Lecture Notes in Computer Science 775, 1994, pp. 661-668
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
  Vlado Danc̑ík, Mike Paterson
  Lecture Notes in Computer Science 775, 1994, pp. 669-678
• The ambiguity of primitive words
  H. Petersen
  Lecture Notes in Computer Science 775, 1994, pp. 679-690
• On codes having no finite completion
  Nguyen Huong Lam
  Lecture Notes in Computer Science 775, 1994, pp. 691-698
• A new approach to information theory
  Richard J. Lipton
  Lecture Notes in Computer Science 775, 1994, pp. 699-708
• On Voronoi diagrams in the L_p-metric in higher dimensions
  Ngọc-Minh Lê
  Lecture Notes in Computer Science 775, 1994, pp. 711-722
• Total protection of analytic invariant information in cross tabulated tables
  Ming-Yang Kao
  Lecture Notes in Computer Science 775, 1994, pp. 723-734
• Dominating cliques in graphs with hypertree structure
  Feodor F. Dragan, Andreas Brandstädt
  Lecture Notes in Computer Science 775, 1994, pp. 735-746
• On vertex ranking for permutation and other graphs
  J.S. Deogun, T. Kloks, D. Kratsch, H. Müller
  Lecture Notes in Computer Science 775, 1994, pp. 747-758
• Finding all minimal separators of a graph
  T. Kloks, D. Kratsch
  Lecture Notes in Computer Science 775, 1994, pp. 759-768
• On the complexity of the maximum cut problem
  Hans L. Bodlaender, Klaus Jansen
  Lecture Notes in Computer Science 775, 1994, pp. 769-780