Rate My Professor Tony Wirth

University of Melbourne

#1,322 worldwide#1,223 in Australia

Algorithms Data Mining Bioinformatics

4.6

5 reviews · out of 5

Rate Tony

Is this you? Claim this profile

Ratings & reviews

5.08/20/2025

Encourages students to think creatively.

4.05/21/2025

Always approachable and easy to talk to.

5.03/31/2025

Encourages students to think critically.

4.02/27/2025

Creates a positive and motivating atmosphere.

5.02/4/2025

Great Professor!

Taught by or worked with Tony?

Add your rating. It takes about 30 seconds.

About Tony

Prof. Tony Wirth is Professor in the School of Computing and Information Systems within the Faculty of Engineering and Information Technology at The University of Melbourne, where he currently serves as an Honorary Professorial Fellow. 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 at The University of Melbourne.

Wirth's research specializations include data mining, approximation and graph algorithms, and bioinformatics. He has a significant publication record in these areas, among others. Key publications include: "Lower bounds for approximate (& exact) k-DISJOINT-SHORTEST-PATHS" by R. Chitnis, S. Thomas, and A. Wirth (Theoretical Computer Science, 2026); "O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN" by J. Gan, A. Wirth, and Z. Zhang (Leibniz International Proceedings in Informatics (LIPIcs), 2025); "Online Computation of String Net Frequency" by P. Guo, S.W. Umboh, A. Wirth, and J. Zobel (Lecture Notes in Computer Science, 2025); "Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths" by R. Chitnis, S. Thomas, and A. Wirth (Lecture Notes in Computer Science, 2025); "Preface" by J. Mestre and A. Wirth (Leibniz International Proceedings in Informatics (LIPIcs), 2024); "Optimal Dynamic Parameterized Subset Sampling" by J. Gan, S.W. Umboh, H. Wang, A. Wirth, and Z. Zhang (Proceedings of the ACM on Management of Data, 2024); "Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound" by P. Cervenjak, J. Gan, S.W. Umboh, and A. Wirth (Leibniz International Proceedings in Informatics (LIPIcs), 2024); "Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams" by A. Chakrabarti, A. McGregor, and A. Wirth (Leibniz International Proceedings in Informatics (LIPIcs), 2024); "Single Round-trip Hierarchical ORAM via Succinct Indices" by W. Holland, O. Ohrimenko, and A. Wirth (ACM AsiaCCS 2024 Proceedings, 2024); and "Exploiting New Properties of String Net Frequency for Efficient Computation" by P. Guo, P. Eades, A. Wirth, and J. Zobel (Leibniz International Proceedings in Informatics (LIPIcs), 2024). Wirth has refereed for numerous international journals and served on several conference program committees. His teaching has been commended both at the department and school level.