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

• Substring languages
  J. Maƚuszyński
  Lecture Notes in Computer Science 28, 1975, pp. 274-284
• Defining languages by Mazurkiewicz aigorithms
  W.A. Owsianiecka
  Lecture Notes in Computer Science 28, 1975, pp. 285-291
• Complexity and normal forms of context-free languages
  A. Pirická
  Lecture Notes in Computer Science 28, 1975, pp. 292-297
• The axiomatization problem of a theory of linear languages
  G. Wechsung
  Lecture Notes in Computer Science 28, 1975, pp. 298-302
• A lattice-theoretical approach to problem-solving
  Jozef Kelemen
  Lecture Notes in Computer Science 28, 1975, pp. 303-306
• On the equivalence of planar grammars and parallel picture processing algorithms
  Zenon Kulpa
  Lecture Notes in Computer Science 28, 1975, pp. 307-312
• Combinatorial aspects of information storage and retrieval
  Witold, Jr. Lipski
  Lecture Notes in Computer Science 28, 1975, pp. 313-326
• Modular approach to the logical theory of programs
  L. Banachowski
  Lecture Notes in Computer Science 28, 1975, pp. 327-332
• Proving programs by sets of computations
  A. Blikle
  Lecture Notes in Computer Science 28, 1975, pp. 333-358
• Bases of paths in correctness proofs
  V. Evtimov
  Lecture Notes in Computer Science 28, 1975, pp. 359-360
• Algebraic models I
  Hans-Jürgen Hoehnke
  Lecture Notes in Computer Science 28, 1975, pp. 361-371
• Structured programmability of iterative algorithms
  Jacek Irlik
  Lecture Notes in Computer Science 28, 1975, pp. 372-376
• On equivalence of programs
  J. Leszczyƚowski
  Lecture Notes in Computer Science 28, 1975, pp. 377-380
• Mathematical model of programs with dynamic allocation of variables
  J. Leszczyƚowski
  Lecture Notes in Computer Science 28, 1975, pp. 381-387
• Mathematical foundations of motivation languages and synthesis maps
  Pierangelo Miglioli
  Lecture Notes in Computer Science 28, 1975, pp. 388-408
• The semantics of semantic equations
  P.D. Mosses
  Lecture Notes in Computer Science 28, 1975, pp. 409-422
• \omega^+-valued algorithmic logic as a tool to investigate procedures
  H. Rasiowa
  Lecture Notes in Computer Science 28, 1975, pp. 423-450
• Call-by-value versus call-by-name: A proof-theoretic comparison
  W.P. de Roever
  Lecture Notes in Computer Science 28, 1975, pp. 451-463
• Procedures, formal computations and models
  Andrzej Salwicki
  Lecture Notes in Computer Science 28, 1975, pp. 464-484