scientific article; zbMATH DE number 3802822
From MaRDI portal
Publication:4746796
zbMath0508.68040MaRDI QIDQ4746796
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items (17)
Complexity of a determinate algorithm for the discrete logarithm ⋮ Algebra of algorithms and Kaluzhnin's graph-schemas ⋮ Parallel merging sorting using comparison matrices. I ⋮ Multilevel block design of discrete devices using algorithmic algebras ⋮ Algebraic-grammatical models of parallel computation ⋮ Fibonacci linear forms and parallel arithmetic algorithms for large numbers ⋮ Parallel merge sort using comparison matrices. II ⋮ The method of global equilibrium search ⋮ Information storage and search complexity theory ⋮ Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics ⋮ Tight bounds for online stable sorting ⋮ Bias of a nonparametric entropy estimator for Markov measures ⋮ Integrated tools for design and synthesis of classes of algorithms and programs ⋮ A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement ⋮ Some mathematical and software tools for the development of special-purpose expert systems ⋮ Unnamed Item ⋮ Computer implementation of efficient discrete-convolution algorithms
This page was built for publication:
