Algorithms for hard graph problems based on auxiliary data. When solving computational problems, algorithms usually access only the data that is absolutely necessary to define the problem. However, much more data is often readily available. Especially for important or slowly evolving data, such as road networks, social graphs, company rankings, or molecules, more and more auxiliary data becomes available through computational processes, sensors, and simple user entries. This auxiliary data can g ....Algorithms for hard graph problems based on auxiliary data. When solving computational problems, algorithms usually access only the data that is absolutely necessary to define the problem. However, much more data is often readily available. Especially for important or slowly evolving data, such as road networks, social graphs, company rankings, or molecules, more and more auxiliary data becomes available through computational processes, sensors, and simple user entries. This auxiliary data can greatly speed up an algorithm and improve its accuracy. This project aims to design improved algorithms that harness auxiliary data to solve selected high-impact NP-hard graph problems, and will build a new empowering theory to discern when auxiliary data can be used to improve algorithms.Read moreRead less
Relaxed correctness criteria for modern multi-core architectures. This project seeks to lay groundwork for fully exploiting the potential of multicore computers. Multicore computers have become ubiquitous over the last decade, now being standard in everything from laptops to mobile phones. Their benefits are clear – better performance leading to more sophisticated applications. Key to ensuring those benefits are complex, and often subtle, algorithms that exploit the parallelism that multicore co ....Relaxed correctness criteria for modern multi-core architectures. This project seeks to lay groundwork for fully exploiting the potential of multicore computers. Multicore computers have become ubiquitous over the last decade, now being standard in everything from laptops to mobile phones. Their benefits are clear – better performance leading to more sophisticated applications. Key to ensuring those benefits are complex, and often subtle, algorithms that exploit the parallelism that multicore computers offer. This project aims to lay foundations for extending those benefits to applications where high reliability is a concern. It plans to do so by developing theoretical results about the correctness of algorithms on standard multicore computers, and practical tools and techniques to help programmers of multicore computers to better understand the behaviour of their code.Read moreRead less
Expander graphs, isoperimetric numbers, and forwarding indices. Expanders are sparse but well connected networks. With numerous applications to modern technology, they have attracted many world leaders in mathematics and computer science. This project aims at substantial advancement on some important problems on expanders and related areas. It will put Australia at the forefront of this topical field.
Elliptic curves: number theoretic and cryptographic aspects. Smart information use is of fundamental nature and has a great number of applications. First-generation security solutions are unable to support the modern requirements and new security infrastructures are emerging that must be carefully, but rapidly, defined. This urgently needs new mathematical tools, which is the main goal of this project.
Australian Laureate Fellowships - Grant ID: FL120100125
Funder
Australian Research Council
Funding Amount
$1,796,966.00
Summary
Advances in the analysis of random structures and their applications. This project will provide new approaches, insights and results for probabilistic combinatorics. This area has contributed in exciting ways elsewhere in mathematics and provides versatile tools of widespread use in algorithmic computer science, with other applications in physics, coding theory for communications, and genetics.
A new approach to compressed sensing. Compressed sensing is an exciting new paradigm promising vastly improved signal sampling and reconstruction in a wide variety of applications including digital cameras, mobile phones and MRI machines. This project will explore a newly discovered approach to compressed sensing which uses mathematical arrays known as hash families.
Discovery Early Career Researcher Award - Grant ID: DE170100234
Funder
Australian Research Council
Funding Amount
$360,000.00
Summary
Exact and hybrid algorithms for the Aircraft Landing Problem. This project aims to develop algorithms with superior guaranteed performance. Aircraft Landing Problems (ALP) are an important class of decision problems. Optimal solution of an ALP is applicable in transportation and health care delivery, benefitting systems experiencing long delays. This project aims to address several of the Australian Government's Science and Research Priorities, focusing on food supply chains, effective operation ....Exact and hybrid algorithms for the Aircraft Landing Problem. This project aims to develop algorithms with superior guaranteed performance. Aircraft Landing Problems (ALP) are an important class of decision problems. Optimal solution of an ALP is applicable in transportation and health care delivery, benefitting systems experiencing long delays. This project aims to address several of the Australian Government's Science and Research Priorities, focusing on food supply chains, effective operation and resource allocation in transport, and better models of health care delivery and services.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE150100720
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Testing Isomorphism of Algebraic Structures. The algorithmic problem of isomorphism testing seeks to decide whether two objects from a mathematical category are essentially the same. This project focuses on the setting when the categories are from algebra, including but not limited to, groups and polynomials. It is a family of fundamental problems in complexity theory, with important applications in cryptography. The project aims to develop efficient algorithms with provable guarantee, or formal ....Testing Isomorphism of Algebraic Structures. The algorithmic problem of isomorphism testing seeks to decide whether two objects from a mathematical category are essentially the same. This project focuses on the setting when the categories are from algebra, including but not limited to, groups and polynomials. It is a family of fundamental problems in complexity theory, with important applications in cryptography. The project aims to develop efficient algorithms with provable guarantee, or formal hardness proofs, for these problems. Algorithms will be implemented to examine the impacts on certain cryptography schemes. The successful completion of this project will enhance the understanding of computational complexities of these problems, and identify the security of certain cryptography schemes.Read moreRead less
Making software more reliable using a new model for entropies of computers' internal state. A new mathematical analysis of the way computer systems exchange data between their components has led to novel design approaches for the programs implementing those systems. This reduces their cost and increases their reliability, with improvements ranging from small-scale smart devices to widely distributed internet protocols.
Towards the prime power conjecture. This project attacks a famous and long standing conjecture in pure mathematics that has important ramifications in many applied areas. The project aims to determine when it is possible to produce more efficient codes for electronic communication and statistically balanced designs for experiments in areas as diverse as agriculture and psychology.