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