Return to Table of Contents Previous Chapter

REFERENCES

Adelson-Velskii, G. M. and E. M. Landis. Soviet Math (Dokl.) 3 (1962), 1259-1263.

Aho, Alfred V. and Jeffrey D. Ullman, Principles of Compiler Design, Addison-Wesley, 1977.

Bentley, Jon L., "Programming Pearls," ACM Communications, August, 1983 and thereafter.

Brodie, Leo, Starting FORTH, Prentice-Hall, 1981.

BYTE Magazine, August, 1980 (Issue on the FORTH language).

Even, Shimon, Graph Algorithms, Computer Science Press, 1979.

Intel, The 8086 Family User's Manual, Intel Corp., 1979.

Kernighan, B. W. and P. J. Plauger, The Elements of Programming Style, McGraw-Hill, 1974.

Knuth, Donald E., The Art of Programming, Vol. 1, Addison-Wesley, 1973.

Ledgard, Henry and Michael Marcotty, The Programming Language Landscape, SRA, 1981.

Roberts, Fred S., Discrete Mathematical Models, Prentice-Hall, 1976.

Roberts, Fred S., Applied Combinatorics, Prentice-Hall, 1984.

Sedgewick, Robert, Algorithms, Addison-Wesley, 1983.

STACK, IEEE Computer Society Journal, Computer, May 1977 (devoted to stack machines).

Tarjan, Robert E., Data Structures and Network Algorithms, SIAM, 1983.

Touretsky, David S., LISP, A Gentle Introduction to Symbolic Computation, Harper & Row, 1984.

Wirth, Nicklaus, Algorithms + Data Structures = Programs, Prentice-Hall, 1976.

Return to Table of Contents