An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
An algorithm for calculation of (+, *) - expressions with natural numbers
An algorithm for deciding if a polyomino tiles the plane
For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.
An algorithm for extending functions in hypercubes.
An algorithm for finding a minimal recursive path ordering
An algorithm for optimal partitioning of a graph
An algorithm for reduction of complexity of relations in a system of variables
Let us have a system of variables, among which there are complicated dependences. Assuming reflexivity and transitivity of the relation " depends on ", a simple algorithm is proposed which produces all dependences in an optimized way, without losing information.
An Algorithm for the Detection of Move Repetition Without the Use of Hash-Keys
An algorithm for the solution of fixed-point equations for infinite words
An algorithm to calculate the kernel of certain polynomial ring homomorphisms.
An algorithm to compute the möbius function of the rotation lattice of binary trees
An Algorithmic Approach to Inferring Cross-Ontology Links while Mapping Anatomical Ontologies
ACM Computing Classification System (1998): J.3.Automated and semi-automated mapping and the subsequently merging of two (or more) anatomical ontologies can be achieved by (at least) two direct procedures. The first concerns syntactic matching between the terms of the two ontologies; in this paper, we call this direct matching (DM). It relies on identities between the terms of the two input ontologies in order to establish cross-ontology links between them. The second involves consulting one or...
An almost naive algorithm for finding relative neighbourhood graphs in metrics
An alternative approach to missing information in the GUHA method
An alternative approach to rough sets
An alternative formulation of the factorization conjecture for codes. (Une formulation alternative de la conjecture de factorisation des codes.)
An analogue of the Thue-Morse sequence.
An analysis of Lambek's production machines
An analysis of programs by algebraic means
An analysis of selection sort using recurrence relations.
This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm...