Data Science News
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
UKRI Future Leaders Fellowship awarded to Dr Tom Gur
We are delighted to report that Dr Tom Gur has been awarded a Future Leaders Fellowship on Foundations of classical and quantum verifiable computing, funded by £892K from UK Research and Innovation. Professor Artur Czumaj, the head of the department's Theory and Foundations research theme, has commented:
We congratulate Tom and look forward to hosting this exciting project that he will lead. This prestigious award confirms the high international standing of research at Warwick in theoretical computer science and its rich interfaces with other fields.
Tom’s Future Leaders Fellowship is concerned with algorithms and cryptographic protocols, both in the classical and quantum settings, and their applications to blockchain technology and delegation of computation to the cloud. This research programme is inherently interdisciplinary, involving fundamental research at the intersection of computer science, pure mathematics, and quantum physics.
The vision that this project aims to achieve is to develop new and exciting mathematical tools and to capitalise on their power to the end of pushing the frontiers of verifiable computing; providing new methodologies for meeting the challenges imposed by big data and the societal need for decentralised systems.
Warwick and Alan Turing Institute partnership brings Data Science for Social Good Fellowship to the UK this summer
This year's Data Science for Social Good (DSSG) Fellowship programme is being held in the UK for the first time. The University of Warwick is hosting the Fellowships this summer in conjunction with the Alan Turing Institute. The 2019 programme is running from June 10 to August 28.
The Fellowship is a project-based training programme to supply data scientists with skills to create data-driven solutions to real-world problems. It trains aspiring data scientists to work on data mining, machine learning, big data and data science projects with social impact.
It was first pioneered by the University of Chicago, and since 2013 has seen more than 200 graduate and undergraduate students studying computer science, social sciences, statistics, public policy and other quantitative fields undertaking a DSSG Fellowship at the University of Chicago.
The Alan Turing Institute’s vision to advance research for public good and train the next generation of leaders is directly aligned with DSSG’s own goal to produce data scientists with strong skills in solving real-world problems.
Fellows work with non-profit and government partners around the world. To date, more than 60 projects have run, which have helped lots of organisations do more with their data, enhancing their services, interventions and outreach so that they can fulfil their mission of improving lives across the world.
Further details on the fellowship can be found here.