Query database
Add entry by form
Add entry in bibtex format
Edit entries
Show variables

BibTex

Joachim Niehren s Publications

International Journals

  1. [2010] Olivier Gauwin and Joachim Niehren and Sophie Tison, Queries on XML Streams with Bounded Delay and Concurrency, Information and Computation
  2. [2010] Mathias John and Cédric Lhoussaine and Joachim Niehren and Adelinde Uhrmacher, The Attributed Pi Calculus with Priorities, Transactions on Computational Systems Biology XII 5945, 13-76
  3. [2009] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas, Information and Computation 11 207, 1181--1208
  4. [2008] Olivier Gauwin and Joachim Niehren and Yves Roos, Streaming Tree Automata, Information Processing Letters 1 109, 13-17
  5. [2007] Wim Martens and Joachim Niehren, On the Minimization of XML Schemas and Tree Automata for Unranked Trees, Journal of Computer and System Science 4 73, 550-583
  6. [2007] Katrin Erk and Joachim Niehren, Dominance Constraints in Stratified Context Unification, Information Processing Letters 4 101, 141-147
  7. [2007] Julien Carme and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Interactive Learning of Node Selecting Tree Transducers, Machine Learning 1 66, 33--67
  8. [2006] Joachim Niehren and Jan Schwinghammer and Gert Smolka, A Concurrent Lambda Calculus with Futures, Theoretical Computer Science 3 364, 338-356
  9. [2006] Céline Kuttler and Joachim Niehren, Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch, Transactions on Computational Systems Biology VII 4220, 24-55
  10. [2003] Joachim Niehren and Tim Priesnitz, Non-Structural Subtype Entailment in Automata Theory, Information and Computation 2 169, 319-354
  11. [2003] Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel, An Efficient Graph Algorithm for Dominance Constraints, Algorithms 1 48, 194--219
  12. [2002] Katrin Erk and Alexander Koller and Joachim Niehren, Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures, Journal of Research on Language and Computation 1 1, 127--169
  13. [2001] Martin Müller and Joachim Niehren and Ralf Treinen, The First-Order Theory of Ordering Constraints over Feature Trees, Discrete Mathematics and Theoretical Computer Science 2 4, 193-234
  14. [2001] Markus Egg and Alexander Koller and Joachim Niehren, The Constraint Language for Lambda Structures, Journal of Logic, Language and Information 10, 457-485
  15. [2000] Martin Müller and Joachim Niehren, Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic, Information and Computation 1/2 159, 22--58
  16. [2000] Martin Müller and Joachim Niehren and Andreas Podelski, Ordering Constraints over Feature Trees, Constraints, an International Journal 1--2 5, 7--42
  17. [2000] Joachim Niehren, Uniform Confluence in Concurrent Computation, Journal of Functional Programming 5 10, 453-499
  18. [2000] Joachim Niehren and Ralf Treinen and Sophie Tison, On Rewrite Constraints and Context Unification, Information Processing Letters 1-2 74, 35--40
  19. [2000] Alexander Koller and Joachim Niehren and Kristina Striegnitz, Relaxing Underspecified Semantic Representations for Reinterpretation, Grammars 2/3 3, 217-241

International Conferences

  1. [2010] Aurélien Lemay and Sebastian Maneth and Joachim Niehren, A Learning Algorithm for Top-Down XML Transformations, 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 285-296
  2. [2009] Slawek Staworko and Grégoire Laurence and Aurélien Lemay and Joachim Niehren, Equivalence of Nested Word to Word Transducers, 17th International Symposium on Fundamentals of Computer Theory, Lecture Notes in Computer Science 5699, 310-322
  3. [2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Earliest Query Answering for Deterministic Nested Word Automata, 17th International Symposium on Fundamentals of Computer Theory, Lecture Notes in Computer Science 5699, 121--132
  4. [2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Bounded Delay and Concurrency for Earliest Query Answering, 3rd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5457, 350-361
  5. [2009] Mathias John and Cédric Lhoussaine and Joachim Niehren, Dynamic Compartments in the Imperative Pi Calculus, Computational Methods in Systems Biology, 7th International Conference, Lecture Notes in Computer Science 5688, 235-250
  6. [2008] Mathias John and Cédric Lhoussaine and Joachim Niehren and Adelinde Uhrmacher, The Attributed Pi Calculus, Computational Methods in Systems Biology, 6th International Conference, Lecture Notes in Computer Science 5307, 83-102
  7. [2008] Marco Kuhlmann and Joachim Niehren, Logics and Automata for Totally Ordered Trees, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117, 217-231
  8. [2008] Manfred Schmidt-Schauß and Joachim Niehren and David Sabel and Jan Schwinghammer, Adequacy of Compositional Translations for Observational Semantics, 5th IFIP International Conference on Theoretical Computer Science 273, 521-535
  9. [2008] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Schema-Guided Induction of Monadic Queries, 9th International Colloquium on Grammatical Inference, Lecture Notes in Computer Science 5278, 15-28
  10. [2008] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Efficient Inclusion Checking for Deterministic Tree Automata and DTDs, 2nd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5196, 184--195
  11. [2007] Joachim Niehren and David Sabel and Manfred Schmidt-Schauß and Jan Schwinghammer, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, 23rd Conference on Mathematical Foundations of Programming Semantics, Electronical notes in theoretical computer science 173, 313-337
  12. [2007] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Polynomial Time Fragments of XPath with Variables, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205-214
  13. [2007] Céline Kuttler and Cédric Lhoussaine and Joachim Niehren, A Stochastic Pi Calculus for Concurrent Objects, Second International Conference on Algebraic Biology, Lecture Notes in Computer Science 4545, 232-246
  14. [2006] Aurélien Lemay and Joachim Niehren and Rémi Gilleron, Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples, International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 4201, 253-267
  15. [2005] Wim Martens and Joachim Niehren, Minimizing Tree Automata for Unranked Trees, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 232--246
  16. [2005] Jordi Levy and Joachim Niehren and Mateu Villaret, Well-nested Context Unification, 20th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 3632, 149-163
  17. [2005] Joachim Niehren and Tim Priesnitz and Zhendong Su, Complexity of Subtype Satisfiability over Posets, 14th European Symposium on Programming, Lecture Notes in Computer Science 3444, 357-373
  18. [2005] Joachim Niehren and Mateu Villaret, Describing Lambda Terms in Context Unification, 5th International Conference on Logical Aspects in Computational Linguistics, Lecture Notes in Artificial Intelligence 3492, 221-237
  19. [2005] Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison, N-ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 217--231
  20. [2004] Ruth Fuchss and Alexander Koller and Joachim Niehren and Stefan Thater, Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis, 42th Meeting of the Association for Computational Linguistics, 247-254
  21. [2004] Ralph Debusmann and Denys Duchier and Joachim Niehren, The XDG Grammar Development Kit, 2nd International Conference on Multiparadigm Programming in Mozart/Oz, Lecture Notes in Artificial Intelligence 3389, 190--201
  22. [2004] Manuel Bodirsky and Denys Duchier and Sebastian Miele and Joachim Niehren, A New Algorithm for Normal Dominance Constraints, ACM-SIAM Symposium on Discrete Algorithms, 54-78
  23. [2004] Julien Carme and Joachim Niehren and Marc Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3091, 105--118
  24. [2004] Julien Carme and Aurélien Lemay and Joachim Niehren, Learning Node Selecting Tree Transducer from Completely Annotated Examples, 7th International Colloquium on Grammatical Inference, Lecture Notes in Artificial Intelligence 3264, 91--102
  25. [2003] Katrin Erk and Joachim Niehren, Well-Nested Parallelism Constraints for Ellipsis Resolution, 11th Conference of the European Chapter of the Association of Computational Linguistics, 115--122
  26. [2003] Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints, 41st Meeting of the Association of Computational Linguistics, 367-374
  27. [2003] Alexander Koller and Joachim Niehren and Stefan Thater, Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints, Meeting of the European Chapter of the Association of Computational Linguistics, 195-202
  28. [2002] Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen, First-Order Theory of Subtyping Constraints, The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
  29. [2002] Joachim Niehren and Mateu Villaret, Parallelism and Tree Regular Constraints, International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Artificial Intelligence 2514, 311--326
  30. [2001] Manuel Bodirsky and Katrin Erk and Alexander Koller and Joachim Niehren, Underspecified Beta Reduction, 39th Annual Meeting of the Association for Computational Linguistics, 74-81
  31. [2001] Manuel Bodirsky and Katrin E. Erk and Alexander Koller and Joachim Niehren, Beta Reduction Constraints, International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, 31-46
  32. [2001] Joachim Niehren and Tim Priesnitz, Non-Structural Subtype Entailment in Automata Theory, Fourth International Symposium on Theoretical Aspects of Computer Software (TACS2001), 360--384
  33. [2001] Joachim Niehren and Alexander Koller, Dominance Constraints in Context Unification, Proceedings of the 3rd International Conference on Logical Aspects of Computational Linguistics (Dec. 1998, Grenoble, France), Lecture Notes in Computer Science 2014, 199-218
  34. [2001] Ernst Althaus and Denys Duchier and Alexander Koller and Kurt Mehlhorn and Joachim Niehren and Sven Thiel, An Efficient Algorithm for the Configuration Problem of Dominance Graphs, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 815--824
  35. [2001] Alexander Koller and Joachim Niehren and Ralf Treinen, Dominance Constraints: Algorithms and Complexity, Third International Conference on Logical Aspects of Computational Linguistics (Dec. 1998, Grenoble, France), Lecture Notes in Computer Science 2014, 106-125
  36. [2000] Katrin E. Erk and Joachim Niehren, Parallelism Constraints, International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1833, 110--126
  37. [2000] Denys Duchier and Joachim Niehren, Dominance Constraints with Set Operators, Proceedings of the First International Conference on Computational Logic (CL2000), Lecture Notes in Computer Science 1861, 326-341
  38. [2000] Alexander Koller and Kurt Mehlhorn and Joachim Niehren, A Polynomial-Time Fragment of Dominance Constraints, 38th Annual Meeting of the Association of Computational Linguistics, 368--375
  39. [2000] Alexander Koller and Joachim Niehren, On Underspecified Processing of Dynamic Semantics, 18th International Conference on Computational Linguistics, 460--466
  40. [1999] Martin Müller and Joachim Niehren and Jean-Marc Talbot, Entailment of Atomic Set Constraints is PSPACE-Complete, Fourteenth Annual IEEE Symposium on Logic in Computer Sience, 285--294
  41. [1999] Joachim Niehren and Tim Priesnitz, Entailment of Non-Structural Subtype Constraints, Asian Computing Science Conference, Lecture Notes in Computer Science 1742, 251--265
  42. [1999] Alexander Koller and Joachim Niehren and Kristina Striegnitz, Relaxing Underspecified Semantic Representations for Reinterpretation, 6th Meeting on Mathematics of Language, 74--87
  43. [1998] Martin Müller and Joachim Niehren, Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic, 9th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1379, 196--210
  44. [1998] Martin Müller and Joachim Niehren and Ralf Treinen, The First-Order Theory of Ordering Constraints over Feature Trees, 13th annual IEEE Symposium on Logic in Computer Sience, 432--443
  45. [1998] Markus Egg and Joachim Niehren and Peter Ruhrberg and Feiyu Xu, Constraints over Lambda-Structures in Semantic Underspecification, Joined 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98), 353--359
  46. [1997] Martin Müller and Joachim Niehren and Andreas Podelski, Inclusion Constraints over Non-Empty Sets of Trees, Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, Lecture Notes in Computer Science 1214, 217-231
  47. [1997] Martin Müller and Joachim Niehren and Andreas Podelski, Ordering Constraints over Feature Trees, 3rd International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 1330, 297--311
  48. [1997] Joachim Niehren and Manfred Pinkal and Peter Ruhrberg, On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting, Proceedings of the International Conference on Automated Deduction, Lecture Notes in Computer Science 1249, 34-48
  49. [1997] Joachim Niehren and Manfred Pinkal and Peter Ruhrberg, A Uniform Approach to Underspecification and Parallelism, 35th Annual Meeting of the Association of Computational Linguistics, 410-417
  50. [1996] Joachim Niehren, Functional Computation as Concurrent Computation, 23th Proceedings of the ACM Symposium on Principles of Programming Languages, 333--343
  51. [1995] Martin Müller and Joachim Niehren, Constraints for Free in Concurrent Computation, Asian Computing Science Conference, Lecture Notes in Computer Science 1023, 171--186
  52. [1994] Joachim Niehren and Gert Smolka, A Confluent Relational Calculus for Higher-Order Programming with Constraints, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science 845
  53. [1993] Joachim Niehren and Andreas Podelski, Feature Automata and Recognizable Sets of Feature Trees, TAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP/FASE/TOOLS., Lecture Notes in Computer Science 668, 356--375
  54. [1993] Joachim Niehren and Andreas Podelski and Ralf Treinen, Equational and Membership Constraints for Infinite Trees, Proceedings. Fifth International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, 106-120

International Workshops

  1. [2009] Jan Schwinghammer and David Sabel and Manfred Schmidt-Schauss and Joachim Niehren, Correctly Translating Concurrency Primitives, Workshop on ML, 27-38
  2. [2008] Olivier Gauwin and Anne-Cécile Caron and Joachim Niehren and Sophie Tison, Complexity of Earliest Query Answering with Streaming Tree Automata, ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X)
  3. [2007] Jérôme Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Towards Schema-Guided XML Query Induction, ICML-2007 Workshop on Challenges and Applications of Grammar Induction
  4. [2006] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Composing Monadic Queries in Trees, PLAN-X International Workshop, 61--70
  5. [2006] Céline Kuttler and Cédric Lhoussaine and Joachim Niehren, A Stochastic Pi Calculus for Concurrent Objects, 1st International Workshop on Probabilistic Automata and Logics
  6. [2005] Julien Carme and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Interactive Learning of Node Selecting Tree Transducer, IJCAI Workshop on Grammatical Inference
  7. [2005] Joachim Niehren and Jan Schwinghammer and Gert Smolka, A Concurrent Lambda Calculus with Futures, 5th International Workshop on Frontiers in Combining Systems, Lecture Notes in Artificial Intelligence 3717, 248-263

Books or Book Chapters

  1. [2002] Alexander Koller and Joachim Niehren, Constraint Programming in Computational Linguistics, Words, Proofs, and Dialog 141, 95-122
  2. [1999] Alexander Koller and Joachim Niehren, Scope Underspecification and Processing, Reader for the ESSLLI summer school.
  3. [1998] Denys Duchier and Claire Gardent and Joachim Niehren, Concurrent Constraint Programming in Oz for Natural Language Processing

Phd and Habilitation thesis

  1. [1994] Joachim Niehren, Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen, Universität des Saarlandes, Fachbereich Informatik

Others

  1. [2010] Olivier Gauwin and Joachim Niehren, Streamable Fragments of Forward XPath
  2. [2010] Jérome Champavère and Rémi Gilleron and Aurélien Lemay and Joachim Niehren, Schema-Guided Query Induction, Journal of Machine Learning Research
  3. [2006] Zhendong Su and Alexander Aiken and Joachim Niehren and Tim Priesnitz and Ralf Treinen, First-Order Theory of Subtyping Constraints, ACM Transactions on Programming Languages and Systems





Valid HTML 4.01! Valid CSS!