M. C. Er

36 papers Journal 36
YearRankTypeTitle / Venue / Authors
1995 J jnl
The anonymity and proximity factors in group decision support systems.
Decis. Support Syst.
M. C. Er, A. C. Ng
1992 J jnl
Efficient Generation of k-ary Trees in Natural Order (Short Note).
Comput. J.
M. C. Er
1992 J jnl
Fast computation of solutions of linear difference equations by Er's rule.
Inf. Sci.
M. C. Er
1989 J jnl
A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc.
Inf. Sci.
M. C. Er
1989 J jnl
A New Algorithm for Generating Binary Trees Using Rotations.
Comput. J.
M. C. Er
1989 J jnl
Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees.
Comput. J.
M. C. Er
1988 J jnl
A Fast Algorithm for Generating Set Partitions.
Comput. J.
M. C. Er
1988 J jnl
A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order.
Comput. J.
M. C. Er
1988 J jnl
A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem.
Comput. J.
M. C. Er
1988 J jnl
An optimal algorithm for Reve's puzzle.
Inf. Sci.
M. C. Er
1988 J jnl
Decision Support Systems: A summary, problems, and future trends.
Decis. Support Syst.
M. C. Er
1987 J jnl
A General Algorithm for Finding a Shortest Path between two n-Configurations.
Inf. Sci.
M. C. Er
1987 J jnl
A loopless and optimal algorithm for the cyclic towers of hanoi problem.
Inf. Sci.
M. C. Er
1987 J jnl
An Efficient Implementation of Permutation Backtracking in Lexicographic Order.
Comput. J.
M. C. Er
1987 J jnl
Lexicographic Listing and Ranking of t-Ary Trees.
Comput. J.
M. C. Er
1986 J jnl
Efficient generation of binary trees from inorder-postorder sequences.
Inf. Sci.
M. C. Er
1986 J jnl
Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi problem.
Computing
M. C. Er
1986 J jnl
The Use of Termination Indicators in Computer Programming.
Comput. J.
M. C. Er
1985 J jnl
Enumerating Ordered Trees Lexicographically.
Comput. J.
M. C. Er
1985 J jnl
Practical Considerations of Global and Local Variables.
Softw. Pract. Exp.
M. C. Er
1985 J jnl
Remark on "Algorithm 246: Graycode [Z]".
ACM Trans. Math. Softw.
M. C. Er
1985 J jnl
The Complexity of the Generalised Cyclic Towers of Hanoi Problem.
J. Algorithms
M. C. Er
1984 J jnl
An iterative algorithm for the cyclic Towers of Hanoi problem.
Int. J. Parallel Program.
M. C. Er
1984 J jnl
On the Complexity of Recursion in Problem-Solving.
Int. J. Man Mach. Stud.
M. C. Er
1984 J jnl
The Colour Towers of Hanoi: A Generalization.
Comput. J.
M. C. Er
1984 J jnl
The Cyclic Towers of Hanoi: A Representation Approach.
Comput. J.
M. C. Er
1984 J jnl
The Generalized Colour Towers of Hanoi: An Iterative Algorithm.
Comput. J.
M. C. Er
1983 J jnl
A Fast Algorithm for Computing Order-K Fibonacci Numbers.
Comput. J.
M. C. Er
1983 J jnl
A Note on Generating Well-Formed Parenthesis Strings Lexicographically.
Comput. J.
M. C. Er
1983 J jnl
A Parallel Computation Approach to Topological Sorting.
Comput. J.
M. C. Er
1983 J jnl
An Analysis of the Generalized Towers of Hanoi Problem.
BIT
M. C. Er
1983 J jnl
An Iterative Solution to the Generalized Towers of Hanoi Problem.
BIT
M. C. Er
1983 J jnl
Computing Sums of Order-k Fibonacci Numbers in Log Time.
Inf. Process. Lett.
M. C. Er
1983 J jnl
Optimizing Procedure Calls and Returns.
Softw. Pract. Exp.
M. C. Er
1982 J jnl
A Representation Approach to the Tower of Hanoi Problem.
Comput. J.
M. C. Er
1982 J jnl
The Theory and Practice of Constructing an Optimal Polyphase Sort.
Comput. J.
M. C. Er, Barry G. T. Lowden