Oded Lachish
Senior LecturerTeaches: Concepts of Computation, Mathematics for Computing
Oded Lachish has a BSc in Physics and Math (Hebrew University 1995), a MSc in Computer Science (The Weizmann Institute of Science 2002) and a PhD in Computer Science (University of Haifa 2007). Prior to joining Birkbeck as a lecturer in 2011, he was a research affiliate at the department of computer science University of Warwick. He also has six years of industrial experience, working at IBM research Labs and Motorola (now Freescale) Semiconductors. His research is in complexity and algorithms and their application.
Contact Information
- Room
- MAL166
- Telephone
- 020 3926 1259
- Email address
- Enable JavaScript to view protected content.
- Personal web page
- http://www.dcs.bbk.ac.uk/~oded
Research
Areas of interest: Algorithms and complexity, computation with extremely limited resources
Key Publications
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy. (2021)
- On the Power of Relaxed Local Decoding Algorithms. (2021)
- Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. (2015)
- O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. (2014)
- Improved competitive ratio for the matroid secretary problem. (2012)