 | 2000 |
|---|
| 13 |       | A. Michael Berman:
Welcome ever smiles / And farewell goes out sighing.
SIGPLAN Notices 35(4): 1 (2000) |
| 1999 |
|---|
| 12 |  | Don C. Stone,
Seth Bergmann,
Ganesh Baliga,
A. Michael Berman,
John Schmalzel:
A CS1 maze lab, using joysticks and MIPPETs.
SIGCSE 1999: 170-173 |
| 11 | | A. Michael Berman:
A Correction and Apology.
SIGPLAN Notices 34(2): 1 (1999) |
| 1998 |
|---|
| 10 | | Daniel D. McCracken,
A. Michael Berman,
Ursula Wolz,
Owen L. Astrachan,
Nell B. Dale:
Possible futures for CS2 (panel).
SIGCSE 1998: 357-358 |
| 9 | | A. Michael Berman:
SIGPLAN Notices - Where We Are, Wher We're Going.
SIGPLAN Notices 33(6): 1-2 (1998) |
| 1996 |
|---|
| 8 | | A. Michael Berman,
Robert C. Duvall:
Thinking about binary trees in an object-oriented world.
SIGCSE 1996: 185-189 |
| 7 | | A. Michael Berman:
Column Constructor.
SIGPLAN Notices 31(2): 4-5 (1996) |
| 6 | | A. Michael Berman:
Philadelphia Dreaming.
SIGPLAN Notices 31(3): 2-3 (1996) |
| 5 | | A. Michael Berman:
On Beyond OOP.
SIGPLAN Notices 31(4): 1-3 (1996) |
| 1994 |
|---|
| 4 | | A. Michael Berman,
Rick Decker,
Dung X. Nguyen,
Richard J. Reid,
Eugene Wallingford:
Using C++ in CS1/CS2.
SIGCSE 1994: 383-384 |
| 3 | | A. Michael Berman:
Does Scheme Enhance an Introductory Programming Course? Some Preliminary Empirical Results.
SIGPLAN Notices 29(2): 44-48 (1994) |
| 1992 |
|---|
| 2 | | A. Michael Berman:
Class discussion by computer: a case study.
SIGCSE 1992: 97-101 |
| 1989 |
|---|
| 1 | | A. Michael Berman,
Marvin C. Paull,
Barbara G. Ryder:
Proving Relative Lower Bounds for Incremental Algorithms.
Acta Inf. 27(7): 665-683 (1989) |
