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
Virtual Complexity
The Complexity Complexity Conference, the conference that shares its name and URL with this blog, originally scheduled for Saarbrücken will be held virtually next...
From Computational Complexity
On Chain Letters and Pandemics
Guest post by Varsha Dani.My 11-year-old child received a letter in the mail. "Send a book to the first person named," it said, "then move everyone's name up the...
From Computational Complexity
And the winners are ....
The Computational Complexity Conference has announced the accepted papers for the 2020 now virtual conference. Check them out! Speaking of the complexity conference...
From Computational Complexity
Vidcast on Conferences
Bill and Lance have another socially-distanced vidcast, this time with Lance telling the story of two conferences (ACM Economics and Computation and the Game Theory...
From Computational Complexity
Predicting the Virus
As a complexity theorist I often find myself far more intrigued in what we cannot compute than what we can. In 2009 I posted on some predictions of the spread of...
From Computational Complexity
Complexity Vidcast - Future Edition
Bill and Lance aim to talk about the future but can't escape the present.
From Computational Complexity
The Summer Virtual Conference Season
Both STOC and Complexity have announced they will go virtual for the summer. ICALP moved from Beijing to Stuttgart to online. I expect every major summer conference...
From Computational Complexity
Theoretical Computer Science for the Future
Guest post by the TCS4F initiative (Antoine Amarilli, Thomas Colcombet, Hugo Férée, Thomas Schwentick) TCS4F is an initiative by theoretical computer scientists...
From Computational Complexity
Return of the Vidcast
Bill and I just have a discussion, virtually of course.
From Computational Complexity
Let's Hear It for the Cloud
Since March 19th I have worked out of home. I've had virtual meetings, sometimes seven or eight a day, on Zoom, Bluejeans, Google Hangouts, Google Meet, Blackboard...
From Computational Complexity
Robin Thomas
Graph Theorist and Georgia Tech Math Professor Robin Thomas passed away Thursday after his long battle with ALS. He was one of the giants of the field and aHadwiger...
From Computational Complexity
What to do while stuck at home Part I
First of all both the Turing award and Abel Prize announced yesterday. As we start moving from the panic phase of the coronavirus to the boring phase, what kinds...
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