Philip Whittington

Orcid: 0009-0005-0910-6826

According to our database¹, Philip Whittington authored at least 5 papers between 2024 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

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

[BibT_eX]

[DOI]

CoRR, March, 2025

Tokenisation is NP-Complete.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Philip Whittington

CoRR, 2024

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

[BibT_eX]

[DOI]

Philip Whittington

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

The 2-Attractor Problem Is NP-Complete.

[BibT_eX]

[DOI]

Janosch Fuchs

Philip Whittington

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

Philip Whittington

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...