Anthony Wirth
Anthony Wirth
Professor, School of Computing and Information Systems, The University of Melbourne
Verified email at
Cited by
Cited by
Clustering with qualitative information
M Charikar, V Guruswami, A Wirth
Journal of Computer and System Sciences 71 (3), 360-383, 2005
Informational complexity and the direct sum problem for simultaneous message complexity
A Chakrabarti, Y Shi, A Wirth, A Yao
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on …, 2001
Maximizing quadratic programs: extending Grothendieck's inequality
M Charikar, A Wirth
Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE …, 2004
Analyzing shared and team mental models
J Langan-Fox, A Wirth, S Code, K Langfield-Smith, A Wirth
International Journal of Industrial Ergonomics 28 (2), 99-112, 2001
Automatic generation of protein structure cartoons with Pro-origami
A Stivala, M Wybrow, A Wirth, JC Whisstock, PJ Stuckey
Bioinformatics 27 (23), 3315-3316, 2011
Set cover algorithms for very large datasets
G Cormode, H Karloff, A Wirth
Proceedings of the 19th ACM international conference on Information and …, 2010
Phat—a gene finding program for Plasmodium falciparum
SE Cawley, AI Wirth, TP Speed
Molecular and biochemical parasitology 118 (2), 167-174, 2001
Structure-based statistical features and multivariate time series clustering
X Wang, A Wirth, L Wang
Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on, 351-360, 2007
Spectral clustering with inconsistent advice
T Coleman, J Saunderson, A Wirth
Proceedings of the 25th international conference on Machine learning, 152-159, 2008
Lock-free parallel dynamic programming
A Stivala, PJ Stuckey, M Garcia de la Banda, M Hermenegildo, A Wirth
Journal of Parallel and Distributed Computing 70 (8), 839-848, 2010
Correlation Clustering in Data Streams
KJ Ahn, G Cormode, S Guha, A McGregor, A Wirth
Proceedings of The 32nd International Conference on Machine Learning, 2237-2246, 2015
Fast and accurate protein substructure searching with simulated annealing and GPUs
A Stivala, P Stuckey, A Wirth
BMC bioinformatics 11 (1), 446, 2010
A local-search 2-approximation for 2-correlation-clustering
T Coleman, J Saunderson, A Wirth
European Symposium on Algorithms, 308-319, 2008
Are approximation algorithms for consensus clustering worthwhile?
M Bertolacci, A Wirth
Proceedings of the 2007 SIAM International Conference on Data Mining, 437-442, 2007
A Correlation Clustering Framework for Community Detection
N Veldt, DF Gleich, A Wirth
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 439-448, 2018
Can we do without ranks in Burrows Wheeler transform compression?
AI Wirth, A Moffat
Data Compression Conference, 2001. Proceedings. DCC 2001., 419-428, 2001
Incidence geometries and the pass complexity of semi-streaming set cover
A Chakrabarti, A Wirth
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
Ranking tournaments: Local search and a new algorithm
T Coleman, A Wirth
Journal of Experimental Algorithmics (JEA) 14, 6, 2009
Large-scale pattern search using reduced-space on-disk suffix arrays
S Gog, A Moffat, JS Culpepper, A Turpin, A Wirth
IEEE Transactions on Knowledge and Data Engineering 26 (8), 1918-1931, 2014
Engineering burstsort: Toward fast in-place string sorting
R Sinha, A Wirth
Journal of Experimental Algorithmics (JEA) 15, 2.5, 2010
The system can't perform the operation now. Try again later.
Articles 1–20