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

• A fast non-commutative algorithm for matrix multiplication
  Ondrej Sýkora
  Lecture Notes in Computer Science 53, 1977, pp. 504-512
• Fixed-points and algebras with infinitely long expressions, I
  J. Tiuryn
  Lecture Notes in Computer Science 53, 1977, pp. 513-522
• On languages, accepted by machines in the category of sets
  Vȇra Trnková, Jiȓí Adámek
  Lecture Notes in Computer Science 53, 1977, pp. 523-531
• Real time computations with restrictions on tape alphabet
  M.K. Valiev
  Lecture Notes in Computer Science 53, 1977, pp. 532-536
• The Bodnarchuk metric space of languages and the topology of the learning space
  Victor Vianu
  Lecture Notes in Computer Science 53, 1977, pp. 537-542
• Complexity hierarchies of oracles
  Klaus Wagner, Gerd Wechsung
  Lecture Notes in Computer Science 53, 1977, pp. 543-548
• Determining processes by violations
  Horst Wedde, Józef Winkowski
  Lecture Notes in Computer Science 53, 1977, pp. 549-559
• The influence of the machine model on the time complexity of context-free language recognition
  Reinhold Weicker
  Lecture Notes in Computer Science 53, 1977, pp. 560-569
• A generalized computability thesis
  Klaus Weihrauch
  Lecture Notes in Computer Science 53, 1977, pp. 570-570
• Identification of formal languages
  Rolf Wiehagen
  Lecture Notes in Computer Science 53, 1977, pp. 571-579
• Correctness of recursive flow diagram programs
  J.A. Goguen, J. Meseguer
  Lecture Notes in Computer Science 53, 1977, pp. 580-595