Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

Among the novel metrics used to study the relative importance of nodes in complex
networks, k-core decomposition has found a number of applications in areas as diverse as …

Graph processing has become an important part of various areas, such as machine
learning, computational sciences, medical applications, social network analysis, and many …

The coarse-grained multicomputer parallel model (CGM for short) has been used for solving
several classes of dynamic programming problems. In this paper, we propose a parallel …

In this paper we present deterministic parallel algorithms for the coarse-grained
multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following …

We study parallel algorithms for computing the minimum spanning tree of a weighted
undirected graph G with n vertices and m edges. We consider an input graph G with m/n/spl …

Even distribution of irregular workload to processing units is crucial for efficient
parallelization in many applications. In this work, we are concerned with a spatial …

This paper presents an approach to generation of 3D parallel tiled code implementing an
optimal binary search tree (OBST) algorithm. We demonstrate that the features of data …

The ability to provide uniform shared-memory access to a significant number of processors
in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this …

Consider the selection problem of determining the k th smallest element of a set of n
elements. Under the CGM (coarse-grained multicomputer) model with p processors and O …