| An overview of the Scala programming language M Odersky, P Altherr, V Cremet, B Emir, S Maneth, S Micheloud, ... Technical Report IC/2004/64, EPFL Lausanne, Switzerland, 2004 | 907 | 2004 |
| A formal model for an expressive fragment of XSLT GJ Bex, S Maneth, F Neven Information Systems 27 (1), 21-39, 2002 | 158 | 2002 |
| Macro tree transducers, attribute grammars, and MSO definable tree translations J Engelfriet, S Maneth Information and Computation 154 (1), 34-91, 1999 | 143 | 1999 |
| XML type checking with macro tree transducers S Maneth, A Berlea, T Perst, H Seidl Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on …, 2005 | 134 | 2005 |
| Efficient memory representation of XML document trees G Busatto, M Lohrey, S Maneth Information Systems 33 (4-5), 456-474, 2008 | 104 | 2008 |
| XML tree structure compression using RePair M Lohrey, S Maneth, R Mennicke Information Systems 38 (8), 1150-1167, 2013 | 101 | 2013 |
| Macro tree translations of linear size increase are MSO definable J Engelfriet, S Maneth SIAM Journal on Computing 32 (4), 950-1006, 2003 | 95 | 2003 |
| A comparison of pebble tree transducers with macro tree transducers J Engelfriet, S Maneth Acta Informatica 39 (9), 613-698, 2003 | 84 | 2003 |
| Efficient memory representation of XML documents G Busatto, M Lohrey, S Maneth International Workshop on Database Programming Languages, 199-216, 2005 | 76 | 2005 |
| Structured document transformations based on XSL S Maneth, F Neven International Symposium on Database Programming Languages, 80-98, 1999 | 75 | 1999 |
| Exact XML type checking in polynomial time S Maneth, T Perst, H Seidl International Conference on Database Theory, 254-268, 2007 | 62 | 2007 |
| The complexity of tree automata and XPath on grammar-compressed trees M Lohrey, S Maneth Theoretical Computer Science 363 (2), 196-210, 2006 | 61 | 2006 |
| Fast in‐memory XPath search using compressed indexes D Arroyuelo, F Claude, S Maneth, V Mäkinen, G Navarro, K Nguyễn, ... Software: Practice and Experience 45 (3), 399-434, 2015 | 60 | 2015 |
| A learning algorithm for top-down XML transformations A Lemay, S Maneth, J Niehren Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on …, 2010 | 60 | 2010 |
| Deciding equivalence of top–down XML transformations in polynomial time J Engelfriet, S Maneth, H Seidl Journal of Computer and System Sciences 75 (5), 271-286, 2009 | 55 | 2009 |
| XML compression via directed acyclic graphs M Bousquet-Mélou, M Lohrey, S Maneth, E Noeth Theory of Computing Systems 57 (4), 1322-1371, 2015 | 50 | 2015 |
| The equivalence problem for deterministic MSO tree transducers is decidable J Engelfriet, S Maneth Information Processing Letters 100 (5), 206-212, 2006 | 50 | 2006 |
| Structural selectivity estimation for XML documents DK Fisher, S Maneth 2007 IEEE 23rd International Conference on Data Engineering, 626-635, 2006 | 49 | 2006 |
| Grammar-based graph compression S Maneth, F Peternek Information Systems 76, 19-45, 2018 | 48 | 2018 |
| Equivalence of deterministic top-down tree-to-string transducers is decidable H Seidl, S Maneth, G Kemper Journal of the ACM (JACM) 65 (4), 1-30, 2018 | 42 | 2018 |
Helmut SeidlProfessor für Informatik, School of CIT, TU MünchenVerified email at in.tum.de
