Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
From Computational Complexity
The Importance of Networking
People skip conferences because of the coronavirus or for global warming or just because conferences are too expensive and time consuming. I'm certainly no fanMarch...
From Computational Complexity
A New College of Computing at Illinois Tech
In 1890, Chicago South Side pastor Frank Gunsaulus gave a sermon where he said that with a million dollars he could build a school where students of all backgrounds...
From Computational Complexity
Pre-(Publish and Perish)
Guest post by Evangelos Georgiadis Quite a few posts have recently focused on papers,publications and venues; "optimal" venues for papers under different objective...
From Computational Complexity
The World of Publishing
Bill is out for blogging for a couple of weeks on injured-reserve (he’ll be fine). I put together a quick blog post on what’s happening in the world of publications...
From Computational Complexity
Quantum Provers to Infinity and Beyond
The Internets are buzzing about the new paper MIP* = RE by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright and Henry Yuan. See posts by Scott, Boaz, not...
From Computational Complexity
Silicon Valley Ethics
Spoiler Alert: This post has details from the final episodes of the HBO television series Silicon Valley A few times I've gotten emails from people claiming they...
From Computational Complexity
Complexity Year in Review 2019
Some great theorems this year including non-deterministic double exponential time by quantumly entangled provers and integer multiplication in O(n log n) time.shockingly...
From Computational Complexity
Statistics to Scare
So how do you parse the following paragraph from Monday's NYT Evening Breifing. A study in JAMA Pediatrics this year found that the average Halloween resultedpaper...
From Computational Complexity
2019 Fall Jobs Post
Starting PhD students over time would always assume that the computer science academic job market would be a strong or as weak when they graduate as it is whenCRA...
From Computational Complexity
Quantum Supremacy
By now you've probably heard the rumors of Google achieving quantum supremacy. I don't have inside information outside of Scott's blog post but it looks like the...
From Computational Complexity
Transitioning
You may have noticed, or not, that I haven't posted or tweeted much in the last month. I've had a busy time moving back to Chicago and starting my new positionsignificant...
From Computational Complexity
The Advisor/Advisee Relationship
I've always felt a strong advisor/advisee relationship is the single most important factor in a successful PhD career. At its best, the advisor works closely with...
From Computational Complexity
Degree and Sensitivity
Hao Huang's proof of the sensitivity conjecture that I posted on last week relied on a 1992 result of Gotsman and Linial. Let's talk about that result. Consider...
From Computational Complexity
Local Kid Makes History
The blogosphere is blowing up over Hao Huang's just posted proof of the sensitivity conjecture, what was one of the more frustrating open questions in complexity...
From Computational Complexity
FCRC 2019
Georgia Tech FCRC Participants I'm heading home from the 2019 ACM Federated Computing Research Conference in Phoenix, a collection of computer science meetings...
From Computational Complexity
The Urban/Rural Collegiality Divide
Just a reminder that Grigory Yaroslavtsev has taken over the Theory Jobs Spreadsheet. Check out who is moving where and let everyone know where you will continue...
From Computational Complexity
Compressing in Moscow
This week finds me in Moscow for a pair of workshops, the Russian Workshop on Complexity and Model Theory and a workshop on Randomness, Information and Complexity...
From Computational Complexity
What Happened to the Surprising Theorems?
Twenty-five years ago Peter Shor presented a polynomial-time factoring algorithms for quantum computers. For Peter, it was a simple translation of a quantum algorithm...
From Computational Complexity
NSF Panels
The government shut down in January led to delays at the National Science Foundation and only recently announcing decisions on grants submitted last fall. For those...
From Computational Complexity