- Computational Complexity - Characterizing and proving lower bounds for the computational ressources of communication protocols and (binary) decision diagrams
- Design of efficient data structures and algorithms for binary decision diagrams, OBDDs (Ordered Binary Decision Diagrams), and their complexity analysis,
- Formal methods for design automation and verification of digital VLSI circuits and communication protocols
resp. in the field of telematics in the frame of the Instituts für Telematik (1996-2004) in Trier which was supervised by the Fraunhofer Management Society.