Joachim Niehren
Directeur de recherche epst
Laboratoire / équipe
Publications
{
"response":{"numFound":138,"start":0,"numFoundExact":true,"docs":[
{
"citationRef_s":"2024, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https://archive.softwareheritage.org/browse/swh:1:dir:2ee08ba683fff637c9ad4fa3b77a7fcece365a15;origin=https://hal.archives-ouvertes.fr/hal-04454979;visit=swh:1:snp:de59a3e33727b8f865541372cbbefcafe314facf;anchor=swh:1:rel:dd82dbbec61205b48fcff20568cd5ec07e24d56d;path=/\">⟨swh:1:dir:2ee08ba683fff637c9ad4fa3b77a7fcece365a15;origin=https://hal.archives-ouvertes.fr/hal-04454979;visit=swh:1:snp:de59a3e33727b8f865541372cbbefcafe314facf;anchor=swh:1:rel:dd82dbbec61205b48fcff20568cd5ec07e24d56d;path=/⟩</a>",
"citationFull_s":"Joachim Niehren. Core SBML Software Package. 2024, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https://archive.softwareheritage.org/browse/swh:1:dir:2ee08ba683fff637c9ad4fa3b77a7fcece365a15;origin=https://hal.archives-ouvertes.fr/hal-04454979;visit=swh:1:snp:de59a3e33727b8f865541372cbbefcafe314facf;anchor=swh:1:rel:dd82dbbec61205b48fcff20568cd5ec07e24d56d;path=/\">⟨swh:1:dir:2ee08ba683fff637c9ad4fa3b77a7fcece365a15;origin=https://hal.archives-ouvertes.fr/hal-04454979;visit=swh:1:snp:de59a3e33727b8f865541372cbbefcafe314facf;anchor=swh:1:rel:dd82dbbec61205b48fcff20568cd5ec07e24d56d;path=/⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04454979v3\">⟨hal-04454979v3⟩</a>",
"title_s":["Core SBML Software Package"],
"authFullName_s":["Joachim Niehren"],
"halId_s":"hal-04454979",
"docType_s":"SOFTWARE",
"producedDateY_i":2024},
{
"citationRef_s":"<i>Logical Methods in Computer Science</i>, In press, Volume 20, Issue 1, <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/lmcs-20(1:9)2024\">⟨10.46298/lmcs-20(1:9)2024⟩</a>",
"citationFull_s":"Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon. Linear Programs with Conjunctive Database Queries. <i>Logical Methods in Computer Science</i>, In press, Volume 20, Issue 1, <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/lmcs-20(1:9)2024\">⟨10.46298/lmcs-20(1:9)2024⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04317553\">⟨hal-04317553⟩</a>",
"title_s":["Linear Programs with Conjunctive Database Queries"],
"authFullName_s":["Florent Capelli",
"Nicolas Crosetti",
"Joachim Niehren",
"Jan Ramon"],
"halId_s":"hal-04317553",
"docType_s":"ART",
"producedDateY_i":2024},
{
"citationRef_s":"<i>24th International Symposium on Fundamentals of Computation Theory, FCT 2023</i>, Sep 2023, Trier, Germany",
"citationFull_s":"Antonio Al Serhali, Joachim Niehren. Subhedge Projection for Stepwise Hedge Automata. <i>24th International Symposium on Fundamentals of Computation Theory, FCT 2023</i>, Sep 2023, Trier, Germany. <a target=\"_blank\" href=\"https://inria.hal.science/hal-04165835v3\">⟨hal-04165835v3⟩</a>",
"title_s":["Subhedge Projection for Stepwise Hedge Automata"],
"authFullName_s":["Antonio Al Serhali",
"Joachim Niehren"],
"halId_s":"hal-04165835",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"<i>27th International Conference on Implementation and Application of Automata (CIAA)</i>, Sep 2023, famagusta, Cyprus",
"citationFull_s":"Antonio Al Serhali, Joachim Niehren. Earliest Query Answering for Deterministic Stepwise Hedge Automata. <i>27th International Conference on Implementation and Application of Automata (CIAA)</i>, Sep 2023, famagusta, Cyprus. <a target=\"_blank\" href=\"https://inria.hal.science/hal-04106420\">⟨hal-04106420⟩</a>",
"title_s":["Earliest Query Answering for Deterministic Stepwise Hedge Automata"],
"authFullName_s":["Antonio Al Serhali",
"Joachim Niehren"],
"halId_s":"hal-04106420",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"14137, Springer Nature Switzerland; Springer, 2023, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-031-42697-1\">⟨10.1007/978-3-031-42697-1⟩</a>",
"citationFull_s":"Jun Pang, Joachim Niehren. Computational Methods in Systems Biology - 21st International Conference,\r\nCMSB 2023. 14137, Springer Nature Switzerland; Springer, 2023, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-031-42697-1\">⟨10.1007/978-3-031-42697-1⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-04325364\">⟨hal-04325364⟩</a>",
"title_s":["Computational Methods in Systems Biology - 21st International Conference, CMSB 2023"],
"authFullName_s":["Jun Pang",
"Joachim Niehren"],
"halId_s":"hal-04325364",
"docType_s":"PROCEEDINGS",
"producedDateY_i":2023},
{
"citationRef_s":"<i>BIOKET</i>, Aug 2023, Montreal, Canada. pp.107, <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/metabo12020107\">⟨10.3390/metabo12020107⟩</a>",
"citationFull_s":"Jean-Sébastien Guez, Françoise Coucheney, Joany Guy, Max Béchet, Pierre Fontanille, et al.. Bioinformatics Modelling and Metabolic Engineering of the Branched Chain Amino Acid Pathway for Specific Production of Microbial Biosurfactants and Biopesticides. <i>BIOKET</i>, Aug 2023, Montreal, Canada. pp.107, <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/metabo12020107\">⟨10.3390/metabo12020107⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-04278771\">⟨hal-04278771⟩</a>",
"title_s":["Bioinformatics Modelling and Metabolic Engineering of the Branched Chain Amino Acid Pathway for Specific Production of Microbial Biosurfactants and Biopesticides"],
"authFullName_s":["Jean-Sébastien Guez",
"Françoise Coucheney",
"Joany Guy",
"Max Béchet",
"Pierre Fontanille",
"Nour-Eddine Chihib",
"Joachim Niehren",
"François Coutte",
"Philippe Jacques"],
"halId_s":"hal-04278771",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"<i>Congrès BIOKET dédié aux procédés et technologies appliqués à la biomasse</i>, May 2023, Trois Rivieres, Canada",
"citationFull_s":"François Coutte, Jean-Sebastien Guez, Joany Castéra-Guy, Cristian Versari, Joachim Niehren, et al.. Bioinformatics Modelling and Metabolic Engineering of the Branched Chain Amino Acid Pathway for Specific Production of Microbial Biosurfactants and Biopesticides. <i>Congrès BIOKET dédié aux procédés et technologies appliqués à la biomasse</i>, May 2023, Trois Rivieres, Canada. <a target=\"_blank\" href=\"https://hal.science/hal-04551935\">⟨hal-04551935⟩</a>",
"title_s":["Bioinformatics Modelling and Metabolic Engineering of the Branched Chain Amino Acid Pathway for Specific Production of Microbial Biosurfactants and Biopesticides"],
"authFullName_s":["François Coutte",
"Jean-Sebastien Guez",
"Joany Castéra-Guy",
"Cristian Versari",
"Joachim Niehren",
"Philippe Jacques"],
"halId_s":"hal-04551935",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"<i>Gandalf 2022: 13th International Symposium on Games, Automata, Logics, and Formal Verification</i>, Sep 2022, Madrid, Spain",
"citationFull_s":"Joachim Niehren, Momar Sakho, Antonio Al Serhali. Schema-Based Automata Determinization. <i>Gandalf 2022: 13th International Symposium on Games, Automata, Logics, and Formal Verification</i>, Sep 2022, Madrid, Spain. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03536045v2\">⟨hal-03536045v2⟩</a>",
"title_s":["Schema-Based Automata Determinization"],
"authFullName_s":["Joachim Niehren",
"Momar Sakho",
"Antonio Al Serhali"],
"halId_s":"hal-03536045",
"docType_s":"COMM",
"producedDateY_i":2022},
{
"citationRef_s":"<i>CMSB 2022 - 20th International Conference on Computational Methods in Systems Biology</i>, Sep 2022, Bucarest, Romania",
"citationFull_s":"Joachim Niehren, Athénaïs Vaginay, Cristian Versari. Abstract Simulation of Reaction Networks via Boolean Networks. <i>CMSB 2022 - 20th International Conference on Computational Methods in Systems Biology</i>, Sep 2022, Bucarest, Romania. <a target=\"_blank\" href=\"https://hal.science/hal-02279942v9\">⟨hal-02279942v9⟩</a>",
"title_s":["Abstract Simulation of Reaction Networks via Boolean Networks"],
"authFullName_s":["Joachim Niehren",
"Athénaïs Vaginay",
"Cristian Versari"],
"halId_s":"hal-02279942",
"docType_s":"COMM",
"producedDateY_i":2022},
{
"citationRef_s":"<i>ICPL 2022 - 38th International Conference on Logic Programming</i>, Jul 2022, Haifa, Israel",
"citationFull_s":"Joachim Niehren, Sylvain Salvati, Rustam Azimov. Jumping Evaluation of Nested Regular Path Queries. <i>ICPL 2022 - 38th International Conference on Logic Programming</i>, Jul 2022, Haifa, Israel. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02492780v6\">⟨hal-02492780v6⟩</a>",
"title_s":["Jumping Evaluation of Nested Regular Path Queries"],
"authFullName_s":["Joachim Niehren",
"Sylvain Salvati",
"Rustam Azimov"],
"halId_s":"hal-02492780",
"docType_s":"COMM",
"producedDateY_i":2022},
{
"citationRef_s":"<i>XML Prague 2022</i>, Jun 2022, Prague, Czech Republic",
"citationFull_s":"Antonio Al Serhali, Joachim Niehren. A Benchmark Collection of Deterministic Automata for XPath Queries. <i>XML Prague 2022</i>, Jun 2022, Prague, Czech Republic. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03527888v4\">⟨hal-03527888v4⟩</a>",
"title_s":["A Benchmark Collection of Deterministic Automata for XPath Queries"],
"authFullName_s":["Antonio Al Serhali",
"Joachim Niehren"],
"halId_s":"hal-03527888",
"docType_s":"COMM",
"producedDateY_i":2022},
{
"citationRef_s":"<i>ICDT 2022 - 25th International Conference on Database Theory</i>, Mar 2022, Edinburgh, United Kingdom",
"citationFull_s":"Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon. Linear Programs with Conjunctive Queries. <i>ICDT 2022 - 25th International Conference on Database Theory</i>, Mar 2022, Edinburgh, United Kingdom. <a target=\"_blank\" href=\"https://hal.science/hal-01981553\">⟨hal-01981553⟩</a>",
"title_s":["Linear Programs with Conjunctive Queries"],
"authFullName_s":["Florent Capelli",
"Nicolas Crosetti",
"Joachim Niehren",
"Jan Ramon"],
"halId_s":"hal-01981553",
"docType_s":"COMM",
"producedDateY_i":2022},
{
"citationRef_s":"<i>Metabolites</i>, 2022, 12 (2), pp.107. <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/metabo12020107\">⟨10.3390/metabo12020107⟩</a>",
"citationFull_s":"Jean-Sébastien Guez, Françoise Coucheney, Joany Guy, Max Béchet, Pierre Fontanille, et al.. Bioinformatics modelling and metabolic engineering of the\r\nbranched chain amino acid pathway for specific production of mycosubtilin isoforms in Bacillus subtilis. <i>Metabolites</i>, 2022, 12 (2), pp.107. <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/metabo12020107\">⟨10.3390/metabo12020107⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03498125\">⟨hal-03498125⟩</a>",
"title_s":["Bioinformatics modelling and metabolic engineering of the branched chain amino acid pathway for specific production of mycosubtilin isoforms in Bacillus subtilis"],
"authFullName_s":["Jean-Sébastien Guez",
"Françoise Coucheney",
"Joany Guy",
"Max Béchet",
"Pierre Fontanille",
"Nour-Eddine Chihib",
"Joachim Niehren",
"François Coutte",
"Philippe Jacques"],
"halId_s":"hal-03498125",
"docType_s":"ART",
"producedDateY_i":2022},
{
"citationRef_s":"<i>Information and Computation</i>, 2022, 286, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2021.104776\">⟨10.1016/j.ic.2021.104776⟩</a>",
"citationFull_s":"Iovka Boneva, Joachim Niehren, Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables. <i>Information and Computation</i>, 2022, 286, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2021.104776\">⟨10.1016/j.ic.2021.104776⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03151014\">⟨hal-03151014⟩</a>",
"title_s":["Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables"],
"authFullName_s":["Iovka Boneva",
"Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-03151014",
"docType_s":"ART",
"producedDateY_i":2022},
{
"citationRef_s":"<i>Frontiers in Bioengineering and Biotechnology</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.3389/fbioe.2021.623701\">⟨10.3389/fbioe.2021.623701⟩</a>",
"citationFull_s":"Ariane Théatre, Carolina Cano-Prieto, Marco Bartolini, Yoann Laurin, Magali Deleu, et al.. The surfactin-like lipopeptides from <i>Bacillus</i> spp.: natural biodiversity and synthetic biology for a broader application range. <i>Frontiers in Bioengineering and Biotechnology</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.3389/fbioe.2021.623701\">⟨10.3389/fbioe.2021.623701⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03158419\">⟨hal-03158419⟩</a>",
"title_s":["The surfactin-like lipopeptides from <i>Bacillus</i> spp.: natural biodiversity and synthetic biology for a broader application range"],
"authFullName_s":["Ariane Théatre",
"Carolina Cano-Prieto",
"Marco Bartolini",
"Yoann Laurin",
"Magali Deleu",
"Joachim Niehren",
"Tarik Fida",
"Saïcha Gerbinet",
"Mohammad Alanjary",
"Marnix H Medema",
"Angélique Léonard",
"Laurence Lins",
"Ana Arabolaza",
"Hugo Gramajo",
"Harald Gross",
"Philippe Jacques"],
"halId_s":"hal-03158419",
"docType_s":"ART",
"producedDateY_i":2021},
{
"citationRef_s":"<i>Algorithms</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/a14030068\">⟨10.3390/a14030068⟩</a>",
"citationFull_s":"Joachim Niehren, Momar Sakho. Determinization and Minimization of Automata for Nested Words Revisited. <i>Algorithms</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.3390/a14030068\">⟨10.3390/a14030068⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03134596\">⟨hal-03134596⟩</a>",
"title_s":["Determinization and Minimization of Automata for Nested Words Revisited"],
"authFullName_s":["Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-03134596",
"docType_s":"ART",
"producedDateY_i":2021},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2021.06.030\">⟨10.1016/j.tcs.2021.06.030⟩</a>",
"citationFull_s":"Emilie Allart, Joachim Niehren, Cristian Versari. Computing Difference Abstractions of Linear Equation Systems. <i>Theoretical Computer Science</i>, 2021, <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2021.06.030\">⟨10.1016/j.tcs.2021.06.030⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03156136v3\">⟨hal-03156136v3⟩</a>",
"title_s":["Computing Difference Abstractions of Linear Equation Systems"],
"authFullName_s":["Emilie Allart",
"Joachim Niehren",
"Cristian Versari"],
"halId_s":"hal-03156136",
"docType_s":"ART",
"producedDateY_i":2021},
{
"citationRef_s":"<i>CSR 2020 - 15th International Computer Science Symposium in Russia</i>, Jun 2020, Ekaterinburg, Russia",
"citationFull_s":"Iovka Boneva, Joachim Niehren, Momar Sakho. Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata. <i>CSR 2020 - 15th International Computer Science Symposium in Russia</i>, Jun 2020, Ekaterinburg, Russia. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02532706v2\">⟨hal-02532706v2⟩</a>",
"title_s":["Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata"],
"authFullName_s":["Iovka Boneva",
"Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-02532706",
"docType_s":"COMM",
"producedDateY_i":2020},
{
"citationRef_s":"<i>CMSB 2019 - 17th International Conference on Computational Methods in Systems Biology</i>, Luca Bortolussi; Guido Sanguinetti, Sep 2019, Trieste, Italy. pp.266-285, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-31304-3_14\">⟨10.1007/978-3-030-31304-3_14⟩</a>",
"citationFull_s":"Emilie Allart, Cristian Versari, Joachim Niehren. Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints. <i>CMSB 2019 - 17th International Conference on Computational Methods in Systems Biology</i>, Luca Bortolussi; Guido Sanguinetti, Sep 2019, Trieste, Italy. pp.266-285, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-31304-3_14\">⟨10.1007/978-3-030-31304-3_14⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-02302463\">⟨hal-02302463⟩</a>",
"title_s":["Computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints"],
"authFullName_s":["Emilie Allart",
"Cristian Versari",
"Joachim Niehren"],
"halId_s":"hal-02302463",
"docType_s":"COMM",
"producedDateY_i":2019},
{
"citationRef_s":"<i>LATA 2019 - 13th International Conference on Language and Automata Theory and Applications</i>, Mar 2019, Saint Petersburg, Russia",
"citationFull_s":"Iovka Boneva, Joachim Niehren, Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. <i>LATA 2019 - 13th International Conference on Language and Automata Theory and Applications</i>, Mar 2019, Saint Petersburg, Russia. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01811835v4\">⟨hal-01811835v4⟩</a>",
"title_s":["Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables"],
"authFullName_s":["Iovka Boneva",
"Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-01811835",
"docType_s":"COMM",
"producedDateY_i":2019},
{
"citationRef_s":"<i>Journal of Computer and System Sciences</i>, 2019, pp.40. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2018.11.004\">⟨10.1016/j.jcss.2018.11.004⟩</a>",
"citationFull_s":"Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints. <i>Journal of Computer and System Sciences</i>, 2019, pp.40. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2018.11.004\">⟨10.1016/j.jcss.2018.11.004⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01176763v2\">⟨hal-01176763v2⟩</a>",
"title_s":["Logics for Unordered Trees with Data Constraints"],
"authFullName_s":["Adrien Boiret",
"Vincent Hugot",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"hal-01176763",
"docType_s":"ART",
"producedDateY_i":2019},
{
"citationRef_s":"<i>RP 2018 - 12th International Conference on Reachability Problems</i>, Sep 2018, Marseille, France",
"citationFull_s":"Iovka Boneva, Joachim Niehren, Momar Sakho. Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams. <i>RP 2018 - 12th International Conference on Reachability Problems</i>, Sep 2018, Marseille, France. <a target=\"_blank\" href=\"https://hal.science/hal-01609498v4\">⟨hal-01609498v4⟩</a>",
"title_s":["Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams"],
"authFullName_s":["Iovka Boneva",
"Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-01609498",
"docType_s":"COMM",
"producedDateY_i":2018},
{
"citationRef_s":"<i>12th European Symposium on Biochemical Engineering Science</i>, Sep 2018, Lisbon, Portugal",
"citationFull_s":"Emilie Allart, Joachim Niehren, Cristian Versari. Elementary Flux Modes Improve Gene Knockout Predictions. <i>12th European Symposium on Biochemical Engineering Science</i>, Sep 2018, Lisbon, Portugal. <a target=\"_blank\" href=\"https://hal.science/hal-02441405\">⟨hal-02441405⟩</a>",
"title_s":["Elementary Flux Modes Improve Gene Knockout Predictions"],
"authFullName_s":["Emilie Allart",
"Joachim Niehren",
"Cristian Versari"],
"halId_s":"hal-02441405",
"docType_s":"COMM",
"producedDateY_i":2018},
{
"citationRef_s":"2018",
"citationFull_s":"Iovka Boneva, Joachim Niehren, Momar Sakho. Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version). 2018. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01846016\">⟨hal-01846016⟩</a>",
"title_s":["Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version)"],
"authFullName_s":["Iovka Boneva",
"Joachim Niehren",
"Momar Sakho"],
"halId_s":"hal-01846016",
"docType_s":"UNDEFINED",
"producedDateY_i":2018},
{
"citationRef_s":"<i>DLT 2017 - Developments in Language Theory</i>, Aug 2017, Liege, Belgium. pp.12, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-29709-0_32\">⟨10.1007/978-3-642-29709-0_32⟩</a>",
"citationFull_s":"Vincent Hugot, Adrien Boiret, Joachim Niehren. Equivalence of Symbolic Tree Transducers. <i>DLT 2017 - Developments in Language Theory</i>, Aug 2017, Liege, Belgium. pp.12, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-29709-0_32\">⟨10.1007/978-3-642-29709-0_32⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01517919v2\">⟨hal-01517919v2⟩</a>",
"title_s":["Equivalence of Symbolic Tree Transducers"],
"authFullName_s":["Vincent Hugot",
"Adrien Boiret",
"Joachim Niehren"],
"halId_s":"hal-01517919",
"docType_s":"COMM",
"producedDateY_i":2017},
{
"citationRef_s":"2017",
"citationFull_s":"Adrien Boiret, Aurélien Lemay, Joachim Niehren. A Learning Algorithm for Top-Down Tree Transducers. 2017. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01357627\">⟨hal-01357627⟩</a>",
"title_s":["A Learning Algorithm for Top-Down Tree Transducers"],
"authFullName_s":["Adrien Boiret",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-01357627",
"docType_s":"UNDEFINED",
"producedDateY_i":2017},
{
"citationRef_s":"<i>Information and Computation</i>, 2017, 253, pp.304-335 <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2016.07.012\">⟨10.1016/j.ic.2016.07.012⟩</a>",
"citationFull_s":"Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Automata for Unordered Trees. <i>Information and Computation</i>, 2017, 253, pp.304-335 <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2016.07.012\">⟨10.1016/j.ic.2016.07.012⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01179493\">⟨hal-01179493⟩</a>",
"title_s":["Automata for Unordered Trees"],
"authFullName_s":["Adrien Boiret",
"Vincent Hugot",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"hal-01179493",
"docType_s":"ART",
"producedDateY_i":2017},
{
"citationRef_s":"<i>Biotechnology Journal</i>, 2017, 12 (7), pp.23. <a target=\"_blank\" href=\"https://dx.doi.org/10.1002/biot.201600574\">⟨10.1002/biot.201600574⟩</a>",
"citationFull_s":"Debarun Dhali, François Coutte, Anthony Argüelles Arias, Sandrine S. Auger, Vladimir V. Bidnenko, et al.. Genetic engineering of the branched fatty acid metabolic pathway of Bacillus subtilis for the overproduction of surfactin C14 isoform. <i>Biotechnology Journal</i>, 2017, 12 (7), pp.23. <a target=\"_blank\" href=\"https://dx.doi.org/10.1002/biot.201600574\">⟨10.1002/biot.201600574⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01502183\">⟨hal-01502183⟩</a>",
"title_s":["Genetic engineering of the branched fatty acid metabolic pathway of Bacillus subtilis for the overproduction of surfactin C14 isoform"],
"authFullName_s":["Debarun Dhali",
"François Coutte",
"Anthony Argüelles Arias",
"Sandrine S. Auger",
"Vladimir V. Bidnenko",
"Gabrielle Chataigné",
"Michael Lalk",
"Joachim Niehren",
"de Sousa Joana",
"Cristian Versari",
"Philippe Jacques"],
"halId_s":"hal-01502183",
"docType_s":"ART",
"producedDateY_i":2017},
{
"citationRef_s":"<i>Computation</i>, 2017, Multiscale and Hybrid Modeling of the Living Systems",
"citationFull_s":"Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren. Simplification of Reaction Networks, Confluence and Elementary Modes. <i>Computation</i>, 2017, Multiscale and Hybrid Modeling of the Living Systems. <a target=\"_blank\" href=\"https://hal.science/hal-01471074\">⟨hal-01471074⟩</a>",
"title_s":["Simplification of Reaction Networks, Confluence and Elementary Modes"],
"authFullName_s":["Guillaume Madelaine",
"Elisa Tonello",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"hal-01471074",
"docType_s":"ART",
"producedDateY_i":2017},
{
"citationRef_s":"<i>BioSystems</i>, 2016, Special Issue of CMSB'2015, 149, pp.34--49. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.biosystems.2016.08.003\">⟨10.1016/j.biosystems.2016.08.003⟩</a>",
"citationFull_s":"Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren, Elisa Tonello. Structural simplification of chemical reaction networks in partial steady states. <i>BioSystems</i>, 2016, Special Issue of CMSB'2015, 149, pp.34--49. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.biosystems.2016.08.003\">⟨10.1016/j.biosystems.2016.08.003⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01350517\">⟨hal-01350517⟩</a>",
"title_s":["Structural simplification of chemical reaction networks in partial steady states"],
"authFullName_s":["Guillaume Madelaine",
"Cédric Lhoussaine",
"Joachim Niehren",
"Elisa Tonello"],
"halId_s":"hal-01350517",
"docType_s":"ART",
"producedDateY_i":2016},
{
"citationRef_s":"<i>BioSystems</i>, 2016, Special Issue of CMSB 2015, 149, pp.113-124. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.biosystems.2016.09.003\">⟨10.1016/j.biosystems.2016.09.003⟩</a>",
"citationFull_s":"Joachim Niehren, Cristian Versari, Mathias John, François Coutte, Philippe Jacques. Predicting Changes of Reaction Networks with Partial Kinetic Information. <i>BioSystems</i>, 2016, Special Issue of CMSB 2015, 149, pp.113-124. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.biosystems.2016.09.003\">⟨10.1016/j.biosystems.2016.09.003⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01239198v3\">⟨hal-01239198v3⟩</a>",
"title_s":["Predicting Changes of Reaction Networks with Partial Kinetic Information"],
"authFullName_s":["Joachim Niehren",
"Cristian Versari",
"Mathias John",
"François Coutte",
"Philippe Jacques"],
"halId_s":"hal-01239198",
"docType_s":"ART",
"producedDateY_i":2016},
{
"citationRef_s":"<i>International Conference on Grammatical Inference 2016</i>, Oct 2016, Delft, Netherlands",
"citationFull_s":"Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Top-Down Tree Transducers with Regular Domain Inspection. <i>International Conference on Grammatical Inference 2016</i>, Oct 2016, Delft, Netherlands. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01357186\">⟨hal-01357186⟩</a>",
"title_s":["Learning Top-Down Tree Transducers with Regular Domain Inspection"],
"authFullName_s":["Adrien Boiret",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-01357186",
"docType_s":"COMM",
"producedDateY_i":2016},
{
"citationRef_s":"<i>14th International Conference on Computational Methods in Systems Biology (CMSB 2016)</i>, Ezio Bartocci; Pietro Lio; Nicola Paoletti, Sep 2016, Cambridge, United Kingdom",
"citationFull_s":"Guillaume Madelaine, Elisa Tonello, Cédric Lhoussaine, Joachim Niehren. Normalizing Chemical Reaction Networks by Confluent Structural Simplification. <i>14th International Conference on Computational Methods in Systems Biology (CMSB 2016)</i>, Ezio Bartocci; Pietro Lio; Nicola Paoletti, Sep 2016, Cambridge, United Kingdom. <a target=\"_blank\" href=\"https://hal.science/hal-01348303\">⟨hal-01348303⟩</a>",
"title_s":["Normalizing Chemical Reaction Networks by Confluent Structural Simplification"],
"authFullName_s":["Guillaume Madelaine",
"Elisa Tonello",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"hal-01348303",
"docType_s":"COMM",
"producedDateY_i":2016},
{
"citationRef_s":"2016",
"citationFull_s":"Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Top-Down Tree Transformations with Regular Inspection. 2016. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01357631\">⟨hal-01357631⟩</a>",
"title_s":["Learning Top-Down Tree Transformations with Regular Inspection"],
"authFullName_s":["Adrien Boiret",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-01357631",
"docType_s":"UNDEFINED",
"producedDateY_i":2016},
{
"citationRef_s":"<i>International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, Jan 2016, Harrachov, Czech Republic",
"citationFull_s":"Tom Sebastian, Joachim Niehren. Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams\r\n. <i>International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, Jan 2016, Harrachov, Czech Republic. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01182529\">⟨hal-01182529⟩</a>",
"title_s":["Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams"],
"authFullName_s":["Tom Sebastian",
"Joachim Niehren"],
"halId_s":"hal-01182529",
"docType_s":"COMM",
"producedDateY_i":2016},
{
"citationRef_s":"<i>Computational Methods for Systems Biology</i>, Sep 2015, Nantes, France. pp.157-169",
"citationFull_s":"Joachim Niehren, Mathias John, Cristian Versari, François Coutte, Philippe Jacques. Qualitative Reasoning about Reaction Networks with Partial Kinetic Information. <i>Computational Methods for Systems Biology</i>, Sep 2015, Nantes, France. pp.157-169. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01163391v2\">⟨hal-01163391v2⟩</a>",
"title_s":["Qualitative Reasoning about Reaction Networks with Partial Kinetic Information"],
"authFullName_s":["Joachim Niehren",
"Mathias John",
"Cristian Versari",
"François Coutte",
"Philippe Jacques"],
"halId_s":"hal-01163391",
"docType_s":"COMM",
"producedDateY_i":2015},
{
"citationRef_s":"<i>Computational Methods in Systems Biology (CMSB)</i>, Jérémie BOURDON; Olivier ROUX, Sep 2015, Nantes, France. pp.133-144",
"citationFull_s":"Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren. Structural simplification of chemical reaction networks preserving deterministic semantics. <i>Computational Methods in Systems Biology (CMSB)</i>, Jérémie BOURDON; Olivier ROUX, Sep 2015, Nantes, France. pp.133-144. <a target=\"_blank\" href=\"https://hal.science/hal-01168038\">⟨hal-01168038⟩</a>",
"title_s":["Structural simplification of chemical reaction networks preserving deterministic semantics"],
"authFullName_s":["Guillaume Madelaine",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"hal-01168038",
"docType_s":"COMM",
"producedDateY_i":2015},
{
"citationRef_s":"<i>Biotechnology Journal</i>, 2015, 10 (8), pp.1216-34. <a target=\"_blank\" href=\"https://dx.doi.org/10.1002/biot.201400541\">⟨10.1002/biot.201400541⟩</a>",
"citationFull_s":"François Coutte, Joachim Niehren, Debarun Dhali, Mathias John, Cristian Versari, et al.. Modeling Leucine’s Metabolic Pathway and Knockout Prediction Improving the Production of Surfactin, a Biosurfactant from Bacillus Subtilis. <i>Biotechnology Journal</i>, 2015, 10 (8), pp.1216-34. <a target=\"_blank\" href=\"https://dx.doi.org/10.1002/biot.201400541\">⟨10.1002/biot.201400541⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01153704\">⟨hal-01153704⟩</a>",
"title_s":["Modeling Leucine’s Metabolic Pathway and Knockout Prediction Improving the Production of Surfactin, a Biosurfactant from Bacillus Subtilis"],
"authFullName_s":["François Coutte",
"Joachim Niehren",
"Debarun Dhali",
"Mathias John",
"Cristian Versari",
"Philippe Jacques"],
"halId_s":"hal-01153704",
"docType_s":"ART",
"producedDateY_i":2015},
{
"citationRef_s":"2015",
"citationFull_s":"Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Sequential Tree-to-Word Transducers: Normalization, Minimization, and Learning. 2015. <a target=\"_blank\" href=\"https://hal.science/hal-01186993\">⟨hal-01186993⟩</a>",
"title_s":["Sequential Tree-to-Word Transducers: Normalization, Minimization, and Learning"],
"authFullName_s":["Grégoire Laurence",
"Aurélien Lemay",
"Joachim Niehren",
"Slawomir Staworko",
"Marc Tommasi"],
"halId_s":"hal-01186993",
"docType_s":"OTHER",
"producedDateY_i":2015},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2015, 577, pp.98-124. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2015.02.027\">⟨10.1016/j.tcs.2015.02.027⟩</a>",
"citationFull_s":"Manfred Schmidt-Schauss, David Sabel, Joachim Niehren, Jan Schwinghammer. Observational Program Calculi and the Correctness of Translations. <i>Theoretical Computer Science</i>, 2015, 577, pp.98-124. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2015.02.027\">⟨10.1016/j.tcs.2015.02.027⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00824349\">⟨hal-00824349⟩</a>",
"title_s":["Observational Program Calculi and the Correctness of Translations"],
"authFullName_s":["Manfred Schmidt-Schauss",
"David Sabel",
"Joachim Niehren",
"Jan Schwinghammer"],
"halId_s":"hal-00824349",
"docType_s":"ART",
"producedDateY_i":2015},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2015, 578, pp.100-125. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2015.01.017\">⟨10.1016/j.tcs.2015.01.017⟩</a>",
"citationFull_s":"Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui. Early Nested Word Automata for XPath Query Answering on XML Streams. <i>Theoretical Computer Science</i>, 2015, 578, pp.100-125. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2015.01.017\">⟨10.1016/j.tcs.2015.01.017⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00966625\">⟨hal-00966625⟩</a>",
"title_s":["Early Nested Word Automata for XPath Query Answering on XML Streams"],
"authFullName_s":["Denis Debarbieux",
"Olivier Gauwin",
"Joachim Niehren",
"Tom Sebastian",
"Mohamed Zergaoui"],
"halId_s":"hal-00966625",
"docType_s":"ART",
"producedDateY_i":2015},
{
"citationRef_s":"<i>9th International Conference on. Language and Automata Theory and Applications</i>, Mar 2015, Nice, France",
"citationFull_s":"Antoine Mbaye Ndione, Aurélien Lemay, Joachim Niehren. Sublinear DTD Validity. <i>9th International Conference on. Language and Automata Theory and Applications</i>, Mar 2015, Nice, France. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00803696\">⟨hal-00803696⟩</a>",
"title_s":["Sublinear DTD Validity"],
"authFullName_s":["Antoine Mbaye Ndione",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-00803696",
"docType_s":"COMM",
"producedDateY_i":2015},
{
"citationRef_s":"<i>LATA : 9th International Conference on Language and Automata Theory and Applications</i>, Mar 2015, Nice, France. pp.175-187",
"citationFull_s":"Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Logics for Unordered Trees with Data Constraints on Siblings. <i>LATA : 9th International Conference on Language and Automata Theory and Applications</i>, Mar 2015, Nice, France. pp.175-187. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01088761\">⟨hal-01088761⟩</a>",
"title_s":["Logics for Unordered Trees with Data Constraints on Siblings"],
"authFullName_s":["Adrien Boiret",
"Vincent Hugot",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"hal-01088761",
"docType_s":"COMM",
"producedDateY_i":2015},
{
"citationRef_s":"<i>41st SOFSEM: International Conference on Current Trends in Theory and Practice of Computer Science</i>, Jan 2015, Pec pod Sněžkou, Czech Republic",
"citationFull_s":"Pavel Labath, Joachim Niehren. A Uniform Programming Language for Implementing XML Standards. <i>41st SOFSEM: International Conference on Current Trends in Theory and Practice of Computer Science</i>, Jan 2015, Pec pod Sněžkou, Czech Republic. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00954692\">⟨hal-00954692⟩</a>",
"title_s":["A Uniform Programming Language for Implementing XML Standards"],
"authFullName_s":["Pavel Labath",
"Joachim Niehren"],
"halId_s":"hal-00954692",
"docType_s":"COMM",
"producedDateY_i":2015},
{
"citationRef_s":"<i>First International Conference on Formal Methods in Macro-Biology</i>, Sep 2014, Nouméa, New Caledonia. pp.82-101",
"citationFull_s":"Guillaume Madelaine, Cédric Lhoussaine, Joachim Niehren. Attractor Equivalence: An Observational Semantics for Reaction Networks. <i>First International Conference on Formal Methods in Macro-Biology</i>, Sep 2014, Nouméa, New Caledonia. pp.82-101. <a target=\"_blank\" href=\"https://hal.science/hal-00990924\">⟨hal-00990924⟩</a>",
"title_s":["Attractor Equivalence: An Observational Semantics for Reaction Networks"],
"authFullName_s":["Guillaume Madelaine",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"hal-00990924",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"<i>Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf)</i>, Sep 2014, Verona, Italy. pp.189-202, <a target=\"_blank\" href=\"https://dx.doi.org/10.4204/EPTCS.161.17\">⟨10.4204/EPTCS.161.17⟩</a>",
"citationFull_s":"Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. Deterministic Automata for Unordered Trees. <i>Fifth International Symposium on Games, Automata, Logics and Formal Verification (Gandalf)</i>, Sep 2014, Verona, Italy. pp.189-202, <a target=\"_blank\" href=\"https://dx.doi.org/10.4204/EPTCS.161.17\">⟨10.4204/EPTCS.161.17⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01020236\">⟨hal-01020236⟩</a>",
"title_s":["Deterministic Automata for Unordered Trees"],
"authFullName_s":["Adrien Boiret",
"Vincent Hugot",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"hal-01020236",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"<i>10th European Symposium of Biochemical Science (ESBES) and 6th International Forum on Industrial Bioprocesses</i>, Sep 2014, Lille, France",
"citationFull_s":"Philippe Jacques, François Coutte, Max Béchet, Jean-Sebastien Guez, Valérie Leclère, et al.. Directed Biosynthesis of Antifungal and Biosurfactant Lipopeptides from Bacillus subtilis.. <i>10th European Symposium of Biochemical Science (ESBES) and 6th International Forum on Industrial Bioprocesses</i>, Sep 2014, Lille, France. <a target=\"_blank\" href=\"https://hal.science/hal-03877026\">⟨hal-03877026⟩</a>",
"title_s":["Directed Biosynthesis of Antifungal and Biosurfactant Lipopeptides from Bacillus subtilis."],
"authFullName_s":["Philippe Jacques",
"François Coutte",
"Max Béchet",
"Jean-Sebastien Guez",
"Valérie Leclère",
"D. Dhali",
"Patrick Fickers",
"M. John",
"Joachim Niehren"],
"halId_s":"hal-03877026",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"<i>8th International Conference on Language and Automata Theory and Applications</i>, Mar 2014, Madrid, Spain",
"citationFull_s":"Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Learning Sequential Tree-to-Word Transducers. <i>8th International Conference on Language and Automata Theory and Applications</i>, Mar 2014, Madrid, Spain. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00912969\">⟨hal-00912969⟩</a>",
"title_s":["Learning Sequential Tree-to-Word Transducers"],
"authFullName_s":["Grégoire Laurence",
"Aurélien Lemay",
"Joachim Niehren",
"Slawomir Staworko",
"Marc Tommasi"],
"halId_s":"hal-00912969",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"[Research Report] inria lille. 2013",
"citationFull_s":"Anthony Lick, Joachim Niehren. Early = Earliest?. [Research Report] inria lille. 2013. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00873742\">⟨hal-00873742⟩</a>",
"title_s":["Early = Earliest?"],
"authFullName_s":["Anthony Lick",
"Joachim Niehren"],
"halId_s":"hal-00873742",
"docType_s":"REPORT",
"producedDateY_i":2013},
{
"citationRef_s":"<i>18th International Conference on Implementation and Application of Automata</i>, Jul 2013, Halifax, Canada. pp.292-305",
"citationFull_s":"Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui. Early Nested Word Automata for XPath Query Answering on XML Streams. <i>18th International Conference on Implementation and Application of Automata</i>, Jul 2013, Halifax, Canada. pp.292-305. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00676178v2\">⟨hal-00676178v2⟩</a>",
"title_s":["Early Nested Word Automata for XPath Query Answering on XML Streams"],
"authFullName_s":["Denis Debarbieux",
"Olivier Gauwin",
"Joachim Niehren",
"Tom Sebastian",
"Mohamed Zergaoui"],
"halId_s":"hal-00676178",
"docType_s":"COMM",
"producedDateY_i":2013},
{
"citationRef_s":"<i>Journal of Machine Learning Research</i>, 2013, 14 (1), pp.927−964",
"citationFull_s":"Joachim Niehren, Jérôme Champavère, Rémi Gilleron, Aurélien Lemay. Query Induction with Schema-Guided Pruning Strategies. <i>Journal of Machine Learning Research</i>, 2013, 14 (1), pp.927−964. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00607121v2\">⟨inria-00607121v2⟩</a>",
"title_s":["Query Induction with Schema-Guided Pruning Strategies"],
"authFullName_s":["Joachim Niehren",
"Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay"],
"halId_s":"inria-00607121",
"docType_s":"ART",
"producedDateY_i":2013},
{
"citationRef_s":"[Research Report] inria lille. 2013",
"citationFull_s":"Pavel Labath, Joachim Niehren. A Functional Language for Hyperstreaming XSLT. [Research Report] inria lille. 2013. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00806343\">⟨hal-00806343⟩</a>",
"title_s":["A Functional Language for Hyperstreaming XSLT"],
"authFullName_s":["Pavel Labath",
"Joachim Niehren"],
"halId_s":"hal-00806343",
"docType_s":"REPORT",
"producedDateY_i":2013},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2013, 487, pp.37-49. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2013.03.004\">⟨10.1016/j.tcs.2013.03.004⟩</a>",
"citationFull_s":"Antoine Mbaye Ndione, Aurélien Lemay, Joachim Niehren. Approximate Membership for Regular Languages modulo the Edit Distance. <i>Theoretical Computer Science</i>, 2013, 487, pp.37-49. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2013.03.004\">⟨10.1016/j.tcs.2013.03.004⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00801970\">⟨hal-00801970⟩</a>",
"title_s":["Approximate Membership for Regular Languages modulo the Edit Distance"],
"authFullName_s":["Antoine Mbaye Ndione",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-00801970",
"docType_s":"ART",
"producedDateY_i":2013},
{
"citationRef_s":"<i>14th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Jan 2013, Rome, Italy. pp.355-374",
"citationFull_s":"Mathias John, Mirabelle Nebut, Joachim Niehren. Knockout Prediction for Reaction Networks with Partial Kinetic Information. <i>14th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Jan 2013, Rome, Italy. pp.355-374. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00692499\">⟨hal-00692499⟩</a>",
"title_s":["Knockout Prediction for Reaction Networks with Partial Kinetic Information"],
"authFullName_s":["Mathias John",
"Mirabelle Nebut",
"Joachim Niehren"],
"halId_s":"hal-00692499",
"docType_s":"COMM",
"producedDateY_i":2013},
{
"citationRef_s":"<i>9th European Symposium on Biochemical Engineering Science</i>, Sep 2012, Istanbul, Turkey",
"citationFull_s":"François Coutte, Mathias John, Max Béchet, Mirabelle Nebut, Joachim Niehren, et al.. Synthetic Engineering of Bacillus subtilis to Overproduce Lipopeptide Biosurfactants. <i>9th European Symposium on Biochemical Engineering Science</i>, Sep 2012, Istanbul, Turkey. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00717261\">⟨hal-00717261⟩</a>",
"title_s":["Synthetic Engineering of Bacillus subtilis to Overproduce Lipopeptide Biosurfactants"],
"authFullName_s":["François Coutte",
"Mathias John",
"Max Béchet",
"Mirabelle Nebut",
"Joachim Niehren",
"Valérie Leclère",
"Philippe Jacques"],
"halId_s":"hal-00717261",
"docType_s":"COMM",
"producedDateY_i":2012},
{
"citationRef_s":"<i>3rd International Symposium on Antimicrobial Peptides</i>, Jun 2012, Lille, France",
"citationFull_s":"Mathias John, François Coutte, Mirabelle Nebut, Philippe Jacques, Joachim Niehren. Knockout Prediction for Reaction Networks with Partial Kinetic Information: Application to Surfactin Overproduction in Bacillus subtilis. <i>3rd International Symposium on Antimicrobial Peptides</i>, Jun 2012, Lille, France. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00702295\">⟨hal-00702295⟩</a>",
"title_s":["Knockout Prediction for Reaction Networks with Partial Kinetic Information: Application to Surfactin Overproduction in Bacillus subtilis"],
"authFullName_s":["Mathias John",
"François Coutte",
"Mirabelle Nebut",
"Philippe Jacques",
"Joachim Niehren"],
"halId_s":"hal-00702295",
"docType_s":"COMM",
"producedDateY_i":2012},
{
"citationRef_s":"<i>16th International Conference on Developments of Language Theory</i>, Apr 2012, Taipee, Taiwan",
"citationFull_s":"Adrien Boiret, Aurélien Lemay, Joachim Niehren. Learning Rational Functions. <i>16th International Conference on Developments of Language Theory</i>, Apr 2012, Taipee, Taiwan. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00692341\">⟨hal-00692341⟩</a>",
"title_s":["Learning Rational Functions"],
"authFullName_s":["Adrien Boiret",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"hal-00692341",
"docType_s":"COMM",
"producedDateY_i":2012},
{
"citationRef_s":"<i>16th International Conference on Implementation and Application of Automata</i>, Jul 2011, Blois, France. pp.3-15",
"citationFull_s":"Olivier Gauwin, Joachim Niehren. Streamable Fragments of Forward XPath. <i>16th International Conference on Implementation and Application of Automata</i>, Jul 2011, Blois, France. pp.3-15. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00442250\">⟨inria-00442250⟩</a>",
"title_s":["Streamable Fragments of Forward XPath"],
"authFullName_s":["Olivier Gauwin",
"Joachim Niehren"],
"halId_s":"inria-00442250",
"docType_s":"COMM",
"producedDateY_i":2011},
{
"citationRef_s":"<i>5th International Conference on Language Automata Theory and Appliciations</i>, May 2011, Tarragona, Spain",
"citationFull_s":"Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Normalization of Sequential Top-Down Tree-to-Word Transducers. <i>5th International Conference on Language Automata Theory and Appliciations</i>, May 2011, Tarragona, Spain. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00566291\">⟨inria-00566291⟩</a>",
"title_s":["Normalization of Sequential Top-Down Tree-to-Word Transducers"],
"authFullName_s":["Grégoire Laurence",
"Aurélien Lemay",
"Joachim Niehren",
"Slawomir Staworko",
"Marc Tommasi"],
"halId_s":"inria-00566291",
"docType_s":"COMM",
"producedDateY_i":2011},
{
"citationRef_s":"<i>20th European Symposium on Programming Languages</i>, Mar 2011, Saarbrücken, Germany. pp.338-357",
"citationFull_s":"Mathias John, Cédric Lhoussaine, Joachim Niehren, Cristian Versari. Biochemical Reaction Rules with Constraints. <i>20th European Symposium on Programming Languages</i>, Mar 2011, Saarbrücken, Germany. pp.338-357. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00544387\">⟨inria-00544387⟩</a>",
"title_s":["Biochemical Reaction Rules with Constraints"],
"authFullName_s":["Mathias John",
"Cédric Lhoussaine",
"Joachim Niehren",
"Cristian Versari"],
"halId_s":"inria-00544387",
"docType_s":"COMM",
"producedDateY_i":2011},
{
"citationRef_s":"<i>Information and Computation</i>, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.08.003\">⟨10.1016/j.ic.2010.08.003⟩</a>",
"citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Queries on XML Streams with Bounded Delay and Concurrency. <i>Information and Computation</i>, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2010.08.003\">⟨10.1016/j.ic.2010.08.003⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00491495\">⟨inria-00491495⟩</a>",
"title_s":["Queries on XML Streams with Bounded Delay and Concurrency"],
"authFullName_s":["Olivier Gauwin",
"Joachim Niehren",
"Sophie Tison"],
"halId_s":"inria-00491495",
"docType_s":"ART",
"producedDateY_i":2011},
{
"citationRef_s":"[Research Report] 2011",
"citationFull_s":"Guillaume Bagan, Joachim Niehren. Constant Delay Enumeration for Acyclic Conjunctive Queries over X-Doublebar Structures. [Research Report] 2011. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00609719\">⟨inria-00609719⟩</a>",
"title_s":["Constant Delay Enumeration for Acyclic Conjunctive Queries over X-Doublebar Structures"],
"authFullName_s":["Guillaume Bagan",
"Joachim Niehren"],
"halId_s":"inria-00609719",
"docType_s":"REPORT",
"producedDateY_i":2011},
{
"citationRef_s":"<i>29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, Jun 2010, Indianapolis, United States. pp.285-296",
"citationFull_s":"Aurélien Lemay, Sebastian Maneth, Joachim Niehren. A Learning Algorithm for Top-Down XML Transformations. <i>29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, Jun 2010, Indianapolis, United States. pp.285-296. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00460489v2\">⟨inria-00460489v2⟩</a>",
"title_s":["A Learning Algorithm for Top-Down XML Transformations"],
"authFullName_s":["Aurélien Lemay",
"Sebastian Maneth",
"Joachim Niehren"],
"halId_s":"inria-00460489",
"docType_s":"COMM",
"producedDateY_i":2010},
{
"citationRef_s":"Corrado Priami; Rainer Breitling; David Gilbert; Monika Heiner; Adelinde M. Uhrmacher. <i>Transactions on Computational Systems Biology XII: Special Issue on Modeling Methodologies</i>, LNBI-5945, Springer, pp.13-76, 2010, Lecture Notes in Bioinformatics (Journal Subline), 978-3-642-11712-1. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-11712-1_2\">⟨10.1007/978-3-642-11712-1_2⟩</a>",
"citationFull_s":"Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde Uhrmacher. The Attributed Pi Calculus with Priorities. Corrado Priami; Rainer Breitling; David Gilbert; Monika Heiner; Adelinde M. Uhrmacher. <i>Transactions on Computational Systems Biology XII: Special Issue on Modeling Methodologies</i>, LNBI-5945, Springer, pp.13-76, 2010, Lecture Notes in Bioinformatics (Journal Subline), 978-3-642-11712-1. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-11712-1_2\">⟨10.1007/978-3-642-11712-1_2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00422969\">⟨inria-00422969⟩</a>",
"title_s":["The Attributed Pi Calculus with Priorities"],
"authFullName_s":["Mathias John",
"Cédric Lhoussaine",
"Joachim Niehren",
"Adelinde Uhrmacher"],
"halId_s":"inria-00422969",
"docType_s":"COUV",
"producedDateY_i":2010},
{
"citationRef_s":"<i>Information and Computation</i>, 2009, 207 (11), pp.1181-1208. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2009.03.003\">⟨10.1016/j.ic.2009.03.003⟩</a>",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas. <i>Information and Computation</i>, 2009, 207 (11), pp.1181-1208. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2009.03.003\">⟨10.1016/j.ic.2009.03.003⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00366082v3\">⟨inria-00366082v3⟩</a>",
"title_s":["Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00366082",
"docType_s":"ART",
"producedDateY_i":2009},
{
"citationRef_s":"<i>The 2009 SIGPLAN Workshop on ML</i>, Oct 2009, Edinburgh, United Kingdom. pp.27-38",
"citationFull_s":"Jan Schwinghammer, David Sabel, Manfred Schmidt-Schauss, Joachim Niehren. Correctly Translating Concurrency Primitives. <i>The 2009 SIGPLAN Workshop on ML</i>, Oct 2009, Edinburgh, United Kingdom. pp.27-38. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00429239\">⟨inria-00429239⟩</a>",
"title_s":["Correctly Translating Concurrency Primitives"],
"authFullName_s":["Jan Schwinghammer",
"David Sabel",
"Manfred Schmidt-Schauss",
"Joachim Niehren"],
"halId_s":"inria-00429239",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>Fundamentals of Computation Theory</i>, Maciej Gebala and Malgorzata Korzeniowska, Sep 2009, Wroclaw, Poland. pp.310-322, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-03409-1_28\">⟨10.1007/978-3-642-03409-1_28⟩</a>",
"citationFull_s":"Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren. Equivalence of Deterministic Nested Word to Word Transducers. <i>Fundamentals of Computation Theory</i>, Maciej Gebala and Malgorzata Korzeniowska, Sep 2009, Wroclaw, Poland. pp.310-322, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-03409-1_28\">⟨10.1007/978-3-642-03409-1_28⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00423961\">⟨inria-00423961⟩</a>",
"title_s":["Equivalence of Deterministic Nested Word to Word Transducers"],
"authFullName_s":["Slawomir Staworko",
"Grégoire Laurence",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00423961",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>17th International Symposium on Fundamentals of Computer Theory</i>, Sep 2009, Wraclaw, Poland. pp.121-132",
"citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata. <i>17th International Symposium on Fundamentals of Computer Theory</i>, Sep 2009, Wraclaw, Poland. pp.121-132. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00390236v2\">⟨inria-00390236v2⟩</a>",
"title_s":["Earliest Query Answering for Deterministic Nested Word Automata"],
"authFullName_s":["Olivier Gauwin",
"Joachim Niehren",
"Sophie Tison"],
"halId_s":"inria-00390236",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>Computational Methods in Systems Biology, 7th International Conference</i>, Aug 2009, Bologna, Italy. pp.235-250, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-03845-7\">⟨10.1007/978-3-642-03845-7⟩</a>",
"citationFull_s":"Mathias John, Cédric Lhoussaine, Joachim Niehren. Dynamic Compartments in the Imperative Pi Calculus. <i>Computational Methods in Systems Biology, 7th International Conference</i>, Aug 2009, Bologna, Italy. pp.235-250, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-03845-7\">⟨10.1007/978-3-642-03845-7⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00422970\">⟨inria-00422970⟩</a>",
"title_s":["Dynamic Compartments in the Imperative Pi Calculus"],
"authFullName_s":["Mathias John",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"inria-00422970",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>3rd International Conference on Language and Automata Theory and Applications</i>, Apr 2009, Tarragona, Spain. pp.350-361, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2\">⟨10.1007/978-3-642-00982-2⟩</a>",
"citationFull_s":"Olivier Gauwin, Joachim Niehren, Sophie Tison. Bounded Delay and Concurrency for Earliest Query Answering. <i>3rd International Conference on Language and Automata Theory and Applications</i>, Apr 2009, Tarragona, Spain. pp.350-361, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2\">⟨10.1007/978-3-642-00982-2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00348463\">⟨inria-00348463⟩</a>",
"title_s":["Bounded Delay and Concurrency for Earliest Query Answering"],
"authFullName_s":["Olivier Gauwin",
"Joachim Niehren",
"Sophie Tison"],
"halId_s":"inria-00348463",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>Information Processing Letters</i>, 2008, 109 (1), pp.13-17. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ipl.2008.08.002\">⟨10.1016/j.ipl.2008.08.002⟩</a>",
"citationFull_s":"Olivier Gauwin, Joachim Niehren, Yves Roos. Streaming Tree Automata. <i>Information Processing Letters</i>, 2008, 109 (1), pp.13-17. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ipl.2008.08.002\">⟨10.1016/j.ipl.2008.08.002⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00288445v3\">⟨inria-00288445v3⟩</a>",
"title_s":["Streaming Tree Automata"],
"authFullName_s":["Olivier Gauwin",
"Joachim Niehren",
"Yves Roos"],
"halId_s":"inria-00288445",
"docType_s":"ART",
"producedDateY_i":2008},
{
"citationRef_s":"<i>Computational Methods in Systems Biology, 6th International Conference CMSB</i>, Oct 2008, Rostock, Germany. pp.83-102",
"citationFull_s":"Mathias John, Cédric Lhoussaine, Joachim Niehren, Adelinde Uhrmacher. The Attributed Pi Calculus. <i>Computational Methods in Systems Biology, 6th International Conference CMSB</i>, Oct 2008, Rostock, Germany. pp.83-102. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00308970v4\">⟨inria-00308970v4⟩</a>",
"title_s":["The Attributed Pi Calculus"],
"authFullName_s":["Mathias John",
"Cédric Lhoussaine",
"Joachim Niehren",
"Adelinde Uhrmacher"],
"halId_s":"inria-00308970",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>5th IFIP International Conference on Theoretical Computer Science</i>, Sep 2008, Milano, Italy. pp.521-535",
"citationFull_s":"Manfred Schmidt-Schauss, Joachim Niehren, Jan Schwinghammer, David Sabel. Adequacy of compositional translations for observational semantics. <i>5th IFIP International Conference on Theoretical Computer Science</i>, Sep 2008, Milano, Italy. pp.521-535. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00257279v7\">⟨inria-00257279v7⟩</a>",
"title_s":["Adequacy of compositional translations for observational semantics"],
"authFullName_s":["Manfred Schmidt-Schauss",
"Joachim Niehren",
"Jan Schwinghammer",
"David Sabel"],
"halId_s":"inria-00257279",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>9th International Colloquium on Grammatical Inference</i>, Sep 2008, Saint-Malo, France. pp.15-28, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-88009-7_2\">⟨10.1007/978-3-540-88009-7_2⟩</a>",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Schema-Guided Induction of Monadic Queries. <i>9th International Colloquium on Grammatical Inference</i>, Sep 2008, Saint-Malo, France. pp.15-28, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-88009-7_2\">⟨10.1007/978-3-540-88009-7_2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00309408v2\">⟨inria-00309408v2⟩</a>",
"title_s":["Schema-Guided Induction of Monadic Queries"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00309408",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>19th International Conference on Rewriting Techniques and Applications</i>, Jun 2008, Linz, Austria. pp.217-231",
"citationFull_s":"Marco Kuhlmann, Joachim Niehren. Logics and Automata for Totally Ordered Trees. <i>19th International Conference on Rewriting Techniques and Applications</i>, Jun 2008, Linz, Austria. pp.217-231. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00610420\">⟨inria-00610420⟩</a>",
"title_s":["Logics and Automata for Totally Ordered Trees"],
"authFullName_s":["Marco Kuhlmann",
"Joachim Niehren"],
"halId_s":"inria-00610420",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>2nd International Conference on Language and Automata Theory and Applications</i>, Mar 2008, Tarragona, Spain. pp.184-195",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. <i>2nd International Conference on Language and Automata Theory and Applications</i>, Mar 2008, Tarragona, Spain. pp.184-195. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00192329v6\">⟨inria-00192329v6⟩</a>",
"title_s":["Efficient Inclusion Checking for Deterministic Tree Automata and DTDs"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00192329",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X)</i>, Jan 2008, San Francisco, United States",
"citationFull_s":"Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison. Complexity of Earliest Query Answering with Streaming Tree Automata. <i>ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X)</i>, Jan 2008, San Francisco, United States. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00336169\">⟨inria-00336169⟩</a>",
"title_s":["Complexity of Earliest Query Answering with Streaming Tree Automata"],
"authFullName_s":["Olivier Gauwin",
"Anne-Cécile Caron",
"Joachim Niehren",
"Sophie Tison"],
"halId_s":"inria-00336169",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>Second International Conference on Algebraic Biology</i>, Jul 2007, Linz, Austria. pp.232-246",
"citationFull_s":"Céline Kuttler, Cédric Lhoussaine, Joachim Niehren. A Stochastic Pi Calculus for Concurrent Objects. <i>Second International Conference on Algebraic Biology</i>, Jul 2007, Linz, Austria. pp.232-246. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00121104v3\">⟨inria-00121104v3⟩</a>",
"title_s":["A Stochastic Pi Calculus for Concurrent Objects"],
"authFullName_s":["Céline Kuttler",
"Cédric Lhoussaine",
"Joachim Niehren"],
"halId_s":"inria-00121104",
"docType_s":"COMM",
"producedDateY_i":2007},
{
"citationRef_s":"<i>26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, Jun 2007, Beijing, China. pp.205-214",
"citationFull_s":"Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Polynomial Time Fragments of XPath with Variables. <i>26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems</i>, Jun 2007, Beijing, China. pp.205-214. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00135678\">⟨inria-00135678⟩</a>",
"title_s":["Polynomial Time Fragments of XPath with Variables"],
"authFullName_s":["Emmanuel Filiot",
"Joachim Niehren",
"Jean-Marc Talbot",
"Sophie Tison"],
"halId_s":"inria-00135678",
"docType_s":"COMM",
"producedDateY_i":2007},
{
"citationRef_s":"<i>23rd Conference on Mathematical Foundations of Programming Semantics</i>, Apr 2007, New Orleans, United States. pp.313-337",
"citationFull_s":"Joachim Niehren, David Sabel, Manfred Schmidt-Schauss, Jan Schwinghammer. Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. <i>23rd Conference on Mathematical Foundations of Programming Semantics</i>, Apr 2007, New Orleans, United States. pp.313-337. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00128861\">⟨inria-00128861⟩</a>",
"title_s":["Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures"],
"authFullName_s":["Joachim Niehren",
"David Sabel",
"Manfred Schmidt-Schauss",
"Jan Schwinghammer"],
"halId_s":"inria-00128861",
"docType_s":"COMM",
"producedDateY_i":2007},
{
"citationRef_s":"<i>Information Processing Letters</i>, 2007, 101 (4), pp.141-147. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ipl.2006.09.009\">⟨10.1016/j.ipl.2006.09.009⟩</a>",
"citationFull_s":"Katrin Erk, Joachim Niehren. Dominance Constraints in Stratified Context Unification. <i>Information Processing Letters</i>, 2007, 101 (4), pp.141-147. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ipl.2006.09.009\">⟨10.1016/j.ipl.2006.09.009⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00094787\">⟨inria-00094787⟩</a>",
"title_s":["Dominance Constraints in Stratified Context Unification"],
"authFullName_s":["Katrin Erk",
"Joachim Niehren"],
"halId_s":"inria-00094787",
"docType_s":"ART",
"producedDateY_i":2007},
{
"citationRef_s":"<i>Machine Learning</i>, 2007, Machine Learning, 66 (1), pp.33-67. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s10994-006-9613-8\">⟨10.1007/s10994-006-9613-8⟩</a>",
"citationFull_s":"Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Interactive Learning of Node Selecting Tree Transducers. <i>Machine Learning</i>, 2007, Machine Learning, 66 (1), pp.33-67. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s10994-006-9613-8\">⟨10.1007/s10994-006-9613-8⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00087226v5\">⟨inria-00087226v5⟩</a>",
"title_s":["Interactive Learning of Node Selecting Tree Transducers"],
"authFullName_s":["Julien Carme",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00087226",
"docType_s":"ART",
"producedDateY_i":2007},
{
"citationRef_s":"<i>Journal of Computer and System Sciences</i>, 2007, Journal of Computer and System Science, 73 (4), pp.550-583. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2006.10.021\">⟨10.1016/j.jcss.2006.10.021⟩</a>",
"citationFull_s":"Wim Martens, Joachim Niehren. On the Minimization of XML-Schemas and Tree Automata for Unranked Trees. <i>Journal of Computer and System Sciences</i>, 2007, Journal of Computer and System Science, 73 (4), pp.550-583. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.jcss.2006.10.021\">⟨10.1016/j.jcss.2006.10.021⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00088406v2\">⟨inria-00088406v2⟩</a>",
"title_s":["On the Minimization of XML-Schemas and Tree Automata for Unranked Trees"],
"authFullName_s":["Wim Martens",
"Joachim Niehren"],
"halId_s":"inria-00088406",
"docType_s":"ART",
"producedDateY_i":2007},
{
"citationRef_s":"<i>8th International Colloquium on Grammatical Inference</i>, Sep 2006, Tokyo, Japan. pp.253-267",
"citationFull_s":"Aurélien Lemay, Joachim Niehren, Rémi Gilleron. Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples. <i>8th International Colloquium on Grammatical Inference</i>, Sep 2006, Tokyo, Japan. pp.253-267. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00088077v2\">⟨inria-00088077v2⟩</a>",
"title_s":["Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples"],
"authFullName_s":["Aurélien Lemay",
"Joachim Niehren",
"Rémi Gilleron"],
"halId_s":"inria-00088077",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2006, Theoretical Computer Science, 364 (3), pp.338-356. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2006:08.016\">⟨10.1016/j.tcs.2006:08.016⟩</a>",
"citationFull_s":"Joachim Niehren, Jan Schwinghammer, Gert Smolka. A Concurrent Lambda Calculus with Futures. <i>Theoretical Computer Science</i>, 2006, Theoretical Computer Science, 364 (3), pp.338-356. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2006:08.016\">⟨10.1016/j.tcs.2006:08.016⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00090434v2\">⟨inria-00090434v2⟩</a>",
"title_s":["A Concurrent Lambda Calculus with Futures"],
"authFullName_s":["Joachim Niehren",
"Jan Schwinghammer",
"Gert Smolka"],
"halId_s":"inria-00090434",
"docType_s":"ART",
"producedDateY_i":2006},
{
"citationRef_s":"<i>Transactions on Computational Systems Biology</i>, 2006, Computational Systems Biology, 4230 (VII), pp.24-55. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/11905455_2\">⟨10.1007/11905455_2⟩</a>",
"citationFull_s":"Céline Kuttler, Joachim Niehren. Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch. <i>Transactions on Computational Systems Biology</i>, 2006, Computational Systems Biology, 4230 (VII), pp.24-55. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/11905455_2\">⟨10.1007/11905455_2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00089218v2\">⟨inria-00089218v2⟩</a>",
"title_s":["Gene Regulation in the Pi Calculus: Simulating Cooperativity at the Lambda Switch"],
"authFullName_s":["Céline Kuttler",
"Joachim Niehren"],
"halId_s":"inria-00089218",
"docType_s":"ART",
"producedDateY_i":2006},
{
"citationRef_s":"<i>PLAN-X</i>, 2006, Unknown, Unknown Region. pp.61-70, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-319-04939-7_13\">⟨10.1007/978-3-319-04939-7_13⟩</a>",
"citationFull_s":"Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Composing Monadic Queries in Trees. <i>PLAN-X</i>, 2006, Unknown, Unknown Region. pp.61-70, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-319-04939-7_13\">⟨10.1007/978-3-319-04939-7_13⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-01196266\">⟨hal-01196266⟩</a>",
"title_s":["Composing Monadic Queries in Trees"],
"authFullName_s":["Emmanuel Filiot",
"Joachim Niehren",
"Jean-Marc Talbot",
"Sophie Tison"],
"halId_s":"hal-01196266",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>5th International Conference on Logical Aspects in Computational Linguistics</i>, 2005, Bordeaux, France. pp.221-237",
"citationFull_s":"Joachim Niehren, Mateu Villaret. Describing Lambda Terms in Context Unification. <i>5th International Conference on Logical Aspects in Computational Linguistics</i>, 2005, Bordeaux, France. pp.221-237. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536524\">⟨inria-00536524⟩</a>",
"title_s":["Describing Lambda Terms in Context Unification"],
"authFullName_s":["Joachim Niehren",
"Mateu Villaret"],
"halId_s":"inria-00536524",
"docType_s":"COMM",
"producedDateY_i":2005},
{
"citationRef_s":"<i>10th International Symposium on Database Programming Languages</i>, 2005, Trondheim, Norway. pp.232--246",
"citationFull_s":"Wim Martens, Joachim Niehren. Minimizing Tree Automata for Unranked Trees. <i>10th International Symposium on Database Programming Languages</i>, 2005, Trondheim, Norway. pp.232--246. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536521\">⟨inria-00536521⟩</a>",
"title_s":["Minimizing Tree Automata for Unranked Trees"],
"authFullName_s":["Wim Martens",
"Joachim Niehren"],
"halId_s":"inria-00536521",
"docType_s":"COMM",
"producedDateY_i":2005},
{
"citationRef_s":"<i>10th International Symposium on Database Programming Languages</i>, 2005, Trondheim, Norway. pp.217--231",
"citationFull_s":"Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison. N-ary Queries by Tree Automata. <i>10th International Symposium on Database Programming Languages</i>, 2005, Trondheim, Norway. pp.217--231. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536522\">⟨inria-00536522⟩</a>",
"title_s":["N-ary Queries by Tree Automata"],
"authFullName_s":["Joachim Niehren",
"Laurent Planque",
"Jean-Marc Talbot",
"Sophie Tison"],
"halId_s":"inria-00536522",
"docType_s":"COMM",
"producedDateY_i":2005},
{
"citationRef_s":"<i>14th European Symposium on Programming</i>, 2005, Edinburgh, United Kingdom. pp.357-373",
"citationFull_s":"Joachim Niehren, Tim Priesnitz, Zhendong Su. Complexity of Subtype Satisfiability over Posets. <i>14th European Symposium on Programming</i>, 2005, Edinburgh, United Kingdom. pp.357-373. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536523\">⟨inria-00536523⟩</a>",
"title_s":["Complexity of Subtype Satisfiability over Posets"],
"authFullName_s":["Joachim Niehren",
"Tim Priesnitz",
"Zhendong Su"],
"halId_s":"inria-00536523",
"docType_s":"COMM",
"producedDateY_i":2005},
{
"citationRef_s":"<i>20th International Conference on Automated Deduction</i>, 2005, Tallinn, Estonia. pp.149-163",
"citationFull_s":"Jordi Levy, Joachim Niehren, Mateu Villaret. Well-nested Context Unification. <i>20th International Conference on Automated Deduction</i>, 2005, Tallinn, Estonia. pp.149-163. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536525\">⟨inria-00536525⟩</a>",
"title_s":["Well-nested Context Unification"],
"authFullName_s":["Jordi Levy",
"Joachim Niehren",
"Mateu Villaret"],
"halId_s":"inria-00536525",
"docType_s":"COMM",
"producedDateY_i":2005},
{
"citationRef_s":"<i>ACM-SIAM Symposium on Discrete Algorithms - SODA'2003</i>, Jan 2004, New Orleans, Louisiana, United States. pp.59-67",
"citationFull_s":"Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. A New Algorithm for Normal Dominance Constraints. <i>ACM-SIAM Symposium on Discrete Algorithms - SODA'2003</i>, Jan 2004, New Orleans, Louisiana, United States. pp.59-67. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536536\">⟨inria-00536536⟩</a>",
"title_s":["A New Algorithm for Normal Dominance Constraints"],
"authFullName_s":["Manuel Bodirsky",
"Denys Duchier",
"Joachim Niehren",
"Sebastian Miele"],
"halId_s":"inria-00536536",
"docType_s":"COMM",
"producedDateY_i":2004},
{
"citationRef_s":"<i>2nd International Conference on Multiparadigm Programming in {Mozart/Oz}</i>, 2004, Charleroi, Belgium. pp.190--201",
"citationFull_s":"Ralph Debusmann, Denys Duchier, Joachim Niehren. The XDG Grammar Development Kit. <i>2nd International Conference on Multiparadigm Programming in {Mozart/Oz}</i>, 2004, Charleroi, Belgium. pp.190--201. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536530\">⟨inria-00536530⟩</a>",
"title_s":["The XDG Grammar Development Kit"],
"authFullName_s":["Ralph Debusmann",
"Denys Duchier",
"Joachim Niehren"],
"halId_s":"inria-00536530",
"docType_s":"COMM",
"producedDateY_i":2004},
{
"citationRef_s":"<i>7th International Colloquium on Grammatical Inference</i>, 2004, Athens, Greece. pp.91--102",
"citationFull_s":"Julien Carme, Aurélien Lemay, Joachim Niehren. Learning Node Selecting Tree Transducer from Completely Annotated Examples. <i>7th International Colloquium on Grammatical Inference</i>, 2004, Athens, Greece. pp.91--102. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536528\">⟨inria-00536528⟩</a>",
"title_s":["Learning Node Selecting Tree Transducer from Completely Annotated Examples"],
"authFullName_s":["Julien Carme",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00536528",
"docType_s":"COMM",
"producedDateY_i":2004},
{
"citationRef_s":"<i>42th Meeting of the Association for Computational Linguistics</i>, 2004, Barcelona, Spain. pp.247-254",
"citationFull_s":"Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater. Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. <i>42th Meeting of the Association for Computational Linguistics</i>, 2004, Barcelona, Spain. pp.247-254. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536532\">⟨inria-00536532⟩</a>",
"title_s":["Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis"],
"authFullName_s":["Ruth Fuchss",
"Alexander Koller",
"Joachim Niehren",
"Stefan Thater"],
"halId_s":"inria-00536532",
"docType_s":"COMM",
"producedDateY_i":2004},
{
"citationRef_s":"<i>19th International Conference on Rewriting Techniques and Applications</i>, 2004, Aachen, Georgia. pp.105--118",
"citationFull_s":"Julien Carme, Joachim Niehren, Marc Tommasi. Querying Unranked Trees with Stepwise Tree Automata. <i>19th International Conference on Rewriting Techniques and Applications</i>, 2004, Aachen, Georgia. pp.105--118. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536529\">⟨inria-00536529⟩</a>",
"title_s":["Querying Unranked Trees with Stepwise Tree Automata"],
"authFullName_s":["Julien Carme",
"Joachim Niehren",
"Marc Tommasi"],
"halId_s":"inria-00536529",
"docType_s":"COMM",
"producedDateY_i":2004},
{
"citationRef_s":"<i>Journal of Algorithms in Cognition, Informatics and Logic</i>, 2003, Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms, 48 (1), pp.194-219. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0196-6774(03)00050-6\">⟨10.1016/S0196-6774(03)00050-6⟩</a>",
"citationFull_s":"Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Graph Algorithm for Dominance Constraints. <i>Journal of Algorithms in Cognition, Informatics and Logic</i>, 2003, Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms, 48 (1), pp.194-219. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/S0196-6774(03)00050-6\">⟨10.1016/S0196-6774(03)00050-6⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536539\">⟨inria-00536539⟩</a>",
"title_s":["An Efficient Graph Algorithm for Dominance Constraints"],
"authFullName_s":["Ernst Althaus",
"Denys Duchier",
"Alexander Koller",
"Kurt Mehlhorn",
"Joachim Niehren",
"Sven Thiel"],
"halId_s":"inria-00536539",
"docType_s":"ART",
"producedDateY_i":2003},
{
"citationRef_s":"<i>41st Meeting of the Association of Computational Linguistics (ACL)</i>, 2003, Saporo, Japan. pp.367-374",
"citationFull_s":"Joachim Niehren, Stefan Thater. Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. <i>41st Meeting of the Association of Computational Linguistics (ACL)</i>, 2003, Saporo, Japan. pp.367-374. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536543\">⟨inria-00536543⟩</a>",
"title_s":["Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints"],
"authFullName_s":["Joachim Niehren",
"Stefan Thater"],
"halId_s":"inria-00536543",
"docType_s":"COMM",
"producedDateY_i":2003},
{
"citationRef_s":"<i>Information and Computation</i>, 2003, 169 (2), pp.319-354",
"citationFull_s":"Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. <i>Information and Computation</i>, 2003, 169 (2), pp.319-354. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536540\">⟨inria-00536540⟩</a>",
"title_s":["Non-Structural Subtype Entailment in Automata Theory"],
"authFullName_s":["Joachim Niehren",
"Tim Priesnitz"],
"halId_s":"inria-00536540",
"docType_s":"ART",
"producedDateY_i":2003},
{
"citationRef_s":"<i>10th Meeting of the European Chapter of the Association of Computational Linguistics</i>, 2003, Budapest, Hungary. pp.195-202",
"citationFull_s":"Alexander Koller, Joachim Niehren, Stefan Thater. Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints. <i>10th Meeting of the European Chapter of the Association of Computational Linguistics</i>, 2003, Budapest, Hungary. pp.195-202. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536542\">⟨inria-00536542⟩</a>",
"title_s":["Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren",
"Stefan Thater"],
"halId_s":"inria-00536542",
"docType_s":"COMM",
"producedDateY_i":2003},
{
"citationRef_s":"<i>10th Conference of the European Chapter of the Association for Computational Linguistics</i>, Association for Compuational Linguistics, 2003, Budapest, Hungary. pp.115--122",
"citationFull_s":"Katrin Erk, Joachim Niehren. Well-Nested Parallelism Constraints for Ellipsis Resolution. <i>10th Conference of the European Chapter of the Association for Computational Linguistics</i>, Association for Compuational Linguistics, 2003, Budapest, Hungary. pp.115--122. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536541\">⟨inria-00536541⟩</a>",
"title_s":["Well-Nested Parallelism Constraints for Ellipsis Resolution"],
"authFullName_s":["Katrin Erk",
"Joachim Niehren"],
"halId_s":"inria-00536541",
"docType_s":"COMM",
"producedDateY_i":2003},
{
"citationRef_s":"<i>International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, 2002, Tblisi, Georgia. pp.311--326",
"citationFull_s":"Joachim Niehren, Mateu Villaret. Parallelism and Tree Regular Constraints. <i>International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, 2002, Tblisi, Georgia. pp.311--326. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536827\">⟨inria-00536827⟩</a>",
"title_s":["Parallelism and Tree Regular Constraints"],
"authFullName_s":["Joachim Niehren",
"Mateu Villaret"],
"halId_s":"inria-00536827",
"docType_s":"COMM",
"producedDateY_i":2002},
{
"citationRef_s":"<i>The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 2002, Portland, United States. pp.203-216",
"citationFull_s":"Zhendong Su, Alex Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen. First-Order Theory of Subtyping Constraints. <i>The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 2002, Portland, United States. pp.203-216. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536828\">⟨inria-00536828⟩</a>",
"title_s":["First-Order Theory of Subtyping Constraints"],
"authFullName_s":["Zhendong Su",
"Alex Aiken",
"Joachim Niehren",
"Tim Priesnitz",
"Ralf Treinen"],
"halId_s":"inria-00536828",
"docType_s":"COMM",
"producedDateY_i":2002},
{
"citationRef_s":"Dave Barker-Plummer and David I. Beaver and Johan van Benthem and Patrick Scotto di Luzio. <i>Words, Proofs, and Dialog</i>, 141, CSLI Press, pp.95-122, 2002",
"citationFull_s":"Alexander Koller, Joachim Niehren. Constraint Programming in Computational Linguistics. Dave Barker-Plummer and David I. Beaver and Johan van Benthem and Patrick Scotto di Luzio. <i>Words, Proofs, and Dialog</i>, 141, CSLI Press, pp.95-122, 2002. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536829\">⟨inria-00536829⟩</a>",
"title_s":["Constraint Programming in Computational Linguistics"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536829",
"docType_s":"COUV",
"producedDateY_i":2002},
{
"citationRef_s":"<i>Journal on Research in Language and Computation</i>, 2002, 1 (1), pp.127--169",
"citationFull_s":"Katrin Erk, Alexander Koller, Joachim Niehren. Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures. <i>Journal on Research in Language and Computation</i>, 2002, 1 (1), pp.127--169. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536796\">⟨inria-00536796⟩</a>",
"title_s":["Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures"],
"authFullName_s":["Katrin Erk",
"Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536796",
"docType_s":"ART",
"producedDateY_i":2002},
{
"citationRef_s":"<i>Journal of Logic, Language and Information</i>, 2001, 10, pp.457-485",
"citationFull_s":"Markus Egg, Alexander Koller, Joachim Niehren. The Constraint Language for Lambda Structures. <i>Journal of Logic, Language and Information</i>, 2001, 10, pp.457-485. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536795\">⟨inria-00536795⟩</a>",
"title_s":["The Constraint Language for Lambda Structures"],
"authFullName_s":["Markus Egg",
"Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536795",
"docType_s":"ART",
"producedDateY_i":2001},
{
"citationRef_s":"<i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, Washington, DC, United States. pp.815--824",
"citationFull_s":"Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, Washington, DC, United States. pp.815--824. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536803\">⟨inria-00536803⟩</a>",
"title_s":["An Efficient Algorithm for the Configuration Problem of Dominance Graphs"],
"authFullName_s":["Ernst Althaus",
"Denys Duchier",
"Alexander Koller",
"Kurt Mehlhorn",
"Joachim Niehren",
"Sven Thiel"],
"halId_s":"inria-00536803",
"docType_s":"COMM",
"producedDateY_i":2001},
{
"citationRef_s":"<i>39th Annual Meeting of the Association for Computational Linguistics</i>, 2001, Toulouse, France. pp.74-81",
"citationFull_s":"Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Underspecified Beta Reduction. <i>39th Annual Meeting of the Association for Computational Linguistics</i>, 2001, Toulouse, France. pp.74-81. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536805\">⟨inria-00536805⟩</a>",
"title_s":["Underspecified Beta Reduction"],
"authFullName_s":["Manuel Bodirsky",
"Katrin Erk",
"Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536805",
"docType_s":"COMM",
"producedDateY_i":2001},
{
"citationRef_s":"<i>International Conference on Rewriting Techniques and Applications</i>, 2001, Utrecht, Netherlands. pp.31-46",
"citationFull_s":"Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Beta Reduction Constraints. <i>International Conference on Rewriting Techniques and Applications</i>, 2001, Utrecht, Netherlands. pp.31-46. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536804\">⟨inria-00536804⟩</a>",
"title_s":["Beta Reduction Constraints"],
"authFullName_s":["Manuel Bodirsky",
"Katrin Erk",
"Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536804",
"docType_s":"COMM",
"producedDateY_i":2001},
{
"citationRef_s":"<i>Discrete Mathematics and Theoretical Computer Science</i>, 2001, Vol. 4 no. 2 (2), pp.193-234. <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/dmtcs.267\">⟨10.46298/dmtcs.267⟩</a>",
"citationFull_s":"Martin Müller, Joachim Niehren, Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. <i>Discrete Mathematics and Theoretical Computer Science</i>, 2001, Vol. 4 no. 2 (2), pp.193-234. <a target=\"_blank\" href=\"https://dx.doi.org/10.46298/dmtcs.267\">⟨10.46298/dmtcs.267⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536800\">⟨inria-00536800⟩</a>",
"title_s":["The First-Order Theory of Ordering Constraints over Feature Trees"],
"authFullName_s":["Martin Müller",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"inria-00536800",
"docType_s":"ART",
"producedDateY_i":2001},
{
"citationRef_s":"<i>4th International Symposium on Theoretical Aspects of Computer Software</i>, 2001, Sendai, Japan. pp.360--384",
"citationFull_s":"Joachim Niehren, Tim Priesnitz. Non-Structural Subtype Entailment in Automata Theory. <i>4th International Symposium on Theoretical Aspects of Computer Software</i>, 2001, Sendai, Japan. pp.360--384. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536514\">⟨inria-00536514⟩</a>",
"title_s":["Non-Structural Subtype Entailment in Automata Theory"],
"authFullName_s":["Joachim Niehren",
"Tim Priesnitz"],
"halId_s":"inria-00536514",
"docType_s":"COMM",
"producedDateY_i":2001},
{
"citationRef_s":"<i>Constraints, an International Journal</i>, 2000, 5 (1--2), pp.7--42",
"citationFull_s":"Martin Müller, Joachim Niehren, Andreas Podelski. Ordering Constraints over Feature Trees. <i>Constraints, an International Journal</i>, 2000, 5 (1--2), pp.7--42. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536799\">⟨inria-00536799⟩</a>",
"title_s":["Ordering Constraints over Feature Trees"],
"authFullName_s":["Martin Müller",
"Joachim Niehren",
"Andreas Podelski"],
"halId_s":"inria-00536799",
"docType_s":"ART",
"producedDateY_i":2000},
{
"citationRef_s":"<i>International Conference on Rewriting Techniques and Applications</i>, 2000, Norwich, United Kingdom. pp.110--126",
"citationFull_s":"Katrin Erk, Joachim Niehren. Parallelism Constraints. <i>International Conference on Rewriting Techniques and Applications</i>, 2000, Norwich, United Kingdom. pp.110--126. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536808\">⟨inria-00536808⟩</a>",
"title_s":["Parallelism Constraints"],
"authFullName_s":["Katrin Erk",
"Joachim Niehren"],
"halId_s":"inria-00536808",
"docType_s":"COMM",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Information Processing Letters</i>, 2000, 74 (1-2), pp.35--40",
"citationFull_s":"Joachim Niehren, Ralf Treinen, Sophie Tison. On Rewrite Constraints and Context Unification. <i>Information Processing Letters</i>, 2000, 74 (1-2), pp.35--40. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536802\">⟨inria-00536802⟩</a>",
"title_s":["On Rewrite Constraints and Context Unification"],
"authFullName_s":["Joachim Niehren",
"Ralf Treinen",
"Sophie Tison"],
"halId_s":"inria-00536802",
"docType_s":"ART",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Proceedings of the First International Conference on Computational Logic</i>, 2000, London, United Kingdom. pp.326-341",
"citationFull_s":"Denys Duchier, Joachim Niehren. Dominance Constraints with Set Operators. <i>Proceedings of the First International Conference on Computational Logic</i>, 2000, London, United Kingdom. pp.326-341. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536806\">⟨inria-00536806⟩</a>",
"title_s":["Dominance Constraints with Set Operators"],
"authFullName_s":["Denys Duchier",
"Joachim Niehren"],
"halId_s":"inria-00536806",
"docType_s":"COMM",
"producedDateY_i":2000},
{
"citationRef_s":"<i>38th Annual Meeting of the Association of Computational Linguistics</i>, 2000, Hong Kong, China. pp.368--375",
"citationFull_s":"Alexander Koller, Kurt Mehlhorn, Joachim Niehren. A Polynomial-Time Fragment of Dominance Constraints. <i>38th Annual Meeting of the Association of Computational Linguistics</i>, 2000, Hong Kong, China. pp.368--375. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536809\">⟨inria-00536809⟩</a>",
"title_s":["A Polynomial-Time Fragment of Dominance Constraints"],
"authFullName_s":["Alexander Koller",
"Kurt Mehlhorn",
"Joachim Niehren"],
"halId_s":"inria-00536809",
"docType_s":"COMM",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Grammars</i>, 2000, 3 (2/3), pp.217-241",
"citationFull_s":"Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. <i>Grammars</i>, 2000, 3 (2/3), pp.217-241. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536797\">⟨inria-00536797⟩</a>",
"title_s":["Relaxing Underspecified Semantic Representations for Reinterpretation"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren",
"Kristina Striegnitz"],
"halId_s":"inria-00536797",
"docType_s":"ART",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Information and Computation</i>, 2000, 159 (1/2), pp.22--58",
"citationFull_s":"Martin Müller, Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. <i>Information and Computation</i>, 2000, 159 (1/2), pp.22--58. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536798\">⟨inria-00536798⟩</a>",
"title_s":["Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic"],
"authFullName_s":["Martin Müller",
"Joachim Niehren"],
"halId_s":"inria-00536798",
"docType_s":"ART",
"producedDateY_i":2000},
{
"citationRef_s":"<i>18th International Conference on Computational Linguistics</i>, 2000, Saarbrücken, Georgia. pp.460--466",
"citationFull_s":"Alexander Koller, Joachim Niehren. On Underspecified Processing of Dynamic Semantics. <i>18th International Conference on Computational Linguistics</i>, 2000, Saarbrücken, Georgia. pp.460--466. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536810\">⟨inria-00536810⟩</a>",
"title_s":["On Underspecified Processing of Dynamic Semantics"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren"],
"halId_s":"inria-00536810",
"docType_s":"COMM",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Journal on Functional Programming</i>, 2000, 10 (5), pp.453-499",
"citationFull_s":"Joachim Niehren. Uniform Confluence in Concurrent Computation. <i>Journal on Functional Programming</i>, 2000, 10 (5), pp.453-499. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536801\">⟨inria-00536801⟩</a>",
"title_s":["Uniform Confluence in Concurrent Computation"],
"authFullName_s":["Joachim Niehren"],
"halId_s":"inria-00536801",
"docType_s":"ART",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Fourteenth Annual IEEE Symposium on Logic in Computer Sience</i>, 1999, Trento, Italy. pp.285--294",
"citationFull_s":"Joachim Niehren, Martin Müller, Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. <i>Fourteenth Annual IEEE Symposium on Logic in Computer Sience</i>, 1999, Trento, Italy. pp.285--294. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536817\">⟨inria-00536817⟩</a>",
"title_s":["Entailment of Atomic Set Constraints is PSPACE-Complete"],
"authFullName_s":["Joachim Niehren",
"Martin Müller",
"Jean-Marc Talbot"],
"halId_s":"inria-00536817",
"docType_s":"COMM",
"producedDateY_i":1999},
{
"citationRef_s":"<i>Asian Computing Science Conference</i>, 1999, Phuket, Thailand. pp.251--265",
"citationFull_s":"Joachim Niehren, Tim Priesnitz. Entailment of Non-Structural Subtype Constraints. <i>Asian Computing Science Conference</i>, 1999, Phuket, Thailand. pp.251--265. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536825\">⟨inria-00536825⟩</a>",
"title_s":["Entailment of Non-Structural Subtype Constraints"],
"authFullName_s":["Joachim Niehren",
"Tim Priesnitz"],
"halId_s":"inria-00536825",
"docType_s":"COMM",
"producedDateY_i":1999},
{
"citationRef_s":"<i>6th Meeting on Mathematics of Language</i>, 1999, Orlando, Florida, United States. pp.74--87",
"citationFull_s":"Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. <i>6th Meeting on Mathematics of Language</i>, 1999, Orlando, Florida, United States. pp.74--87. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536811\">⟨inria-00536811⟩</a>",
"title_s":["Relaxing Underspecified Semantic Representations for Reinterpretation"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren",
"Kristina Striegnitz"],
"halId_s":"inria-00536811",
"docType_s":"COMM",
"producedDateY_i":1999},
{
"citationRef_s":"<i>Joined 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98)</i>, 1998, Montreal, Canada. pp.353--359",
"citationFull_s":"Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu Xu. Constraints over Lambda-Structures in Semantic Underspecification. <i>Joined 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98)</i>, 1998, Montreal, Canada. pp.353--359. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536807\">⟨inria-00536807⟩</a>",
"title_s":["Constraints over Lambda-Structures in Semantic Underspecification"],
"authFullName_s":["Markus Egg",
"Joachim Niehren",
"Peter Ruhrberg",
"Feiyu Xu"],
"halId_s":"inria-00536807",
"docType_s":"COMM",
"producedDateY_i":1998},
{
"citationRef_s":"<i>3rd International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001)</i>, 1998, Heidelberg, France. pp.199-218",
"citationFull_s":"Joachim Niehren, Alexander Koller. Dominance Constraints in Context Unification. <i>3rd International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001)</i>, 1998, Heidelberg, France. pp.199-218. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536820\">⟨inria-00536820⟩</a>",
"title_s":["Dominance Constraints in Context Unification"],
"authFullName_s":["Joachim Niehren",
"Alexander Koller"],
"halId_s":"inria-00536820",
"docType_s":"COMM",
"producedDateY_i":1998},
{
"citationRef_s":"<i>9th International Conference on Rewriting Techniques and Applications</i>, 1998, Tsukuba, Japan. pp.196--210",
"citationFull_s":"Martin Müller, Joachim Niehren. Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic. <i>9th International Conference on Rewriting Techniques and Applications</i>, 1998, Tsukuba, Japan. pp.196--210. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536814\">⟨inria-00536814⟩</a>",
"title_s":["Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic"],
"authFullName_s":["Martin Müller",
"Joachim Niehren"],
"halId_s":"inria-00536814",
"docType_s":"COMM",
"producedDateY_i":1998},
{
"citationRef_s":"<i>Third International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001)</i>, 1998, Grenoble, France. pp.106-125",
"citationFull_s":"Alexander Koller, Joachim Niehren, Ralf Treinen. Dominance Constraints: Algorithms and Complexity. <i>Third International Conference on Logical Aspects of Computational Linguistics 1998 (Postproceedings 2001)</i>, 1998, Grenoble, France. pp.106-125. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536812\">⟨inria-00536812⟩</a>",
"title_s":["Dominance Constraints: Algorithms and Complexity"],
"authFullName_s":["Alexander Koller",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"inria-00536812",
"docType_s":"COMM",
"producedDateY_i":1998},
{
"citationRef_s":"<i>13th annual IEEE Symposium on Logic in Computer Sience</i>, 1998, Indianapolis, Indiana, United States. pp.432--443",
"citationFull_s":"Martin Müller, Joachim Niehren, Ralf Treinen. The First-Order Theory of Ordering Constraints over Feature Trees. <i>13th annual IEEE Symposium on Logic in Computer Sience</i>, 1998, Indianapolis, Indiana, United States. pp.432--443. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536818\">⟨inria-00536818⟩</a>",
"title_s":["The First-Order Theory of Ordering Constraints over Feature Trees"],
"authFullName_s":["Martin Müller",
"Joachim Niehren",
"Ralf Treinen"],
"halId_s":"inria-00536818",
"docType_s":"COMM",
"producedDateY_i":1998},
{
"citationRef_s":"<i>35th Annual Meeting of the Association of Computational Linguistics</i>, 1997, Madrid, Spain. pp.410-417",
"citationFull_s":"Joachim Niehren, Manfred Pinkal, Peter Ruhrberg. A Uniform Approach to Underspecification and Parallelism. <i>35th Annual Meeting of the Association of Computational Linguistics</i>, 1997, Madrid, Spain. pp.410-417. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536821\">⟨inria-00536821⟩</a>",
"title_s":["A Uniform Approach to Underspecification and Parallelism"],
"authFullName_s":["Joachim Niehren",
"Manfred Pinkal",
"Peter Ruhrberg"],
"halId_s":"inria-00536821",
"docType_s":"COMM",
"producedDateY_i":1997},
{
"citationRef_s":"<i>Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS</i>, 1997, Lille, France. pp.217-231",
"citationFull_s":"Martin Müller, Joachim Niehren, Andreas Podelski. Inclusion Constraints over Non-Empty Sets of Trees. <i>Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS</i>, 1997, Lille, France. pp.217-231. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536816\">⟨inria-00536816⟩</a>",
"title_s":["Inclusion Constraints over Non-Empty Sets of Trees"],
"authFullName_s":["Martin Müller",
"Joachim Niehren",
"Andreas Podelski"],
"halId_s":"inria-00536816",
"docType_s":"COMM",
"producedDateY_i":1997},
{
"citationRef_s":"<i>3rd International Conference on Principles and Practice of Constraint Programming</i>, 1997, Schloss Hagenberg, Linz, Austria. pp.297--311",
"citationFull_s":"Martin Müller, Joachim Niehren, Andreas Podelski. Ordering Constraints over Feature Trees. <i>3rd International Conference on Principles and Practice of Constraint Programming</i>, 1997, Schloss Hagenberg, Linz, Austria. pp.297--311. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536815\">⟨inria-00536815⟩</a>",
"title_s":["Ordering Constraints over Feature Trees"],
"authFullName_s":["Martin Müller",
"Joachim Niehren",
"Andreas Podelski"],
"halId_s":"inria-00536815",
"docType_s":"COMM",
"producedDateY_i":1997},
{
"citationRef_s":"<i>Proceedings of the International Conference on Automated Deduction</i>, 1997, Townsville, Australia. pp.34-48",
"citationFull_s":"Joachim Niehren, Manfred Pinkal, Peter Ruhrberg. On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting. <i>Proceedings of the International Conference on Automated Deduction</i>, 1997, Townsville, Australia. pp.34-48. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536822\">⟨inria-00536822⟩</a>",
"title_s":["On Equality Up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting"],
"authFullName_s":["Joachim Niehren",
"Manfred Pinkal",
"Peter Ruhrberg"],
"halId_s":"inria-00536822",
"docType_s":"COMM",
"producedDateY_i":1997},
{
"citationRef_s":"<i>23th ACM Symposium on Principles of Programming Languages</i>, 1996, St. Petersburg Beach, Florida, United States. pp.333--343",
"citationFull_s":"Joachim Niehren. Functional Computation as Concurrent Computation. <i>23th ACM Symposium on Principles of Programming Languages</i>, 1996, St. Petersburg Beach, Florida, United States. pp.333--343. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536819\">⟨inria-00536819⟩</a>",
"title_s":["Functional Computation as Concurrent Computation"],
"authFullName_s":["Joachim Niehren"],
"halId_s":"inria-00536819",
"docType_s":"COMM",
"producedDateY_i":1996},
{
"citationRef_s":"<i>Asian Computing Science Conference</i>, 1995, Pathumthani, Thailand. pp.171--186",
"citationFull_s":"Joachim Niehren, Martin Müller. Constraints for Free in Concurrent Computation. <i>Asian Computing Science Conference</i>, 1995, Pathumthani, Thailand. pp.171--186. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536813\">⟨inria-00536813⟩</a>",
"title_s":["Constraints for Free in Concurrent Computation"],
"authFullName_s":["Joachim Niehren",
"Martin Müller"],
"halId_s":"inria-00536813",
"docType_s":"COMM",
"producedDateY_i":1995},
{
"citationRef_s":"<i>1st International Conference on Constraints in Computational Logics</i>, 1994, Munich, Germany",
"citationFull_s":"Joachim Niehren, Gert Smolka. A Confluent Relational Calculus for Higher-Order Programming with Constraints. <i>1st International Conference on Constraints in Computational Logics</i>, 1994, Munich, Germany. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536826\">⟨inria-00536826⟩</a>",
"title_s":["A Confluent Relational Calculus for Higher-Order Programming with Constraints"],
"authFullName_s":["Joachim Niehren",
"Gert Smolka"],
"halId_s":"inria-00536826",
"docType_s":"COMM",
"producedDateY_i":1994},
{
"citationRef_s":"<i>TAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP/FASE/TOOLS.</i>, 1993, Orsay, France. pp.356--375",
"citationFull_s":"Joachim Niehren, Andreas Podelski. Feature Automata and Recognizable Sets of Feature Trees. <i>TAPSOFT: Theory and Practice of Software Development: Joint International Conference CAAP/FASE/TOOLS.</i>, 1993, Orsay, France. pp.356--375. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536823\">⟨inria-00536823⟩</a>",
"title_s":["Feature Automata and Recognizable Sets of Feature Trees"],
"authFullName_s":["Joachim Niehren",
"Andreas Podelski"],
"halId_s":"inria-00536823",
"docType_s":"COMM",
"producedDateY_i":1993},
{
"citationRef_s":"<i>5th International Conference on Rewriting Techniques and Applications</i>, 1993, Montreal, Canada. pp.106-120",
"citationFull_s":"Joachim Niehren, Andreas Podelski, Ralf Treinen. Equational and Membership Constraints for Infinite Trees. <i>5th International Conference on Rewriting Techniques and Applications</i>, 1993, Montreal, Canada. pp.106-120. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536824\">⟨inria-00536824⟩</a>",
"title_s":["Equational and Membership Constraints for Infinite Trees"],
"authFullName_s":["Joachim Niehren",
"Andreas Podelski",
"Ralf Treinen"],
"halId_s":"inria-00536824",
"docType_s":"COMM",
"producedDateY_i":1993}]
}}