Algorithmization of algebras and relational structures
Algorithms. 34. STUDENT. An algorithm for Student’s -test without application of critical values
Algorithms. 36. SNEDECOR. An algorithm for Fisher-Snedecor’s -test without application of critical values
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations
Algorithms and experiments for the Webgraph.
Algorithms for Classification based on k-NN.
Algorithms for cluster busting in anchored graph drawing.
Algorithms for determining the model structure of a controlled system
Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.Two heuristic algorithms (M65 and M52) for finding respectively unitals and maximal arcs in projective planes of order 16 are described. The exact algorithms based on exhaustive search are impractical because of the combinatorial explosion (huge number of combinations to be checked). Algorithms M65 and M52 use unions of orbits...
Algorithms for Ham Sandwich Cuts.
Algorithms for incremental orthogonal graph drawing in three dimensions.
Algorithms for permutability in finite groups
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
Algorithms for single link failure recovery and related problems.
Algorithms for weighted graph problems on the modified cellular graph automaton
Algoritmy a počítací stroje
Algoritmy a počítací stroje [Dokončení]
All Bézier curves are attractors of iterated function systems.
Almost curvature continuous fitting of B-spline surfaces.
Almost Optimal Set Covers in Finite VC-Dimension.
Almost Tight Bounds for e-Nets.