David J. Wheeler

According to our database, David J. Wheeler authored at least 11 papers between 1952 and 1994.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1994

TEA, a Tiny Encryption Algorithm.

David J. Wheeler, Roger M. Needham

Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

1993

A Bulk Data Encription Algorithm.

David J. Wheeler

Proceedings of the Fast Software Encryption, 1993

1992

The EDSAC Programming Systems.

David J. Wheeler

IEEE Ann. Hist. Comput., 1992

1990

A Matrix Key-Distribution Scheme.

Li Gong, David J. Wheeler

J. Cryptol., 1990

1987

Programmed computing at the Universities of Cambridge and Illinois in the early fifties.

David J. Wheeler

Proceedings of the ACM Conference on History of Scientific and Numeric Computation, 1987

1979

Maintenance of Ring Communication Systems.

Andy Hopper, David J. Wheeler

IEEE Trans. Commun., 1979

Binary Routing Networks.

Andrew Hopper, David J. Wheeler

IEEE Trans. Computers, 1979

1971

The Limits of the Complexity of Computer Systems.

David J. Wheeler

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

1959

Letter to the Editor on "A Method for Transposing a Matrix".

David J. Wheeler, H. P. F. Swinnerton-Dyer

J. ACM, 1959

Note on the Runge-Kutta Method of Integrating Ordinary Differential Equations.

David J. Wheeler

Comput. J., 1959

1952

The use of sub-routines in programmes.

David J. Wheeler

Proceedings of the 1952 ACM national meeting (Pittsburgh), 1952