Assistant professor at @EECSatMI. I do theoretical computer science and graph theory.
Joined January 2014
- Tweets448
- Following375
- Followers1.5K
- Likes804
Greg Bodwin retweeted
Promo video for the UMich Theory Lab. Happy to call this group my academic home :) youtube.com/watch?v=3h3qB3wv…
Greg Bodwin retweeted
We're restarting NY Theory Day, and have a really fantastic lineup of speakers! Come check it out if you're nearby :)
sites.google.com/view/nycthe…
New York Theory Day finally returns on December 6, 2024, after being put on hiatus during COVID.
Will be held at @nyutandon in Brooklyn. Registration is free!
Ft stellar speakers Amir Abboud, Sanjeev Khanna, Rotem Oshman, and @ronrothblum!
sites.google.com/view/nycthe…
Greg Bodwin retweeted
At University of Michigan CSE we have a new program for PhD applicants to apply for an application fee waiver. If you are interested in applying but paying the fee poses a challenge, see here for more info: cse.engin.umich.edu/academic…
Greg Bodwin retweeted
Why don't our schools teach our kids useful life skills instead of useless crap like how to serve a volleyball or make a free throw in basketball? Nobody ever uses that again. If you become a pro you'll learn it in college. PE classes should be about how to move a fridge.
physics isn't stagnant, it's just that up to 85% of all physics is done by Dark Physicists, who
Greg Bodwin retweeted
SOSA 2025 was so much fun to co-chair with @ioanabercea and a great PC! We just finalized the exciting list of papers that will appear at the conference in New Orleans in January:
rasmuspagh.net/SOSA25%20Acce…
I got my first P=NP crank paper emailed to me today! It's titled "A brilliant idea for solving the 3-CNF-SAT problem," and it roughly works by correctly proving that if all Boolean formulas are unsatisfiable, then no graphs are 3-colorable.
Today I learned about a 1944 foundational crisis in graph theory, when a WW2 Soviet bombing campaign rendered the Königsberg bridge problem temporarily solvable en.wikipedia.org/wiki/Bombin…
Greg Bodwin retweeted
The Math department at the University of Alberta should rename themselves the Edmonton Eulers
Greg Bodwin retweeted
How did people describe the brain before computer metaphors? Charles S. Sherrington in 1942 called it "that enchanted loom where millions of flashing shuttles weave a dissolving pattern."
My most cancellable opinion is I don't seriously believe that anyone has strong feelings about fonts
Greg Bodwin retweeted
Euler's Polyhedron Formula is the very cool fact that given an polyhedron, if it has V vertices, E edges and F faces, then
V - E + F = 2.
There are many proofs of this formula, but here is simultaneously the most imaginative, bizarre and wonderful proof of them all:
I find the existence of Olde Graph Theory very charming. Sometimes I look up a paper and it starts saying words like valence and circuit and I think ah yes, one of these
I used to think that the Imitation Game - that the proper test of machine intelligence is whether it fools humans - was a bad def that skirted the interesting philosophical questions in AI. This lecture analogizes it to other TCS defs in a way that completely changed my mind.
Avi Wigderson Turing Award Lecture is a must-watch! youtube.com/live/f2NiGO8zC1c… via @YouTube
The SOSA 2025 submission server is open now, info here. This is one of my favorite conferences, and I'll be on the PC this year. Hope to see you there!
Greg Bodwin retweeted
I am urging the entire TCS community to attend the TCS for All inspiration talk to be given by Luca Trevisan to honor his contributions and to be there for him and his family at this very difficult time. I will be sharing the registration link shortly. Registration will be free.