Subject area for

Authored Research Books

Computer Software Products

Conference Papers Refereed
 A LocalSearch 2Approximation for 2CorrelationClustering
 AlgorithmicParameter Optimization of a Parallelized SplitStep Fourier Transform Using a Modified BSP Cost Model
 Algorithms for Reliable Navigation and Wayfinding
 An Analysis of the Effects of Population Structure on Scalable Multiobjective Optimization Problems
 An implementation of the Message Passing Interface over an Adaptive PeertoPeer Network
 Are approximation algorithms for consensus clustering worthwhile?
 Asymmetry in kCenter Variants
 Boolean approximation revisited
 CacheConscious Sorting of Large Sets of Strings with Dynamic Tries
 Clustering with Qualitative Information
 Competition, cooperation and collective behaviour: resource utilization in nonstationary environments
 Continuous Intersection Joins Over Moving Objects
 Efficient Triebased Sorting of Large Sets of Strings
 Engineering Burstsort: Towards Fast InPlace String Sorting
 Enhanced WordBased BlockSorting Text Compression
 Fast Learning of Optimal Connections in a PeertoPeer Network
 Hybrid Prefix Codes for Practical Use
 Incorporating Fault Tolerance with Replication on Very Large Scale Grids
 Incremental Calculation of MinimumRedundancy LengthRestricted Codes
 Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
 Maximizing quadratic programs: extending Grothendieck’s inequality
 Mining Classification Rules Using Evolutionary Multiobjective Algorithms
 MultiSpace Distributed Hash Tables for Multiple Transport Domains
 Multiobjective Evolutionary Algorithms on Complex Networks
 Multiple SelfSplitting and Merging Competitive Learning Algorithm
 New algorithms research for first year students
 On Performance Metrics and Particle Swarm Methods for Dynamic Multiobjective Optimization Problems
 Ranking Tournaments: Local Search and a New Algorithm
 Selforganizing virtual networks of high performance for wavelength routing
 Spectral Clustering with Inconsistent Advice
 Using Random Sampling to Build Approximate Tries for Efficient String Sorting
 Visual Representation for Recursive Algorithms

Conference Papers Unrefereed

Grant
 "Fast, practical and effective algorithms for clustering with advice"
 ANALYZING ALGORITHUMS FOR CLUSTERING WITH ADVICE  MELBOURNE EARLY CAREER RESEARCHER GRANT SCHEME 2006
 Adapting the bulk synchronous parallel processing model to peertopeer networked computing
 Algorithms and computation in fourdimensional topology
 Dynamics of eigenvalue/eigenspace algorithms with applications to signal processing
 Efficient Algorithms for Inmemory Sorting, Searching and Indexing on Modern Multicore Cachebased and Graphics Processor Architectures
 Efficient Synchronisation of Large Repositories
 Evolutionary multiobjective algorithms for Global Grids
 Quantum decoherence: a gametheoretic perspective
 Sequence data analysis
 The timevarying eigenvalue problem with application to signal processing and control

Journal Articles Refereed
 A new family of extremal interconnection networks
 Asymmetry in kCenter Variants
 Cacheconscious Sorting of Large Sets of Strings with Dynamic Tries
 Cacheefficient string sorting using copying
 Clustering with Qualitative Information
 Incremental Calculation of MinimumRedundancy LengthRestricted Codes
 Ontologydriven map generalization
 Using Random Sampling to Build Approximate Tries for Efficient String Sorting
 Using fundamental electrical theory for varying time quantum uniprocessor scheduling

Major Reference Works

Research Book Chapters