• Publications
  • Influence
On Sum Coloring of Graphs with Parallel Genetic Algorithms
TLDR
The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can be efficiently used for computing approximate sum colorings and finding upper bounds for chromatic sums and chromatic sum numbers for hard---to---color graphs. Expand
  • 37
  • 9
  • PDF
On Parallel Generation of t-Ary Trees in an Associative Model
TLDR
In this paper a new parallel algorithm is presented for generation of t-ary trees. Expand
  • 10
  • 2
  • PDF
Parallel Genetic Algorithm for Graph Coloring Problem
TLDR
In this paper a new parallel genetic algorithm for coloring graph vertices is presented. Expand
  • 23
  • 1
  • PDF
On Parallel Generation of Combinations in Associative Processor Architectures
TLDR
In this paper two new parallel algorithms are presented for generation of (n,k)-combinations. Expand
  • 11
  • 1
  • PDF
Algorithms for Unranking Combinations and their Applications
  • Z. Kokosinski
  • Computer Science
  • Parallel and Distributed Computing and Systems
  • 1995
  • 9
  • 1
B11: A hardware implementation of a generator of (n,k)–combinations
TLDR
This paper presents a hardware implementation of a generator of combinations based on parallel algorithm Bincombgen that generates, in binary representation, all combinations in reverse lexicographic order in constant time per combination. Expand
  • 3
  • 1
On Parallel Generation of Partial Derangements, Derangements and Permutations
TLDR
The concept of a partial derangement is introduced and a versatile representation of partial Derangements is proposed with permutations and derangements as special cases. Expand
  • 3
  • 1
  • PDF
Functional decomposition of combinational logic circuits with PKmin
TLDR
An application of the PKmin program for functional decomposition of multiinput multi-output combinational circuits is presented. Expand
  • 2
  • 1
  • PDF
On generation of permutations through decomposition of symmetric groups into cosets
  • Z. Kokosinski
  • Mathematics, Computer Science
  • BIT Comput. Sci. Sect.
  • 1 November 1990
TLDR
A hardware-oriented algorithm for generating permutations is presented that takes as a theoretic base an iterative decomposition of the symmetric group S~ into cosets. Expand
  • 22
  • PDF
Mask and Pattern Generation for Associative Supercomputing
  • 9
...
1
2
3
4
5
...