M. C. Er

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Research on flow shop scheduling problem based on improved genetic algorithm	2008-08-06	Paper
Efficient Generation of k-ary Trees in Natural Order The Computer Journal	1993-01-16	Paper
Fast computation of solutions of linear difference equations by Er's rule Information Sciences	1992-06-28	Paper
A Taxonomy of Software Development Environments and their Applicabilities to Supporting Evolutionary Information Systems Development Journal of Information and Optimization Sciences	1990-01-01	Paper
A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc Information Sciences	1989-01-01	Paper
Efficient enumeration of cyclic permutations in situ International Journal of Computer Mathematics	1989-01-01	Paper
A New Algorithm for Generating Binary Trees using Rotations The Computer Journal	1989-01-01	Paper
Classes of Admissible Permutations that are Generatable by Depth-first Traversals of Ordered Trees The Computer Journal	1989-01-01	Paper
A Fast Algorithm for Generating Set Partitions The Computer Journal	1988-01-01	Paper
A Minimal Space Algorithm for Solving the Towers of Hanoi Problem Journal of Information and Optimization Sciences	1988-01-01	Paper
A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order The Computer Journal	1988-01-01	Paper
A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems Journal of Information and Optimization Sciences	1988-01-01	Paper
An optimal algorithm for Reve's puzzle Information Sciences	1988-01-01	Paper
The Weakest Libera! Preconditions of Nondeterministic Machines and Robust Programs Journal of Information and Optimization Sciences	1988-01-01	Paper
Ranking and Unranking of Non-regular Trees Journal of Information and Optimization Sciences	1988-01-01	Paper
Derivation of Identity Equations of the Order-k Fibonacci Numbers Journal of Information and Optimization Sciences	1988-01-01	Paper
A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem The Computer Journal	1988-01-01	Paper
An O(k²log(n/k)) Algorithm for Computing Generalized Order-k Fibonacci Numbers with Linear Space Journal of Information and Optimization Sciences	1988-01-01	Paper
An Algorithmic Solution to the Multi-tower Hanoi Problem Journal of Information and Optimization Sciences	1987-01-01	Paper
A general algorithm for finding a shortest path between two n- configurations Information Sciences	1987-01-01	Paper
Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order The Computer Journal	1987-01-01	Paper
Counter examples to adjudicating a towers of hanoi contest International Journal of Computer Mathematics	1987-01-01	Paper
On enumerating tree permutations in natural order International Journal of Computer Mathematics	1987-01-01	Paper
Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects International Journal of Computer Mathematics	1987-01-01	Paper
Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order The Computer Journal	1987-01-01	Paper
Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem Computing	1986-01-01	Paper
Efficient generation of binary trees from inorder-postorder sequences Information Sciences	1986-01-01	Paper
A loopless approach for constructing a fastest algorithm for the towers of hanoi problem International Journal of Computer Mathematics	1986-01-01	Paper
A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers Journal of Information and Optimization Sciences	1986-01-01	Paper
Some Variants of the Weakest Precondition in Nondeterminism Journal of Information and Optimization Sciences	1986-01-01	Paper
Generation, Ranking and Unranking of Permutations based on the Mixed-Radix Codes Journal of Information and Optimization Sciences	1986-01-01	Paper
The Use of Termination Indicators in Computer Programming The Computer Journal	1986-01-01	Paper
Lexicographical Ordering of k-Subsets of a Set Journal of Information and Optimization Sciences	1986-01-01	Paper
The Cyclic Towers of Hanoi and Pseudo Ternary Codes Journal of Information and Optimization Sciences	1986-01-01	Paper
A New Programming Technique Derived from Dijkstra’s Methodology Journal of Information and Optimization Sciences	1986-01-01	Paper
The complexity of the generalised cyclic Towers of Hanoi problem Journal of Algorithms	1985-01-01	Paper
Lexicographic ordering, ranking and unranking of combinations International Journal of Computer Mathematics	1985-01-01	Paper
Lexicographic Enumeration of k-ary Trees Journal of Information and Optimization Sciences	1985-01-01	Paper
The Towers of Hanoi and Binary Numerals Journal of Information and Optimization Sciences	1985-01-01	Paper
Fast Computation of Fibonacci Numbers and Their Sums Journal of Information and Optimization Sciences	1985-01-01	Paper
Enumerating Ordered Trees Lexicographically The Computer Journal	1985-01-01	Paper
Formal Techniques for Deriving Binary Search Algorithms Journal of Information and Optimization Sciences	1985-01-01	Paper
scientific article; zbMATH DE number 3857208 (Why is no real title available?)	1984-01-01	Paper
An iterative algorithm for the cyclic Towers of Hanoi problem International Journal of Computer & Information Sciences	1984-01-01	Paper
The Generalized Towers of Hanoi Problem Journal of Information and Optimization Sciences	1984-01-01	Paper
The Cyclic Towers of Hanoi: A Representation Approach The Computer Journal	1984-01-01	Paper
On Generating the N-ary Reflected Gray Codes IEEE Transactions on Computers	1984-01-01	Paper
A generalization of the cyclic towers of hanoi: an iterative solution International Journal of Computer Mathematics	1984-01-01	Paper
The Generalized Colour Towers of Hanoi: An Iterative Algorithm The Computer Journal	1984-01-01	Paper
scientific article; zbMATH DE number 3857295 (Why is no real title available?)	1984-01-01	Paper
The Colour Towers of Hanoi – An Iterative Solution Journal of Information and Optimization Sciences	1984-01-01	Paper
A Note on Generating Well-formed Parenthesis Strings Lexicographically The Computer Journal	1983-01-01	Paper
Computing sums of order-k Fibonacci numbers in log time Information Processing Letters	1983-01-01	Paper
A Fast Algorithm for Computing Order-K Fibonacci Numbers The Computer Journal	1983-01-01	Paper
An iterative solution to the generalized Towers of Hanoi problem BIT	1983-01-01	Paper
An analysis of the generalized Towers of Hanoi problem BIT	1983-01-01	Paper
Optimizing procedure calls and returns Software: Practice and Experience	1983-01-01	Paper
A Parallel Computation Approach to Topological Sorting The Computer Journal	1983-01-01	Paper
A Representation Approach to the Tower of Hanoi Problem The Computer Journal	1982-01-01	Paper

Research outcomes over time

This page was built for person: M. C. Er