Prof Tony Wirth
Honorary Professorial Fellow
Faculty of Engineering and Information Technology
97 Scholarly works
14 Projects
HIGHLIGHTS
2026
Conference Proceedings
A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
DOI: 10.65109/IPZQ73202026
Journal article
Lower bounds for approximate (& exact) k-DISJOINT-SHORTEST-PATHS
DOI: 10.1016/j.tcs.2026.1158422020
Research Contracts
Exploring the Ethical Implications of AI Bias as a Result of Workforce Gender Imbalance
2019
Research grants (ARC, NHMRC, MRFF)
Approximate Structures for Efficient Processing of Data Streams
2017
Conference Proceedings
A cost model for long-term compressed data retention
DOI: 10.1145/3018661.30187382016
Conference Proceedings
Effective Construction of Relative Lempel-Ziv Dictionaries
DOI: 10.1145/2872427.28830422014
Journal article
Large-scale pattern search using reduced-space on-disk suffix arrays
DOI: 10.1109/TKDE.2013.129
RECENT SCHOLARLY WORKS
2025
Conference Proceedings
O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN
DOI: 10.4230/LIPIcs.ICDT.2025.72025
Conference Proceedings
Online Computation of String Net Frequency
DOI: 10.1007/978-3-031-72200-4_122025
Conference Proceedings
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
DOI: 10.1007/978-3-031-81396-2_42024
Journal article
Preface
DOI: 10.4230/LIPIcs.ISAAC.2024.02024
Journal article
Optimal Dynamic Parameterized Subset Sampling
DOI: 10.1145/36958272024
Conference Proceedings
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2024.252024
Conference Proceedings
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
DOI: 10.4230/LIPIcs.ESA.2024.402024
Conference Proceedings
Single Round-trip Hierarchical ORAM via Succinct Indices
DOI: 10.1145/3634737.3656290