Exploiting dynamic information in mobile networks. Mobile and wireless networks are ideal for Australia as they provide both low set-up costs and environmentally robust infrastructures. Exploiting mobility to enhance efficiency and cost will place Australia at the forefront of research in mobile networking and will contribute to the worldwide effort towards sustainability and survivability.
Local computations in dynamic networks. This project aims to identify and exploit dynamic networks, and investigate how locally available knowledge affects the computability or the communication complexity of solving a problem. Mobile, wireless, social and other ubiquitous communication networks involve autonomous and highly dynamic entities, but these are often treated as a liability instead of an asset, even when they enhance the network. Local knowledge in the entities’ neighbourhood can make ....Local computations in dynamic networks. This project aims to identify and exploit dynamic networks, and investigate how locally available knowledge affects the computability or the communication complexity of solving a problem. Mobile, wireless, social and other ubiquitous communication networks involve autonomous and highly dynamic entities, but these are often treated as a liability instead of an asset, even when they enhance the network. Local knowledge in the entities’ neighbourhood can make the network more efficient. This project is expected to contribute to the worldwide effort towards advanced technologies and place Australia at the forefront of research in mobile and social networking.Read moreRead less
Local reoptimization for turbocharging heuristics. Theoretical computer science has up until now had little impact on the design of effective heuristics. While data sets may be large, significant structure is almost always present and important to take into account when designing algorithms. Parameterised complexity considers the underlying structure by parameterising not only on the size of the input but also on structural parameters. This project aims to take advantage of the many opportunitie ....Local reoptimization for turbocharging heuristics. Theoretical computer science has up until now had little impact on the design of effective heuristics. While data sets may be large, significant structure is almost always present and important to take into account when designing algorithms. Parameterised complexity considers the underlying structure by parameterising not only on the size of the input but also on structural parameters. This project aims to take advantage of the many opportunities for new theories in the design of new heuristics and in turbocharging existing heuristics for computationally hard problems.Read moreRead less
Verification and analysis of quantum programs. This project aims to develop theoretical foundations and techniques, as well as efficient algorithms and effective tools, for the verification and analysis of quantum programs. This project will introduce new ideas and techniques to tackle the problem of verifying and analysing quantum programs and provide efficient algorithms and effective tools to help quantum program compilation and optimisation. Successful development of the outcomes and tools i ....Verification and analysis of quantum programs. This project aims to develop theoretical foundations and techniques, as well as efficient algorithms and effective tools, for the verification and analysis of quantum programs. This project will introduce new ideas and techniques to tackle the problem of verifying and analysing quantum programs and provide efficient algorithms and effective tools to help quantum program compilation and optimisation. Successful development of the outcomes and tools in this project will help Australian industries build frontier technologies for quantum software engineering and establish and preserve their competitive status in the era of quantum computing.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE130101664
Funder
Australian Research Council
Funding Amount
$357,084.00
Summary
Universal solution for scheduling problems. The aim of this project is to design efficient algorithms that compute universal solutions for scheduling on an unreliable machine. Such solutions are specially suitable for situations where machines can behave unpredictably, such as scheduling in cloud computing.
Algorithmics for visual analytics of massive complex networks. The project will provide new scalable algorithms for visual analytics of massive complex networks. These fast algorithms will enable security analysts to detect abnormal behaviours such as money laundering, biologists to understand protein-protein interaction networks, and support software engineers new ways of understanding large software systems.
Quantum computation: through the algorithm and complexity theory lens. This project aims to advance our knowledge of quantum computation through the lens of algorithm and complexity theory. Three core areas of the theory will be examined: interactive computing models, query complexity, and circuit lower bounds. The expected outcomes include: revealing the quantum advantages of interactive computing models; techniques for verifying quantum devices in the cloud and quantum cloud computing in gener ....Quantum computation: through the algorithm and complexity theory lens. This project aims to advance our knowledge of quantum computation through the lens of algorithm and complexity theory. Three core areas of the theory will be examined: interactive computing models, query complexity, and circuit lower bounds. The expected outcomes include: revealing the quantum advantages of interactive computing models; techniques for verifying quantum devices in the cloud and quantum cloud computing in general; sharpening the separation between algorithm performance in quantum and classical query models; establishing both unconditional and conditional hardness results for quantum circuits. This comprehensive understanding will enhance Australia's research portfolio in the theory of quantum computing.Read moreRead less
Devising tools for big data sets to support computational movement analysis. This project aims to devise practical fundamental algorithms and multi-purpose data structures with performance guarantees for big spatio-temporal data sets. Systematic analysis of trajectory data has been occurring since the 1950s, but with the recent technological advances the size of the data sets has recently soared. Existing computational tools were developed for small to mid-size data sets. This project aims to d ....Devising tools for big data sets to support computational movement analysis. This project aims to devise practical fundamental algorithms and multi-purpose data structures with performance guarantees for big spatio-temporal data sets. Systematic analysis of trajectory data has been occurring since the 1950s, but with the recent technological advances the size of the data sets has recently soared. Existing computational tools were developed for small to mid-size data sets. This project aims to devise practical fundamental algorithms that will enable the development of domain specific tools for a wide range of applications, including sports, behavioural ecology, transport, and surveillance.Read moreRead less
Multicast in Single-Hop and Multi-Hop WDM Optical Networks. The emerging Wavelength-Division-Multiplexing (WDM) optical network is a promising candidate for next-generation Internet, which provides enormous bandwidth and fast connectivity. Multicast in WDM networks is a fundamental problem which has wide applications including teleconferencing, entertainment distribution, etc. In this project we investigate the multicast and constraint multicast problems in both single-hop and multi-hop WDM netw ....Multicast in Single-Hop and Multi-Hop WDM Optical Networks. The emerging Wavelength-Division-Multiplexing (WDM) optical network is a promising candidate for next-generation Internet, which provides enormous bandwidth and fast connectivity. Multicast in WDM networks is a fundamental problem which has wide applications including teleconferencing, entertainment distribution, etc. In this project we investigate the multicast and constraint multicast problems in both single-hop and multi-hop WDM networks by studying their computational complexities and devising scalable, high-quality approximation algorithms for them. The developed algorithms significantly improve the network performance and scalability, and the innovative approaches and algorithm techniques developed in this project are also applicable to other routing problems.Read moreRead less
Formal Verification of Quantum Logic Circuits. The project aims to develop comprehensive theory and effective techniques for formal modelling, equivalence checking, and model checking of quantum circuits. The research is timely as the rapid growth of quantum computing hardware makes it an urgent task to develop verification techniques for quantum hardware design and quantum compilers. The successful development of the algorithms and software tools proposed in this project will significantly adva ....Formal Verification of Quantum Logic Circuits. The project aims to develop comprehensive theory and effective techniques for formal modelling, equivalence checking, and model checking of quantum circuits. The research is timely as the rapid growth of quantum computing hardware makes it an urgent task to develop verification techniques for quantum hardware design and quantum compilers. The successful development of the algorithms and software tools proposed in this project will significantly advance the knowledge on formal verification of quantum circuits and help Australian quantum start-ups build and maintain an internationally leading position in the rapidly emerging quantum electronic design automation (EDA) industry.Read moreRead less