 | 2009 |
|---|
| 73 |       | Mathias John,
Cédric Lhoussaine,
Joachim Niehren:
Dynamic Compartments in the Imperative pi-Calculus.
CMSB 2009: 235-250 |
| 72 | | Olivier Gauwin,
Joachim Niehren,
Sophie Tison:
Earliest Query Answering for Deterministic Nested Word Automata.
FCT 2009: 121-132 |
| 71 | | Slawomir Staworko,
Grégoire Laurence,
Aurélien Lemay,
Joachim Niehren:
Equivalence of Deterministic Nested Word to Word Transducers.
FCT 2009: 310-322 |
| 70 | | Olivier Gauwin,
Joachim Niehren,
Sophie Tison:
Bounded Delay and Concurrency for Earliest Query Answering.
LATA 2009: 350-361 |
| 69 | | Jérôme Champavère,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Efficient inclusion checking for deterministic tree automata and XML Schemas.
Inf. Comput. 207(11): 1181-1208 (2009) |
| 2008 |
|---|
| 68 | | Mathias John,
Cédric Lhoussaine,
Joachim Niehren,
Adelinde M. Uhrmacher:
The Attributed Pi Calculus.
CMSB 2008: 83-102 |
| 67 | | Jérôme Champavère,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Schema-Guided Induction of Monadic Queries.
ICGI 2008: 15-28 |
| 66 | | Manfred Schmidt-Schauß,
Joachim Niehren,
Jan Schwinghammer,
David Sabel:
Adequacy of Compositional Translations for Observational Semantics.
IFIP TCS 2008: 521-535 |
| 65 | | Jérôme Champavère,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
LATA 2008: 184-195 |
| 64 | | Olivier Gauwin,
Anne-Cécile Caron,
Joachim Niehren,
Sophie Tison:
Complexity of Earliest Query Answering with Streaming Tree Automata.
PLAN-X 2008 |
| 63 | | Marco Kuhlmann,
Joachim Niehren:
Logics and Automata for Totally Ordered Trees.
RTA 2008: 217-231 |
| 62 | | Olivier Gauwin,
Joachim Niehren,
Yves Roos:
Streaming tree automata.
Inf. Process. Lett. 109(1): 13-17 (2008) |
| 2007 |
|---|
| 61 | | Céline Kuttler,
Cédric Lhoussaine,
Joachim Niehren:
A Stochastic Pi Calculus for Concurrent Objects.
AB 2007: 232-246 |
| 60 | | Emmanuel Filiot,
Joachim Niehren,
Jean-Marc Talbot,
Sophie Tison:
Polynomial time fragments of XPath with variables.
PODS 2007: 205-214 |
| 59 | | Joachim Niehren,
David Sabel,
Manfred Schmidt-Schauß,
Jan Schwinghammer:
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.
Electr. Notes Theor. Comput. Sci. 173: 313-337 (2007) |
| 58 | | Katrin Erk,
Joachim Niehren:
Dominance constraints in stratified context unification.
Inf. Process. Lett. 101(4): 141-147 (2007) |
| 57 | | Wim Martens,
Joachim Niehren:
On the minimization of XML Schemas and tree automata for unranked trees.
J. Comput. Syst. Sci. 73(4): 550-583 (2007) |
| 56 | | Julien Carme,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Interactive learning of node selecting tree transducer.
Machine Learning 66(1): 33-67 (2007) |
| 2006 |
|---|
| 55 | | Aurélien Lemay,
Joachim Niehren,
Rémi Gilleron:
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
ICGI 2006: 253-267 |
| 54 |  | Emmanuel Filiot,
Joachim Niehren,
Jean-Marc Talbot,
Sophie Tison:
Composing Monadic Queries in Trees.
PLAN-X 2006: 61-70 |
| 53 | | Céline Kuttler,
Joachim Niehren:
Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch.
T. Comp. Sys. Biology: 24-55 (2006) |
| 52 | | Joachim Niehren,
Jan Schwinghammer,
Gert Smolka:
A concurrent lambda calculus with futures.
Theor. Comput. Sci. 364(3): 338-356 (2006) |
| 2005 |
|---|
| 51 | | Jordi Levy,
Joachim Niehren,
Mateu Villaret:
Well-Nested Context Unification.
CADE 2005: 149-163 |
| 50 | | Joachim Niehren,
Laurent Planque,
Jean-Marc Talbot,
Sophie Tison:
N-Ary Queries by Tree Automata.
DBPL 2005: 217-231 |
| 49 | | Wim Martens,
Joachim Niehren:
Minimizing Tree Automata for Unranked Trees.
DBPL 2005: 232-246 |
| 48 | | Joachim Niehren,
Tim Priesnitz,
Zhendong Su:
Complexity of Subtype Satisfiability over Posets.
ESOP 2005: 357-373 |
| 47 | | Joachim Niehren,
Laurent Planque,
Jean-Marc Talbot,
Sophie Tison:
N-ary Queries by Tree Automata.
Foundations of Semistructured Data 2005 |
| 46 | | Joachim Niehren,
Jan Schwinghammer,
Gert Smolka:
A Concurrent Lambda Calculus with Futures.
FroCos 2005: 248-263 |
| 45 | | Joachim Niehren,
Mateu Villaret:
Describing Lambda Terms in Context Unification.
LACL 2005: 221-237 |
| 2004 |
|---|
| 44 | | Ruth Fuchss,
Alexander Koller,
Joachim Niehren,
Stefan Thater:
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis.
ACL 2004: 247-254 |
| 43 | | Julien Carme,
Aurélien Lemay,
Joachim Niehren:
Learning Node Selecting Tree Transducer from Completely Annotated Examples.
ICGI 2004: 91-102 |
| 42 | | Ralph Debusmann,
Denys Duchier,
Joachim Niehren:
The XDG Grammar Development Kit.
MOZ 2004: 188-199 |
| 41 | | Julien Carme,
Joachim Niehren,
Marc Tommasi:
Querying Unranked Trees with Stepwise Tree Automata.
RTA 2004: 105-118 |
| 40 | | Manuel Bodirsky,
Denys Duchier,
Joachim Niehren,
Sebastian Miele:
A new algorithm for normal dominance constraints.
SODA 2004: 59-67 |
| 2003 |
|---|
| 39 | | Joachim Niehren,
Stefan Thater:
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints.
ACL 2003: 367-374 |
| 38 | | Katrin Erk,
Joachim Niehren:
Well-Nested Parallelism Constraints for Ellipsis Resolution.
EACL 2003: 115-122 |
| 37 | | Alexander Koller,
Joachim Niehren,
Stefan Thater:
Underspecification formalisms: Hole semantics as dominance constraints.
EACL 2003: 195-202 |
| 36 | | Joachim Niehren,
Tim Priesnitz:
Non-structural subtype entailment in automata theory.
Inf. Comput. 186(2): 319-354 (2003) |
| 35 | | Ernst Althaus,
Denys Duchier,
Alexander Koller,
Kurt Mehlhorn,
Joachim Niehren,
Sven Thiel:
An efficient graph algorithm for dominance constraints.
J. Algorithms 48(1): 194-219 (2003) |
| 2002 |
|---|
| 34 | | Joachim Niehren,
Mateu Villaret:
Parallelism and Tree Regular Constraints.
LPAR 2002: 311-326 |
| 33 | | Zhendong Su,
Alexander Aiken,
Joachim Niehren,
Tim Priesnitz,
Ralf Treinen:
The first-order theory of subtyping constraints.
POPL 2002: 203-216 |
| 2001 |
|---|
| 32 | | Manuel Bodirsky,
Katrin Erk,
Alexander Koller,
Joachim Niehren:
Underspecified Beta Reduction.
ACL 2001: 74-81 |
| 31 | | Manuel Bodirsky,
Katrin Erk,
Alexander Koller,
Joachim Niehren:
Beta Reduction Constraints.
RTA 2001: 31-46 |
| 30 | | Ernst Althaus,
Denys Duchier,
Alexander Koller,
Kurt Mehlhorn,
Joachim Niehren,
Sven Thiel:
An efficient algorithm for the configuration problem of dominance graphs.
SODA 2001: 815-824 |
| 29 | | Joachim Niehren,
Tim Priesnitz:
Non-structural Subtype Entailment in Automata Theory.
TACS 2001: 360-384 |
| 28 | | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The first-order theory of ordering constraints over feature trees.
Discrete Mathematics & Theoretical Computer Science 4(2): 193-234 (2001) |
| 27 | | Markus Egg,
Alexander Koller,
Joachim Niehren:
The Constraint Language for Lambda Structures.
Journal of Logic, Language and Information 10(4): 457-485 (2001) |
| 2000 |
|---|
| 26 | | Alexander Koller,
Kurt Mehlhorn,
Joachim Niehren:
A Polynomial-Time Fragment of Dominance Constraints.
ACL 2000 |
| 25 | | Alexander Koller,
Joachim Niehren:
On Underspecified Processing of Dynamic Semantics.
COLING 2000: 460-466 |
| 24 | | Denys Duchier,
Joachim Niehren:
Dominance Constraints with Set Operators.
Computational Logic 2000: 326-341 |
| 23 | | Katrin Erk,
Joachim Niehren:
Parallelism Constraints.
RTA 2000: 110-126 |
| 22 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
Constraints 5(1/2): 7-41 (2000) |
| 21 | | Alexander Koller,
Joachim Niehren,
Kristina Striegnitz:
Relaxing Underspecified Semantic Representations for Reinterpretation.
Grammars 3(2/3): 217-241 (2000) |
| 20 | | Martin Müller,
Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
Inf. Comput. 159(1-2): 22-58 (2000) |
| 19 | | Joachim Niehren,
Sophie Tison,
Ralf Treinen:
On rewrite constraints and context unification.
Inf. Process. Lett. 74(1-2): 35-40 (2000) |
| 18 | | Joachim Niehren:
Uniform confluence in concurrent computation.
J. Funct. Program. 10(5): 453-499 (2000) |
| 1999 |
|---|
| 17 | | Joachim Niehren,
Tim Priesnitz:
Entailment of Non-structural Subtype Constraints.
ASIAN 1999: 251-265 |
| 16 | | Joachim Niehren,
Martin Müller,
Jean-Marc Talbot:
Entailment of Atomic Set Constraints is PSPACE-Complete.
LICS 1999: 285-294 |
| 1998 |
|---|
| 15 | | Markus Egg,
Joachim Niehren,
Peter Ruhrberg,
Feiyu Xu:
Constraints over Lambda-Structures in Semantic Underspecification.
COLING-ACL 1998: 353-359 |
| 14 | | Alexander Koller,
Joachim Niehren,
Ralf Treinen:
Dominance Constraints: Algorithms and Complexity.
LACL 1998: 106-125 |
| 13 | | Joachim Niehren,
Alexander Koller:
Dominance Constraints in Context Unification.
LACL 1998: 199-218 |
| 12 | | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The First-Order Theory of Ordering Constraints over Feature Trees.
LICS 1998: 432-443 |
| 11 | | Martin Müller,
Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
RTA 1998: 196-210 |
| 1997 |
|---|
| 10 | | Joachim Niehren,
Manfred Pinkal,
Peter Ruhrberg:
A Uniform Approach to Underspecification and Parallelism.
ACL 1997: 410-417 |
| 9 | | Joachim Niehren,
Manfred Pinkal,
Peter Ruhrberg:
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting.
CADE 1997: 34-48 |
| 8 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
CP 1997: 297-311 |
| 7 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees.
TAPSOFT 1997: 345-356 |
| 1996 |
|---|
| 6 | | Joachim Niehren:
Functional Computation as Concurrent Computation.
POPL 1996: 333-343 |
| 1995 |
|---|
| 5 | | Joachim Niehren,
Martin Müller:
Constraints for Free in Concurrent Computation.
ASIAN 1995: 171-186 |
| 4 | | Martin Müller,
Joachim Niehren:
Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm
CoRR abs/cmp-lg/9506002: (1995) |
| 1994 |
|---|
| 3 | | Joachim Niehren,
Gert Smolka:
A Confluent Relational Calculus for Higher-Order Programming with Constraints.
CCL 1994: 89-104 |
| 1993 |
|---|
| 2 | | Joachim Niehren,
Andreas Podelski,
Ralf Treinen:
Equational and Membership Constraints for Finite Trees.
RTA 1993: 106-120 |
| 1 | | Joachim Niehren,
Andreas Podelski:
Feature Automata and Recognizable Sets of Feature Trees.
TAPSOFT 1993: 356-375 |
