Philip Bille

Philip Bille is a Professor and Head of the Algorithms, Logic and Graphs section at the Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU), College of Engineering. His research centers on the design and analysis of efficient algorithms, particularly for string processing, compressed data, and data structures.

His research interests lie at the intersection of theoretical computer science and practical applications. He focuses on algorithms, data structures, string indexing, pattern matching, and compressed computation. His work enables efficient querying and processing of large-scale, repetitive data, with applications in bioinformatics, intrusion detection, and green computing.

The recent publications reflect a strong trend in developing space-efficient and fast algorithms for modern computational challenges. Key themes include compressed data structures, sliding window indexing, finite automata compression, and energy-aware matrix operations. These works demonstrate expertise in balancing theoretical rigor with practical performance.

Philip Bille actively supervises multiple PhD students and leads several research projects. He contributes to advancing sustainable computing aligned with UN SDGs. His work integrates algorithmic theory with real-world efficiency.

• Supervises PhD projects on hierarchical compression, adaptive computation, and vector processor algorithms.
• Involved in research on green computing, compressed formats, and efficient data models.

He is affiliated with the Algorithms, Logic and Graphs group at DTU, a hub for theoretical and applied algorithmic research. The team explores fundamental problems in data representation and processing, pushing the boundaries of what is computationally feasible in terms of time and space.