Joachim Niehren

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 27

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Database Queries. Log. Methods Comput. Sci. 20 (1) (2024)
Antonio Al Serhali, Joachim Niehren
Earliest Query Answering for Deterministic Stepwise Hedge Automata. CIAA (2023)
Antonio Al Serhali, Joachim Niehren
Subhedge Projection for Stepwise Hedge Automata. FCT (2023)
Joachim Niehren, Cédric Lhoussaine, Athénaïs Vaginay
Core SBML and Its Formal Semantics. CMSB (2023)
Iovka Boneva, Joachim Niehren, Momar Sakho
Regular matching and inclusion on compressed tree patterns with constrained context variables. Inf. Comput. 286 (2022)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Queries. ICDT (2022)
Joachim Niehren, Sylvain Salvati, Rustam Azimov
Jumping Evaluation of Nested Regular Path Queries. ICLP Technical Communications / Doctoral Consortium (2022)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Database Queries. CoRR (2022)
Joachim Niehren, Athénaïs Vaginay, Cristian Versari
Abstract Simulation of Reaction Networks via Boolean Networks. CMSB (2022)
Joachim Niehren, Momar Sakho, Antonio Al Serhali
Schema-Based Automata Determinization. GandALF (2022)
Emilie Allart, Joachim Niehren, Cristian Versari
Computing difference abstractions of linear equation systems. Theor. Comput. Sci. 893 (2021)
Emilie Allart, Joachim Niehren, Cristian Versari
Exact Boolean Abstraction of Linear Equation Systems. Comput. 9 (11) (2021)
Joachim Niehren, Momar Sakho
Determinization and Minimization of Automata for Nested Words Revisited. Algorithms 14 (3) (2021)
Iovka Boneva, Joachim Niehren, Momar Sakho
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. CSR (2020)
Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
Logics for unordered trees with data constraints. J. Comput. Syst. Sci. 104 (2019)
Iovka Boneva, Joachim Niehren, Momar Sakho
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. LATA (2019)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Dependency Weighted Aggregation on Factorized Databases. CoRR (2019)
Emilie Allart, Joachim Niehren, Cristian Versari
Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints. CMSB (2019)
Iovka Boneva, Joachim Niehren, Momar Sakho
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams. RP (2018)
Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren
Simplification of Reaction Networks, Confluence and Elementary Modes. Comput. 5 (1) (2017)
Vincent Hugot, Adrien Boiret, Joachim Niehren
Equivalence of Symbolic Tree Transducers. DLT (2017)
Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
Automata for unordered trees. Inf. Comput. 253 (2017)
Tom Sebastian, Joachim Niehren
Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams. SOFSEM (2016)
Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques
Predicting changes of reaction networks with partial kinetic information. Biosyst. 149 (2016)
Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello
Structural simplification of chemical reaction networks in partial steady states. Biosyst. 149 (2016)
Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren
Normalizing Chemical Reaction Networks by Confluent Structural Simplification. CMSB (2016)
Adrien Boiret, Aurélien Lemay, Joachim Niehren
Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI (2016)
Pavel Labath, Joachim Niehren
A Uniform Programmning Language for Implementing XML Standards. SOFSEM (2015)
Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques
Qualitative Reasoning for Reaction Networks with Partial Kinetic Information. CMSB (2015)
Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
Logics for Unordered Trees with Data Constraints on Siblings. LATA (2015)
Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren
Structural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics. CMSB (2015)
Antoine Ndione, Aurélien Lemay, Joachim Niehren
Sublinear DTD Validity. LATA (2015)
Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer
Observational program calculi and the correctness of translations. Theor. Comput. Sci. 577 (2015)
Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578 (2015)
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
Learning Sequential Tree-to-Word Transducers. LATA (2014)
Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
Deterministic Automata for Unordered Trees. GandALF (2014)
Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren
Attractor Equivalence: An Observational Semantics for Reaction Networks. FMMB (2014)
Antoine Ndione, Aurélien Lemay, Joachim Niehren
Approximate membership for regular languages modulo the edit distance. Theor. Comput. Sci. 487 (2013)
Mathias John, Mirabelle Nebut, Joachim Niehren
Knockout Prediction for Reaction Networks with Partial Kinetic Information. VMCAI (2013)
Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
Early Nested Word Automata for XPath Query Answering on XML Streams. CIAA (2013)
Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron
Query induction with schema-guided pruning strategies. J. Mach. Learn. Res. 14 (1) (2013)
Adrien Boiret, Aurélien Lemay, Joachim Niehren
Learning Rational Functions. Developments in Language Theory (2012)
Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari
Biochemical Reaction Rules with Constraints. ESOP (2011)
Olivier Gauwin, Joachim Niehren
Streamable Fragments of Forward XPath. CIAA (2011)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Queries on Xml streams with bounded delay and concurrency. Inf. Comput. 209 (3) (2011)
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA (2011)
Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher
The Attributed Pi-Calculus with Priorities. Trans. Comp. Sys. Biology 12 (2010)
Aurélien Lemay, Sebastian Maneth, Joachim Niehren
A learning algorithm for top-down XML transformations. PODS (2010)
Mathias John, Cédric Lhoussaine, Joachim Niehren
-Calculus. CMSB (2009)
Joachim Niehren
Streaming Tree Automata and XPath. NCMA (2009)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Earliest Query Answering for Deterministic Nested Word Automata. FCT (2009)
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) (2009)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Bounded Delay and Concurrency for Earliest Query Answering. LATA (2009)
Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
Equivalence of Deterministic Nested Word to Word Transducers. FCT (2009)
Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher
The Attributed Pi Calculus. CMSB (2008)
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA (2008)
Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison
Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X (2008)
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Schema-Guided Induction of Monadic Queries. ICGI (2008)
Marco Kuhlmann, Joachim Niehren
Logics and Automata for Totally Ordered Trees. RTA (2008)
Olivier Gauwin, Joachim Niehren, Yves Roos
Streaming tree automata. Inf. Process. Lett. 109 (1) (2008)
Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel
Adequacy of Compositional Translations for Observational Semantics. IFIP TCS (2008)
Wim Martens, Joachim Niehren
On the minimization of XML Schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73 (4) (2007)
Céline Kuttler, Cédric Lhoussaine, Joachim Niehren
A Stochastic Pi Calculus for Concurrent Objects. AB (2007)
Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS (2007)
Katrin Erk, Joachim Niehren
Dominance constraints in stratified context unification. Inf. Process. Lett. 101 (4) (2007)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Polynomial time fragments of XPath with variables. PODS (2007)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Interactive learning of node selecting tree transducer. Mach. Learn. 66 (1) (2007)
Joachim Niehren, Jan Schwinghammer, Gert Smolka
A concurrent lambda calculus with futures. Theor. Comput. Sci. 364 (3) (2006)
Aurélien Lemay, Joachim Niehren, Rémi Gilleron
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI (2006)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Composing Monadic Queries in Trees. PLAN-X (2006)
Céline Kuttler, Joachim Niehren
Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch. Trans. Comp. Sys. Biology 7 (2006)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-Ary Queries by Tree Automata. DBPL (2005)
Wim Martens, Joachim Niehren
Minimizing Tree Automata for Unranked Trees. DBPL (2005)
Joachim Niehren, Jan Schwinghammer, Gert Smolka
A Concurrent Lambda Calculus with Futures. FroCoS (2005)
Joachim Niehren, Tim Priesnitz, Zhendong Su
Complexity of Subtype Satisfiability over Posets. ESOP (2005)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-ary Queries by Tree Automata. Foundations of Semistructured Data (2005)
Jordi Levy, Joachim Niehren, Mateu Villaret
Well-Nested Context Unification. CADE (2005)
Joachim Niehren, Mateu Villaret
Describing Lambda Terms in Context Unification. LACL (2005)
Julien Carme, Joachim Niehren, Marc Tommasi
Querying Unranked Trees with Stepwise Tree Automata. RTA (2004)
Ralph Debusmann, Denys Duchier, Joachim Niehren
The XDG Grammar Development Kit. MOZ (2004)
Julien Carme, Aurélien Lemay, Joachim Niehren
Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI (2004)
Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele
A new algorithm for normal dominance constraints. SODA (2004)
Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. ACL (2004)
Joachim Niehren, Stefan Thater
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. ACL (2003)
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
An efficient graph algorithm for dominance constraints. J. Algorithms 48 (1) (2003)
Alexander Koller, Joachim Niehren, Stefan Thater
Underspecification formalisms: Hole semantics as dominance constraints. EACL (2003)
Katrin Erk, Joachim Niehren
Well-Nested Parallelism Constraints for Ellipsis Resolution. EACL (2003)
Joachim Niehren, Tim Priesnitz
Non-structural subtype entailment in automata theory. Inf. Comput. 186 (2) (2003)
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen
The first-order theory of subtyping constraints. POPL (2002)
Joachim Niehren, Mateu Villaret
Parallelism and Tree Regular Constraints. LPAR (2002)
Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
Underspecified Beta Reduction. ACL (2001)
Joachim Niehren, Tim Priesnitz
Non-structural Subtype Entailment in Automata Theory. TACS (2001)
Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
An efficient algorithm for the configuration problem of dominance graphs. SODA (2001)
Martin Müller, Joachim Niehren, Ralf Treinen
The first-order theory of ordering constraints over feature trees. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
Beta Reduction Constraints. RTA (2001)
Markus Egg, Alexander Koller, Joachim Niehren
The Constraint Language for Lambda Structures. J. Log. Lang. Inf. 10 (4) (2001)
Martin Müller, Joachim Niehren
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. Inf. Comput. 159 (1-2) (2000)
Joachim Niehren
Uniform confluence in concurrent computation. J. Funct. Program. 10 (5) (2000)
Alexander Koller, Joachim Niehren
On Underspecified Processing of Dynamic Semantics. COLING (2000)
Joachim Niehren, Sophie Tison, Ralf Treinen
On rewrite constraints and context unification. Inf. Process. Lett. 74 (1-2) (2000)

Joachim Niehren.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joachim Niehren