Search the dblp DataBase
Sebastian Maneth :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Heinz Faßbender , Sebastian Maneth A Strict Border for the Decidability of E-Unification for Recursive Functions. [Citation Graph (0, 0)][DBLP ] ALP, 1996, pp:194-208 [Conf ] Geert Jan Bex , Sebastian Maneth , Frank Neven A Formal Model for an Expressive Fragment of XSLT. [Citation Graph (0, 0)][DBLP ] Computational Logic, 2000, pp:1137-1151 [Conf ] Giorgio Busatto , Markus Lohrey , Sebastian Maneth Efficient Memory Representation of XML Documents. [Citation Graph (0, 0)][DBLP ] DBPL, 2005, pp:199-216 [Conf ] Sebastian Maneth , Frank Neven Structured Document Transformations Based on XSL. [Citation Graph (0, 0)][DBLP ] DBPL, 1999, pp:80-98 [Conf ] Joost Engelfriet , Sebastian Maneth Hierarchies of String Languages Generated by Deterministic Tree Transducers. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2001, pp:228-238 [Conf ] Sebastian Maneth String Languages Generated by Total Deterministic Macro Tree Transducers. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 1999, pp:258-272 [Conf ] Sebastian Maneth , Giorgio Busatto Tree Transducers and Tree Compressions. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2004, pp:363-377 [Conf ] Joost Engelfriet , Sebastian Maneth The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:495-504 [Conf ] Sebastian Maneth The Complexity of Compositions of Deterministic Tree Transducers. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2002, pp:265-276 [Conf ] Sebastian Maneth The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:326-337 [Conf ] Zoltán Fülöp , Sebastian Maneth A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. [Citation Graph (0, 0)][DBLP ] Grammatical Models of Multi-Agent Systems, 1999, pp:182-192 [Conf ] Sebastian Maneth , Thomas Perst , Helmut Seidl Exact XML Type Checking in Polynomial Time. [Citation Graph (0, 0)][DBLP ] ICDT, 2007, pp:254-268 [Conf ] Joost Engelfriet , Sebastian Maneth Two-Way Finite State Transducers with Nested Pebbles. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:234-244 [Conf ] Sebastian Maneth Cooperating Distributed Hyperedge Replacement Grammars. [Citation Graph (0, 0)][DBLP ] MFCS Workshop on Grammar Systems, 1998, pp:149-161 [Conf ] Sebastian Maneth , Helmut Seidl Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. [Citation Graph (0, 0)][DBLP ] PLAN-X, 2007, pp:73-79 [Conf ] Sebastian Maneth , Alexandru Berlea , Thomas Perst , Helmut Seidl XML type checking with macro tree transducers. [Citation Graph (0, 0)][DBLP ] PODS, 2005, pp:283-294 [Conf ] Joost Engelfriet , Sebastian Maneth Characterizing and Deciding MSO-Definability of Macro Tree Transductions. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:542-554 [Conf ] Joost Engelfriet , Sebastian Maneth Tree Languages Generated be Context-Free Graph Grammars. [Citation Graph (0, 0)][DBLP ] TAGT, 1998, pp:15-29 [Conf ] Markus Lohrey , Sebastian Maneth Tree Automata and XPath on Compressed Trees. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:225-237 [Conf ] Burak Emir , Sebastian Maneth , Martin Odersky Scalable Programming Abstractions for XML Services. [Citation Graph (0, 0)][DBLP ] Research Results of the DICS Program, 2006, pp:103-126 [Conf ] Joost Engelfriet , Sebastian Maneth A comparison of pebble tree transducers with macro tree transducers. [Citation Graph (0, 0)][DBLP ] Acta Inf., 2003, v:39, n:9, pp:613-698 [Journal ] Sebastian Maneth Cooperating Distributed Hyperedge Replacement Grammars. [Citation Graph (0, 0)][DBLP ] Grammars, 1999, v:1, n:3, pp:193-208 [Journal ] Joost Engelfriet , Sebastian Maneth Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1999, v:154, n:1, pp:34-91 [Journal ] Sebastian Maneth The Generating Power of Total Deterministic Tree Transducers. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1998, v:147, n:2, pp:111-144 [Journal ] Zoltán Fülöp , Sebastian Maneth Domains of partial attributed tree transducers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:175-180 [Journal ] Joost Engelfriet , Sebastian Maneth The equivalence problem for deterministic MSO tree transducers is decidable. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:5, pp:206-212 [Journal ] Geert Jan Bex , Sebastian Maneth , Frank Neven A formal model for an expressive fragment of XSLT. [Citation Graph (0, 0)][DBLP ] Inf. Syst., 2002, v:27, n:1, pp:21-39 [Journal ] Sebastian Maneth , Heiko Vogler Attributed Context-Free Hypergraph Grammars. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 1998, v:3, n:2, pp:105-147 [Journal ] Joost Engelfriet , Sebastian Maneth Output String Languages of Compositions of Deterministic Macro Tree Transducers. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:64, n:2, pp:350-395 [Journal ] Heinz Faßbender , Sebastian Maneth A Strict Border for the Decidability of E-Unification for Recursive Functions. [Citation Graph (0, 0)][DBLP ] Journal of Functional and Logic Programming, 1998, v:1998, n:4, pp:- [Journal ] Joost Engelfriet , Sebastian Maneth Macro Tree Translations of Linear Size Increase are MSO Definable. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:4, pp:950-1006 [Journal ] Markus Lohrey , Sebastian Maneth The complexity of tree automata and XPath on grammar-compressed trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:363, n:2, pp:196-210 [Journal ] Damien K. Fisher , Sebastian Maneth Structural Selectivity Estimation for XML Documents. [Citation Graph (0, 0)][DBLP ] ICDE, 2007, pp:626-635 [Conf ] Irini Fundulaki , Sebastian Maneth Formalizing XML access control for update operations. [Citation Graph (0, 0)][DBLP ] SACMAT, 2007, pp:169-174 [Conf ] Restricted Global Grammar Constraints. [Citation Graph (, )][DBLP ] XML Tree Structure Compression. [Citation Graph (, )][DBLP ] Minimization of Deterministic Bottom-Up Tree Transducers. [Citation Graph (, )][DBLP ] Classes of Tree Homomorphisms with Decidable Preservation of Regularity. [Citation Graph (, )][DBLP ] Parameter Reduction in Grammar-Compressed Trees. [Citation Graph (, )][DBLP ] The Complexity of Tree Transducer Output Languages. [Citation Graph (, )][DBLP ] Fast in-memory XPath search using compressed indexes. [Citation Graph (, )][DBLP ] XML Type Checking for Macro Tree Transducers with Holes. [Citation Graph (, )][DBLP ] A learning algorithm for top-down XML transformations. [Citation Graph (, )][DBLP ] Multi-Return Macro Tree Transducers. [Citation Graph (, )][DBLP ] The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable [Citation Graph (, )][DBLP ] Restricted Global Grammar Constraints [Citation Graph (, )][DBLP ] Fast In-Memory XPath Search over Compressed Text and Tree Indexes [Citation Graph (, )][DBLP ] The Complexity of Translation Membership for Macro Tree Transducers [Citation Graph (, )][DBLP ] Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete [Citation Graph (, )][DBLP ] XPath Whole Query Optimization [Citation Graph (, )][DBLP ] Tree structure compression with RePair [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.307secs