The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

M. C. Er: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. M. C. Er
    An Analysis of the Generalized Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    BIT, 1983, v:23, n:4, pp:429-435 [Journal]
  2. M. C. Er
    An Iterative Solution to the Generalized Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    BIT, 1983, v:23, n:3, pp:295-302 [Journal]
  3. M. C. Er
    A Representation Approach to the Tower of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1982, v:25, n:4, pp:442-447 [Journal]
  4. M. C. Er
    A Note on Generating Well-Formed Parenthesis Strings Lexicographically. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1983, v:26, n:3, pp:205-207 [Journal]
  5. M. C. Er
    A Fast Algorithm for Computing Order-K Fibonacci Numbers. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1983, v:26, n:3, pp:224-227 [Journal]
  6. M. C. Er
    A Parallel Computation Approach to Topological Sorting. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1983, v:26, n:4, pp:293-295 [Journal]
  7. M. C. Er
    The Colour Towers of Hanoi: A Generalization. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1984, v:27, n:1, pp:80-82 [Journal]
  8. M. C. Er
    The Cyclic Towers of Hanoi: A Representation Approach. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1984, v:27, n:2, pp:171-175 [Journal]
  9. M. C. Er
    The Generalized Colour Towers of Hanoi: An Iterative Algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1984, v:27, n:3, pp:278-282 [Journal]
  10. M. C. Er
    Enumerating Ordered Trees Lexicographically. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1985, v:28, n:5, pp:538-542 [Journal]
  11. M. C. Er
    The Use of Termination Indicators in Computer Programming. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1986, v:29, n:5, pp:430-433 [Journal]
  12. M. C. Er
    An Efficient Implementation of Permutation Backtracking in Lexicographic Order. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:3, pp:282- [Journal]
  13. M. C. Er
    Lexicographic Listing and Ranking of t-Ary Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:6, pp:569-572 [Journal]
  14. M. C. Er
    A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:61-64 [Journal]
  15. M. C. Er
    A Fast Algorithm for Generating Set Partitions. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:3, pp:283-284 [Journal]
  16. M. C. Er
    A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:6, pp:557-560 [Journal]
  17. M. C. Er
    Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:1, pp:76-85 [Journal]
  18. M. C. Er
    A New Algorithm for Generating Binary Trees Using Rotations. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:5, pp:470-473 [Journal]
  19. M. C. Er
    Efficient Generation of k-ary Trees in Natural Order (Short Note). [Citation Graph (0, 0)][DBLP]
    Comput. J., 1992, v:35, n:3, pp:306-308 [Journal]
  20. M. C. Er, Barry G. T. Lowden
    The Theory and Practice of Constructing an Optimal Polyphase Sort. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1982, v:25, n:1, pp:93-101 [Journal]
  21. M. C. Er
    On the Complexity of Recursion in Problem-Solving. [Citation Graph (0, 0)][DBLP]
    International Journal of Man-Machine Studies, 1984, v:20, n:6, pp:537-544 [Journal]
  22. M. C. Er
    Computing Sums of Order-k Fibonacci Numbers in Log Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:1, pp:1-5 [Journal]
  23. M. C. Er
    Efficient generation of binary trees from inorder-postorder sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1986, v:40, n:2, pp:175-181 [Journal]
  24. M. C. Er
    A General Algorithm for Finding a Shortest Path between two n-Configurations. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1987, v:42, n:2, pp:137-141 [Journal]
  25. M. C. Er
    A loopless and optimal algorithm for the cyclic towers of hanoi problem. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1987, v:42, n:3, pp:283-287 [Journal]
  26. M. C. Er
    An optimal algorithm for Reve's puzzle. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1988, v:45, n:1, pp:39-49 [Journal]
  27. M. C. Er
    A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1989, v:47, n:1, pp:47-52 [Journal]
  28. M. C. Er
    Fast computation of solutions of linear difference equations by Er's rule. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:62, n:1-2, pp:1-11 [Journal]
  29. M. C. Er
    The Complexity of the Generalised Cyclic Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:351-358 [Journal]
  30. M. C. Er
    Optimizing Procedure Calls and Returns. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1983, v:13, n:10, pp:921-939 [Journal]
  31. M. C. Er
    Practical Considerations of Global and Local Variables. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1985, v:15, n:5, pp:499-502 [Journal]
  32. M. C. Er
    Remark on "Algorithm 246: Graycode [Z]". [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1985, v:11, n:4, pp:441-443 [Journal]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002