**Ivan Stojmenovic: List
of publications**** **

**Combinatorial Algorithms** (intensive 1990-1996)

Combinatorial algorithms are designed using sequential and parallel models of computation. We studied generating combinatorial objects such as combinations, permutations, subsets, integer partitions, set partitions, trees, B-trees, using both sequential and parallel models of computation. Combinatorial optimization problems such as knapsack, base enumeration, branch and bound problems, applications of backtracking, isomorphs-free generation etc were also investigated. My two sequential algorithms, for generating all set partitions and integer partitions, are still fastest known algorithms.

__Sequential algorithms for generating all combinatorial objects__:

Zoghbi
A., and **International Journal of Computer
Mathematics,** 70, 1998, 319-332. {contains the fastest known generation
algorithms for integer partitions, in both representations}; Donald E. Knuth
included it in his historical The Art of Computer
Programming, Volume 4, Fascicle 3, Errata Oct. 25,
2005.

Djokic B., Miyakawa M., Sekiguchi S., Semba I., Stojmenovic I., A fast
iterative algorithm for generating set partitions, **The Computer Journal**,
Vol. 32, No. 3, 1989, 281-282.

Stojmenovic I., Miyakawa
M., Applications of
a subset generating algorithm to base enumeration, knapsack and minimal
covering problems, **The Computer Journal, **Vol. 31, No. 1, 1988,
65-70.

Doroslovacki R., **BIT**
27, 1, 1987, 18-24.

__Generating combinatorial objects at random__:

Stojmenovic I., On random and
adaptive parallel generation of combinatorial objects, **International
Journal of Computer Mathematics,** Vol. 42, 1992,125-135.

__Parallel algorithms for generating all combinatorial objects__:

__Survey
articles__

I. Stojmenovic, Listing
combinatorial objects in parallel, **International
Journal of Parallel, Emergent and Distributed Systems**, Vol. 21, No. 2,
April 2006, 127–146, to appear.

Akl S.G., and **Parallel Computing: Paradigms and
Applications** (A.Y. Zomaya, ed.).,
International Thomson Computer Press, 1996, 639-670.

__Main contributions:__

Akl S.G., Calvert J.M., and **Algorithms
and Parallel VLSI Architectures II **(P. Quinton, Y. Robert, eds.), Elsevier Sci. Publ., 1992, 59-70.

Akl S.G. and Stojmenovic
I., Generating t-ary
trees in parallel, **Nordic Journal of Computing**, Vol. 3, 1996, 63-71.

**Parallel Processing Letters**, Vol. 6, No. 1, 1996, 27-34.

Belbaraka M., Stojmenovic
I., On generating B-trees with constant average delay
and in lexicographic order, **Information Processing Letters**, 49, 1,
1994, 27-32.

Akl S.G., Meijer H. and Stojmenovic I., An optimal systolic
algorithm for generating permutations in lexicographic order, **Journal of
Parallel and Distributed Computing,** 20, 1, 1994, 84-91.

Elhage H., and Stojmenovic
I., Systolic generation of combinations from
arbitrary elements, **Parallel Processing Letters,** Vol. 2, No. 2
&3 (1992) 241-248.

Stojmenovic I., A
simple systolic algorithm for generating combinations in lexicographic order,
**Computers & Mathematics with Applications,** Vol. 24, No. 4, pp.
61-64, 1992.

**BIT,** 30, 3 (1990), 424-436.