Philip Whittington

According to our database, Philip Whittington authored at least 8 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Tokenisation via Convex Relaxations.

Jan Tempus, Philip Whittington, Craig W. Schmidt, Dennis Komm, Tiago Pimentel

CoRR, May, 2026

2025

Tokenisation over Bounded Alphabets is Hard.

Violeta Kastreva, Philip Whittington, Dennis Komm, Tiago Pimentel

CoRR, November, 2025

Time-Optimal <i>k</i>-Server.

Fabian Frei, Dennis Komm, Moritz Stocker, Philip Whittington

CoRR, March, 2025

Time-Optimal k-Server.

Fabian Frei, Dennis Komm, Moritz Stocker, Philip Whittington

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

Tokenisation is NP-Complete.

Philip Whittington, Gregor Bachmann, Tiago Pimentel

Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025

2024

Online String Attractors.

Philip Whittington

CoRR, 2024

Online String Attractors - And Their Relation to the Lempel-Ziv Factorization.

Philip Whittington

Proceedings of the Approximation and Online Algorithms - 22nd International Workshop, 2024

The 2-Attractor Problem Is NP-Complete.

Janosch Fuchs, Philip Whittington

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024