Ivan Stojmenovic

List of publications (1987-1995)

Parallel Computational Geometry

Problems of particular interest in computational geometry are finding the convex hull, Voronoi diagrams, intersection problems, point locations, maximal elements, circle-cover, triangulation, nearest neighbors, visibility-related problems, external watchman route etc. Several models of parallel computation are used (e.g PRAM, MMB, star, mesh, hypercube).

Major publications:

Akl S.G., Qiu K., and Stojmenovic I., Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry, Networks, Vol. 23, 1993, 215-225. {over 50 citations}

Olariu S., and Stojmenovic I., Time optimal nearest-neighbor computations on enhanced meshes, Journal of Parallel and Distributed Computing, 36, 144-155, 1996. {15 citations}

Bhagavathi D., Bokka V., Gurla H., Olariu S., Schwing J.L., Stojmenovic I., Zhang J., Time-optimal visibility-related algorithms on meshes with multiple broadcasting, IEEE Transactions on Parallel and Distributed Systems, Vol. 6, No. 7, July 1995, 687-703. {11 citations}

Gewali L.P., Stojmenovic I., Computing external watchman routes on PRAM, BSR, and interconnection network models of parallel computation, Parallel Processing Letters, Vol. 4, No. 1 & 2, 1994, 83-93.

Sarkar D., Stojmenovic I., An optimal parallel circle-cover algorithm, Information Processing Letters, 32, 1, (1989) 3-6.

Dehne F., Stojmenovic I., An O(Root(n)) algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors, Information Processing Letters, 28, 2, 1988, 67-70.

Stojmenovic I., Miyakawa M., An optimal parallel algorithm for solving the maximal elements problem in the plane, Parallel Computing, 7, 2, June 1988, 249-251.

Stojmenovic I., Computational geometry on a hypercube, International Conference on Parallel Processing, St. Charles, Illinois, Aug. 15-18, 1988, Vol. III Algorithms and Applications (D.H. Bailey, ed.), 100-103. {21 citations}