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

• Axiomatic semantics of indirect addressing
  Juraj Steiner
  Lecture Notes in Computer Science 118, 1981, pp. 515-523
• Testing of join dependency preserving by a modified chase method
  Katsumi Tanaka, Yahiko Kambayashi
  Lecture Notes in Computer Science 118, 1981, pp. 524-533
• A starvation-free solution of the dining philosophers' problem by use of interaction systems
  Horst Wedde
  Lecture Notes in Computer Science 118, 1981, pp. 534-543
• Admissible representations of effective cpo's
  Klaus Weihrauch, Gisela Schäfer
  Lecture Notes in Computer Science 118, 1981, pp. 544-553
• Preserving total order in constant expected time
  Juraj Wiedermann
  Lecture Notes in Computer Science 118, 1981, pp. 554-562
• Constructive category theory (No. 1)
  Akira Kanda
  Lecture Notes in Computer Science 118, 1981, pp. 563-577
• Two pebbles don't suffice
  Lothar Budach
  Lecture Notes in Computer Science 118, 1981, pp. 578-589