default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Wirth
Anthony Ian Wirth – Tony Wirth
Person information
- affiliation: University of Sydney, School of Computer Science, Australia
- affiliation (former): University of Melbourne, School of Computing and Information Systems, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j13]Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth, Zhuo Zhang:
Optimal Dynamic Parameterized Subset Sampling. Proc. ACM Manag. Data 2(5): 209:1-209:26 (2024)- [c63]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. APPROX/RANDOM 2024: 25:1-25:23 - [c62]William L. Holland
, Olga Ohrimenko, Anthony Wirth:
Single Round-trip Hierarchical ORAM via Succinct Indices. AsiaCCS 2024 - [c61]Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel:
Exploiting New Properties of String Net Frequency for Efficient Computation. CPM 2024: 16:1-16:16 - [c60]Amit Chakrabarti, Andrew McGregor, Anthony Wirth:
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams. ESA 2024: 40:1-40:15 - [c59]Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel:
Online Computation of String Net Frequency. SPIRE 2024: 159-173 - [e2]Julián Mestre, Anthony Wirth:
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. LIPIcs 322, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-354-6 [contents] - [i27]Amit Chakrabarti, Andrew McGregor, Anthony Wirth:
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams. CoRR abs/2403.14087 (2024) - [i26]Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel:
Exploiting New Properties of String Net Frequency for Efficient Computation. CoRR abs/2404.12701 (2024) - [i25]Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth:
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. CoRR abs/2407.09368 (2024) - [i24]Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel:
Online Computation of String Net Frequency. CoRR abs/2408.00308 (2024) - [i23]Rajesh Chitnis, Samuel Thomas, Anthony Wirth:
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. CoRR abs/2408.03933 (2024) - 2023
- [c58]Rowan Warneke, Farhana Murtaza Choudhury, Anthony Wirth:
Maximum Coverage in Random-Arrival Streams. ESA 2023: 102:1-102:15 - [c57]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Tight Data Access Bounds for Private Top-k Selection. ICML 2023: 37635-37655 - [c56]Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth:
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. WADS 2023: 247-261 - [c55]Philip Cervenjak, Junhao Gan, Anthony Wirth:
Fast Parallel Algorithms for Submodular p-Superseparable Maximization. WAOA 2023: 219-233 - [c54]Stephen Jaud, Anthony Wirth, Farhana Murtaza Choudhury:
Maximum Coverage in Sublinear Space, Faster. SEA 2023: 21:1-21:20 - [i22]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Tight Data Access Bounds for Private Top-$k$ Selection. CoRR abs/2301.13347 (2023) - [i21]Stephen Jaud, Anthony Wirth, Farhana Murtaza Choudhury:
Maximum Coverage in Sublinear Space, Faster. CoRR abs/2302.06137 (2023) - [i20]Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth:
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. CoRR abs/2305.16815 (2023) - [i19]Philip Cervenjak, Junhao Gan, Anthony Wirth:
Fast Parallel Algorithms for Submodular p-Superseparable Maximization. CoRR abs/2311.13123 (2023) - 2022
- [c53]Hao Wu, Anthony Wirth:
Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches. AISTATS 2022: 7766-7798 - [c52]William L. Holland, Olga Ohrimenko, Anthony Wirth:
Efficient Oblivious Permutation via the Waksman Network. AsiaCCS 2022: 771-783 - [c51]Patrick Eades, Anthony Wirth, Justin Zobel:
Immediate Text Search on Streams Using Apoptosic Indexes. ECIR (1) 2022: 157-169 - [c50]Sheilla Njoto, Marc Cheong, Reeva Lederman, Aidan McLoughney, Leah Ruppanner, Anthony Wirth:
Gender Bias in AI Recruitment Systems: A Sociological-and Data Science-based Case Study. ISTAS 2022: 1-7 - [c49]Olga Ohrimenko, Anthony Wirth, Hao Wu:
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. PODS 2022: 237-249 - [c48]Junhao Gan, Anthony Wirth, Xin Zhang:
An Almost Optimal Algorithm for Unbounded Search with Noisy Information. SWAT 2022: 25:1-25:15 - [i18]Hao Wu, Olga Ohrimenko, Anthony Wirth:
Walking to Hide: Privacy Amplification via Random Message Exchanges in Network. CoRR abs/2206.09519 (2022) - [i17]William L. Holland, Olga Ohrimenko, Anthony Wirth:
Single Round-trip Hierarchical ORAM via Succinct Indices. CoRR abs/2208.07489 (2022) - 2021
- [j12]Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth:
Correlation Clustering in Data Streams. Algorithmica 83(7): 1980-2017 (2021) - [c47]Boyu Ruan, Junhao Gan, Hao Wu, Anthony Wirth:
Dynamic Structural Clustering on Graphs. SIGMOD Conference 2021: 1491-1503 - [i16]Hao Wu, Anthony Wirth:
Locally Differentially Private Frequency Estimation. CoRR abs/2106.07815 (2021) - [i15]Boyu Ruan, Junhao Gan, Hao Wu, Anthony Wirth:
Dynamic Structural Clustering on Graphs. CoRR abs/2108.11549 (2021) - [i14]Olga Ohrimenko, Anthony Wirth, Hao Wu:
Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data. CoRR abs/2112.12279 (2021) - 2020
- [c46]William L. Holland, Anthony Wirth, Justin Zobel:
Recency Queries with Succinct Representation. ISAAC 2020: 49:1-49:14 - [c45]Nate Veldt, Anthony Wirth, David F. Gleich:
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. KDD 2020: 1868-1876 - [c44]Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang:
Graph Clustering in All Parameter Regimes. MFCS 2020: 39:1-39:15 - [i13]Nate Veldt, Anthony Wirth, David F. Gleich:
Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs. CoRR abs/2002.09460 (2020)
2010 – 2019
- 2019
- [j11]Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson:
Metric-Constrained Optimization for Graph Clustering Algorithms. SIAM J. Math. Data Sci. 1(2): 333-355 (2019) - [c43]Narthana S. Epa, Junhao Gan, Anthony Wirth:
Result-Sensitive Binary Search with Noisy Information. ISAAC 2019: 60:1-60:15 - [c42]Nate Veldt, David F. Gleich, Anthony Wirth:
Learning Resolution Parameters for Graph Clustering. WWW 2019: 1909-1919 - [i12]Nate Veldt, David F. Gleich, Anthony Wirth:
Learning Resolution Parameters for Graph Clustering. CoRR abs/1903.05246 (2019) - [i11]Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang:
Graph Clustering in All Parameter Regimes. CoRR abs/1910.06435 (2019) - 2018
- [c41]David F. Gleich, Nate Veldt, Anthony Wirth:
Correlation Clustering Generalized. ISAAC 2018: 44:1-44:13 - [c40]Nate Veldt, David F. Gleich, Anthony Wirth:
A Correlation Clustering Framework for Community Detection. WWW 2018: 439-448 - [i10]Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson:
A Projection Method for Metric-Constrained Optimization. CoRR abs/1806.01678 (2018) - [i9]David F. Gleich, Nate Veldt, Anthony Wirth:
Correlation Clustering Generalized. CoRR abs/1809.09493 (2018) - [i8]Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth:
Correlation Clustering in Data Streams. CoRR abs/1812.02023 (2018) - 2017
- [c39]Kevin Fray, Kerri Morgan, Anthony Wirth, Justin Zobel:
Practical adaptive search trees with performance bounds. ACSW 2017: 23:1-23:8 - [c38]Jessica McClintock, Julián Mestre, Anthony Wirth:
Precedence-Constrained Min Sum Set Cover. ISAAC 2017: 55:1-55:12 - [c37]Kewen Liao, Alistair Moffat, Matthias Petri, Anthony Wirth:
A Cost Model for Long-Term Compressed Data Retention. WSDM 2017: 241-249 - [c36]Nate Veldt, Anthony Ian Wirth, David F. Gleich:
Correlation Clustering with Low-Rank Matrices. WWW 2017: 1025-1034 - [r2]Anthony Wirth:
Correlation Clustering. Encyclopedia of Machine Learning and Data Mining 2017: 280-284 - [i7]Nate Veldt, David F. Gleich, Anthony Wirth:
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering. CoRR abs/1712.05825 (2017) - 2016
- [c35]Moses Charikar, Yonatan Naamad, Anthony Wirth:
On Approximating Target Set Selection. APPROX-RANDOM 2016: 4:1-4:16 - [c34]Jessica McClintock, Anthony Wirth:
Efficient Parallel Algorithms for k-Center Clustering. ICPP 2016: 133-138 - [c33]Amit Chakrabarti, Anthony Wirth:
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. SODA 2016: 1365-1373 - [c32]Kewen Liao, Matthias Petri, Alistair Moffat, Anthony Wirth:
Effective Construction of Relative Lempel-Ziv Dictionaries. WWW 2016: 807-816 - [i6]Matthias Petri, Alistair Moffat, P. C. Nagesh, Anthony Wirth:
Access Time Tradeoffs in Archive Compression. CoRR abs/1602.08829 (2016) - [i5]Jessica McClintock, Anthony Wirth:
Efficient Parallel Algorithms for k-Center Clustering. CoRR abs/1604.03228 (2016) - [i4]Nate Veldt, Anthony Wirth, David F. Gleich:
Correlation Clustering with Low-Rank Matrices. CoRR abs/1611.07305 (2016) - 2015
- [c31]Matthias Petri, Alistair Moffat, P. C. Nagesh, Anthony Wirth:
Access Time Tradeoffs in Archive Compression. AIRS 2015: 15-28 - [c30]Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, Anthony Wirth:
Correlation Clustering in Data Streams. ICML 2015: 2237-2246 - [i3]Amit Chakrabarti, Anthony Wirth:
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. CoRR abs/1507.04645 (2015) - [i2]Amit Chakrabarti, Anthony Wirth:
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j10]Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth:
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Trans. Knowl. Data Eng. 26(8): 1918-1931 (2014) - [c29]C. L. Lim, Alistair Moffat, Anthony Ian Wirth:
Lazy and Eager Approaches for the Set Cover Problem. ACSC 2014: 19-27 - [c28]Matthias Petri, Alistair Moffat, Anthony Wirth:
Graph Representations and Applications of Citation Networks. ADCS 2014: 18 - [c27]Jiancong Tong, Anthony Wirth, Justin Zobel:
Blended Dictionaries for Reduced-Memory Lempel-Ziv Corpus Compression. ADCS 2014: 113 - [c26]Angelos Molfetas, Anthony Wirth, Justin Zobel:
Scalability in Recursively Stored Delta Compressed Collections of Files. AWC 2014: 21-30 - [c25]Angelos Molfetas, Anthony Wirth, Justin Zobel:
Storing a Collection of Differentially Compressed Files Recursively. BigData Congress 2014: 88-95 - [c24]Angelos Molfetas, Anthony Wirth, Justin Zobel:
Using Inter-file Similarity to Improve Intra-file Compression. BigData Congress 2014: 192-199 - [c23]Jiancong Tong, Anthony Wirth, Justin Zobel:
Compact Auxiliary Dictionaries for Incremental Compression of Large Repositories. CIKM 2014: 1629-1638 - [c22]Jiancong Tong, Anthony Wirth, Justin Zobel:
Principled dictionary pruning for low-memory corpus compression. SIGIR 2014: 283-292 - 2013
- [c21]Andrew Chester, Riccardo Dondi, Anthony Wirth:
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs. TAMC 2013: 260-271 - [e1]Anthony Wirth:
Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, Adelaide, Australia, February 2013. CRPIT 141, Australian Computer Society 2013, ISBN 978-1-921770-26-5 [contents] - [i1]Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth:
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. CoRR abs/1303.6481 (2013) - 2012
- [c20]Jean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong:
Identification of binary gene networks. Allerton Conference 2012: 1467-1474 - [c19]Jean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong:
A theoretical approach to gene network identification. ITW 2012: 432-436 - 2011
- [j9]Amit Chakrabarti, Venkatesan Guruswami, Andrew Wirth, Anthony Wirth:
The query complexity of estimating weighted averages. Acta Informatica 48(7-8): 417-426 (2011) - [j8]Alex D. Stivala, Michael Wybrow, Anthony Wirth, James C. Whisstock, Peter J. Stuckey:
Automatic generation of protein structure cartoons with Pro-origami. Bioinform. 27(23): 3315-3316 (2011) - [c18]Andrew Peel, Anthony Wirth, Justin Zobel:
Collection-based compression using discovered long matching strings. CIKM 2011: 2361-2364 - [c17]Parvin Asadzadeh, Lars Kulik, Egemen Tanin, Anthony Wirth:
On Optimal Arrangements of Binary Sensors. COSIT 2011: 168-187 - 2010
- [j7]Alex D. Stivala, Peter J. Stuckey, Anthony Wirth:
Fast and accurate protein substructure searching with simulated annealing and GPUs. BMC Bioinform. 11: 446 (2010) - [j6]Ranjan Sinha, Anthony Wirth:
Engineering burstsort: Toward fast in-place string sorting. ACM J. Exp. Algorithmics 15 (2010) - [j5]Alex D. Stivala, Peter J. Stuckey, Maria Garcia de la Banda, Manuel V. Hermenegildo, Anthony Wirth:
Lock-free parallel dynamic programming. J. Parallel Distributed Comput. 70(8): 839-848 (2010) - [c16]Nicholas Downing, Peter J. Stuckey, Anthony Wirth:
Improved consensus clustering via linear programming. ACSC 2010: 61-70 - [c15]Graham Cormode, Howard J. Karloff, Anthony Wirth:
Set cover algorithms for very large datasets. CIKM 2010: 479-488 - [c14]Tom Coleman, Anthony Wirth:
A Polynomial Time Approximation Scheme for k-Consensus Clustering. SODA 2010: 729-740 - [r1]Anthony Wirth:
Correlation Clustering. Encyclopedia of Machine Learning 2010: 227-231
2000 – 2009
- 2009
- [j4]Alex D. Stivala, Anthony Wirth, Peter J. Stuckey:
Tableau-based protein substructure search using quadratic programming. BMC Bioinform. 10 (2009) - [j3]Tom Coleman, Anthony Wirth:
Ranking tournaments: Local search and a new algorithm. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [c13]Tom Coleman, Anthony Wirth:
Ranking Tournaments: Local Search and a New Algorithm. ALENEX 2008: 133-141 - [c12]Xiaozhe Wang, Liang Wang, Anthony Wirth:
Pattern discovery in motion time series via structure-based spectral clustering. CVPR 2008 - [c11]Tom Coleman, James Saunderson, Anthony Wirth:
A Local-Search 2-Approximation for 2-Correlation-Clustering. ESA 2008: 308-319 - [c10]Tom Coleman, James Saunderson, Anthony Wirth:
Spectral clustering with inconsistent advice. ICML 2008: 152-159 - [c9]Ranjan Sinha, Anthony Wirth:
Engineering Burstsort: Towards Fast In-Place String Sorting. WEA 2008: 14-27 - 2007
- [c8]Xiaozhe Wang, Anthony Wirth, Liang Wang:
Structure-Based Statistical Features and Multivariate Time Series Clustering. ICDM 2007: 351-360 - [c7]Michael Bertolacci, Anthony Wirth:
Are approximation algorithms for consensus clustering worthwhile?. SDM 2007: 437-442 - 2006
- [j2]Inge Li Gørtz, Anthony Wirth:
Asymmetry in k-center variants. Theor. Comput. Sci. 361(2-3): 188-199 (2006) - [c6]Anthony Wirth, Michael Bertolacci:
New algorithms research for first year students. ITiCSE 2006: 128-132 - 2005
- [j1]Moses Charikar, Venkatesan Guruswami, Anthony Wirth:
Clustering with qualitative information. J. Comput. Syst. Sci. 71(3): 360-383 (2005) - 2004
- [c5]Moses Charikar, Anthony Wirth:
Maximizing Quadratic Programs: Extending Grothendieck's Inequality. FOCS 2004: 54-60 - 2003
- [c4]Moses Charikar, Venkatesan Guruswami, Anthony Wirth:
Clustering with Qualitative Information. FOCS 2003: 524-533 - [c3]Inge Li Gørtz, Anthony Wirth:
Asymmetry in k-Center Variants. RANDOM-APPROX 2003: 59-70 - 2001
- [c2]Anthony Ian Wirth, Alistair Moffat:
Can We Do without Ranks in Burrows Wheeler Transform Compression? Data Compression Conference 2001: 419-428 - [c1]Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao:
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. FOCS 2001: 270-278
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-09 23:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
