acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

TheoretiCS: New TCS Journal

Guest Post from Paul Beame on behalf of the TheoretiCS FoundationI am writing to let you know of the launch today of TheoretiCS, a new fully open-access journal...

From Computational Complexity

Finding an element with nonadaptive questions

Suppose you have a non-empty subset S of {1,...N} and want to find an element of S. You can ask arbitrary questions of the form "Does S contain an element in A?"...

From Computational Complexity

CS Slow to Change?

Back in March of 2019 I wroteI was also going to post about Yann LeCun's Facebook rant about stodgy CS departments but then Yann goes ahead and wins a Turing award...

From Computational Complexity

20 Years of Algorithmic Game Theory

Twenty years ago DIMACS hosted a Workshop on Computational Issues in Game Theory and Mechanism Design. This wasn't the very beginning of algorithmic game theory...

From Computational Complexity

A Complexity View of Machine Learning?

Complexity is at its best when it models new technologies so we can study it in a principled way. Quantum computing comes to mind as a good relatively recent example...

From Computational Complexity

Fall 2021 Jobs Post

We're in the midst of a great transformation in computing, one where data takes center stage and I predict this will start to have a larger effect on hiring indrop...

From Computational Complexity

A Young Person's Game?

When László Babai first announced his graph isomorphism in quasipolynomial time result, I wroteWe think of theory as a young person's game, most of the big breakthroughs...

From Computational Complexity

C++ is for Cookie and That's Good Enough for Me

Potbelly, a local sandwich chain, made me an offer I couldn't refuse: change my password and earn a free (and quite tasty) oatmeal chocolate chip cookie. A free...

From Computational Complexity

Being the Chair

If you have Netflix and interested in the academic world, I recommend The Chair, a six-episode dramatic series starring Sandra Oh as a new English department chair...

From Computational Complexity

Why Conferences?

An undergrad thesis from North Carolina State University tries to tackle the question as to why computer science has used conferences as its main and most prestigious...

From Computational Complexity

The Death of Expertise

Four years ago I tried to catch up with deep learning and this summer I aimed to try to catch up again. Who would've thought 2017 is ancient history.I watched the...

From Computational Complexity

The hierarchy and GapP

There is a great but little-known theorem from the early 90's by Seinosuke Toda and Mitsunori Ogihara (buried as Lemma 2.3 in their paper) that shows the polynomial...

From Computational Complexity

The Long Road

Guest blogger Varsha Dani tells us why it's never too late.This week, I am starting as an Assistant Professor at RIT and I am super excited about it. What's the...

From Computational Complexity

Trusting Scientists

 A tweet that made me think. If you think you don't trust scientists, you're mistaken. You trust scientists in a million different ways every time you step onJuly...

From Computational Complexity

Recognizing Faces

I sometimes have trouble recognizing faces, matching faces to people I've interacted with in the past. It's not a disease like prosopagnosia, I can certainly tell...

From Computational Complexity

Pole Vault Live Blogging

As I write this I'm watching the women's pole vault final in the Olympics. Of the 15 women who made the finals, only four remain after two heights.To expand ontweet...

From Computational Complexity

Covid Stats

A stat often quoted: About 97% of hospitalized coronavirus patients have not been vaccinated.  People take this as proof that once vaccinated no worries. But I...

From Computational Complexity

Technical Difficulties

After returning from vacation last weekend (hello North Dakota--my 49th state visited), all sorts of odd problems arose. This blog stopped working, a P v NP paper...

From Computational Complexity

Intersecting Classes

If you have two complexity classes that have complete sets, the intersection might not, for example NP ∩ co-NP. The world of total-function classes acts differently...

From Computational Complexity

Collusion Rings

Grigory Yaroslavtsev now maintains the Theory Jobs Spreadsheet, a crowd-sourced listing of where your favorite CS theorists have taken new positions. Read his blog...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account