Joachim Niehren
Publications
Publications
|
|
Subhedge Projection for Stepwise Hedge Automata24th International Symposium on Fundamentals of Computation Theory, FCT 2023, Sep 2023, Trier, Germany |
Bioinformatics Modelling and Metabolic Engineering of the Branched Chain Amino Acid Pathway for Specific Production of Microbial Biosurfactants and BiopesticidesCongrès BIOKET dédié aux procédés et technologies appliqués à la biomasse, May 2023, Trois Rivieres, Canada |
|
|
|
Earliest Query Answering for Deterministic Stepwise Hedge Automata27th International Conference on Implementation and Application of Automata (CIAA), Sep 2023, famagusta, Cyprus |
|
|
Linear Programs with Conjunctive QueriesICDT 2022 - 25th International Conference on Database Theory, Mar 2022, Edinburgh, United Kingdom |
|
|
Abstract Simulation of Reaction Networks via Boolean NetworksCMSB 2022 - 20th International Conference on Computational Methods in Systems Biology, Sep 2022, Bucarest, Romania |
|
|
Schema-Based Automata DeterminizationGandalf 2022: 13th International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2022, Madrid, Spain |
|
|
Jumping Evaluation of Nested Regular Path QueriesICLP 2022 - 38th International Conference on Logic Programming, Jul 2022, Haifa, Israel |
|
|
A Benchmark Collection of Deterministic Automata for XPath QueriesXML Prague 2022, Jun 2022, Prague, Czech Republic |
|
|
Nested Regular Expressions can be Compiled to Small Deterministic Nested Word AutomataCSR 2020 - 15th International Computer Science Symposium in Russia, Jun 2020, Ekaterinburg, Russia |
|
|
Computing Difference Abstractions of Metabolic Networks Under Kinetic ConstraintsCMSB 2019 - 17th International Conference on Computational Methods in Systems Biology, Luca Bortolussi; Guido Sanguinetti, Sep 2019, Trieste, Italy. pp.266-285, ⟨10.1007/978-3-030-31304-3_14⟩ |
|
|
Regular Matching and Inclusion on Compressed Tree Patterns with Context VariablesLATA 2019 - 13th International Conference on Language and Automata Theory and Applications, Mar 2019, Saint Petersburg, Russia |
Elementary Flux Modes Improve Gene Knockout Predictions12th European Symposium on Biochemical Engineering Science, Sep 2018, Lisbon, Portugal |
|
|
|
Certain Query Answering on Compressed String Patterns: From Streams to HyperstreamsRP 2018 - 12th International Conference on Reachability Problems, Sep 2018, Marseille, France |
|
|
Equivalence of Symbolic Tree TransducersDLT 2017 - Developments in Language Theory, Aug 2017, Liege, Belgium. pp.12, ⟨10.1007/978-3-642-29709-0_32⟩ |
|
|
Normalizing Chemical Reaction Networks by Confluent Structural Simplification14th International Conference on Computational Methods in Systems Biology (CMSB 2016), Ezio Bartocci; Pietro Lio; Nicola Paoletti, Sep 2016, Cambridge, United Kingdom |
|
|
Learning Top-Down Tree Transducers with Regular Domain InspectionInternational Conference on Grammatical Inference 2016, Oct 2016, Delft, Netherlands |
|
|
Projection for Nested Word Automata Speeds up XPath Evaluation on XML StreamsInternational Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2016, Harrachov, Czech Republic |
|
|
Sublinear DTD Validity9th International Conference on. Language and Automata Theory and Applications, Mar 2015, Nice, France |
|
|
A Uniform Programming Language for Implementing XML Standards41st SOFSEM: International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2015, Pec pod Sněžkou, Czech Republic |
|
|
Logics for Unordered Trees with Data Constraints on SiblingsLATA : 9th International Conference on Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.175-187 |
|
|
Qualitative Reasoning about Reaction Networks with Partial Kinetic InformationComputational Methods for Systems Biology, Sep 2015, Nantes, France. pp.157-169 |
|
|
Structural simplification of chemical reaction networks preserving deterministic semanticsComputational Methods in Systems Biology (CMSB), Jérémie BOURDON; Olivier ROUX, Sep 2015, Nantes, France. pp.133-144 |
|
|
Learning Sequential Tree-to-Word Transducers8th International Conference on Language and Automata Theory and Applications, Mar 2014, Madrid, Spain |
Directed Biosynthesis of Antifungal and Biosurfactant Lipopeptides from Bacillus subtilis.10th European Symposium of Biochemical Science (ESBES) and 6th International Forum on Industrial Bioprocesses, Sep 2014, Lille, France |
|
|
|
Attractor Equivalence: An Observational Semantics for Reaction NetworksFirst International Conference on Formal Methods in Macro-Biology, Sep 2014, Nouméa, New Caledonia. pp.82-101 |
|
|
Deterministic Automata for Unordered TreesFifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf), Sep 2014, Verona, Italy. pp.189-202, ⟨10.4204/EPTCS.161.17⟩ |
|
|
Knockout Prediction for Reaction Networks with Partial Kinetic Information14th International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2013, Rome, Italy. pp.355-374 |
|
|
Early Nested Word Automata for XPath Query Answering on XML Streams18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, Canada. pp.292-305 |
|
|
Learning Rational Functions16th International Conference on Developments of Language Theory, Apr 2012, Taipee, Taiwan |
Knockout Prediction for Reaction Networks with Partial Kinetic Information: Application to Surfactin Overproduction in Bacillus subtilis3rd International Symposium on Antimicrobial Peptides, Jun 2012, Lille, France |
|
Synthetic Engineering of Bacillus subtilis to Overproduce Lipopeptide Biosurfactants9th European Symposium on Biochemical Engineering Science, Sep 2012, Istanbul, Turkey |
|
|
|
Streamable Fragments of Forward XPath16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.3-15 |
|
|
Biochemical Reaction Rules with Constraints20th European Symposium on Programming Languages, Mar 2011, Saarbrücken, Germany. pp.338-357 |
|
|
Normalization of Sequential Top-Down Tree-to-Word Transducers5th International Conference on Language Automata Theory and Appliciations, May 2011, Tarragona, Spain |
|
|
A Learning Algorithm for Top-Down XML Transformations29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2010, Indianapolis, United States. pp.285-296 |
|
|
Earliest Query Answering for Deterministic Nested Word Automata17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132 |
|
|
Dynamic Compartments in the Imperative Pi CalculusComputational Methods in Systems Biology, 7th International Conference, Aug 2009, Bologna, Italy. pp.235-250, ⟨10.1007/978-3-642-03845-7⟩ |
|
|
Correctly Translating Concurrency PrimitivesThe 2009 SIGPLAN Workshop on ML, Oct 2009, Edinburgh, United Kingdom. pp.27-38 |
|
|
Equivalence of Deterministic Nested Word to Word TransducersFundamentals of Computation Theory, Maciej Gebala and Malgorzata Korzeniowska, Sep 2009, Wroclaw, Poland. pp.310-322, ⟨10.1007/978-3-642-03409-1_28⟩ |
|
|
Bounded Delay and Concurrency for Earliest Query Answering3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, ⟨10.1007/978-3-642-00982-2⟩ |
|
|
Schema-Guided Induction of Monadic Queries9th International Colloquium on Grammatical Inference, Sep 2008, Saint-Malo, France. pp.15-28, ⟨10.1007/978-3-540-88009-7_2⟩ |
|
|
Complexity of Earliest Query Answering with Streaming Tree AutomataACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States |
|
|
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. pp.184-195 |
|
|
Adequacy of compositional translations for observational semantics5th IFIP International Conference on Theoretical Computer Science, Sep 2008, Milano, Italy. pp.521-535 |
|
|
Logics and Automata for Totally Ordered Trees19th International Conference on Rewriting Techniques and Applications, Jun 2008, Linz, Austria. pp.217-231 |
|
|
The Attributed Pi CalculusComputational Methods in Systems Biology, 6th International Conference CMSB, Oct 2008, Rostock, Germany. pp.83-102 |
|
|
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures23rd Conference on Mathematical Foundations of Programming Semantics, Apr 2007, New Orleans, United States. pp.313-337 |
|
|
A Stochastic Pi Calculus for Concurrent ObjectsSecond International Conference on Algebraic Biology, Jul 2007, Linz, Austria. pp.232-246 |
|
|
Polynomial Time Fragments of XPath with Variables26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214 |
Composing Monadic Queries in TreesPLAN-X, 2006, Unknown, Unknown Region. pp.61-70, ⟨10.1007/978-3-319-04939-7_13⟩ |
|
|
|
Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples8th International Colloquium on Grammatical Inference, Sep 2006, Tokyo, Japan. pp.253-267 |
|
|
Describing Lambda Terms in Context Unification5th International Conference on Logical Aspects in Computational Linguistics, 2005, Bordeaux, France. pp.221-237 |
|
|
Minimizing Tree Automata for Unranked Trees10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.232--246 |
|
|
N-ary Queries by Tree Automata10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231 |
|
|
Complexity of Subtype Satisfiability over Posets14th European Symposium on Programming, 2005, Edinburgh, United Kingdom. pp.357-373 |
|
|
Well-nested Context Unification20th International Conference on Automated Deduction, 2005, Tallinn, Estonia. pp.149-163 |
|
|
The XDG Grammar Development Kit2nd International Conference on Multiparadigm Programming in {Mozart/Oz}, 2004, Charleroi, Belgium. pp.190--201 |
|
|
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis42th Meeting of the Association for Computational Linguistics, 2004, Barcelona, Spain. pp.247-254 |
|
|
Learning Node Selecting Tree Transducer from Completely Annotated Examples7th International Colloquium on Grammatical Inference, 2004, Athens, Greece. pp.91--102 |
|
|
Querying Unranked Trees with Stepwise Tree Automata19th International Conference on Rewriting Techniques and Applications, 2004, Aachen, Georgia. pp.105--118 |
|
|
A New Algorithm for Normal Dominance ConstraintsACM-SIAM Symposium on Discrete Algorithms - SODA'2003, Jan 2004, New Orleans, Louisiana, United States. pp.59-67 |
|
|
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints41st Meeting of the Association of Computational Linguistics (ACL), 2003, Saporo, Japan. pp.367-374 |
|
|
Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints10th Meeting of the European Chapter of the Association of Computational Linguistics, 2003, Budapest, Hungary. pp.195-202 |
|
|
Well-Nested Parallelism Constraints for Ellipsis Resolution10th Conference of the European Chapter of the Association for Computational Linguistics, Association for Compuational Linguistics, 2003, Budapest, Hungary. pp.115--122 |
|
|
First-Order Theory of Subtyping ConstraintsThe 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, Portland, United States. pp.203-216 |
|
|
Parallelism and Tree Regular ConstraintsInternational Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2002, Tblisi, Georgia. pp.311--326 |
|
|
An Efficient Algorithm for the Configuration Problem of Dominance GraphsProceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. pp.815--824 |
|
|
Beta Reduction ConstraintsInternational Conference on Rewriting Techniques and Applications, 2001, Utrecht, Netherlands. pp.31-46 |
|
|
Dominance Constraints in Context Unification3rd International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001), 1998, Heidelberg, France. pp.199-218 |
|
|
Underspecified Beta Reduction39th Annual Meeting of the Association for Computational Linguistics, 2001, Toulouse, France. pp.74-81 |
|
|
Non-Structural Subtype Entailment in Automata Theory4th International Symposium on Theoretical Aspects of Computer Software, 2001, Sendai, Japan. pp.360--384 |
|
|
Dominance Constraints: Algorithms and ComplexityThird International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001), 1998, Grenoble, France. pp.106-125 |
|
|
Parallelism ConstraintsInternational Conference on Rewriting Techniques and Applications, 2000, Norwich, United Kingdom. pp.110--126 |
|
|
A Polynomial-Time Fragment of Dominance Constraints38th Annual Meeting of the Association of Computational Linguistics, 2000, Hong Kong, China. pp.368--375 |
|
|
Dominance Constraints with Set OperatorsProceedings of the First International Conference on Computational Logic, 2000, London, United Kingdom. pp.326-341 |
|
|
On Underspecified Processing of Dynamic Semantics18th International Conference on Computational Linguistics, 2000, Saarbrücken, Georgia. pp.460--466 |
|
|
Entailment of Non-Structural Subtype ConstraintsAsian Computing Science Conference, 1999, Phuket, Thailand. pp.251--265 |
|
|
Entailment of Atomic Set Constraints is PSPACE-CompleteFourteenth Annual IEEE Symposium on Logic in Computer Sience, 1999, Trento, Italy. pp.285--294 |
|
|
Relaxing Underspecified Semantic Representations for Reinterpretation6th Meeting on Mathematics of Language, 1999, Orlando, Florida, United States. pp.74--87 |
|
|
Constraints over Lambda-Structures in Semantic UnderspecificationJoined 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98), 1998, Montreal, Canada. pp.353--359 |
|
|
Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic9th International Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan. pp.196--210 |
|
|
The First-Order Theory of Ordering Constraints over Feature Trees13th annual IEEE Symposium on Logic in Computer Sience, 1998, Indianapolis, Indiana, United States. pp.432--443 |
|
|
A Uniform Approach to Underspecification and Parallelism35th Annual Meeting of the Association of Computational Linguistics, 1997, Madrid, Spain. pp.410-417 |
|
|
Inclusion Constraints over Non-Empty Sets of TreesTheory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, 1997, Lille, France. pp.217-231 |
|
|
On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step RewritingProceedings of the International Conference on Automated Deduction, 1997, Townsville, Australia. pp.34-48 |
Ordering Constraints over Feature Trees3rd International Conference on Principles and Practice of Constraint Programming, 1997, Schloss Hagenberg, Linz, Austria. pp.297--311 |
|
|
|
Functional Computation as Concurrent Computation23th ACM Symposium on Principles of Programming Languages, 1996, St. Petersburg Beach, Florida, United States. pp.333--343 |
|
|
Constraints for Free in Concurrent ComputationAsian Computing Science Conference, 1995, Pathumthani, Thailand. pp.171--186 |
|
|
A Confluent Relational Calculus for Higher-Order Programming with Constraints1st International Conference on Constraints in Computational Logics, 1994, Munich, Germany |
|
|
Feature Automata and Recognizable Sets of Feature TreesTAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP/FASE/TOOLS., 1993, Orsay, France. pp.356--375 |
|
|
Equational and Membership Constraints for Infinite Trees5th International Conference on Rewriting Techniques and Applications, 1993, Montreal, Canada. pp.106-120 |
|
|
The Attributed Pi Calculus with PrioritiesCorrado Priami; Rainer Breitling; David Gilbert; Monika Heiner; Adelinde M. Uhrmacher. Transactions on Computational Systems Biology XII: Special Issue on Modeling Methodologies, LNBI-5945, Springer, pp.13-76, 2010, Lecture Notes in Bioinformatics (Journal Subline), 978-3-642-11712-1. ⟨10.1007/978-3-642-11712-1_2⟩ |
|
|
Constraint Programming in Computational LinguisticsDave Barker-Plummer and David I. Beaver and Johan van Benthem and Patrick Scotto di Luzio. Words, Proofs, and Dialog, 141, CSLI Press, pp.95-122, 2002 |
Sequential Tree-to-Word Transducers: Normalization, Minimization, and Learning2015 |
|
|
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version)2018 |
|
|
A Learning Algorithm for Top-Down Tree Transducers2017 |
Learning Top-Down Tree Transformations with Regular Inspection2016 |
A Functional Language for Hyperstreaming XSLT[Research Report] inria lille. 2013 |
|
Early = Earliest?[Research Report] inria lille. 2013 |
|
Constant Delay Enumeration for Acyclic Conjunctive Queries over X-Doublebar Structures[Research Report] 2011 |