| 2009 |
|---|
| 45 | EE | Markus Lohrey,
Sebastian Maneth,
Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees.
FOSSACS 2009: 212-226 |
| 44 | EE | Joost Engelfriet,
Sebastian Maneth,
Helmut Seidl:
Deciding equivalence of top-down XML transformations in polynomial time.
J. Comput. Syst. Sci. 75(5): 271-286 (2009) |
| 2008 |
|---|
| 43 | EE | Kazuhiro Inaba,
Haruo Hosoya,
Sebastian Maneth:
Multi-Return Macro Tree Transducers.
CIAA 2008: 102-111 |
| 42 | EE | Sebastian Maneth,
Nikolay Mihaylov,
Sherif Sakr:
XML Tree Structure Compression.
DEXA Workshops 2008: 243-247 |
| 41 | EE | Kazuhiro Inaba,
Sebastian Maneth:
The Complexity of Tree Transducer Output Languages.
FSTTCS 2008 |
| 40 | EE | Guillem Godoy,
Sebastian Maneth,
Sophie Tison:
Classes of Tree Homomorphisms with Decidable Preservation of Regularity.
FoSSaCS 2008: 127-141 |
| 39 | EE | Sebastian Maneth,
Keisuke Nakano:
XML Type Checking for Macro Tree Transducers with Holes.
PLAN-X 2008 |
| 38 | EE | Giorgio Busatto,
Markus Lohrey,
Sebastian Maneth:
Efficient memory representation of XML document trees.
Inf. Syst. 33(4-5): 456-474 (2008) |
| 37 | EE | Jens Teubner,
Torsten Grust,
Sebastian Maneth,
Sherif Sakr:
Dependable cardinality forecasts for XQuery.
PVLDB 1(1): 463-477 (2008) |
| 2007 |
|---|
| 36 | EE | Damien K. Fisher,
Sebastian Maneth:
Structural Selectivity Estimation for XML Documents.
ICDE 2007: 626-635 |
| 35 | EE | Sebastian Maneth,
Thomas Perst,
Helmut Seidl:
Exact XML Type Checking in Polynomial Time.
ICDT 2007: 254-268 |
| 34 | EE | Sebastian Maneth,
Helmut Seidl:
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.
PLAN-X 2007: 73-79 |
| 33 | EE | Irini Fundulaki,
Sebastian Maneth:
Formalizing XML access control for update operations.
SACMAT 2007: 169-174 |
| 2006 |
|---|
| 32 | EE | Burak Emir,
Sebastian Maneth,
Martin Odersky:
Scalable Programming Abstractions for XML Services.
Research Results of the DICS Program 2006: 103-126 |
| 31 | EE | Joost Engelfriet,
Sebastian Maneth:
The equivalence problem for deterministic MSO tree transducers is decidable.
Inf. Process. Lett. 100(5): 206-212 (2006) |
| 30 | EE | Markus Lohrey,
Sebastian Maneth:
The complexity of tree automata and XPath on grammar-compressed trees.
Theor. Comput. Sci. 363(2): 196-210 (2006) |
| 29 | | Sebastian Maneth,
Thomas Perst,
Helmut Seidl:
Exact XML Type Checking in Polynomial Time.
Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04: (2006) |
| 2005 |
|---|
| 28 | EE | Markus Lohrey,
Sebastian Maneth:
Tree Automata and XPath on Compressed Trees.
CIAA 2005: 225-237 |
| 27 | EE | Giorgio Busatto,
Markus Lohrey,
Sebastian Maneth:
Efficient Memory Representation of XML Documents.
DBPL 2005: 199-216 |
| 26 | EE | Joost Engelfriet,
Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable.
FSTTCS 2005: 495-504 |
| 25 | EE | Sebastian Maneth,
Alexandru Berlea,
Thomas Perst,
Helmut Seidl:
XML type checking with macro tree transducers.
PODS 2005: 283-294 |
| 24 | EE | Joost Engelfriet,
Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
CoRR abs/cs/0506014: (2005) |
| 2004 |
|---|
| 23 | EE | Sebastian Maneth,
Giorgio Busatto:
Tree Transducers and Tree Compressions.
FoSSaCS 2004: 363-377 |
| 2003 |
|---|
| 22 | EE | Sebastian Maneth:
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase.
FSTTCS 2003: 326-337 |
| 21 | EE | Joost Engelfriet,
Sebastian Maneth:
A comparison of pebble tree transducers with macro tree transducers.
Acta Inf. 39(9): 613-698 (2003) |
| 20 | EE | Joost Engelfriet,
Sebastian Maneth:
Macro Tree Translations of Linear Size Increase are MSO Definable.
SIAM J. Comput. 32(4): 950-1006 (2003) |
| 2002 |
|---|
| 19 | EE | Sebastian Maneth:
The Complexity of Compositions of Deterministic Tree Transducers.
FSTTCS 2002: 265-276 |
| 18 | EE | Joost Engelfriet,
Sebastian Maneth:
Two-Way Finite State Transducers with Nested Pebbles.
MFCS 2002: 234-244 |
| 17 | EE | Geert Jan Bex,
Sebastian Maneth,
Frank Neven:
A formal model for an expressive fragment of XSLT.
Inf. Syst. 27(1): 21-39 (2002) |
| 16 | EE | Joost Engelfriet,
Sebastian Maneth:
Output String Languages of Compositions of Deterministic Macro Tree Transducers.
J. Comput. Syst. Sci. 64(2): 350-395 (2002) |
| 2001 |
|---|
| 15 | EE | Joost Engelfriet,
Sebastian Maneth:
Hierarchies of String Languages Generated by Deterministic Tree Transducers.
Developments in Language Theory 2001: 228-238 |
| 2000 |
|---|
| 14 | EE | Geert Jan Bex,
Sebastian Maneth,
Frank Neven:
A Formal Model for an Expressive Fragment of XSLT.
Computational Logic 2000: 1137-1151 |
| 13 | EE | Joost Engelfriet,
Sebastian Maneth:
Characterizing and Deciding MSO-Definability of Macro Tree Transductions.
STACS 2000: 542-554 |
| 12 | EE | Zoltán Fülöp,
Sebastian Maneth:
Domains of partial attributed tree transducers.
Inf. Process. Lett. 73(5-6): 175-180 (2000) |
| 1999 |
|---|
| 11 | EE | Sebastian Maneth,
Frank Neven:
Structured Document Transformations Based on XSL.
DBPL 1999: 80-98 |
| 10 | | Sebastian Maneth:
String Languages Generated by Total Deterministic Macro Tree Transducers.
FoSSaCS 1999: 258-272 |
| 9 | | Zoltán Fülöp,
Sebastian Maneth:
A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars.
Grammatical Models of Multi-Agent Systems 1999: 182-192 |
| 8 | | Sebastian Maneth:
Cooperating Distributed Hyperedge Replacement Grammars.
Grammars 1(3): 193-208 (1999) |
| 7 | | Joost Engelfriet,
Sebastian Maneth:
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations.
Inf. Comput. 154(1): 34-91 (1999) |
| 1998 |
|---|
| 6 | | Sebastian Maneth:
Cooperating Distributed Hyperedge Replacement Grammars.
MFCS Workshop on Grammar Systems 1998: 149-161 |
| 5 | | Joost Engelfriet,
Sebastian Maneth:
Tree Languages Generated be Context-Free Graph Grammars.
TAGT 1998: 15-29 |
| 4 | | Sebastian Maneth:
The Generating Power of Total Deterministic Tree Transducers.
Inf. Comput. 147(2): 111-144 (1998) |
| 3 | | Sebastian Maneth,
Heiko Vogler:
Attributed Context-Free Hypergraph Grammars.
Journal of Automata, Languages and Combinatorics 3(2): 105-147 (1998) |
| 2 | | Heinz Faßbender,
Sebastian Maneth:
A Strict Border for the Decidability of E-Unification for Recursive Functions.
Journal of Functional and Logic Programming 1998(4): (1998) |
| 1996 |
|---|
| 1 | | Heinz Faßbender,
Sebastian Maneth:
A Strict Border for the Decidability of E-Unification for Recursive Functions.
ALP 1996: 194-208 |
