Extending Graham-Glanville techniques for optimal code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Processor modeling and code selection for retargetable compilation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
Compositions of tree series transformations
Theoretical Computer Science
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Recognizable tree series with discounting
Acta Cybernetica
An appreciation of the work of Reinhard Wilhelm
Program analysis and compilation, theory and practice
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Code selection by tree series transducers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Computing all subtree repeats in ordered trees
Information Processing Letters
| Hi-index | 0.00 |