Jan B. Hext

According to our database, Jan B. Hext authored at least 10 papers between 1967 and 2001.

Collaborative distances:

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

2001

B-Trees - A Simple Proof of their Space Utilisation.

Jan B. Hext

J. Res. Pract. Inf. Technol., 2001

1996

Jocula - an instructive compiler.

Robert E. Buckley, Jan B. Hext

Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1994

Mr Waring's problem.

Jan B. Hext

ACM SIGCSE Bull., 1994

1992

Some Classes for Object-Based Simulation in C++.

Tapas Debray, Jan B. Hext

Proceedings of the TOOLS 1992: 6th International Conference on Technology of Object-Oriented Languages and Systems, 1992

1982

The Formal Treatment of state Transition Tables - A Tutorial.

Jan B. Hext, S. C. Hirst

Aust. Comput. J., 1982

1979

Pattern-Matching Commands.

Jan B. Hext

Proceedings of the Language Design and Programming Methodology, 1979

1975

Array reference operations.

Jan B. Hext

Proceedings of the Conference on Programming Languages and Compilers for Parallel and Vector Machines 1975, 1975

1970

Syntax Analysis by Domölki's Algorithm.

Jan B. Hext, P. S. Roberts

Comput. J., 1970

1969

An automatic grading scheme for simple programming exercises.

Jan B. Hext, J. W. Winings

Commun. ACM, 1969

1967

Compile-Time Type-Matching.

Jan B. Hext

Comput. J., 1967