Human-Centred Computing News
The department's new Student Experience staff team
Making sure that our students have a high-quality experience in the department will be a top priority for Dr Sara Kalvala, Dr Ramanujan Sridharan and Adam Alcock. They will work with our students, the department's academic and professional services staff, and colleagues in the wider university to address issues, make improvements, and develop initiatives that will improve students' satisfaction and benefit their future careers.
Senior Teaching Fellow and two Teaching Fellows join the department
We are happy to welcome to the department Dr Ian Saunders as a new Senior Teaching Fellow, and Dr Jonathan Foss and James Atkinson as new Teaching Fellows. In addition to all being accomplished scholars and teachers, Ian brings us a wealth of entrepreneurial experience, Jonny has expertise in working with industry in an interdisciplinary context, and James has recently won a prestigious Warwick Award for Teaching Excellence for Postgraduates who Teach. Professor Ranko Lazic, the head of department, has commented:
We are looking forward to the exciting enhancements that Ian, Jonny and James will be making to the department's teaching and learning, to the lasting benefit of our students.
Seven papers accepted to the 31st SODA
We are pleased to report that members of the department's Theory and Foundations research theme have had 7 papers accepted to the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, to be held in Salt Lake City, Utah, USA, January 5-8, 2020. SODA is the premier international conference on algorithms research, and the papers are:
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal by M. S. Ramanujan, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
- An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs by Sayan Bhattacharya, Janardhan Kulkarni
- Coarse-Grained Complexity for Dynamic Algorithms by Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
- Combinatorial Generation via Permutation Languages by Elizabeth Hartung, Hung P. Hoang, Torsten Mütze, Aaron Williams
- On the Power of Relaxed Local Decoding Algorithms by Tom Gur, Oded Lachish
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity by Alessandro Chiesa, Tom Gur, Igor Shinkar
- Sublinear time approximation of the cost of a metric k-nearest neighbor graph by Artur Czumaj, Christian Sohler