Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sophie Tison
2010 – today
- 2011
[j10]Olivier Gauwin, Joachim Niehren, Sophie Tison: Queries on Xml streams with bounded delay and concurrency. Inf. Comput. 209(3): 409-442 (2011)- [c37]Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko: View update translation for XML. ICDT 2011: 42-53
- [c36]Sophie Tison: Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. RTA 2011: 1-2
- [c35]Sophie Tison: Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New? TLCA 2011: 3-5
- 2010
- [j9]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21(4): 571-596 (2010)
2000 – 2009
- 2009
- [c34]Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison: XML Security Views Revisited. DBPL 2009: 52-67
- [c33]Olivier Gauwin, Joachim Niehren, Sophie Tison: Earliest Query Answering for Deterministic Nested Word Automata. FCT 2009: 121-132
- [c32]Olivier Gauwin, Joachim Niehren, Sophie Tison: Bounded Delay and Concurrency for Earliest Query Answering. LATA 2009: 350-361
- 2008
- [c31]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326
- [c30]Guillem Godoy, Sebastian Maneth, Sophie Tison: Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS 2008: 127-141
- [c29]Emmanuel Filiot, Sophie Tison: Regular n-ary Queries in Trees and Variable Independence. IFIP TCS 2008: 429-443
- [c28]Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison: Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X 2008
- 2007
- [j8]Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison: Path constraints in semistructured data. Theor. Comput. Sci. 385(1-3): 11-33 (2007)
- [c27]Guillem Godoy, Sophie Tison: On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE 2007: 247-262
- [c26]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145
- [c25]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Polynomial time fragments of XPath with variables. PODS 2007: 205-214
- 2006
- [c24]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Composing Monadic Queries in Trees. PLAN-X 2006: 61-70
- 2005
- [c23]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005
- [c22]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-Ary Queries by Tree Automata. DBPL 2005: 217-231
- [c21]Iovka Boneva, Jean-Marc Talbot, Sophie Tison: Expressiveness of a Spatial Logic for Trees. LICS 2005: 280-289
- [c20]Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos: Monotone AC-Tree Automata. LPAR 2005: 337-351
- 2004
- [c19]Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison: Extraction and Implication of Path Constraints. MFCS 2004: 863-875
- 2003
- [c18]Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano: BHDL: Circuit Design in B. ACSD 2003: 241-242
- 2002
- [j7]Max Dauchet, Sophie Tison, Marc Tommasi: Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theor. Comput. Sci. 281(1-2): 219-233 (2002)
- [e4]Sophie Tison (Ed.): Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings. Lecture Notes in Computer Science 2378, Springer 2002, ISBN 3-540-43916-1
- 2001
- [j6]Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen: Grid structures and undecidable constraint theories. Theor. Comput. Sci. 258(1-2): 453-490 (2001)
- 2000
- [j5]Jean-Marc Talbot, Philippe Devienne, Sophie Tison: Generalized Definite Set Constraints. Constraints 5(1/2): 161-202 (2000)
- [j4]Joachim Niehren, Sophie Tison, Ralf Treinen: On rewrite constraints and context unification. Inf. Process. Lett. 74(1-2): 35-40 (2000)
- [c17]
- [e3]Horst Reichel, Sophie Tison (Eds.): STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings. Lecture Notes in Computer Science 1770, Springer 2000, ISBN 3-540-67141-2
1990 – 1999
- 1999
- [j3]Rémi Gilleron, Sophie Tison, Marc Tommasi: Set Constraints and Automata. Inf. Comput. 149(1): 1-41 (1999)
- [c16]Franck Seynhaeve, Sophie Tison, Marc Tommasi: Homomorphisms and Concurrent Term Rewriting. FCT 1999: 475-487
- [c15]Bruno Bogaert, Franck Seynhaeve, Sophie Tison: The Recognizability Problem for Tree Automata with Comparisons between Brothers. FoSSaCS 1999: 150-164
- [c14]Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. RTA 1999: 103-117
- [e2]Christoph Meinel, Sophie Tison (Eds.): STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings. Lecture Notes in Computer Science 1563, Springer 1999
- 1998
- [c13]Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39
- 1997
- [c12]Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76
- [c11]Jean-Marc Talbot, Sophie Tison, Philippe Devienne: Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140
- 1995
- [j2]Rémi Gilleron, Sophie Tison: Regular Tree Languages and Rewrite Systems. Fundam. Inform. 24(1/2): 157-174 (1995)
- 1994
- [c10]Rémi Gilleron, Sophie Tison, Marc Tommasi: Some new Decidability Results on Positive and Negative Set Constraints. CCL 1994: 336-351
- [e1]Sophie Tison (Ed.): Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, U.K., April 11-13, 1994, Proceedings. Lecture Notes in Computer Science 787, Springer 1994, ISBN 3-540-57879-X
- 1993
- [c9]Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints with Negated Subset Relationships. FOCS 1993: 372-380
- [c8]Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints using Tree Automata. STACS 1993: 505-514
- 1992
- [p1]Max Dauchet, Sophie Tison: Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354
- [c7]Bruno Bogaert, Sophie Tison: Equality and Disequality Constraints on Direct Subterms in Tree Automata. STACS 1992: 161-171
- 1990
- [j1]Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison: Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems. Inf. Comput. 88(2): 187-201 (1990)
- [c6]
1980 – 1989
- 1989
- [c5]Jean-Luc Coquidé, Max Dauchet, Sophie Tison: About Connections Between Syntactical and Computational Complexity. FCT 1989: 105-115
- [c4]
- 1987
- [c3]Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne: Decidability of the Confluence of Ground Term Rewriting Systems. LICS 1987: 353-359
- 1985
- [c2]Max Dauchet, Sophie Tison: Decidability of confluence for ground term rewriting systems. FCT 1985: 80-89
- 1983
- [c1]Sophie Tison, Max Dauchet, Gérard Comyn: Metrical an Ordered Properties of Powerdomains. FCT 1983: 465-474
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:44 CEST by the dblp team