The CUHK Theory Lunch is an informal weekly meeting. We discuss various scientific and non-scientific happenings over lunch, in preparation for a refreshing talk by a student, a colleague, or a visitor. The talks are usually informal, no need to prepare slides. Interruptions for questions and discussion are encouraged.
Feel free to join us if you are interested, and please drop us an email if you would like to give a talk. The talks are about theoretical aspects of computer science but we are also very interested in hearing about work in other areas and problems in need of solutions.
The talk starts at 11, and goes on for half an hour or 45 minutes, but never beyond 12, and then we eat lunch.
Announcements To receive announcements, join our mailing list.
Tight bounds for approximate Carathéodory
||Day after mid-autumn festival
Bregman divergence and convex optimization
||Siu On Chan
On the largest simplex problem
Packing spheres in high dimensions
Oblivious amplitude amplification and linear combinations of unitaries
||Cancelled owing to typhoon|
Random oracles with auxiliary input, revisited
Envy-free cake-cutting algorithms
Approximate holant problems
On an information inequality conjecture
Sharing secrets infinitely