Proving Relative Lower Bounds for Incremental Algorithms. - A. Michael Berman; Marvin C. Paull; Barbara G. Ryder (Acta Informatica, 1990)

Class discussion by computer: a case study. - A. Michael Berman (SIGCSE, 1992)

Using C++ in CS1/CS2. - A. Michael Berman; Rick Decker; Dung X. Nguyen; Richard J. Reid; Eugene Wallingford (SIGCSE, 1994)

Does Scheme Enhance an Introductory Programming Course? Some Preliminary Empirical Results. - A. Michael Berman (ACM SIGPLAN Notices, 1994)

Thinking about binary trees in an object-oriented world. - A. Michael Berman; Robert C. Duvall (SIGCSE, 1996)

On Beyond OOP. - A. Michael Berman (ACM SIGPLAN Notices, 1996)

Philadelphia Dreaming. - A. Michael Berman (ACM SIGPLAN Notices, 1996)

Column Constructor. - A. Michael Berman (ACM SIGPLAN Notices, 1996)

Possible futures for CS2 (panel). - Daniel D. McCracken; A. Michael Berman; Ursula Wolz; Owen L. Astrachan; Nell B. Dale (SIGCSE, 1998)

SIGPLAN Notices - Where We Are, Wher We're Going. - A. Michael Berman (ACM SIGPLAN Notices, 1998)

A CS1 maze lab, using joysticks and MIPPETs. - Don C. Stone; Seth D. Bergmann; Ganesh R. Baliga; A. Michael Berman; John L. Schmalzel (SIGCSE, 1999)

A Correction and Apology. - A. Michael Berman (ACM SIGPLAN Notices, 1999)

Welcome ever smiles / And farewell goes out sighing. - A. Michael Berman (ACM SIGPLAN Notices, 2000)