Sebastian Maneth
I am Senior Researcher at
National ICT Australia (NICTA)'s Kensington Research Lab,
Sydney, Australia
and
Conjoint Associate Professor at the
School of Computer Science & Engineering
, University of New South Wales.
At NICTA, I am managing the project:
In Memory XML Query Processing (ComQu).
Address:
National ICT Australia Ltd
Locked Bag 6016
The University of New South Wales
Sydney, NSW 1466
Australia
Office:
Room 508, Level 5, NICTA, 223 Anzac Parade, Kensington,
Sydney, NSW 2052, Australia
Email: first.lastATnicta.com.au,
Phone: (+61) 2 83060481,
Fax: (+61) 2 83060405
Research Interests:
XML Query and Transformation Languages
Automata and Formal Language Theory
Logic (on graphs and trees)
Recent Publications:
(see also
)
-
Dependable Cardinality Forecasts for XQuery
(with J. Teubner, T. Grust, and S. Sakr)
To appear in
VLDB'08,
Proceedings, ACM Press, 2008.
-
XML Tree Structure Compression
(with N. Mihaylov and S. Sakr)
To appear in
XANTEC'08,
DEXA Workshops, Proceedings, IEEE Computer Society, 2008.
-
Multi-Return Macro Tree Transducers
(with K. Inaba and H. Hosoya)
To appear in
CIAA 2008,
Proceedings, LNCS, Springer-Verlag, 2008.
-
Classes of Tree Homomorphisms with Decidable Preservation of Regularity
(with G. Godoy and S. Tison)
In
FoSSaCS 2008,
Proceedings, pp. 127-141, LNCS 4962, Springer-Verlag, 2008.
-
XML Type Checking for Macro Tree Transducers with Holes
(with K. Nakano)
In
PLAN-X 2008,
Proceedings, 2008.
-
Efficient Memory Representation of XML Document Trees
(with G. Busatto and M. Lohrey)
Information Systems
33:456-474 (2008).
-
Formalizing XML Access Control for Update Operations (with I. Fundulaki)
In
SACMAT 2007,
Proceedings,
pp. 169-174,
ACM Press, 2007.
-
Structural Selectivity Estimation for XML Documents
(with D. Fisher)
In
ICDE 2007,
Proceedings,
pp. 626-635,
IEEE Press, 2007.
(Long:
Technical Report PA006152)
-
Deciding Equivalence of Top-Down XML
Transformations in Polynomial Time (with H. Seidl)
In
PLAN-X 2007,
Proceedings, 2007.
-
Exact XML Type Checking in Polynomial Time
(with T. Perst and H. Seidl)
In
ICDT 2007,
Proceedings,
pp. 254-268,
LNCS 4353,
Springer-Verlag, 2007.
-
The Equivalence Problem for Deterministic MSO Tree Transducers is
Decidable (with J. Engelfriet)
Inform. Proc. Letters
100:206-212 (2006).
-
Scalable Programming Abstractions for XML Services
(with B. Emir and M. Odersky)
In J. Kohlas, B. Meyer, and A. Schiper (Eds.):
Dependable Systems, LNCS 4028, pp. 103-126,
Springer-Verlag, 2006.
-
The Complexity of Tree Automata and XPath on Grammar-Compressed Trees
(with M. Lohrey)
Theoret. Comput. Sci.
363:196-210 (2006)
Lectures:
Activities:
My Erdös number: 3 (F. Neven -> N. Alon -> P. Erdös)
some pictures