# Anthony Wirth

According to our database

Collaborative distances :

^{1}, Anthony Wirth authored at least 60 papers between 2001 and 2018.Collaborative distances :

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

A Projection Method for Metric-Constrained Optimization.

CoRR, 2018

A Correlation Clustering Framework for Community Detection.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017

Correlation Clustering.

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering.

CoRR, 2017

Correlation Clustering with Low-Rank Matrices.

Proceedings of the 26th International Conference on World Wide Web, 2017

A Cost Model for Long-Term Compressed Data Retention.

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Precedence-Constrained Min Sum Set Cover.

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Practical adaptive search trees with performance bounds.

Proceedings of the Australasian Computer Science Week Multiconference, 2017

2016

Correlation Clustering with Low-Rank Matrices.

CoRR, 2016

Access Time Tradeoffs in Archive Compression.

CoRR, 2016

Efficient Parallel Algorithms for k-Center Clustering.

CoRR, 2016

Effective Construction of Relative Lempel-Ziv Dictionaries.

Proceedings of the 25th International Conference on World Wide Web, 2016

Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Efficient Parallel Algorithms for k-Center Clustering.

Proceedings of the 45th International Conference on Parallel Processing, 2016

On Approximating Target Set Selection.

Proceedings of the Approximation, 2016

2015

Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover.

Electronic Colloquium on Computational Complexity (ECCC), 2015

Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover.

CoRR, 2015

Correlation Clustering in Data Streams.

Proceedings of the 32nd International Conference on Machine Learning, 2015

Access Time Tradeoffs in Archive Compression.

Proceedings of the Information Retrieval Technology, 2015

2014

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays.

IEEE Trans. Knowl. Data Eng., 2014

Principled dictionary pruning for low-memory corpus compression.

Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

Compact Auxiliary Dictionaries for Incremental Compression of Large Repositories.

Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Using Inter-file Similarity to Improve Intra-file Compression.

Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Storing a Collection of Differentially Compressed Files Recursively.

Proceedings of the 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, June 27, 2014

Scalability in Recursively Stored Delta Compressed Collections of Files.

Proceedings of the Second Australasian Web Conference, 2014

Blended Dictionaries for Reduced-Memory Lempel-Ziv Corpus Compression.

Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Graph Representations and Applications of Citation Networks.

Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Lazy and Eager Approaches for the Set Cover Problem.

Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays

CoRR, 2013

Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs.

Proceedings of the Theory and Applications of Models of Computation, 2013

2012

A theoretical approach to gene network identification.

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Identification of binary gene networks.

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Automatic generation of protein structure cartoons with Pro-origami.

Bioinformatics, 2011

The query complexity of estimating weighted averages.

Acta Inf., 2011

On Optimal Arrangements of Binary Sensors.

Proceedings of the Spatial Information Theory - 10th International Conference, 2011

Collection-based compression using discovered long matching strings.

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Correlation Clustering.

Proceedings of the Encyclopedia of Machine Learning, 2010

Lock-free parallel dynamic programming.

J. Parallel Distrib. Comput., 2010

Engineering burstsort: Toward fast in-place string sorting.

ACM Journal of Experimental Algorithmics, 2010

Fast and accurate protein substructure searching with simulated annealing and GPUs.

BMC Bioinformatics, 2010

A Polynomial Time Approximation Scheme for k-Consensus Clustering.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Set cover algorithms for very large datasets.

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

Improved consensus clustering via linear programming.

Proceedings of the Computer Science 2010, 2010

2009

Ranking tournaments: Local search and a new algorithm.

ACM Journal of Experimental Algorithmics, 2009

Tableau-based protein substructure search using quadratic programming.

BMC Bioinformatics, 2009

2008

Engineering Burstsort: Towards Fast In-Place String Sorting.

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Spectral clustering with inconsistent advice.

Proceedings of the Machine Learning, 2008

A Local-Search 2-Approximation for 2-Correlation-Clustering.

Proceedings of the Algorithms, 2008

Pattern discovery in motion time series via structure-based spectral clustering.

Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008

Ranking Tournaments: Local Search and a New Algorithm.

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

Are approximation algorithms for consensus clustering worthwhile?.

Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

Structure-Based Statistical Features and Multivariate Time Series Clustering.

Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006

Asymmetry in

*k*-center variants.
Theor. Comput. Sci., 2006

New algorithms research for first year students.

Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

2005

Clustering with qualitative information.

J. Comput. Syst. Sci., 2005

2004

Maximizing Quadratic Programs: Extending Grothendieck's Inequality.

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Asymmetry in k-Center Variants.

Proceedings of the Approximation, 2003

Clustering with Qualitative Information.

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2001

Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Can We Do without Ranks in Burrows Wheeler Transform Compression?

Proceedings of the Data Compression Conference, 2001