default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. C. Er
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[j36]M. C. Er, A. C. Ng:
The anonymity and proximity factors in group decision support systems. Decis. Support Syst. 14(1): 75-83 (1995)- 1992
- [j35]M. C. Er:
Efficient Generation of k-ary Trees in Natural Order (Short Note). Comput. J. 35(3): 306-308 (1992) - [j34]M. C. Er:
Fast computation of solutions of linear difference equations by Er's rule. Inf. Sci. 62(1-2): 1-11 (1992)
1980 – 1989
- 1989
- [j33]M. C. Er:
Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees. Comput. J. 32(1): 76-85 (1989) - [j32]M. C. Er:
A New Algorithm for Generating Binary Trees Using Rotations. Comput. J. 32(5): 470-473 (1989) - [j31]M. C. Er:
A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc. Inf. Sci. 47(1): 47-52 (1989) - 1988
- [j30]M. C. Er:
A Simple Algorithm for Generating Non-Regular Trees in Lexicographic Order. Comput. J. 31(1): 61-64 (1988) - [j29]M. C. Er:
A Fast Algorithm for Generating Set Partitions. Comput. J. 31(3): 283-284 (1988) - [j28]M. C. Er:
A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem. Comput. J. 31(6): 557-560 (1988) - [j27]M. C. Er:
Decision Support Systems: A summary, problems, and future trends. Decis. Support Syst. 4(3): 355-363 (1988) - [j26]M. C. Er:
An optimal algorithm for Reve's puzzle. Inf. Sci. 45(1): 39-49 (1988) - 1987
- [j25]M. C. Er:
An Efficient Implementation of Permutation Backtracking in Lexicographic Order. Comput. J. 30(3): 282 (1987) - [j24]M. C. Er:
Lexicographic Listing and Ranking of t-Ary Trees. Comput. J. 30(6): 569-572 (1987) - [j23]M. C. Er:
A General Algorithm for Finding a Shortest Path between two n-Configurations. Inf. Sci. 42(2): 137-141 (1987) - [j22]M. C. Er:
A loopless and optimal algorithm for the cyclic towers of hanoi problem. Inf. Sci. 42(3): 283-287 (1987) - 1986
- [j21]M. C. Er:
The Use of Termination Indicators in Computer Programming. Comput. J. 29(5): 430-433 (1986) - [j20]M. C. Er:
Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi problem. Computing 37(2): 93-102 (1986) - [j19]M. C. Er:
Efficient generation of binary trees from inorder-postorder sequences. Inf. Sci. 40(2): 175-181 (1986) - 1985
- [j18]M. C. Er:
Enumerating Ordered Trees Lexicographically. Comput. J. 28(5): 538-542 (1985) - [j17]M. C. Er:
The Complexity of the Generalised Cyclic Towers of Hanoi Problem. J. Algorithms 6(3): 351-358 (1985) - [j16]M. C. Er:
Practical Considerations of Global and Local Variables. Softw. Pract. Exp. 15(5): 499-502 (1985) - [j15]M. C. Er:
Remark on "Algorithm 246: Graycode [Z]". ACM Trans. Math. Softw. 11(4): 441-443 (1985) - 1984
- [j14]M. C. Er:
The Colour Towers of Hanoi: A Generalization. Comput. J. 27(1): 80-82 (1984) - [j13]M. C. Er:
The Cyclic Towers of Hanoi: A Representation Approach. Comput. J. 27(2): 171-175 (1984) - [j12]M. C. Er:
The Generalized Colour Towers of Hanoi: An Iterative Algorithm. Comput. J. 27(3): 278-282 (1984) - [j11]M. C. Er:
On the Complexity of Recursion in Problem-Solving. Int. J. Man Mach. Stud. 20(6): 537-544 (1984) - [j10]M. C. Er:
An iterative algorithm for the cyclic Towers of Hanoi problem. Int. J. Parallel Program. 13(2): 123-129 (1984) - 1983
- [j9]M. C. Er:
An Iterative Solution to the Generalized Towers of Hanoi Problem. BIT 23(3): 295-302 (1983) - [j8]M. C. Er:
An Analysis of the Generalized Towers of Hanoi Problem. BIT 23(4): 429-435 (1983) - [j7]M. C. Er:
A Note on Generating Well-Formed Parenthesis Strings Lexicographically. Comput. J. 26(3): 205-207 (1983) - [j6]M. C. Er:
A Fast Algorithm for Computing Order-K Fibonacci Numbers. Comput. J. 26(3): 224-227 (1983) - [j5]M. C. Er:
A Parallel Computation Approach to Topological Sorting. Comput. J. 26(4): 293-295 (1983) - [j4]M. C. Er:
Computing Sums of Order-k Fibonacci Numbers in Log Time. Inf. Process. Lett. 17(1): 1-5 (1983) - [j3]M. C. Er:
Optimizing Procedure Calls and Returns. Softw. Pract. Exp. 13(10): 921-939 (1983) - 1982
- [j2]M. C. Er, Barry G. T. Lowden:
The Theory and Practice of Constructing an Optimal Polyphase Sort. Comput. J. 25(1): 93-101 (1982) - [j1]M. C. Er:
A Representation Approach to the Tower of Hanoi Problem. Comput. J. 25(4): 442-447 (1982)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
