The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joachim Niehren: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  61. The Attributed Pi Calculus. [Citation Graph (, )][DBLP]


  62. Dynamic Compartments in the Imperative pi-Calculus. [Citation Graph (, )][DBLP]


  63. Equivalence of Deterministic Nested Word to Word Transducers. [Citation Graph (, )][DBLP]


  64. Earliest Query Answering for Deterministic Nested Word Automata. [Citation Graph (, )][DBLP]


  65. Schema-Guided Induction of Monadic Queries. [Citation Graph (, )][DBLP]


  66. Adequacy of Compositional Translations for Observational Semantics. [Citation Graph (, )][DBLP]


  67. Complexity of Earliest Query Answering with Streaming Tree Automata. [Citation Graph (, )][DBLP]


  68. A learning algorithm for top-down XML transformations. [Citation Graph (, )][DBLP]


  69. Logics and Automata for Totally Ordered Trees. [Citation Graph (, )][DBLP]


  70. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. [Citation Graph (, )][DBLP]


  71. Bounded Delay and Concurrency for Earliest Query Answering. [Citation Graph (, )][DBLP]


  72. Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002