Er, M. C. Fast computation of solutions of linear difference equations by Er’s rule. (English) Zbl 0762.65088 Inf. Sci. 62, No. 1-2, 1-11 (1992). Reviewer: J.Kalinowski (Katowice) MSC: 65Q05 39A10 PDFBibTeX XMLCite \textit{M. C. Er}, Inf. Sci. 62, No. 1--2, 1--11 (1992; Zbl 0762.65088) Full Text: DOI
Er, M. C. Efficient enumeration of cyclic permutations in situ. (English) Zbl 0673.05003 Int. J. Comput. Math. 29, No. 2-4, 121-129 (1989). MSC: 05A05 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 29, No. 2--4, 121--129 (1989; Zbl 0673.05003) Full Text: DOI
Er, M. C. A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc. (English) Zbl 0666.68034 Inf. Sci. 47, No. 1, 47-52 (1989). MSC: 68Q25 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, Inf. Sci. 47, No. 1, 47--52 (1989; Zbl 0666.68034) Full Text: DOI
Er, M. C. A minimal space algorithm for solving the towers of Hanoi problem. (English) Zbl 0719.68030 J. Inf. Optim. Sci. 9, No. 2, 183-191 (1988). MSC: 68Q25 68R05 05A99 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 9, No. 2, 183--191 (1988; Zbl 0719.68030) Full Text: DOI
Er, M. C. An \(O(k^ 2\log (n/k))\) algorithm for computing generalized order-k Fibonacci numbers with linear space. (English) Zbl 0665.10007 J. Inf. Optim. Sci. 9, No. 3, 343-353 (1988). Reviewer: M.D.Hendy MSC: 11B37 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 9, No. 3, 343--353 (1988; Zbl 0665.10007) Full Text: DOI
Er, M. C. An optimal algorithm for Reve’s puzzle. (English) Zbl 0661.68062 Inf. Sci. 45, No. 1, 39-49 (1988). MSC: 68R99 05A99 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, Inf. Sci. 45, No. 1, 39--49 (1988; Zbl 0661.68062) Full Text: DOI
Er, M. C. A parallel algorithm for cost-optimal generation of permutations of r out of n items. (English) Zbl 0647.68072 J. Inf. Optim. Sci. 9, No. 1, 53-56 (1988). MSC: 68R99 05-04 68Q25 05A05 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 9, No. 1, 53--56 (1988; Zbl 0647.68072) Full Text: DOI
Er, M. C. Ranking and unranking of non-regular trees. (English) Zbl 0647.68066 J. Inf. Optim. Sci. 9, No. 1, 57-64 (1988). MSC: 68R10 05C05 68W99 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 9, No. 1, 57--64 (1988; Zbl 0647.68066) Full Text: DOI
Er, M. C. Lexicographic enumeration, ranking and unranking of permutations of r out of n objects. (English) Zbl 0656.68075 Int. J. Comput. Math. 23, No. 1, 1-7 (1987). MSC: 68R99 05A05 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 23, No. 1, 1--7 (1987; Zbl 0656.68075) Full Text: DOI
Er, M. C. On enumerating tree permutations in natural order. (English) Zbl 0656.68074 Int. J. Comput. Math. 22, No. 2, 105-115 (1987). MSC: 68R99 68P05 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 22, No. 2, 105--115 (1987; Zbl 0656.68074) Full Text: DOI
Er, M. C. Counter examples of adjudicating a Towers of Hanoi contest. (English) Zbl 0656.68073 Int. J. Comput. Math. 21, No. 2, 123-131 (1987). MSC: 68R99 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 21, No. 2, 123--131 (1987; Zbl 0656.68073) Full Text: DOI
Er, M. C. A general algorithm for finding a shortest path between two n- configurations. (English) Zbl 0636.68039 Inf. Sci. 42, 137-141 (1987). MSC: 68Q25 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, Inf. Sci. 42, 137--141 (1987; Zbl 0636.68039) Full Text: DOI
Er, M. C. An algorithmic solution to the multi-tower Hanoi problem. (English) Zbl 0626.05002 J. Inf. Optim. Sci. 8, 91-100 (1987). MSC: 05A99 05-04 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 8, 91--100 (1987; Zbl 0626.05002) Full Text: DOI
Er, M. C. A loopless approach for constructing a fastest algorithm for the Towers of Hanoi problem. (English) Zbl 0655.68094 Int. J. Comput. Math. 20, No. 1, 49-54 (1986). MSC: 68R99 68N01 68W99 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 20, No. 1, 49--54 (1986; Zbl 0655.68094) Full Text: DOI
Er, M. C. A new programming technique derived from Dijkstra’s methodology. (English) Zbl 0608.68007 J. Inf. Optim. Sci. 7, 279-290 (1986). MSC: 68N01 68P10 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 7, 279--290 (1986; Zbl 0608.68007) Full Text: DOI
Er, M. C. The cyclic Towers of Hanoi and pseudo ternary codes. (English) Zbl 0605.68064 J. Inf. Optim. Sci. 7, 271-277 (1986). MSC: 68R99 05A99 94B60 68Q25 91A99 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 7, 271--277 (1986; Zbl 0605.68064) Full Text: DOI
Er, M. C. Generation, ranking and unranking of permutations based on the mixed- radix codes. (English) Zbl 0597.05002 J. Inf. Optim. Sci. 7, 105-111 (1986). MSC: 05A05 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 7, 105--111 (1986; Zbl 0597.05002) Full Text: DOI
Er, M. C. A formal derivation of an \(O(\log n)\) algorithm for computing Fibonacci numbers. (English) Zbl 0587.10001 J. Inf. Optim. Sci. 7, 9-15 (1986). Reviewer: M. C. Er MSC: 11Y55 11-04 11B39 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 7, 9--15 (1986; Zbl 0587.10001) Full Text: DOI
Er, M. C. Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem. (English) Zbl 0586.68037 Computing 37, 93-102 (1986). MSC: 68Q25 68W99 PDFBibTeX XMLCite \textit{M. C. Er}, Computing 37, 93--102 (1986; Zbl 0586.68037) Full Text: DOI
Er, M. C. Formal techniques for deriving binary search algorithms. (English) Zbl 0593.68026 J. Inf. Optim. Sci. 6, 201-212 (1985). MSC: 68W99 68P10 68Q60 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 6, 201--212 (1985; Zbl 0593.68026) Full Text: DOI
Er, M. C. The Towers of Hanoi and binary numerals. (English) Zbl 0578.68054 J. Inf. Optim. Sci. 6, 147-152 (1985). MSC: 68R99 05A15 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 6, 147--152 (1985; Zbl 0578.68054) Full Text: DOI
Er, M. C. Lexicographic enumeration of k-ary trees. (English) Zbl 0572.68056 J. Inf. Optim. Sci. 6, 137-145 (1985). MSC: 68R10 05C05 05C30 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 6, 137--145 (1985; Zbl 0572.68056) Full Text: DOI
Er, M. C. An iterative algorithm for the cyclic Towers of Hanoi problem. (English) Zbl 0555.68041 Int. J. Comput. Inform. Sci. 13, 123-129 (1984). MSC: 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Inform. Sci. 13, 123--129 (1984; Zbl 0555.68041) Full Text: DOI
Er, M. C. The colour Towers of Hanoi - an iterative solution. (English) Zbl 0542.68056 J. Inf. Optim. Sci. 5, 95-104 (1984). MSC: 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 5, 95--104 (1984; Zbl 0542.68056) Full Text: DOI
Er, M. C. The generalized Towers of Hanoi problem. (English) Zbl 0542.68055 J. Inf. Optim. Sci. 5, 89-94 (1984). MSC: 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, J. Inf. Optim. Sci. 5, 89--94 (1984; Zbl 0542.68055) Full Text: DOI
Er, M. C. A generalization of the cyclic Towers of Hanoi: An iterative solution. (English) Zbl 0535.68032 Int. J. Comput. Math. 15, 129-140 (1984). MSC: 68R99 PDFBibTeX XMLCite \textit{M. C. Er}, Int. J. Comput. Math. 15, 129--140 (1984; Zbl 0535.68032) Full Text: DOI
Er, M. C. An analysis of the generalized Towers of Hanoi problem. (English) Zbl 0523.68057 BIT 23, 429-435 (1983). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{M. C. Er}, BIT 23, 429--435 (1983; Zbl 0523.68057) Full Text: DOI
Er, M. C. An iterative solution to the generalized Towers of Hanoi problem. (English) Zbl 0513.68082 BIT 23, 295-302 (1983). MSC: 68U99 PDFBibTeX XMLCite \textit{M. C. Er}, BIT 23, 295--302 (1983; Zbl 0513.68082) Full Text: DOI