| 1992 |
|---|
| 32 | | M. C. Er:
Efficient Generation of k-ary Trees in Natural Order (Short Note).
Comput. J. 35(3): 306-308 (1992) |
| 31 | EE | M. C. Er:
Fast computation of solutions of linear difference equations by Er's rule.
Inf. Sci. 62(1-2): 1-11 (1992) |
| 1989 |
|---|
| 30 | | M. C. Er:
Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees.
Comput. J. 32(1): 76-85 (1989) |
| 29 | | M. C. Er:
A New Algorithm for Generating Binary Trees Using Rotations.
Comput. J. 32(5): 470-473 (1989) |
| 28 | EE | M. C. Er:
A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc.
Inf. Sci. 47(1): 47-52 (1989) |
| 1988 |
|---|
| 27 | | M. C. Er:
A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order.
Comput. J. 31(1): 61-64 (1988) |
| 26 | | M. C. Er:
A Fast Algorithm for Generating Set Partitions.
Comput. J. 31(3): 283-284 (1988) |
| 25 | | M. C. Er:
A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem.
Comput. J. 31(6): 557-560 (1988) |
| 24 | EE | M. C. Er:
An optimal algorithm for Reve's puzzle.
Inf. Sci. 45(1): 39-49 (1988) |
| 1987 |
|---|
| 23 | | M. C. Er:
An Efficient Implementation of Permutation Backtracking in Lexicographic Order.
Comput. J. 30(3): 282 (1987) |
| 22 | | M. C. Er:
Lexicographic Listing and Ranking of t-Ary Trees.
Comput. J. 30(6): 569-572 (1987) |
| 21 | EE | M. C. Er:
A General Algorithm for Finding a Shortest Path between two n-Configurations.
Inf. Sci. 42(2): 137-141 (1987) |
| 20 | EE | M. C. Er:
A loopless and optimal algorithm for the cyclic towers of hanoi problem.
Inf. Sci. 42(3): 283-287 (1987) |
| 1986 |
|---|
| 19 | | M. C. Er:
The Use of Termination Indicators in Computer Programming.
Comput. J. 29(5): 430-433 (1986) |
| 18 | EE | M. C. Er:
Efficient generation of binary trees from inorder-postorder sequences.
Inf. Sci. 40(2): 175-181 (1986) |
| 1985 |
|---|
| 17 | EE | M. C. Er:
Remark on "Algorithm 246: Graycode [Z]".
ACM Trans. Math. Softw. 11(4): 441-443 (1985) |
| 16 | | M. C. Er:
Enumerating Ordered Trees Lexicographically.
Comput. J. 28(5): 538-542 (1985) |
| 15 | | M. C. Er:
The Complexity of the Generalised Cyclic Towers of Hanoi Problem.
J. Algorithms 6(3): 351-358 (1985) |
| 14 | | M. C. Er:
Practical Considerations of Global and Local Variables.
Softw., Pract. Exper. 15(5): 499-502 (1985) |
| 1984 |
|---|
| 13 | | M. C. Er:
The Colour Towers of Hanoi: A Generalization.
Comput. J. 27(1): 80-82 (1984) |
| 12 | | M. C. Er:
The Cyclic Towers of Hanoi: A Representation Approach.
Comput. J. 27(2): 171-175 (1984) |
| 11 | | M. C. Er:
The Generalized Colour Towers of Hanoi: An Iterative Algorithm.
Comput. J. 27(3): 278-282 (1984) |
| 10 | | M. C. Er:
On the Complexity of Recursion in Problem-Solving.
International Journal of Man-Machine Studies 20(6): 537-544 (1984) |
| 1983 |
|---|
| 9 | | M. C. Er:
An Iterative Solution to the Generalized Towers of Hanoi Problem.
BIT 23(3): 295-302 (1983) |
| 8 | | M. C. Er:
An Analysis of the Generalized Towers of Hanoi Problem.
BIT 23(4): 429-435 (1983) |
| 7 | | M. C. Er:
A Note on Generating Well-Formed Parenthesis Strings Lexicographically.
Comput. J. 26(3): 205-207 (1983) |
| 6 | | M. C. Er:
A Fast Algorithm for Computing Order-K Fibonacci Numbers.
Comput. J. 26(3): 224-227 (1983) |
| 5 | | M. C. Er:
A Parallel Computation Approach to Topological Sorting.
Comput. J. 26(4): 293-295 (1983) |
| 4 | | M. C. Er:
Computing Sums of Order-k Fibonacci Numbers in Log Time.
Inf. Process. Lett. 17(1): 1-5 (1983) |
| 3 | | M. C. Er:
Optimizing Procedure Calls and Returns.
Softw., Pract. Exper. 13(10): 921-939 (1983) |
| 1982 |
|---|
| 2 | | M. C. Er,
Barry G. T. Lowden:
The Theory and Practice of Constructing an Optimal Polyphase Sort.
Comput. J. 25(1): 93-101 (1982) |
| 1 | | M. C. Er:
A Representation Approach to the Tower of Hanoi Problem.
Comput. J. 25(4): 442-447 (1982) |
