Anthony Wirth

University of Sydney — Australia

Computer Science · Physical Sciences

19h-index2.1kcitations119works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(28), Algorithms and Data Compression(22), Advanced Clustering Algorithms Research(19), Complex Network Analysis Techniques(17), Optimization and Search Problems(16)

Publications119 total

Fast and accurate protein substructure searching with simulated annealing and GPUs
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Fast and accurate protein substructure searching with simulated annealing and GPUs
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Tableau-based protein substructure search using quadratic programming
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Tableau-based protein substructure search using quadratic programming
Zenodo (CERN European Organization for Nuclear Research)·2025Open Access
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
Lecture notes in computer science·2025· 1 cited
$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
arXiv (Cornell University)·2025Open Access
Optimal Dynamic Parameterized Subset Sampling
Proceedings of the ACM on Management of Data·2024· 2 citedOpen Access
Optimal Dynamic Parameterized Subset Sampling
arXiv (Cornell University)·2024Open Access
Online Computation of String Net Frequency
Lecture notes in computer science·2024
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
arXiv (Cornell University)·2024· 1 citedOpen Access
Online Computation of String Net Frequency
arXiv (Cornell University)·2024Open Access
Single Round-trip Hierarchical ORAM via Succinct Indices
2024Open Access
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
arXiv (Cornell University)·2024Open Access
Exploiting New Properties of String Net Frequency for Efficient Computation
arXiv (Cornell University)·2024· 1 citedOpen Access
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
arXiv (Cornell University)·2024Open Access
Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
arXiv (Cornell University)·2023Open Access
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
arXiv (Cornell University)·2023Open Access
Table of Contents
2023Open Access
‘Emerging proxies’ in information-rich machine learning: a threat to fairness?
2023· 3 cited
Tight Data Access Bounds for Private Top-$k$ Selection
arXiv (Cornell University)·2023Open Access
page 1 of 6Next →

Frequent Co-authors

Nate Veldt(8), David F. Gleich(8), Moses Charikar(5), Alistair Moffat(5), Alex Stivala(4), Peter J. Stuckey(4), Tom Coleman(4), James Saunderson(4), Justin Zobel(4), Venkatesan Guruswami(2), Janice Langan‐Fox(2), Sharon Code(2), Kim Langfield‐Smith(2), Andrew Wirth(2), Graham Cormode(2), Xiaozhe Wang(2), Liang Wang(2), Andrew Turpin(2), Kewen Liao(2), Matthias Petri(2)