A Representation Approach to the Tower of Hanoi Problem. - M. C. Er (Comput. J., 1982)

The Theory and Practice of Constructing an Optimal Polyphase Sort. - M. C. Er; Barry G. T. Lowden (Comput. J., 1982)

An Iterative Solution to the Generalized Towers of Hanoi Problem. - M. C. Er (BIT, 1983)

An Analysis of the Generalized Towers of Hanoi Problem. - M. C. Er (BIT, 1983)

A Note on Generating Well-Formed Parenthesis Strings Lexicographically. - M. C. Er (Comput. J., 1983)

A Fast Algorithm for Computing Order-K Fibonacci Numbers. - M. C. Er (Comput. J., 1983)

A Parallel Computation Approach to Topological Sorting. - M. C. Er (Comput. J., 1983)

Computing Sums of Order-k Fibonacci Numbers in Log Time. - M. C. Er (Inf. Process. Lett., 1983)

Optimizing Procedure Calls and Returns. - M. C. Er (Softw. Pract. Exp., 1983)

The Colour Towers of Hanoi: A Generalization. - M. C. Er (Comput. J., 1984)

The Cyclic Towers of Hanoi: A Representation Approach. - M. C. Er (Comput. J., 1984)

The Generalized Colour Towers of Hanoi: An Iterative Algorithm. - M. C. Er (Comput. J., 1984)

On the Complexity of Recursion in Problem-Solving. - M. C. Er (Int. J. Man Mach. Stud., 1984)

An iterative algorithm for the cyclic Towers of Hanoi problem. - M. C. Er (Int. J. Parallel Program., 1984)

Enumerating Ordered Trees Lexicographically. - M. C. Er (Comput. J., 1985)

The Complexity of the Generalised Cyclic Towers of Hanoi Problem. - M. C. Er (J. Algorithms, 1985)

Practical Considerations of Global and Local Variables. - M. C. Er (Softw. Pract. Exp., 1985)

Remark on "Algorithm 246: Graycode [Z]". - M. C. Er (ACM Trans. Math. Softw., 1985)

The Use of Termination Indicators in Computer Programming. - M. C. Er (Comput. J., 1986)

Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi problem. - M. C. Er (Computing, 1986)

Efficient generation of binary trees from inorder-postorder sequences. - M. C. Er (Inf. Sci., 1986)

An Efficient Implementation of Permutation Backtracking in Lexicographic Order. - M. C. Er (Comput. J., 1987)

Lexicographic Listing and Ranking of t-Ary Trees. - M. C. Er (Comput. J., 1987)

A General Algorithm for Finding a Shortest Path between two n-Configurations. - M. C. Er (Inf. Sci., 1987)

A loopless and optimal algorithm for the cyclic towers of hanoi problem. - M. C. Er (Inf. Sci., 1987)

A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order. - M. C. Er (Comput. J., 1988)

A Fast Algorithm for Generating Set Partitions. - M. C. Er (Comput. J., 1988)

A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem. - M. C. Er (Comput. J., 1988)

Decision Support Systems: A summary, problems, and future trends. - M. C. Er (Decis. Support Syst., 1988)

An optimal algorithm for Reve's puzzle. - M. C. Er (Inf. Sci., 1988)

Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees. - M. C. Er (Comput. J., 1989)

A New Algorithm for Generating Binary Trees Using Rotations. - M. C. Er (Comput. J., 1989)

A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc. - M. C. Er (Inf. Sci., 1989)

Efficient Generation of k-ary Trees in Natural Order (Short Note). - M. C. Er (Comput. J., 1992)

Fast computation of solutions of linear difference equations by Er's rule. - M. C. Er (Inf. Sci., 1992)

The anonymity and proximity factors in group decision support systems. - M. C. Er; A. C. Ng (Decis. Support Syst., 1995)