Overview
|
The Algorithms group looks at various aspects of the
theory and practice of algorithms. The goal of our research is both to
provide scalable solutions to existing problems and to understand the
limits of what is possible. We are now a part of the larger Hare umbrella group.
The quantity of data available in digital form continues to increase
at an exponential rate. The need for faster and more accurate
algorithms is now more important than ever before.
“ People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically. ” - Donald Knuth
Local readers and visitors to the university may also be interested in the Theory of Computing Reading Group at Bristol which runs on a weekly basis. |
|
Events
The 4th Annual Bristol Algorithms Days, BAD'10, is being held on February 15 and 16, 2010 with special themes of pattern matching algorithms for streaming data and the new area of algorithms for power efficiency. This workshop is an EPSRC funded initiative with the aim of exploring new collaborative research programmes at the interface between mathematics and computer science.As a group we also ran our successful workshop, Bristol Algorithms Days (BAD) in 2007, 2008 and 2009 as well as the Bristol Summer School on Probabilistic Techniques in Computer Science in 2009.
Current Interests
|
|
Permanent academic staff
 Raphaël Clifford |
 Aram Harrow |
Postdoctoral researchers
 Ashley Montanaro |
 Markus Jalsenius |
PhD Students
 Benjamin Sach |
 Alex Popa |
 Leon Atkins |