Professor Tony Wirth

  • Room: Level: 09 Room: 9.20
  • Building: Doug McDonell Building
  • Campus: Parkville

Research interests

  • Algorithms (Algorithms for processing text; graph algorithms; streaming algorithms)
  • Data Mining and Machine Learning
  • Psychophysical Testing (Psychometric Function Estimation)

Personal webpage


Dr Tony Wirth is Professor in the School of Computing and Information Systems at The University of Melbourne. 

He completed a BSc(Hons) and MSc at the University of Melbourne; supported by a Gordon Wu Fellowship, he completed an MA and PhD at Princeton University. Wirth has previously been the Seminar and Excellence Coordinator in the Department of Computer Science and Software Engineering. Wirth has a significant publication record in, amongst others, approximation and graph algorithms, bioinformatics, and data mining. He has refereed for numerous international journals and served on several conference program committees. Wirth's teaching has been commended both at the department and school level.

Recent publications

  1. Liao K, Moffat A, Petri M, Wirth A. A cost model for long-term compressed data retention. WSDM 2017 - Proceedings of the 10th ACM International Conference on Web Search and Data Mining. 2017. DOI: 10.1145/3018661.3018738
  2. Veldt N, Wirth A, Gleich DF. Correlation clustering with low-rank matrices. 26th International Conference on World Wide Web (WWW). 2017. DOI: 10.1145/3038912.3052586
  3. Fray KS, Morgan KJ, Wirth A, Zobel J. Practical adaptive search trees with performance bounds. ACM International Conference Proceeding Series. 2017, Vol. Part F126226. DOI: 10.1145/3014812.3014836
  4. McClintock J, Mestre J, Wirth A. Precedence-constrained min sum set cover. Leibniz International Proceedings in Informatics, LIPIcs. 2017, Vol. 92. DOI: 10.4230/LIPIcs.ISAAC.2017.55
  5. Liao K, Petri M, Moffat A, Wirth A. Effective construction of relative lempel-ziv dictionaries. 25th International Conference on World Wide Web (WWW). 2016. DOI: 10.1145/2872427.2883042
  6. McClintock J, Wirth A. Efficient Parallel Algorithms for k-Center Clustering. 45th International Conference on Parallel Processing (ICPP). CRC Press. 2016, Vol. 2016-September. DOI: 10.1109/ICPP.2016.22
  7. Chakrabarti A, Wirth A. Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM Publications. 2016. Editors: Krauthgamer R. DOI: 10.1137/1.9781611974331.ch94
  8. Charikar M, Naamad Y, Wirth A. On approximating target set selection. Leibniz International Proceedings in Informatics, LIPIcs. 2016, Vol. 60. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.4
  9. Petri M, Moffat A, Nagesh PC, Wirth A. Access Time Tradeoffs in Archive Compression. 11th Asia Information Retrieval Societies Conference (AIRS). Springer Verlag. 2015, Vol. 9460. Editors: Zuccon G, Geva S, Joho H, Scholer F, Sun A, Zhang P. DOI: 10.1007/978-3-319-28940-3_2
  10. Ahn KJ, Cormode G, Guha S, McGregor A, Wirth A. Correlation clustering in data streams. 32nd International Conference on Machine Learning (ICML). 2015, Vol. 3.
  11. Tong J, Wirth A, Zobel J. Blended dictionaries for reduced-memory lempel-ziv corpus compression. ACM International Conference Proceeding Series. 2014, Vol. 27-28-November-2014. DOI: 10.1145/2682862.2682866
  12. Tong J, Wirth A, Zobel J. Compact auxiliary dictionaries for incremental compression of large repositories. CIKM 2014 - Proceedings of the 2014 ACM International Conference on Information and Knowledge Management. 2014. DOI: 10.1145/2661829.2661961
  13. Petri M, Moffat A, Wirth A. Graph representations and applications of citation networks. ACM International Conference Proceeding Series. 2014, Vol. 27-28-November-2014. DOI: 10.1145/2682862.2682865
  14. Gog S, Moffat A, Culpepper JS, Turpin A, Wirth A. Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Transactions on Knowledge and Data Engineering. IEEE Computer Society. 2014, Vol. 26, Issue 8. DOI: 10.1109/TKDE.2013.129
  15. Lim C, Moffat A, Wirth A. Lazy and Eager Approaches for the Set Cover Problem. Proceedings of the Thirty-Seventh Australasian Computer Science Conference. Australian Computer Society. 2014, Vol. 147.

View a full list of publications on the University of Melbourne’s ‘Find An Expert’ profile