algorithms Academic and Adjunct staff
4 entries. Last updated 2012-05-16 15:19:41.
![]() |
| ||||||||||||||||||
Research interests:Analysis of algorithms, computational complexity, computational number theory, parallel/distributed computing, parallel computer architectures, randomised algorithms, random number generators, scientific computing. | |||||||||||||||||||
Bio:In 1978 Richard Brent was appointed Foundation Professor of Computer Science at ANU, and in 1985 he became Professor and Head of the Computer Sciences Laboratory in the Research School of Physical Sciences at ANU.
In 1998 he moved to Oxford as Statutory Professor of Computing Science and Fellow of St Hugh's College.
In March 2005 he returned to ANU to take up a 5-year position as an ARC Federation Fellow in the Mathematical Sciences Institute (MSI) and the Research School of Information Sciences and Engineering.
Since March 2010 he has been a Distinguished Professor with a joint appointment in MSI and the School of Computer Science.
He is a Fellow of the ACM, IEEE, SIAM, the Australian Academy of Science, and various other professional bodies. He is also a Chief Investigator in the ARC Centre of Excellence for Mathematics and Statistics of Complex Systems (MASCOS), and leader of the Computational Mathematics group in MSI.
His most recent book, Modern Computer Arithmetic (written jointly with Paul Zimmermann), was published in November 2010 by Cambridge University Press. | |||||||||||||||||||
Research opportunities with Emeritus Professor Richard BRENT | |||||||||||||||||||
![]() |
| ||||||||||||||||
Research interests:Combinatorial optimization, graph theory, probabilistic methods, complexity theory, and their applications in natural sciences. | |||||||||||||||||
![]() |
| ||||||||||||||||||
Research interests:Wireless ad hoc and sensor networks,approximation algorithms, parallel and distributed algorithms, query optimization in sensor networks and social networks, combinatorial optimization, graph theory | |||||||||||||||||||
![]() |
| ||||||||||||||||||
Research interests:Graph theory, algorithms for discrete structures, graph isomorphism problem, probabilistic combinatorics, asymptotic enumeration | |||||||||||||||||||
Bio:Brendan McKay received his PhD from Melbourne University in 1980. After three years at Vanderbilt University, USA, he came to ANU in 1983. He has been Professor of Computer Science since 1998. He is a Fellow of the Australian Academy of Science and of the Australian Mathematical Society. He is author of about 155 articles in journals and conference proceedings. | |||||||||||||||||||




