Dennis Shasha – Page 5 – Communications of the ACM

Opinion Feb 1 2015

A popular logic game involves figuring out an arrangement of people sitting around a circular table based on hints about, say, their relationships. Here, we aim to determine the smallest number of hints sufficient to specify an arrangement unambiguously.

Computing Applications

Opinion Nov 1 2014

Upstart Puzzles: Proving Without Teaching/Teaching Without Proving

Peter Winkler's mathematically elegant, often whimsical puzzles have been a joy to read and wrestle with. My columns now embark on a different path. Each will come in two parts: one quite doable, the other an "upstart," or insolent variant. Here we go.

Computing Applications

Proving without Teaching/ Teaching without Proving, illustration

News Feb 1 2010

An Interview with Michael Rabin

Michael O. Rabin, co-recipient of the 1976 ACM A.M. Turing Award, discusses his innovative algorithmic work with Dennis Shasha.

Systems and Networking

ACM Turing Award recipient Michael O. Rabin

Research and Advances Aug 1 1989

Using a relational system on Wall Street: the good, the bad, the ugly, and the ideal

Developers of a Wall Street financial application were able to exploit a relational DBMS to advantage for some data management tasks (the good). For others, the relational system was not helpful (the bad), or could be pressed into service only by means of major or minor contortions (the ugly). The authors identify database constructs that would have simplified developing the application (the ideal).

Computing Applications

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