46 Titel in Besondere Sammlungen → Veröffentlichungen der Universität → Fakultät für Elektrotechnik, Informatik und Mathematik → Institut für Informatik 1
zu den Filteroptionen46 Titel in Besondere Sammlungen → Veröffentlichungen der Universität → Fakultät für Elektrotechnik, Informatik und Mathematik → Institut für Informatik
1
The GAG-system : A tool for compiler construction
In: Methods and tools for compiler construction, Jg. 1984, S. 165-181
How to find long paths efficiently
In: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254Implementation of visit-oriented attribute evaluators
In: Attribute grammars, applications and systems (Lecture notes in computer science : 545), Jg. 1991, S. 114-139Improving the concurrency of integrity checks and write operations
In: Proceedings / ICDT '90, Third International Conference on Database Theory, Paris, France, December 12 - 14, 1990, Jg. 1990, S. 259-273An inference engine for function free logic programs
In: Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence, Jg. 1990, S. 885-890Integrated predicative synchronization implemented in a federated DBMS
In: Tenth Annual International Phoenix Conference on Computers and Communications, Jg. 1991, S. 123-129Integrating a deductive database system with a Warren Abstract Machine
In: Proceedings of the International Symposium "Computational Intelligence 90", Jg. 1991, S. 19-24The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Jg. 8.1977, S. 371-382Lifetime analysis for attributes
In: Acta Informatica, Jg. 24.1987 H. 6, S. 633-652On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Jg. 9, S. 414-425On transactions in logic programming languages
In: Logic programming : proceedings of the Eighth International Conference [on Logic Programming, held in Paris, France, June 24 - 28, 1991]Ordered attributed grammars
In: Acta Informatica, Jg. 13.1980 H. 3, S. 229-256A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-74Relationships between pushdown automata and tape-bounded turing machines
In: Automata, languages and programming, Jg. 1973, S. 575-583Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-264The ring machine
In: Computers and artificial intelligence, Jg. 1987, S. 195-208A semantics for the integration of database modifications and transaction brackets into a logic programming language
In: Information systems and artificial intelligence / Workshop on Information Systems and Artificial Intelligence, Jg. 1990, S. 1-10Simulating binary trees on x-trees
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, S. 147-158Solving linear graphical constraint expressions
In: Human-computer interaction / International Conference on Human Computer Interaction <5, 1993, Orlando, Fla.>, Jg. 3.1993 Poster session, 267 SeitenSystematische Analyse semantischer Abhängigkeiten
In: Programmiersprachen / Fachtagung über Programmiersprachen, Jg. 4, S. 19-32