Travelled to:1 × Australia
1 × Austria
1 × China
1 × Estonia
1 × Japan
1 × Taiwan
1 × The Netherlands
2 × Canada
2 × France
2 × Germany
2 × Italy
3 × United Kingdom
4 × Spain
4 × USA
Collaborated with:A.Lemay O.Gauwin M.Müller A.Podelski R.Treinen K.Erk M.Tommasi A.Boiret M.John S.Tison J.Talbot T.Priesnitz Z.Su M.Kuhlmann D.Duchier ∅ G.Laurence S.Staworko D.Debarbieux T.Sebastian M.Zergaoui A.Ndione M.Nebut S.Maneth J.Levy M.Villaret J.Carme M.Pinkal P.Ruhrberg M.M.0001 V.Hugot C.Lhoussaine C.Versari J.Champavère R.Gilleron E.Filiot M.Bodirsky A.Koller A.Aiken
Talks about:tree (13) constraint (12) automata (6) order (6) featur (4) queri (4) word (4) path (4) set (4) answer (3)
Person: Joachim Niehren
DBLP: Niehren:Joachim
Contributed to:
20152014
20132015
2013
20122011
20112011
201020092008
20082007
200520052004
20022001
20002000
199919981998199719961993
19931997Wrote 30 papers:
- LATA-2015-BoiretHNT #constraints #logic
- Logics for Unordered Trees with Data Constraints on Siblings (AB, VH, JN, RT), pp. 175–187.
- LATA-2015-NdioneLN #sublinear
- Sublinear DTD Validity (AN, AL, JN), pp. 739–751.
- LATA-2014-LaurenceLNST #learning #transducer
- Learning Sequential Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 490–502.
- CIAA-2013-DebarbieuxGNSZ #automaton #query #word #xml #xpath
- Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
- CIAA-J-2013-DebarbieuxGNSZ15 #automaton #query #word #xml #xpath
- Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.
- VMCAI-2013-JohnNN #network #predict
- Knockout Prediction for Reaction Networks with Partial Kinetic Information (MJ, MN, JN), pp. 355–374.
- DLT-2012-BoiretLN #learning
- Learning Rational Functions (AB, AL, JN), pp. 273–283.
- CIAA-2011-GauwinN #xpath
- Streamable Fragments of Forward XPath (OG, JN), pp. 3–15.
- ESOP-2011-JohnLNV #constraints
- Biochemical Reaction Rules with Constraints (MJ, CL, JN, CV), pp. 338–357.
- LATA-2011-LaurenceLNST #normalisation #top-down #transducer
- Normalization of Sequential Top-Down Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 354–365.
- PODS-2010-LemayMN #algorithm #learning #top-down #xml
- A learning algorithm for top-down XML transformations (AL, SM, JN), pp. 285–296.
- LATA-2009-GauwinNT #bound #concurrent #query
- Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
- LATA-2008-ChampavereGLN #automaton #performance
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.
- RTA-2008-KuhlmannN #automaton #logic #order
- Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.
- PODS-2007-FiliotNTT #polynomial #xpath
- Polynomial time fragments of XPath with variables (EF, JN, JMT, ST), pp. 205–214.
- CADE-2005-LevyNV #unification
- Well-Nested Context Unification (JL, JN, MV), pp. 149–163.
- ESOP-2005-NiehrenPS #complexity #satisfiability #type system
- Complexity of Subtype Satisfiability over Posets (JN, TP, ZS), pp. 357–373.
- RTA-2004-CarmeNT #automaton #query
- Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.
- POPL-2002-SuANPT #constraints #first-order #type system
- The first-order theory of subtyping constraints (ZS, AA, JN, TP, RT), pp. 203–216.
- RTA-2001-BodirskyEKN #constraints #reduction
- β Reduction Constraints (MB, KE, AK, JN), pp. 31–46.
- CL-2000-DuchierN #constraints #set
- Dominance Constraints with Set Operators (DD, JN), pp. 326–341.
- RTA-2000-ErkN #constraints #parallel
- Parallelism Constraints (KE, JN), pp. 110–126.
- LICS-1999-NiehrenMT #constraints #set
- Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
- LICS-1998-MullerNT #constraints #first-order
- The First-Order Theory of Ordering Constraints over Feature Trees (MM, JN, RT), pp. 432–443.
- RTA-1998-MullerN #constraints #higher-order #logic #monad
- Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
- CADE-1997-NiehrenPR #constraints #finite #on the #similarity #unification
- On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
- POPL-1996-Niehren #concurrent #functional
- Functional Computation as Concurrent Computation (JN), pp. 333–343.
- RTA-1993-NiehrenPT #constraints #equation #finite
- Equational and Membership Constraints for Finite Trees (JN, AP, RT), pp. 106–120.
- TAPSOFT-1993-NiehrenP #automaton #set
- Feature Automata and Recognizable Sets of Feature Trees (JN, AP), pp. 356–375.
- TAPSOFT-1997-MullerNP #constraints #set
- Inclusion Constraints over Non-empty Sets of Trees (MM0, JN, AP), pp. 345–356.