M. C. Er - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

1995

The anonymity and proximity factors in group decision support systemsM. C. Er, A. C. Ng. dss, 14(1):75-83, 1995. [doi]

1992

Fast computation of solutions of linear difference equations by Er s ruleM. C. Er. isci, 62(1-2):1-11, 1992. [doi]

Efficient Generation of k-ary Trees in Natural Order (Short Note)M. C. Er. cj, 35(3):306-308, 1992.

1989

A Linear space algorithm for solving the towers of hanoi problem by using a virtual discM. C. Er. isci, 47(1):47-52, 1989. [doi]

A New Algorithm for Generating Binary Trees Using RotationsM. C. Er. cj, 32(5):470-473, 1989.

Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered TreesM. C. Er. cj, 32(1):76-85, 1989.

1988

A Fast Algorithm for Generating Set PartitionsM. C. Er. cj, 31(3):283-284, 1988.

An optimal algorithm for Reve s puzzleM. C. Er. isci, 45(1):39-49, 1988. [doi]

A Simple Algorithm for Generating Non-Regular Trees in Lexicographic OrderM. C. Er. cj, 31(1):61-64, 1988.

A Smooth Reshuffling Algorithm for Solving the Bulterman s ProblemM. C. Er. cj, 31(6):557-560, 1988.

Decision Support Systems: A summary, problems, and future trendsM. C. Er. dss, 4(3):355-363, 1988. [doi]

1987

Lexicographic Listing and Ranking of t-Ary TreesM. C. Er. cj, 30(6):569-572, 1987.

A General Algorithm for Finding a Shortest Path between two n-ConfigurationsM. C. Er. isci, 42(2):137-141, 1987. [doi]

A loopless and optimal algorithm for the cyclic towers of hanoi problemM. C. Er. isci, 42(3):283-287, 1987. [doi]

An Efficient Implementation of Permutation Backtracking in Lexicographic OrderM. C. Er. cj, 30(3):282, 1987.

1986

The Use of Termination Indicators in Computer ProgrammingM. C. Er. cj, 29(5):430-433, 1986.

Efficient generation of binary trees from inorder-postorder sequencesM. C. Er. isci, 40(2):175-181, 1986. [doi]

Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi problemM. C. Er. computing, 37(2):93-102, 1986. [doi]

1985

Remark on Algorithm 246: Graycode [Z] M. C. Er. TOMS, 11(4):441-443, 1985. [doi]

Practical Considerations of Global and Local VariablesM. C. Er. SPE, 15(5):499-502, 1985.

Enumerating Ordered Trees LexicographicallyM. C. Er. cj, 28(5):538-542, 1985.

The Complexity of the Generalised Cyclic Towers of Hanoi ProblemM. C. Er. jal, 6(3):351-358, 1985.

1984

On the Complexity of Recursion in Problem-SolvingM. C. Er. ijmms, 20(6):537-544, 1984.

The Colour Towers of Hanoi: A GeneralizationM. C. Er. cj, 27(1):80-82, 1984.

The Cyclic Towers of Hanoi: A Representation ApproachM. C. Er. cj, 27(2):171-175, 1984.

The Generalized Colour Towers of Hanoi: An Iterative AlgorithmM. C. Er. cj, 27(3):278-282, 1984.

An iterative algorithm for the cyclic Towers of Hanoi problemM. C. Er. ijpp, 13(2):123-129, 1984. [doi]

1983

An Iterative Solution to the Generalized Towers of Hanoi ProblemM. C. Er. bit, 23(3):295-302, 1983.

An Analysis of the Generalized Towers of Hanoi ProblemM. C. Er. bit, 23(4):429-435, 1983.

A Note on Generating Well-Formed Parenthesis Strings LexicographicallyM. C. Er. cj, 26(3):205-207, 1983.

A Fast Algorithm for Computing Order-K Fibonacci NumbersM. C. Er. cj, 26(3):224-227, 1983.

A Parallel Computation Approach to Topological SortingM. C. Er. cj, 26(4):293-295, 1983.

Optimizing Procedure Calls and ReturnsM. C. Er. SPE, 13(10):921-939, 1983.

Computing Sums of Order-k Fibonacci Numbers in Log TimeM. C. Er. ipl, 17(1):1-5, 1983.

1982

The Theory and Practice of Constructing an Optimal Polyphase SortM. C. Er, Barry G. T. Lowden. cj, 25(1):93-101, 1982.

A Representation Approach to the Tower of Hanoi ProblemM. C. Er. cj, 25(4):442-447, 1982.

Sign in or sign up to see more results.

runs on WebDSL