Sebastian Maneth

Markus Lohrey, Sebastian Maneth, Eric Noeth: XML compression via DAGs. ICDT 2013: 69-80

Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5): 1651-1669 (2012)

Benoît Groz, Sebastian Maneth, Slawek Staworko: Deterministic regular expressions in linear time. PODS 2012: 49-60

Sebastian Maneth: Dictionary-Based Tree Compression (Invited Talk). RTA 2012: 5-5

Sylvia Friese, Helmut Seidl, Sebastian Maneth: Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011)

Omer Giménez, Guillem Godoy, Sebastian Maneth: Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. SIAM J. Comput. 40(2): 446-464 (2011)

Markus Lohrey, Sebastian Maneth, Roy Mennicke: Tree Structure Compression with RePair. DCC 2011: 353-362

Adria Gascón, Sebastian Maneth, Lander Ramos: First-Order Unification on Compressed Terms. RTA 2011: 51-60

Sebastian Maneth, Kim Nguyen: XPath Whole Query Optimization. PVLDB 3(1): 882-893 (2010)

Sebastian Maneth: Preface. Theor. Comput. Sci. 411(38-39): 3403 (2010)

Sylvia Friese, Helmut Seidl, Sebastian Maneth: Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196

Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki: Fast in-memory XPath search using compressed indexes. ICDE 2010: 417-428

Aurélien Lemay, Sebastian Maneth, Joachim Niehren: A learning algorithm for top-down XML transformations. PODS 2010: 285-296

Sebastian Maneth, Kim Nguyen: XPath Whole Query Optimization. CoRR abs/1003.4353 (2010)

Markus Lohrey, Sebastian Maneth, Roy Mennicke: Tree structure compression with RePair. CoRR abs/1007.5406 (2010)

Sebastian Maneth, Tom Sebastian: Fast and Tiny Structural Self-Indexes for XML. CoRR abs/1012.5696 (2010)

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)

George Katsirelos, Sebastian Maneth, Nina Narodytska, Toby Walsh: Restricted Global Grammar Constraints. CP 2009: 501-508

Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter Reduction in Grammar-Compressed Trees. FOSSACS 2009: 212-226

Sebastian Maneth (Ed.): Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings. Lecture Notes in Computer Science 5642, Springer 2009, isbn 978-3-642-02978-3

George Katsirelos, Sebastian Maneth, Nina Narodytska, Toby Walsh: Restricted Global Grammar Constraints. CoRR abs/0906.5233 (2009)

Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki: Fast In-Memory XPath Search over Compressed Text and Tree Indexes. CoRR abs/0907.2089 (2009)

Kazuhiro Inaba, Sebastian Maneth: The Complexity of Translation Membership for Macro Tree Transducers. CoRR abs/0910.2315 (2009)

Omer Giménez, Guillem Godoy, Sebastian Maneth: Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. CoRR abs/0911.3674 (2009)

Giorgio Busatto, Markus Lohrey, Sebastian Maneth: Efficient memory representation of XML document trees. Inf. Syst. 33(4-5): 456-474 (2008)

Jens Teubner, Torsten Grust, Sebastian Maneth, Sherif Sakr: Dependable cardinality forecasts for XQuery. PVLDB 1(1): 463-477 (2008)

Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr: XML Tree Structure Compression. DEXA Workshops 2008: 243-247

Guillem Godoy, Sebastian Maneth, Sophie Tison: Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS 2008: 127-141

Kazuhiro Inaba, Sebastian Maneth: The Complexity of Tree Transducer Output Languages. FSTTCS 2008: 244-255

Sebastian Maneth, Keisuke Nakano: XML Type Checking for Macro Tree Transducers with Holes. PLAN-X 2008

Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth: Multi-Return Macro Tree Transducers. CIAA 2008: 102-111

Damien K. Fisher, Sebastian Maneth: Structural Selectivity Estimation for XML Documents. ICDE 2007: 626-635

Sebastian Maneth, Thomas Perst, Helmut Seidl: Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268

Sebastian Maneth, Helmut Seidl: Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79

Irini Fundulaki, Sebastian Maneth: Formalizing XML access control for update operations. SACMAT 2007: 169-174

Joost Engelfriet, Sebastian Maneth: The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5): 206-212 (2006)

Markus Lohrey, Sebastian Maneth: The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2): 196-210 (2006)

Burak Emir, Sebastian Maneth, Martin Odersky: Scalable Programming Abstractions for XML Services. Research Results of the DICS Program 2006: 103-126

Sebastian Maneth, Thomas Perst, Helmut Seidl: Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 (2006)

Giorgio Busatto, Markus Lohrey, Sebastian Maneth: Efficient Memory Representation of XML Documents. DBPL 2005: 199-216

Joost Engelfriet, Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005: 495-504

Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl: XML type checking with macro tree transducers. PODS 2005: 283-294

Markus Lohrey, Sebastian Maneth: Tree Automata and XPath on Compressed Trees. CIAA 2005: 225-237

Joost Engelfriet, Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable. CoRR abs/cs/0506014 (2005)

Sebastian Maneth, Giorgio Busatto: Tree Transducers and Tree Compressions. FoSSaCS 2004: 363-377

Joost Engelfriet, Sebastian Maneth: A comparison of pebble tree transducers with macro tree transducers. Acta Inf. 39(9): 613-698 (2003)

Joost Engelfriet, Sebastian Maneth: Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32(4): 950-1006 (2003)

Sebastian Maneth: The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. FSTTCS 2003: 326-337

Geert Jan Bex, Sebastian Maneth, Frank Neven: A formal model for an expressive fragment of XSLT. Inf. Syst. 27(1): 21-39 (2002)

Joost Engelfriet, Sebastian Maneth: Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64(2): 350-395 (2002)

Sebastian Maneth: The Complexity of Compositions of Deterministic Tree Transducers. FSTTCS 2002: 265-276

Joost Engelfriet, Sebastian Maneth: Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002: 234-244

Joost Engelfriet, Sebastian Maneth: Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001: 228-238

Zoltán Fülöp, Sebastian Maneth: Domains of partial attributed tree transducers. Inf. Process. Lett. 73(5-6): 175-180 (2000)

Geert Jan Bex, Sebastian Maneth, Frank Neven: A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000: 1137-1151

Joost Engelfriet, Sebastian Maneth: Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000: 542-554

Sebastian Maneth: Cooperating Distributed Hyperedge Replacement Grammars. Grammars 1(3): 193-208 (1999)

Joost Engelfriet, Sebastian Maneth: Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154(1): 34-91 (1999)

Sebastian Maneth, Frank Neven: Structured Document Transformations Based on XSL. DBPL 1999: 80-98

Sebastian Maneth: String Languages Generated by Total Deterministic Macro Tree Transducers. FoSSaCS 1999: 258-272

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

Sebastian Maneth: The Generating Power of Total Deterministic Tree Transducers. Inf. Comput. 147(2): 111-144 (1998)

Sebastian Maneth, Heiko Vogler: Attributed Context-Free Hypergraph Grammars. Journal of Automata, Languages and Combinatorics 3(2): 105-147 (1998)

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)

Sebastian Maneth: Cooperating Distributed Hyperedge Replacement Grammars. MFCS Workshop on Grammar Systems 1998: 149-161

Joost Engelfriet, Sebastian Maneth: Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998: 15-29

Heinz Faßbender, Sebastian Maneth: A Strict Border for the Decidability of E-Unification for Recursive Functions. ALP 1996: 194-208