Joachim Niehren

From MaRDI portal
Person:174813

Available identifiers

zbMath Open niehren.joachimMaRDI QIDQ174813

List of research outcomes





PublicationDate of PublicationType
Subhedge projection for stepwise hedge automata2024-05-29Paper
Linear programs with conjunctive queries2024-04-25Paper
Linear programs with conjunctive queries2024-04-23Paper
Linear Programs with Conjunctive Database Queries2024-03-11Paper
Core SBML and its formal semantics2024-02-28Paper
Earliest query answering for deterministic stepwise hedge automata2024-02-28Paper
https://portal.mardi4nfdi.de/entity/Q61910062024-02-08Paper
https://portal.mardi4nfdi.de/entity/Q61420352024-01-23Paper
Abstract simulation of reaction networks via Boolean networks2023-01-18Paper
Equational and membership constraints for infinite trees2022-12-09Paper
Feature automata and recognizable sets of feature trees2022-11-02Paper
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata2022-10-19Paper
A confluent relational calculus for higher-order programming with constraints2022-08-16Paper
Regular matching and inclusion on compressed tree patterns with constrained context variables2022-06-13Paper
Computing difference abstractions of linear equation systems2021-11-01Paper
https://portal.mardi4nfdi.de/entity/Q49953692021-06-24Paper
Regular matching and inclusion on compressed tree patterns with context variables2019-12-04Paper
Computing difference abstractions of metabolic networks under kinetic constraints2019-10-10Paper
On equality up-to constraints over finite trees, context unification, and one-step rewriting2019-10-01Paper
Logics for unordered trees with data constraints2019-06-25Paper
Certain query answering on compressed string patterns: from streams to hyperstreams2018-10-23Paper
Normalizing chemical reaction networks by confluent structural simplification2018-03-22Paper
Equivalence of symbolic tree transducers2017-10-13Paper
Automata for unordered trees2017-03-16Paper
Sublinear DTD Validity2016-04-08Paper
Logics for Unordered Trees with Data Constraints on Siblings2016-04-08Paper
Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams2016-03-10Paper
Attractor Equivalence: An Observational Semantics for Reaction Networks2015-08-06Paper
https://portal.mardi4nfdi.de/entity/Q55012432015-08-03Paper
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures2015-07-10Paper
Early nested word automata for XPath query answering on XML streams2015-05-18Paper
Observational program calculi and the correctness of translations2015-04-01Paper
The first-order theory of subtyping constraints2015-03-17Paper
Knockout Prediction for Reaction Networks with Partial Kinetic Information2014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q54052742014-04-01Paper
Learning Sequential Tree-to-Word Transducers2014-03-31Paper
Approximate membership for regular languages modulo the edit distance2013-12-11Paper
Early Nested Word Automata for XPath Query Answering on XML Streams2013-08-07Paper
Learning Rational Functions2012-11-02Paper
Streamable Fragments of Forward XPath2011-07-29Paper
Queries on XML streams with bounded delay and concurrency2011-07-27Paper
Normalization of Sequential Top-Down Tree-to-Word Transducers2011-06-03Paper
Biochemical Reaction Rules with Constraints2011-05-19Paper
The Attributed Pi-Calculus with Priorities2011-01-18Paper
Streaming tree automata2010-06-09Paper
Dominance constraints in stratified context unification2010-01-29Paper
Efficient inclusion checking for deterministic tree automata and XML schemas2009-11-27Paper
Earliest Query Answering for Deterministic Nested Word Automata2009-10-20Paper
Equivalence of Deterministic Nested Word to Word Transducers2009-10-20Paper
Rewriting Techniques and Applications2009-04-30Paper
Bounded Delay and Concurrency for Earliest Query Answering2009-04-02Paper
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples2008-11-27Paper
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs2008-11-20Paper
Schema-Guided Induction of Monadic Queries2008-10-16Paper
Logics and Automata for Totally Ordered Trees2008-08-28Paper
A Stochastic Pi Calculus for Concurrent Objects2007-11-29Paper
On the minimization of XML schemas and tree automata for unranked trees2007-05-23Paper
A concurrent lambda calculus with futures2007-01-09Paper
Automated Deduction – CADE-202006-11-01Paper
Database Programming Languages2006-10-20Paper
Grammatical Inference: Algorithms and Applications2006-10-20Paper
Database Programming Languages2006-10-20Paper
Frontiers of Combining Systems2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q33672992006-01-24Paper
https://portal.mardi4nfdi.de/entity/Q57144492006-01-02Paper
Logical Aspects of Computational Linguistics2005-11-23Paper
Programming Languages and Systems2005-09-13Paper
Processing underspecified semantic representations in the constraint language for lambda structures2005-03-15Paper
Non-structural subtype entailment in automata theory2004-11-23Paper
An efficient graph algorithm for dominance constraints2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44283082003-09-15Paper
On rewrite constraints and context unification2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27670662002-04-28Paper
An efficient algorithm for the configuration problem of dominance graphs2002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27788692002-03-21Paper
The constraint language for lambda structures2002-02-19Paper
Relaxing underspecified semantic representations for reinterpretation2002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27628722002-01-13Paper
https://portal.mardi4nfdi.de/entity/Q27628782002-01-13Paper
The first-order theory of ordering constraints over feature trees2002-01-07Paper
https://portal.mardi4nfdi.de/entity/Q27238952001-07-08Paper
Uniform confluence in concurrent computation2001-02-22Paper
https://portal.mardi4nfdi.de/entity/Q45015882000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49361552000-01-23Paper

Research outcomes over time

This page was built for person: Joachim Niehren