Sebastian Maneth

According to our database1, Sebastian Maneth
  • authored at least 108 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Efficient testing and matching of deterministic regular expressions.
J. Comput. Syst. Sci., 2017

Determinacy and rewriting of functional top-down and MSO tree transformations.
J. Comput. Syst. Sci., 2017

Grammar-Based Graph Compression.
CoRR, 2017

Multiple Context-Free Tree Grammars: Lexicalization and Characterization.
CoRR, 2017

Data Science.
Comput. J., 2017

Parsing Graphs with Regular Graph Grammars.
Proceedings of the 6th Joint Conference on Lexical and Computational Semantics, 2017

(Re)introducing Regular Graph Languages.
Proceedings of the 15th Meeting on the Mathematics of Language, 2017

Compression of Unordered XML Trees.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Equivalence - Combinatorics, Algebra, Proofs.
Proceedings of the Dependable Software Systems Engineering, 2016

Look-ahead removal for total deterministic top-down tree transducers.
Theor. Comput. Sci., 2016

Computation over Compressed Structured Data (Dagstuhl Seminar 16431).
Dagstuhl Reports, 2016

Robust and Noise Resistant Wrapper Induction.
Proceedings of the 2016 International Conference on Management of Data, 2016

Compressing graphs by grammars.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Incremental updates on compressed XML.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Traversing Grammar-Compressed Trees with Constant Delay.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Fast in-memory XPath search using compressed indexes.
Softw., Pract. Exper., 2015

XML Compression via Directed Acyclic Graphs.
Theory Comput. Syst., 2015

A Survey on Decidable Equivalence Problems for Tree Transducers.
Int. J. Found. Comput. Sci., 2015

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
CoRR, 2015

A Survey on Methods and Systems for Graph Compression.
CoRR, 2015

Traversing Grammar-Compressed Trees with Constant Delay.
CoRR, 2015

Compressed Tree Canonization.
CoRR, 2015

Transforming XML Streams with References.
Proceedings of the String Processing and Information Retrieval, 2015

Compressed Tree Canonization.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Decision Problems of Tree Transducers with Origin.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

OnlineRePair: A Recompressor for XML Structures.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Equivalence Problems for Tree Transducers: A Brief Survey.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

XQuery streaming by Forest Transducers.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

How to Remove the Look-Ahead of Top-Down Tree Transducers.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
XML tree structure compression using RePair.
Inf. Syst., 2013

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).
Dagstuhl Reports, 2013

Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232).
Dagstuhl Reports, 2013

XPath Node Selection over Grammar-Compressed Trees.
Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

XQuery Streaming by Forest Transducers.
CoRR, 2013

Look-Ahead Removal for Top-Down Tree Transducers.
CoRR, 2013

XML Compression via DAGs.
CoRR, 2013

Determinacy and Rewriting of Top-Down and MSO Tree Transformations.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

XML compression via DAGs.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012
Parameter reduction and automata evaluation for grammar-compressed trees.
J. Comput. Syst. Sci., 2012

Dictionary-Based Tree Compression (Invited Talk).
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Deterministic regular expressions in linear time.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Type Checking of Tree Walking Transducers.
Modern Applications of Automata Theory, 2012

2011
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete.
SIAM J. Comput., 2011

Earliest Normal Form and Minimization for Bottom-up Tree Transducers.
Int. J. Found. Comput. Sci., 2011

First-Order Unification on Compressed Terms.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Tree Structure Compression with RePair.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010
Preface.
Theor. Comput. Sci., 2010

XPath Whole Query Optimization.
PVLDB, 2010

Fast and Tiny Structural Self-Indexes for XML
CoRR, 2010

Tree structure compression with RePair
CoRR, 2010

XPath Whole Query Optimization
CoRR, 2010

A learning algorithm for top-down XML transformations.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Fast in-memory XPath search using compressed indexes.
Proceedings of the 26th International Conference on Data Engineering, 2010

Minimization of Deterministic Bottom-Up Tree Transducers.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Deciding equivalence of top-down XML transformations in polynomial time.
J. Comput. Syst. Sci., 2009

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
CoRR, 2009

The Complexity of Translation Membership for Macro Tree Transducers
CoRR, 2009

Fast In-Memory XPath Search over Compressed Text and Tree Indexes
CoRR, 2009

Restricted Global Grammar Constraints
CoRR, 2009

Parameter Reduction in Grammar-Compressed Trees.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Restricted Global Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
Dependable cardinality forecasts for XQuery.
PVLDB, 2008

Efficient memory representation of XML document trees.
Inf. Syst., 2008

Multi-Return Macro Tree Transducers.
Proceedings of the Implementation and Applications of Automata, 2008

XML Type Checking for Macro Tree Transducers with Holes.
Proceedings of the PLAN-X 2008, 2008

The Complexity of Tree Transducer Output Languages.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Classes of Tree Homomorphisms with Decidable Preservation of Regularity.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

XML Tree Structure Compression.
Proceedings of the 19th International Workshop on Database and Expert Systems Applications (DEXA 2008), 2008

08261 Executive Summary - Structure-Based Compression of Complex Massive Data.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

2007
Formalizing XML access control for update operations.
Proceedings of the 12th ACM Symposium on Access Control Models and Technologies, 2007

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.
Proceedings of the PLAN-X 2007, 2007

Exact XML Type Checking in Polynomial Time.
Proceedings of the Database Theory, 2007

Structural Selectivity Estimation for XML Documents.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
Exact XML Type Checking in Polynomial Time.
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2006

The complexity of tree automata and XPath on grammar-compressed trees.
Theor. Comput. Sci., 2006

The equivalence problem for deterministic MSO tree transducers is decidable.
Inf. Process. Lett., 2006

Scalable Programming Abstractions for XML Services.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

2005
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
CoRR, 2005

Tree Automata and XPath on Compressed Trees.
Proceedings of the Implementation and Application of Automata, 2005

XML type checking with macro tree transducers.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Efficient Memory Representation of XML Documents.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

2004
Tree Transducers and Tree Compressions.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Macro Tree Translations of Linear Size Increase are MSO Definable.
SIAM J. Comput., 2003

A comparison of pebble tree transducers with macro tree transducers.
Acta Inf., 2003

The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Output String Languages of Compositions of Deterministic Macro Tree Transducers.
J. Comput. Syst. Sci., 2002

A formal model for an expressive fragment of XSLT.
Inf. Syst., 2002

Two-Way Finite State Transducers with Nested Pebbles.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Complexity of Compositions of Deterministic Tree Transducers.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001
Hierarchies of String Languages Generated by Deterministic Tree Transducers.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Domains of partial attributed tree transducers.
Inf. Process. Lett., 2000

Characterizing and Deciding MSO-Definability of Macro Tree Transductions.
Proceedings of the STACS 2000, 2000

A Formal Model for an Expressive Fragment of XSLT.
Proceedings of the Computational Logic, 2000

1999
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations.
Inf. Comput., 1999

Cooperating Distributed Hyperedge Replacement Grammars.
Grammars, 1999

A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

String Languages Generated by Total Deterministic Macro Tree Transducers.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Structured Document Transformations Based on XSL.
Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

1998
A Strict Border for the Decidability of E-Unification for Recursive Functions.
Journal of Functional and Logic Programming, 1998

Attributed Context-Free Hypergraph Grammars.
Journal of Automata, Languages and Combinatorics, 1998

The Generating Power of Total Deterministic Tree Transducers.
Inf. Comput., 1998

Tree Languages Generated be Context-Free Graph Grammars.
Proceedings of the Theory and Application of Graph Transformations, 1998

Cooperating Distributed Hyperedge Replacement Grammars.
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1996
A Strict Border for the Decidability of E-Unification for Recursive Functions.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996


  Loading...