Joachim Niehren
Joachim Niehren
Dirección de correo verificada de - Página principal
TítuloCitado porAño
The constraint language for lambda structures
M Egg, A Koller, J Niehren
Journal of Logic, Language and Information 10 (4), 457-485, 2001
A concurrent lambda calculus with futures
J Niehren, J Schwinghammer, G Smolka
Theoretical Computer Science 364 (3), 338-356, 2006
Gene regulation in the pi calculus: Simulating cooperativity at the lambda switch
C Kuttler, J Niehren
Transactions on computational systems biology VII, 24-55, 2006
Querying unranked trees with stepwise tree automata
J Carme, J Niehren, M Tommasi
International Conference on Rewriting Techniques and Applications, 105-118, 2004
Constraints over lambda-structures in semantic underspecification
M Egg, J Niehren, P Ruhrberg, F Xu
Proceedings of the 36th Annual Meeting of the Association for Computational …, 1998
On the minimization of XML schemas and tree automata for unranked trees
W Martens, J Niehren
Journal of Computer and System Sciences 73 (4), 550-583, 2007
On equality up-to constraints over finite trees, context unification, and one-step rewriting
J Niehren, M Pinkal, P Ruhrberg
International Conference on Automated Deduction, 34-48, 1997
Dominance constraints: Algorithms and complexity
A Koller, J Niehren, R Treinen
International Conference on Logical Aspects of Computational Linguistics …, 1998
Interactive learning of node selecting tree transducer
J Carme, R Gilleron, A Lemay, J Niehren
Machine Learning 66 (1), 33-67, 2007
An efficient graph algorithm for dominance constraints
E Althaus, D Duchier, A Koller, K Mehlhorn, J Niehren, S Thiel
Journal of Algorithms 48 (1), 194-219, 2003
A uniform approach to underspecification and parallelism
J Niehren, M Pinkal, P Ruhrberg
Proceedings of the eighth conference on European chapter of the Association …, 1997
A learning algorithm for top-down XML transformations
A Lemay, S Maneth, J Niehren
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on …, 2010
Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints
A Koller, J Niehren, S Thater
The attributed pi-calculus with priorities
M John, C Lhoussaine, J Niehren, AM Uhrmacher
Transactions on Computational Systems Biology XII, 13-76, 2010
The attributed pi calculus
M John, C Lhoussaine, J Niehren, AM Uhrmacher
International Conference on Computational Methods in Systems Biology, 83-102, 2008
N-ary queries by tree automata
J Niehren, L Planque, JM Talbot, S Tison
International Workshop on Database Programming Languages, 217-231, 2005
The first-order theory of subtyping constraints
Z Su, A Aiken, J Niehren, T Priesnitz, R Treinen
ACM SIGPLAN Notices 37 (1), 203-216, 2002
Functional computation as concurrent computation
J Niehren
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of …, 1996
Feature automata and recognizable sets of feature trees
J Niehren, A Podelski
Colloquium on Trees in Algebra and Programming, 356-375, 1993
Constraints for free in concurrent computation
J Niehren, M Müller
Asian Computing Science Conference, 171-186, 1995
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20