„Logic Programming“

Suchergebnisse

2.836 Treffer

• Nonlinear pattern theory
  Gimpel, James F.
• Context-free grammars with selective rewriting
  Rozenberg, G. ; Wood, D.
• Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme – Teil I: Datenstrukturen und Schemata
  Ehrich, H. -D
• Remarks on “A Synthesis of Several Sorting Algorithms” by John Darlington
  Barstow, David R.
• A practical example of the specification of abstract data types
  Tompa, Frank W.
• On the worst case performance of buddy systems
  Lloyd, Errol L. ; Loui, Michael C.
• Replaceability and computational equivalence for monotone boolean functions
  Beynon, Meurig
• Complexity of the word problem for commutative semigroups of fixed dimension
  Huynh, Dung T.
• Global storage cells for attributes in an attribute grammar
  Sonnenschein, Michael
• Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
  Kuck, David ; Muraoka, Yoichi
• Some resource allocation policies in a Multi Associative Processor
  Nutt, Gary J.
• Maintaining range trees in secondary memory – Part II: Lower bounds
  Smid, Michiel H. M. ; Overmars, Mark H.
• Complete problems for space bounded subclasses of NP
  Chung, Moon Jung ; Evangelist, W. Michael ; Sudborough, Ivan Hal
• Maintaining range trees in secondary memory – Part I: Partitions
  Overmars, Mark H. ; Smid, Michiel H. M. ; Berg, Mark T. de ; Kreveld, Marc J. van
• Necessary and sufficient conditions for the universality of programming formalisms
  Kfoury, A. J. ; Urzyczyn, Pawel
• The complexity of graph languages generated by hyperedge replacement
  Lautemann, Clemens
• Data encodings and their costs
  Rosenberg, Arnold L.
• Design and correctness of a compiler for a non-procedural language
  Hoffmann, Christoph M.
• Gobang ist PSPACE-vollständig
  Reisch, Stefan
• Applications of efficient mergeable heaps for optimization problems on trees
  Galil, Zvi