Joachim Niehren

According to our database1, Joachim Niehren authored at least 98 papers between 1993 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams.
Proceedings of the Reachability Problems - 12th International Conference, 2018

2017
Automata for unordered trees.
Inf. Comput., 2017

Simplification of Reaction Networks, Confluence and Elementary Modes.
Computation, 2017

Equivalence of Symbolic Tree Transducers.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016
Predicting changes of reaction networks with partial kinetic information.
Biosystems, 2016

Structural simplification of chemical reaction networks in partial steady states.
Biosystems, 2016

Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Learning Top-Down Tree Transducers with Regular Domain Inspection.
Proceedings of the 13th International Conference on Grammatical Inference, 2016

Normalizing Chemical Reaction Networks by Confluent Structural Simplification.
Proceedings of the Computational Methods in Systems Biology, 2016

2015
Observational program calculi and the correctness of translations.
Theor. Comput. Sci., 2015

A Uniform Programmning Language for Implementing XML Standards.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Sublinear DTD Validity.
Proceedings of the Language and Automata Theory and Applications, 2015

Logics for Unordered Trees with Data Constraints on Siblings.
Proceedings of the Language and Automata Theory and Applications, 2015

Qualitative Reasoning for Reaction Networks with Partial Kinetic Information.
Proceedings of the Computational Methods in Systems Biology, 2015

Structural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics.
Proceedings of the Computational Methods in Systems Biology, 2015

2014
Deterministic Automata for Unordered Trees.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Learning Sequential Tree-to-Word Transducers.
Proceedings of the Language and Automata Theory and Applications, 2014

Attractor Equivalence: An Observational Semantics for Reaction Networks.
Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

2013
Approximate membership for regular languages modulo the edit distance.
Theor. Comput. Sci., 2013

Query induction with schema-guided pruning strategies.
Journal of Machine Learning Research, 2013

Early Nested Word Automata for XPath Query Answering on XML Streams.
Proceedings of the Implementation and Application of Automata, 2013

Knockout Prediction for Reaction Networks with Partial Kinetic Information.
Proceedings of the Verification, 2013

2012
Learning Rational Functions.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Queries on Xml streams with bounded delay and concurrency.
Inf. Comput., 2011

Streamable Fragments of Forward XPath.
Proceedings of the Implementation and Application of Automata, 2011

Normalization of Sequential Top-Down Tree-to-Word Transducers.
Proceedings of the Language and Automata Theory and Applications, 2011

Biochemical Reaction Rules with Constraints.
Proceedings of the Programming Languages and Systems, 2011

2010
The Attributed Pi-Calculus with Priorities.
Trans. Computational Systems Biology, 2010

A learning algorithm for top-down XML transformations.
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.
Inf. Comput., 2009

Streaming Tree Automata and XPath.
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.
Proceedings of the Language and Automata Theory and Applications, 2009

Equivalence of Deterministic Nested Word to Word Transducers.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Earliest Query Answering for Deterministic Nested Word Automata.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Dynamic Compartments in the Imperative pi-Calculus.
Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

2008
Streaming tree automata.
Inf. Process. Lett., 2008

Logics and Automata for Totally Ordered Trees.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Complexity of Earliest Query Answering with Streaming Tree Automata.
Proceedings of the PLAN-X 2008, 2008

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
Proceedings of the Language and Automata Theory and Applications, 2008

Adequacy of Compositional Translations for Observational Semantics.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Schema-Guided Induction of Monadic Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

The Attributed Pi Calculus.
Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

2007
Interactive learning of node selecting tree transducer.
Machine Learning, 2007

On the minimization of XML Schemas and tree automata for unranked trees.
J. Comput. Syst. Sci., 2007

Dominance constraints in stratified context unification.
Inf. Process. Lett., 2007

Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.
Electr. Notes Theor. Comput. Sci., 2007

Polynomial time fragments of XPath with variables.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

A Stochastic Pi Calculus for Concurrent Objects.
Proceedings of the Algebraic Biology, Second International Conference, 2007

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

Composing Monadic Queries in Trees.
Proceedings of the PLAN-X 2006 Informal Proceedings, 2006

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005
Describing Lambda Terms in Context Unification.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

A Concurrent Lambda Calculus with Futures.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Complexity of Subtype Satisfiability over Posets.
Proceedings of the Programming Languages and Systems, 2005

N-Ary Queries by Tree Automata.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

Minimizing Tree Automata for Unranked Trees.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

N-ary Queries by Tree Automata.
Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

Well-Nested Context Unification.
Proceedings of the Automated Deduction, 2005

2004
A new algorithm for normal dominance constraints.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Querying Unranked Trees with Stepwise Tree Automata.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

The XDG Grammar Development Kit.
Proceedings of the Multiparadigm Programming in Mozart/Oz, Second International Conference, 2004

Learning Node Selecting Tree Transducer from Completely Annotated Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis.
Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

2003
An efficient graph algorithm for dominance constraints.
J. Algorithms, 2003

Underspecification formalisms: Hole semantics as dominance constraints.
Proceedings of the EACL 2003, 2003

Well-Nested Parallelism Constraints for Ellipsis Resolution.
Proceedings of the EACL 2003, 2003

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints.
Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003

2002
The first-order theory of subtyping constraints.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Parallelism and Tree Regular Constraints.
Proceedings of the Logic for Programming, 2002

2001
The Constraint Language for Lambda Structures.
Journal of Logic, Language and Information, 2001

Non-structural Subtype Entailment in Automata Theory.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

An efficient algorithm for the configuration problem of dominance graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Beta Reduction Constraints.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Underspecified Beta Reduction.
Proceedings of the Association for Computational Linguistic, 2001

2000
Uniform confluence in concurrent computation.
J. Funct. Program., 2000

On rewrite constraints and context unification.
Inf. Process. Lett., 2000

Relaxing Underspecified Semantic Representations for Reinterpretation.
Grammars, 2000

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

On Underspecified Processing of Dynamic Semantics.
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.
Proceedings of the Computational Logic, 2000

A Polynomial-Time Fragment of Dominance Constraints.
Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, 2000

1999
Entailment of Atomic Set Constraints is PSPACE-Complete.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Entailment of Non-structural Subtype Constraints.
Proceedings of the Advances in Computing Science, 1999

1998
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The First-Order Theory of Ordering Constraints over Feature Trees.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Dominance Constraints in Context Unification.
Proceedings of the Logical Aspects of Computational Linguistics, 1998

Dominance Constraints: Algorithms and Complexity.
Proceedings of the Logical Aspects of Computational Linguistics, 1998

Constraints over Lambda-Structures in Semantic Underspecification.
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.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Ordering Constraints over Feature Trees.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting.
Proceedings of the Automated Deduction, 1997

A Uniform Approach to Underspecification and Parallelism.
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.
Proceedings of the Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996

1995
Constraints for Free in Concurrent Computation.
Proceedings of the Algorithms, 1995

1994
Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen.
PhD thesis, 1994

A Confluent Relational Calculus for Higher-Order Programming with Constraints.
Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993
Feature Automata and Recognizable Sets of Feature Trees.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Equational and Membership Constraints for Finite Trees.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993


  Loading...