BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × France
1 × Russia
1 × Serbia
1 × Spain
1 × The Netherlands
2 × Germany
2 × Hungary
2 × Japan
2 × United Kingdom
4 × USA
Collaborated with:
J.Engelfriet H.Seidl M.Lohrey S.Friese K.Nguyen G.Busatto H.Faßbender F.Peternek B.Groz S.Staworko A.Gascón L.Ramos A.Lemay J.Niehren M.Schmidt-Schauß K.Inaba H.Hosoya G.Godoy S.Tison G.J.Bex F.Neven E.Filiot P.Reynier J.Talbot J.Teubner T.Grust S.Sakr A.Berlea T.Perst
Talks about:
tree (18) transduc (10) compress (6) determinist (4) languag (3) generat (3) macro (3) regular (2) problem (2) grammar (2)

Person: Sebastian Maneth

DBLP DBLP: Maneth:Sebastian

Facilitated 1 volumes:

CIAA 2009Ed

Contributed to:

ICALP (2) 20152015
AFL 20142014
DLT 20142014
PODS 20122012
RTA 20122012
RTA 20112011
DLT 20102010
DLT 20102011
PODS 20102010
VLDB 20102010
FOSSACS 20092009
CIAA 20082008
FoSSaCS 20082008
VLDB 20082008
CIAA 20052005
PODS 20052005
FoSSaCS 20042004
DLT 20012001
CL 20002000
FoSSaCS 19991999
TAGT 19981998
ALP 19961996

Wrote 23 papers:

ICALP-v2-2015-FiliotMRT #problem #transducer
Decision Problems of Tree Transducers with Origin (EF, SM, PAR, JMT), pp. 209–221.
Compressed Tree Canonization (ML, SM, FP), pp. 337–349.
AFL-2014-Maneth #equivalence #overview #problem #transducer
Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.
DLT-2014-EngelfrietMS #how #top-down #transducer
How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.
PODS-2012-GrozMS #linear #regular expression
Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.
Dictionary-Based Tree Compression (SM), p. 5.
RTA-2011-GasconMR #first-order #unification
First-Order Unification on Compressed Terms (AG, SM, LR), pp. 51–60.
DLT-2010-FrieseSM #bottom-up #transducer
Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.
DLT-J-2010-FrieseSM11 #bottom-up #normalisation #transducer
Earliest Normal Form and Minimization for Bottom-up Tree Transducers (SF, HS, SM), pp. 1607–1623.
PODS-2010-LemayMN #algorithm #learning #top-down #xml
A learning algorithm for top-down XML transformations (AL, SM, JN), pp. 285–296.
VLDB-2010-ManethN #optimisation #query #xpath
XPath Whole Query Optimization (SM, KN), pp. 882–893.
FoSSaCS-2009-LohreyMS #parametricity #reduction
Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
CIAA-2008-InabaHM #metaprogramming #multi #transducer
Multi-Return Macro Tree Transducers (KI, HH, SM), pp. 102–111.
FoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
VLDB-2008-TeubnerGMS #xquery
Dependable cardinality forecasts for XQuery (JT, TG, SM, SS), pp. 463–477.
CIAA-2005-LohreyM #automaton #xpath
Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.
PODS-2005-ManethBPS #metaprogramming #transducer #type checking #xml
XML type checking with macro tree transducers (SM, AB, TP, HS), pp. 283–294.
FoSSaCS-2004-ManethB #transducer
Tree Transducers and Tree Compressions (SM, GB), pp. 363–377.
DLT-2001-EngelfrietM #string #transducer
Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.
CL-2000-BexMN #formal method
A Formal Model for an Expressive Fragment of XSLT (GJB, SM, FN), pp. 1137–1151.
FoSSaCS-1999-Maneth #metaprogramming #string #transducer
String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.
TAGT-1998-EngelfrietM #graph grammar
Tree Languages Generated be Context-Free Graph Grammars (JE, SM), pp. 15–29.
ALP-1996-FassbenderM #decidability #recursion #strict
A Strict Border for the Decidability of E-Unification for Recursive Functions (HF, SM), pp. 194–208.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.