An Algorithm for a Better Bookshelf
Laziness is only one of two desirable properties for a bookshelf algorithm. The second is the ability to proactively respond to an adversary’s strategy.
Erica Klarreich
Advertisement
Author Archives
Algorithmic Advance: the Group Isomorphism Problem
Exploring a potential way to immensely speed up algorithms for the group isomorphism problem.
Multiplication Hits the Speed Limit
A problem "around since antiquity" may have been resolved by a new algorithm.
Good Algorithms Make Good Neighbors
Many computer scientists doubted ad hoc methods would ever give way to a more general approach to finding nearest neighbors. They were wrong.
Macarthur Fellow Gene Luen Yang's graphic novels introduce kids to computer programming.
Because it is easy to fool, machine learning must be taught how to handle adversarial inputs.
In Search of Bayesian Inference
Long relegated to the statistical backburner, Bayesian Inference is undergoing a renaissance.
The first steps have been taken toward enabling a computer to perceive one's thoughts.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved