Joachim Niehren

According to our database, Joachim Niehren authored at least 117 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Complete Subhedge Projection for Stepwise Hedge Automata.

Antonio Al Serhali, Joachim Niehren

Algorithms, August, 2024

Linear Programs with Conjunctive Database Queries.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

Log. Methods Comput. Sci., 2024

2023

Earliest Query Answering for Deterministic Stepwise Hedge Automata.

Antonio Al Serhali, Joachim Niehren

Proceedings of the Implementation and Application of Automata, 2023

Subhedge Projection for Stepwise Hedge Automata.

Antonio Al Serhali, Joachim Niehren

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Core SBML and Its Formal Semantics.

Joachim Niehren, Cédric Lhoussaine, Athénaïs Vaginay

Proceedings of the Computational Methods in Systems Biology, 2023

2022

Regular matching and inclusion on compressed tree patterns with constrained context variables.

Iovka Boneva, Joachim Niehren, Momar Sakho

Inf. Comput., 2022

Schema-Based Automata Determinization.

Joachim Niehren, Momar Sakho, Antonio Al Serhali

Proceedings of the 13th International Symposium on Games, 2022

Jumping Evaluation of Nested Regular Path Queries.

Joachim Niehren, Sylvain Salvati, Rustam Azimov

Proceedings of the Proceedings 38th International Conference on Logic Programming, 2022

Linear Programs with Conjunctive Queries.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

Proceedings of the 25th International Conference on Database Theory, 2022

Abstract Simulation of Reaction Networks via Boolean Networks.

Joachim Niehren, Athénaïs Vaginay, Cristian Versari

Proceedings of the Computational Methods in Systems Biology, 2022

2021

Computing difference abstractions of linear equation systems.

Emilie Allart, Joachim Niehren, Cristian Versari

Theor. Comput. Sci., 2021

Exact Boolean Abstraction of Linear Equation Systems.

Emilie Allart, Joachim Niehren, Cristian Versari

Comput., 2021

Determinization and Minimization of Automata for Nested Words Revisited.

Joachim Niehren, Momar Sakho

Algorithms, 2021

2020

Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata.

Iovka Boneva, Joachim Niehren, Momar Sakho

Proceedings of the Computer Science - Theory and Applications, 2020

2019

Logics for unordered trees with data constraints.

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

J. Comput. Syst. Sci., 2019

Dependency Weighted Aggregation on Factorized Databases.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

CoRR, 2019

Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables.

Iovka Boneva, Joachim Niehren, Momar Sakho

Proceedings of the Language and Automata Theory and Applications, 2019

Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints.

Emilie Allart, Joachim Niehren, Cristian Versari

Proceedings of the Computational Methods in Systems Biology, 2019

2018

Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams.

Iovka Boneva, Joachim Niehren, Momar Sakho

Proceedings of the Reachability Problems - 12th International Conference, 2018

2017

Automata for unordered trees.

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

Inf. Comput., 2017

Simplification of Reaction Networks, Confluence and Elementary Modes.

Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren

Comput., 2017

Equivalence of Symbolic Tree Transducers.

Vincent Hugot, Adrien Boiret, Joachim Niehren

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Predicting changes of reaction networks with partial kinetic information.

Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques

Biosyst., 2016

Structural simplification of chemical reaction networks in partial steady states.

Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello

Biosyst., 2016

Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams.

Tom Sebastian, Joachim Niehren

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Learning Top-Down Tree Transducers with Regular Domain Inspection.

Adrien Boiret, Aurélien Lemay, Joachim Niehren

Proceedings of the 13th International Conference on Grammatical Inference, 2016

Normalizing Chemical Reaction Networks by Confluent Structural Simplification.

Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren

Proceedings of the Computational Methods in Systems Biology, 2016

2015

Observational program calculi and the correctness of translations.

Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer

Theor. Comput. Sci., 2015

Early nested word automata for XPath query answering on XML streams.

Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui

Theor. Comput. Sci., 2015

A Uniform Programmning Language for Implementing XML Standards.

Pavel Labath, Joachim Niehren

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Sublinear DTD Validity.

Antoine Ndione, Aurélien Lemay, Joachim Niehren

Proceedings of the Language and Automata Theory and Applications, 2015

Logics for Unordered Trees with Data Constraints on Siblings.

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

Proceedings of the Language and Automata Theory and Applications, 2015

Qualitative Reasoning for Reaction Networks with Partial Kinetic Information.

Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques

Proceedings of the Computational Methods in Systems Biology, 2015

Structural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics.

Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren

Proceedings of the Computational Methods in Systems Biology, 2015

2014

Deterministic Automata for Unordered Trees.

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Learning Sequential Tree-to-Word Transducers.

Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi

Proceedings of the Language and Automata Theory and Applications, 2014

Attractor Equivalence: An Observational Semantics for Reaction Networks.

Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren

Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

2013

Approximate membership for regular languages modulo the edit distance.

Antoine Ndione, Aurélien Lemay, Joachim Niehren

Theor. Comput. Sci., 2013

Query induction with schema-guided pruning strategies.

Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron

J. Mach. Learn. Res., 2013

Knockout Prediction for Reaction Networks with Partial Kinetic Information.

Mathias John, Mirabelle Nebut, Joachim Niehren

Proceedings of the Verification, 2013

2012

Learning Rational Functions.

Adrien Boiret, Aurélien Lemay, Joachim Niehren

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Queries on Xml streams with bounded delay and concurrency.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Inf. Comput., 2011

Streamable Fragments of Forward XPath.

Olivier Gauwin, Joachim Niehren

Proceedings of the Implementation and Application of Automata, 2011

Normalization of Sequential Top-Down Tree-to-Word Transducers.

Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi

Proceedings of the Language and Automata Theory and Applications, 2011

Biochemical Reaction Rules with Constraints.

Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari

Proceedings of the Programming Languages and Systems, 2011

2010

The Attributed Pi-Calculus with Priorities.

Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher

Trans. Comp. Sys. Biology, 2010

A learning algorithm for top-down XML transformations.

Aurélien Lemay, Sebastian Maneth, Joachim Niehren

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

Efficient inclusion checking for deterministic tree automata and XML Schemas.

Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren

Inf. Comput., 2009

Streaming Tree Automata and XPath.

Joachim Niehren

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Bounded Delay and Concurrency for Earliest Query Answering.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Proceedings of the Language and Automata Theory and Applications, 2009

Equivalence of Deterministic Nested Word to Word Transducers.

Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Earliest Query Answering for Deterministic Nested Word Automata.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Dynamic Compartments in the Imperative <i>pi</i>-Calculus.

Mathias John, Cédric Lhoussaine, Joachim Niehren

Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

2008

Streaming tree automata.

Olivier Gauwin, Joachim Niehren, Yves Roos

Inf. Process. Lett., 2008

Logics and Automata for Totally Ordered Trees.

Marco Kuhlmann, Joachim Niehren

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Complexity of Earliest Query Answering with Streaming Tree Automata.

Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison

Proceedings of the PLAN-X 2008, 2008

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.

Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren

Proceedings of the Language and Automata Theory and Applications, 2008

Adequacy of Compositional Translations for Observational Semantics.

Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Schema-Guided Induction of Monadic Queries.

Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

The Attributed Pi Calculus.

Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher

Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

2007

Interactive learning of node selecting tree transducer.

Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren

Mach. Learn., 2007

On the minimization of XML Schemas and tree automata for unranked trees.

Wim Martens, Joachim Niehren

J. Comput. Syst. Sci., 2007

Dominance constraints in stratified context unification.

Katrin Erk, Joachim Niehren

Inf. Process. Lett., 2007

Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.

Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer

Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Polynomial time fragments of XPath with variables.

Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

A Stochastic Pi Calculus for Concurrent Objects.

Céline Kuttler, Cédric Lhoussaine, Joachim Niehren

Proceedings of the Algebraic Biology, Second International Conference, 2007

2006

Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch.

Céline Kuttler, Joachim Niehren

Trans. Comp. Sys. Biology, 2006

A concurrent lambda calculus with futures.

Joachim Niehren, Jan Schwinghammer, Gert Smolka

Theor. Comput. Sci., 2006

Composing Monadic Queries in Trees.

Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison

Proceedings of the PLAN-X 2006 Informal Proceedings, 2006

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.

Aurélien Lemay, Joachim Niehren, Rémi Gilleron

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005

Describing Lambda Terms in Context Unification.

Joachim Niehren, Mateu Villaret

Proceedings of the Logical Aspects of Computational Linguistics, 2005

Complexity of Subtype Satisfiability over Posets.

Joachim Niehren, Tim Priesnitz, Zhendong Su

Proceedings of the Programming Languages and Systems, 2005

N-Ary Queries by Tree Automata.

Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison

Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Minimizing Tree Automata for Unranked Trees.

Wim Martens, Joachim Niehren

Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Well-Nested Context Unification.

Jordi Levy, Joachim Niehren, Mateu Villaret

Proceedings of the Automated Deduction, 2005

2004

A new algorithm for normal dominance constraints.

Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Querying Unranked Trees with Stepwise Tree Automata.

Julien Carme, Joachim Niehren, Marc Tommasi

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

The XDG Grammar Development Kit.

Ralph Debusmann, Denys Duchier, Joachim Niehren

Proceedings of the Multiparadigm Programming in Mozart/Oz, Second International Conference, 2004

Learning Node Selecting Tree Transducer from Completely Annotated Examples.

Julien Carme, Aurélien Lemay, Joachim Niehren

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis.

Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater

Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

2003

An efficient graph algorithm for dominance constraints.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

J. Algorithms, 2003

Non-structural subtype entailment in automata theory.

Joachim Niehren, Tim Priesnitz

Inf. Comput., 2003

Underspecification formalisms: Hole semantics as dominance constraints.

Alexander Koller, Joachim Niehren, Stefan Thater

Proceedings of the EACL 2003, 2003

Well-Nested Parallelism Constraints for Ellipsis Resolution.

Katrin Erk, Joachim Niehren

Proceedings of the EACL 2003, 2003

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints.

Joachim Niehren, Stefan Thater

Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003

2002

The first-order theory of subtyping constraints.

Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen

Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Parallelism and Tree Regular Constraints.

Joachim Niehren, Mateu Villaret

Proceedings of the Logic for Programming, 2002

2001

The Constraint Language for Lambda Structures.

Markus Egg, Alexander Koller, Joachim Niehren

J. Log. Lang. Inf., 2001

The first-order theory of ordering constraints over feature trees.

Martin Müller, Joachim Niehren, Ralf Treinen

Discret. Math. Theor. Comput. Sci., 2001

An efficient algorithm for the configuration problem of dominance graphs.

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Beta Reduction Constraints.

Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Underspecified Beta Reduction.

Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren

Proceedings of the Association for Computational Linguistic, 2001

2000

Uniform confluence in concurrent computation.

Joachim Niehren

J. Funct. Program., 2000

On rewrite constraints and context unification.

Joachim Niehren, Sophie Tison, Ralf Treinen

Inf. Process. Lett., 2000

Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.

Martin Müller, Joachim Niehren

Inf. Comput., 2000

Relaxing Underspecified Semantic Representations for Reinterpretation.

Alexander Koller, Joachim Niehren, Kristina Striegnitz

Grammars, 2000

Ordering Constraints over Feature Trees.

Martin Müller, Joachim Niehren, Andreas Podelski

Constraints An Int. J., 2000

Parallelism Constraints.

Katrin Erk, Joachim Niehren

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

On Underspecified Processing of Dynamic Semantics.

Alexander Koller, Joachim Niehren

Proceedings of the COLING 2000, 18th International Conference on Computational Linguistics, Proceedings of the Conference, 2 Volumes, July 31, 2000

Dominance Constraints with Set Operators.

Denys Duchier, Joachim Niehren

Proceedings of the Computational Logic, 2000

A Polynomial-Time Fragment of Dominance Constraints.

Alexander Koller, Kurt Mehlhorn, Joachim Niehren

Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, 2000

1999

Entailment of Atomic Set Constraints is PSPACE-Complete.

Joachim Niehren, Martin Müller, Jean-Marc Talbot

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Entailment of Non-structural Subtype Constraints.

Joachim Niehren, Tim Priesnitz

Proceedings of the Advances in Computing Science, 1999

1998

Dominance Constraints in Context Unification.

Joachim Niehren, Alexander Koller

Proceedings of the Logical Aspects of Computational Linguistics, 1998

Dominance Constraints: Algorithms and Complexity.

Alexander Koller, Joachim Niehren, Ralf Treinen

Proceedings of the Logical Aspects of Computational Linguistics, 1998

Constraints over Lambda-Structures in Semantic Underspecification.

Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu Xu

Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, 1998

1997

Inclusion Constraints over Non-empty Sets of Trees.

Martin Müller, Joachim Niehren, Andreas Podelski

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting.

Joachim Niehren, Manfred Pinkal, Peter Ruhrberg

Proceedings of the Automated Deduction, 1997

A Uniform Approach to Underspecification and Parallelism.

Joachim Niehren, Manfred Pinkal, Peter Ruhrberg

Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, 1997

1996

Functional Computation as Concurrent Computation.

Joachim Niehren

Proceedings of the Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996

1995

Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm

Martin Müller, Joachim Niehren

CoRR, 1995

Constraints for Free in Concurrent Computing.

Joachim Niehren, Martin Müller

Proceedings of the First International Workshop on Concurrent Constraint Programming, 1995

Constraints for Free in Concurrent Computation.

Joachim Niehren, Martin Müller

Proceedings of the Algorithms, 1995

1994

Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen.

Joachim Niehren

PhD thesis, 1994

A Confluent Relational Calculus for Higher-Order Programming with Constraints.

Joachim Niehren, Gert Smolka

Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993

Feature Automata and Recognizable Sets of Feature Trees.

Joachim Niehren, Andreas Podelski

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Equational and Membership Constraints for Finite Trees.

Joachim Niehren, Andreas Podelski, Ralf Treinen

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993