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 YEAR=1987

• Modules for Re-use
  David Gries
  Lecture Notes in Computer Science 287, 1987, pp. 373-375
• Hierarchical refinement of a Z specification
  D. Neilson
  Lecture Notes in Computer Science 287, 1987, pp. 376-399
• Lazy pattern matching in the ML language
  A. Laville
  Lecture Notes in Computer Science 287, 1987, pp. 400-419
• Program development using lambda abstraction
  A. Pettorossi
  Lecture Notes in Computer Science 287, 1987, pp. 420-434
• Relativized Arthur-Merlin versus Merlin-Arthur games
  M. Santha
  Lecture Notes in Computer Science 287, 1987, pp. 435-442
• On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
  V. Arvind, S. Biswas
  Lecture Notes in Computer Science 287, 1987, pp. 456-469
• A lock-ahead interpreter for sequential prolog and its implementation
  A. Kumar, V.M. Malhotra
  Lecture Notes in Computer Science 287, 1987, pp. 470-484
• Extension of weakest precondition formalism to a low level language
  A. Sanyal, S. Biswas, V.M. Malhotra
  Lecture Notes in Computer Science 287, 1987, pp. 485-499
• Retrospection on the PQCC compiler structure
  K.V. Nori, S. Kumar, M. Pavan Kumar
  Lecture Notes in Computer Science 287, 1987, pp. 500-527
• Some recent applications of knowledge
  Rohit Parikh
  Lecture Notes in Computer Science 287, 1987, pp. 528-539
• On direct methods of realization of normal algorithms by Turing machines
  G.V. Babikov
  Lecture Notes in Computer Science 278, 1987, pp. 41
• On one approximate algorithm for solving systems of linear inequalities with boolean variables
  N.N. Kuzjurin
  Lecture Notes in Computer Science 278, 1987, pp. 272
• Diophantine complexity
  Yu. Matijasevich
  Lecture Notes in Computer Science 278, 1987, pp. 301
• On cartesian powers of P_2
  V.A. Taimanov
  Lecture Notes in Computer Science 278, 1987, pp. 435
• Possibilities of probabilistic on-line counting machines
  F.M. Ablayev
  Lecture Notes in Computer Science 278, 1987, pp. 1-4
• Functional systems on semilattices
  G.P. Agibalov
  Lecture Notes in Computer Science 278, 1987, pp. 5-9
• Recognition of properties in K-valued logic and approximate algorithms
  V.B. Alekseyev
  Lecture Notes in Computer Science 278, 1987, pp. 10-13
• Linearized disjunctive normal forms of boolean functions
  A.A. Alexanyan
  Lecture Notes in Computer Science 278, 1987, pp. 14-16
• On a stable generating of random sequences by probabilistic automata
  Ju.A. Alpin, B.S. Kotchkarev, R.G. Mubarakzianov
  Lecture Notes in Computer Science 278, 1987, pp. 17-20
• Automata classes induced by Post classes
  S.V. Alyoshin
  Lecture Notes in Computer Science 278, 1987, pp. 21-23
• Effective lower bounds for complexity of some classes of schemes
  A.E. Andreev
  Lecture Notes in Computer Science 278, 1987, pp. 24-29
• Stable finite automata mappings and Church-Rosser systems
  A.V. Anisimov, V.A. Oleshchuk
  Lecture Notes in Computer Science 278, 1987, pp. 30-33
• The recursion theorem, approximations, and clasifying index sets of recursively enumerable sets
  M.M. Arslanov
  Lecture Notes in Computer Science 278, 1987, pp. 34-37
• Duality of functions and data in algorithms description
  A.D. Astakhov
  Lecture Notes in Computer Science 278, 1987, pp. 38-40
• Verbal operation on automaton
  D.N. Babin
  Lecture Notes in Computer Science 278, 1987, pp. 42-44