| 2000 |
|---|
| 11 | EE | Max Hailperin,
David M. Arnow,
Judith Bishop,
Chester Lund,
Lynn Andrea Stein:
Concurrency the first year (panel session): experience reports.
SIGCSE 2000: 407-408 |
| 1999 |
|---|
| 10 | | Kevin Ying,
David M. Arnow,
Dayton Clark:
Evaluating Communication Protocols for WebComputing.
PDPTA 1999: 857-868 |
| 1998 |
|---|
| 9 | | David M. Arnow,
Chaya Gurwitz:
Insight Through Experience: Hands-on Internet Experiments for Non-CS Majors.
WebNet 1998 |
| 1995 |
|---|
| 8 | EE | David M. Arnow,
Ken McAloon,
Carol Tretkoff:
Parallel Integer Goal Programming.
ACM Conference on Computer Science 1995: 42-47 |
| 7 | EE | David M. Arnow:
:-) When you grade that: using e-mail and the network in programming courses.
SAC 1995: 10-13 |
| 6 | EE | David M. Arnow:
XDP: a simple library for teaching a distributed programming module.
SIGCSE 1995: 82-86 |
| 5 | | David M. Arnow:
DP: A Library for Building Portable, Reliable Distributed Applications.
USENIX Winter 1995: 235-247 |
| 1994 |
|---|
| 4 | EE | David M. Arnow:
Teaching programming to liberal arts students: using loop invariants.
SIGCSE 1994: 141-144 |
| 3 | | David M. Arnow,
Ken McAloon,
Carol Tretkoff:
Distributed Programming and Disjunctive Programming.
Workshop on Design and Impl. of Parallel Logic Programming Systems 1994: 120-129 |
| 1985 |
|---|
| 2 | | David M. Arnow,
Aaron M. Tenenbaum,
Connie Wu:
P-Trees: Storage Efficient Multiway Trees.
SIGIR 1985: 111-121 |
| 1984 |
|---|
| 1 | EE | David M. Arnow,
Aaron M. Tenenbaum:
An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees.
SIGMOD Conference 1984: 33-46 |
