Sebastian Maneth

Recent Publications (see also )

• Deciding Equivalence of Top-Down XML Transformations in Polynomial Time (with J. Engelfriet and H. Seidl)
  To appear in Journal of Computer and System Sciences, 2009.

• Parameter Reduction in Grammar-Compressed Trees (with M. Lohrey and M. Schmidt-Schauss)
  To appear in FoSSaCS 2009, Proceedings, Springer, 2009.

• The Complexity of Translation Membership for Macro Tree Transducers (with K. Inaba)
  In PLAN-X 2009, Proceedings, 2009.

• The Complexity of Tree Transducer Output Languages (with K. Inaba)
  In FSTTCS 2008, Proceedings, IBFI, 2008.

• Dependable Cardinality Forecasts for XQuery (with J. Teubner, T. Grust, and S. Sakr)
  In VLDB'08, Proceedings, pp. 463-477, VLDB Endowment, 2008.

• XML Tree Structure Compression (with N. Mihaylov and S. Sakr)
  In XANTEC'08, DEXA Workshops, Proceedings, pp 243-247, IEEE Computer Society, 2008.

• Multi-Return Macro Tree Transducers (with K. Inaba and H. Hosoya)
  In CIAA 2008, Proceedings, pp. 102-111, LNCS 5148, Springer, 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, 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, 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, 2006.

• The Complexity of Tree Automata and XPath on Grammar-Compressed Trees (with M. Lohrey)
  Theoret. Comput. Sci. 363:196-210 (2006)

Lectures

• XML and Databases (UNSW, 1/2008)
• XML and Databases (UNSW, 2/2007)
• Logic and Automata (Canberra, December 2006)
• Type Systems (EPFL, 2004/05)
• Tree Transducers and XML (Tarragona, April 2004)

Activities

• PC member, International Conference on Database Theory (ICDT 2010)
• PC member, International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2010)
• PC member, Asian Symposium on Programming Languages and Systems (APLAS 2009)
• PC member, International Workshop on Schema Languages for XML (X-Schemas'09)
• Organizer, International Conference on Implementation and Application of Automata (CIAA 2009)
• PC member, International Conference on Database Theory (ICDT 2009)
• PC member, 20th Australasian Database Conference (ADC 2009)
• PC member, International Conference on Implementation and Application of Automata (CIAA 2008)
• Organizer, Dagstuhl Seminar on Structure-Based Compression of Complex Massive Data (June 2008)
• PC member, Programming Language Technologies for XML (PLAN-X 2008)
• PC member, ACM Workshop on Web Information and Data Management (WIDM 2007)
• PC member, ACM Workshop on Web Information and Data Management (WIDM 2006)
• Mathematical Reviews

My PhD Thesis

Recent Talks

Old Talks