Joachim Niehren

127 papers A* 13A 8B 9C 12Misc 1Journal 36Unranked 45

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Complete Subhedge Projection for Stepwise Hedge Automata. Algorithms Antonio Al Serhali, Joachim Niehren
2024	J	`jnl`	Linear Programs with Conjunctive Database Queries. Log. Methods Comput. Sci. Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2023	—	`ed.`	Computational Methods in Systems Biology - 21st International Conference, CMSB 2023, Luxembourg City, Luxembourg, September 13-15, 2023, Proceedings CMSB Jun Pang, Joachim Niehren
2023	—	`conf`	Core SBML and Its Formal Semantics. CMSB Joachim Niehren, Cédric Lhoussaine, Athénaïs Vaginay
2023	C	`conf`	Earliest Query Answering for Deterministic Stepwise Hedge Automata. CIAA Antonio Al Serhali, Joachim Niehren
2023	B	`conf`	Subhedge Projection for Stepwise Hedge Automata. FCT Antonio Al Serhali, Joachim Niehren
2022	—	`conf`	Abstract Simulation of Reaction Networks via Boolean Networks. CMSB Joachim Niehren, Athénaïs Vaginay, Cristian Versari
2022	—	`conf`	Jumping Evaluation of Nested Regular Path Queries. ICLP Technical Communications / Doctoral Consortium Joachim Niehren, Sylvain Salvati, Rustam Azimov
2022	J	`jnl`	Linear Programs with Conjunctive Database Queries. CoRR Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2022	A	`conf`	Linear Programs with Conjunctive Queries. ICDT Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2022	J	`jnl`	Regular matching and inclusion on compressed tree patterns with constrained context variables. Inf. Comput. Iovka Boneva, Joachim Niehren, Momar Sakho
2022	—	`conf`	Schema-Based Automata Determinization. GandALF Joachim Niehren, Momar Sakho, Antonio Al Serhali
2021	J	`jnl`	Computing difference abstractions of linear equation systems. Theor. Comput. Sci. Emilie Allart, Joachim Niehren, Cristian Versari
2021	J	`jnl`	Determinization and Minimization of Automata for Nested Words Revisited. Algorithms Joachim Niehren, Momar Sakho
2021	J	`jnl`	Exact Boolean Abstraction of Linear Equation Systems. Comput. Emilie Allart, Joachim Niehren, Cristian Versari
2020	Misc	`conf`	Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. CSR Iovka Boneva, Joachim Niehren, Momar Sakho
2019	—	`conf`	Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints. CMSB Emilie Allart, Joachim Niehren, Cristian Versari
2019	J	`jnl`	Dependency Weighted Aggregation on Factorized Databases. CoRR Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2019	J	`jnl`	Logics for unordered trees with data constraints. J. Comput. Syst. Sci. Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
2019	—	`ed.`	Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2018, Oxford, England, 8th July 2018. WPTE@FSCD Joachim Niehren, David Sabel
2019	C	`conf`	Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. LATA Iovka Boneva, Joachim Niehren, Momar Sakho
2018	—	`conf`	Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams. RP Iovka Boneva, Joachim Niehren, Momar Sakho
2017	J	`jnl`	Automata for unordered trees. Inf. Comput. Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
2017	C	`conf`	Equivalence of Symbolic Tree Transducers. DLT Vincent Hugot, Adrien Boiret, Joachim Niehren
2017	J	`jnl`	Simplification of Reaction Networks, Confluence and Elementary Modes. Comput. Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren
2016	—	`conf`	Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI Adrien Boiret, Aurélien Lemay, Joachim Niehren
2016	—	`conf`	Normalizing Chemical Reaction Networks by Confluent Structural Simplification. CMSB Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren
2016	J	`jnl`	Predicting changes of reaction networks with partial kinetic information. Biosyst. Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques
2016	B	`conf`	Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams. SOFSEM Tom Sebastian, Joachim Niehren
2016	J	`jnl`	Structural simplification of chemical reaction networks in partial steady states. Biosyst. Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello
2015	B	`conf`	A Uniform Programmning Language for Implementing XML Standards. SOFSEM Pavel Labath, Joachim Niehren
2015	J	`jnl`	Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
2015	C	`conf`	Logics for Unordered Trees with Data Constraints on Siblings. LATA Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
2015	J	`jnl`	Observational program calculi and the correctness of translations. Theor. Comput. Sci. Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer
2015	—	`conf`	Qualitative Reasoning for Reaction Networks with Partial Kinetic Information. CMSB Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques
2015	—	`conf`	Structural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics. CMSB Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren
2015	C	`conf`	Sublinear DTD Validity. LATA Antoine Ndione, Aurélien Lemay, Joachim Niehren
2014	—	`conf`	Attractor Equivalence: An Observational Semantics for Reaction Networks. FMMB Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren
2014	—	`conf`	Deterministic Automata for Unordered Trees. GandALF Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
2014	C	`conf`	Learning Sequential Tree-to-Word Transducers. LATA Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2013	J	`jnl`	Approximate membership for regular languages modulo the edit distance. Theor. Comput. Sci. Antoine Ndione, Aurélien Lemay, Joachim Niehren
2013	C	`conf`	Early Nested Word Automata for XPath Query Answering on XML Streams. CIAA Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
2013	B	`conf`	Knockout Prediction for Reaction Networks with Partial Kinetic Information. VMCAI Mathias John, Mirabelle Nebut, Joachim Niehren
2013	J	`jnl`	Query induction with schema-guided pruning strategies. J. Mach. Learn. Res. Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron
2012	C	`conf`	Learning Rational Functions. Developments in Language Theory Adrien Boiret, Aurélien Lemay, Joachim Niehren
2011	A	`conf`	Biochemical Reaction Rules with Constraints. ESOP Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari
2011	C	`conf`	Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2011	J	`jnl`	Queries on Xml streams with bounded delay and concurrency. Inf. Comput. Olivier Gauwin, Joachim Niehren, Sophie Tison
2011	C	`conf`	Streamable Fragments of Forward XPath. CIAA Olivier Gauwin, Joachim Niehren
2010	A*	`conf`	A learning algorithm for top-down XML transformations. PODS Aurélien Lemay, Sebastian Maneth, Joachim Niehren
2010	J	`jnl`	The Attributed Pi-Calculus with Priorities. Trans. Comp. Sys. Biology Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher
2009	C	`conf`	Bounded Delay and Concurrency for Earliest Query Answering. LATA Olivier Gauwin, Joachim Niehren, Sophie Tison
2009	—	`conf`	Dynamic Compartments in the Imperative CMSB Mathias John, Cédric Lhoussaine, Joachim Niehren
2009	B	`conf`	Earliest Query Answering for Deterministic Nested Word Automata. FCT Olivier Gauwin, Joachim Niehren, Sophie Tison
2009	J	`jnl`	Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2009	B	`conf`	Equivalence of Deterministic Nested Word to Word Transducers. FCT Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
2009	—	`conf`	Streaming Tree Automata and XPath. NCMA Joachim Niehren
2008	—	`conf`	Adequacy of Compositional Translations for Observational Semantics. IFIP TCS Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel
2008	—	`conf`	Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison
2008	C	`conf`	Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2008	—	`conf`	Logics and Automata for Totally Ordered Trees. RTA Marco Kuhlmann, Joachim Niehren
2008	—	`conf`	Schema-Guided Induction of Monadic Queries. ICGI Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2008	J	`jnl`	Streaming tree automata. Inf. Process. Lett. Olivier Gauwin, Joachim Niehren, Yves Roos
2008	—	`conf`	The Attributed Pi Calculus. CMSB Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde M. Uhrmacher
2007	—	`conf`	A Stochastic Pi Calculus for Concurrent Objects. AB Céline Kuttler, Cédric Lhoussaine, Joachim Niehren
2007	J	`jnl`	Dominance constraints in stratified context unification. Inf. Process. Lett. Katrin Erk, Joachim Niehren
2007	J	`jnl`	Interactive learning of node selecting tree transducer. Mach. Learn. Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2007	B	`conf`	Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer
2007	J	`jnl`	On the minimization of XML Schemas and tree automata for unranked trees. J. Comput. Syst. Sci. Wim Martens, Joachim Niehren
2007	A*	`conf`	Polynomial time fragments of XPath with variables. PODS Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2006	J	`jnl`	A concurrent lambda calculus with futures. Theor. Comput. Sci. Joachim Niehren, Jan Schwinghammer, Gert Smolka
2006	—	`conf`	Composing Monadic Queries in Trees. PLAN-X Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2006	J	`jnl`	Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch. Trans. Comp. Sys. Biology Céline Kuttler, Joachim Niehren
2006	—	`conf`	Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI Aurélien Lemay, Joachim Niehren, Rémi Gilleron
2005	—	`conf`	A Concurrent Lambda Calculus with Futures. FroCoS Joachim Niehren, Jan Schwinghammer, Gert Smolka
2005	A	`conf`	Complexity of Subtype Satisfiability over Posets. ESOP Joachim Niehren, Tim Priesnitz, Zhendong Su
2005	—	`conf`	Describing Lambda Terms in Context Unification. LACL Joachim Niehren, Mateu Villaret
2005	—	`conf`	Minimizing Tree Automata for Unranked Trees. DBPL Wim Martens, Joachim Niehren
2005	—	`conf`	N-Ary Queries by Tree Automata. DBPL Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2005	—	`conf`	N-ary Queries by Tree Automata. Foundations of Semistructured Data Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2005	A	`conf`	Well-Nested Context Unification. CADE Jordi Levy, Joachim Niehren, Mateu Villaret
2004	A*	`conf`	A new algorithm for normal dominance constraints. SODA Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele
2004	—	`conf`	Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI Julien Carme, Aurélien Lemay, Joachim Niehren
2004	A*	`conf`	Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. ACL Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater
2004	—	`conf`	Querying Unranked Trees with Stepwise Tree Automata. RTA Julien Carme, Joachim Niehren, Marc Tommasi
2004	—	`conf`	The XDG Grammar Development Kit. MOZ Ralph Debusmann, Denys Duchier, Joachim Niehren
2003	J	`jnl`	An efficient graph algorithm for dominance constraints. J. Algorithms Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
2003	A*	`conf`	Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. ACL Joachim Niehren, Stefan Thater
2003	J	`jnl`	Non-structural subtype entailment in automata theory. Inf. Comput. Joachim Niehren, Tim Priesnitz
2003	A	`conf`	Underspecification formalisms: Hole semantics as dominance constraints. EACL Alexander Koller, Joachim Niehren, Stefan Thater
2003	A	`conf`	Well-Nested Parallelism Constraints for Ellipsis Resolution. EACL Katrin Erk, Joachim Niehren
2002	B	`conf`	Parallelism and Tree Regular Constraints. LPAR Joachim Niehren, Mateu Villaret
2002	A*	`conf`	The first-order theory of subtyping constraints. POPL Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen
2001	A*	`conf`	An efficient algorithm for the configuration problem of dominance graphs. SODA Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
2001	—	`conf`	Beta Reduction Constraints. RTA Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
2001	—	`conf`	Non-structural Subtype Entailment in Automata Theory. TACS Joachim Niehren, Tim Priesnitz
2001	J	`jnl`	The Constraint Language for Lambda Structures. J. Log. Lang. Inf. Markus Egg, Alexander Koller, Joachim Niehren
2001	J	`jnl`	The first-order theory of ordering constraints over feature trees. Discret. Math. Theor. Comput. Sci. Martin Müller, Joachim Niehren, Ralf Treinen
2001	A*	`conf`	Underspecified Beta Reduction. ACL Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
2000	A*	`conf`	A Polynomial-Time Fragment of Dominance Constraints. ACL Alexander Koller, Kurt Mehlhorn, Joachim Niehren
2000	—	`conf`	Dominance Constraints with Set Operators. Computational Logic Denys Duchier, Joachim Niehren
2000	B	`conf`	On Underspecified Processing of Dynamic Semantics. COLING Alexander Koller, Joachim Niehren
2000	J	`jnl`	On rewrite constraints and context unification. Inf. Process. Lett. Joachim Niehren, Sophie Tison, Ralf Treinen
2000	J	`jnl`	Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. Inf. Comput. Martin Müller, Joachim Niehren
2000	J	`jnl`	Ordering Constraints over Feature Trees. Constraints An Int. J. Martin Müller, Joachim Niehren, Andreas Podelski
2000	—	`conf`	Parallelism Constraints. RTA Katrin Erk, Joachim Niehren
2000	J	`jnl`	Relaxing Underspecified Semantic Representations for Reinterpretation. Grammars Alexander Koller, Joachim Niehren, Kristina Striegnitz
2000	J	`jnl`	Uniform confluence in concurrent computation. J. Funct. Program. Joachim Niehren
1999	A*	`conf`	Entailment of Atomic Set Constraints is PSPACE-Complete. LICS Joachim Niehren, Martin Müller, Jean-Marc Talbot
1999	—	`conf`	Entailment of Non-structural Subtype Constraints. ASIAN Joachim Niehren, Tim Priesnitz
1998	—	`conf`	Constraints over Lambda-Structures in Semantic Underspecification. COLING-ACL Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu Xu
1998	—	`conf`	Dominance Constraints in Context Unification. LACL Joachim Niehren, Alexander Koller
1998	—	`conf`	Dominance Constraints: Algorithms and Complexity. LACL Alexander Koller, Joachim Niehren, Ralf Treinen
1998	—	`conf`	Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. RTA Martin Müller, Joachim Niehren
1998	A*	`conf`	The First-Order Theory of Ordering Constraints over Feature Trees. LICS Martin Müller, Joachim Niehren, Ralf Treinen
1997	A*	`conf`	A Uniform Approach to Underspecification and Parallelism. ACL Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
1997	—	`conf`	Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT Martin Müller, Joachim Niehren, Andreas Podelski
1997	A	`conf`	On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting. CADE Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
1997	A	`conf`	Ordering Constraints over Feature Trees. CP Martin Müller, Joachim Niehren, Andreas Podelski
1996	A*	`conf`	Functional Computation as Concurrent Computation. POPL Joachim Niehren
1995	—	`conf`	Constraints for Free in Concurrent Computation. ASIAN Joachim Niehren, Martin Müller
1995	—	`conf`	Constraints for Free in Concurrent Computing. CCP Joachim Niehren, Martin Müller
1995	J	`jnl`	Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm CoRR Martin Müller, Joachim Niehren
1994	—	`conf`	A Confluent Relational Calculus for Higher-Order Programming with Constraints. CCL Joachim Niehren, Gert Smolka
1994	—	`—`	Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen. Joachim Niehren
1993	—	`conf`	Equational and Membership Constraints for Finite Trees. RTA Joachim Niehren, Andreas Podelski, Ralf Treinen
1993	—	`conf`	Feature Automata and Recognizable Sets of Feature Trees. TAPSOFT Joachim Niehren, Andreas Podelski