Search results for "M. C. Er"

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

Publications of "M. C. Er" ( http://dblp.L3S.de/Authors/M._C._Er )