BibTex


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. [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
  3. [2008] Olivier Gauwin and Joachim Niehren and Yves Roos, Streaming Tree Automata, Information Processing Letters 1 109, 13-17
  4. [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
  5. [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
  6. [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

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. [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
  6. [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
  7. [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
  8. [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
  9. [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
  10. [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
  11. [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
  12. [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
  13. [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
  14. [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
  15. [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
  16. [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
  17. [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

International Workshops

  1. [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)
  2. [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
  3. [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

Others

  1. [2010] Olivier Gauwin and Joachim Niehren, Streamable Fragments of Forward XPath
  2. [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!