Clément Canonne
LightNews LightNews
banner
ccanonne.github.io
Clément Canonne
@ccanonne.github.io
6.8K followers 600 following 2.4K posts
Senior Lecturer #USydCompSci at the University of Sydney. Postdocs IBM Research and Stanford; PhD at Columbia. Converts ☕ into puns: sometimes theorems. He/him.
Posts Replies Media Videos
ccanonne.github.io
You still have some, actually. And are you that likely to get "grant money" if you're one of 10,000 applying for the exact same thing?
November 29, 2025 at 1:47 AM
ccanonne.github.io
*within some limits, yes. But this freedom to set our own course is something we both over- and undervalue, somehow?
November 29, 2025 at 12:51 AM
Reposted by Clément Canonne
sydneycompsci.bsky.social
Dean's Lecture Series — Prof Shafi Goldwasser | Wednesday 10 December 2025

📍Eastern Avenue Auditorium (F19)
Camperdown NSW 2006
maps.app.goo.gl/M3zMEGwWRC5o...

📋 Register (by Dec 5): signup.e2ma.net/signup/20429...
Abstract Summary For decades now cryptographic tools and models have at their essence transformed technology platforms controlled by worst case adversaries to trustworthy platforms. This talk will describe how interactive proofs and cryptographic modeling can be used to build trust in legal domains and various phases of the machine learning pipelines, including verification of LLM outputs. About the Speaker Shafi Goldwasser is the Research Director for the Resilience Research Pod at the Simons Institute for the Theory of Computing, the C. Lester Hogan Professor in Electrical Engineering and Computer Sciences at UC Berkeley and the Leighton Family Professor of Mathematics at MIT. She was director of the Simons Institute from 2018 to 2024. She is a professor emeritus of computer science and applied mathematics at the Weizmann Institute of Science in Israel. Goldwasser received a BS in applied mathematics from Carnegie Mellon University in 1979, and MS and PhD in computer science from UC Berkeley in 1984. Goldwasser was the recipient of the ACM Turing Award for 2012. She was also the recipient of the Gödel Prize in 1993 and another in 2001 for her work on interactive proofs and connections to approximation, and was awarded the ACM Grace Murray Hopper Award (1996), the RSA award in mathematics (1998), the ACM Athena award for women in computer science (2008), the Benjamin Franklin Medal in Computer and Cognitive Science (2010), the IEEE Emanuel R. Piore Award (2011), the Barnard College Medal of Distinction (2016), and the Suffrage Science Award (2016). She is a member of the AAAS, ACM, NAE, NAS, Israeli Academy of Science, London Mathematical Society, Royal Society and Russian Academy of Science and received honorary doctorates from Haifa University, Tel Aviv University, Bar Ilan UNiversity, Ben Gurion University, Hebrew University, Waterloo University and Carnegie Mellon University.
November 17, 2025 at 8:00 PM
ccanonne.github.io
We just CANNOT let our country be left behind in the Torment Nexus race!
November 24, 2025 at 9:11 PM
Reposted by Clément Canonne
ccanonne.github.io
(As it turns out, the Torment Nexus had already been considerably improved in [Schmidhuber, 1993])
November 24, 2025 at 8:40 AM
ccanonne.github.io
(As it turns out, the Torment Nexus had already been considerably improved in [Schmidhuber, 1993])
November 24, 2025 at 8:40 AM
Reposted by Clément Canonne
nsaphra.bsky.social
My attitude towards reviews comes from my favorite Borges story, The Lottery in Babylon. "Like all men of babylon, I have been proconsul; like all, I have been a slave."
web.itu.edu.tr
November 23, 2025 at 11:58 PM
ccanonne.github.io
en.wikipedia.org/wiki/Simon%2... Even in quantum, everyone forgets about Garfunkel.
Simon's problem - Wikipedia
en.wikipedia.org
November 23, 2025 at 2:21 AM
ccanonne.github.io
Mmh... Not sure what the 'dependency graph' is, here :)
November 22, 2025 at 7:11 PM
ccanonne.github.io
"On arrête les conneries, et oui, hein, l'eau était froide."
November 22, 2025 at 10:14 AM
ccanonne.github.io
Well, I guess it's someone else's Problem
November 22, 2025 at 8:58 AM
ccanonne.github.io
(This is the most obscure quantum computing joke I have ever made.)
November 22, 2025 at 8:55 AM