Big data is typically characterized with 4V's: Volume, Velocity, Variety and Veracity. When it
comes to big graphs, these challenges become even more staggering. Each and every of …

The success of the von Neumann model of sequential computation is attributable to the fact
that it is an efficient bridge between software and hardware: high-level languages can be …

In a decision-theoretic model of a firm, I represent managers as information processors of
limited capacity; efficiency is measured in terms of the number of processors and the delay …

This paper was prepared for the Marshall Lectures, Cambridge Uni-versity, October 25-26,
1989. I am grateful to CV Kuh for helpful discussions and suggestions during the preparation …

Chernoff–Hoeffding (CH) bounds are fundamental tools used in bounding the tail
probabilities of the sums of bounded and independent random variables (rv's). We present a …

We propose a class of functional dependencies for graphs, referred to as GFDs. GFDs
capture both attribute-value dependencies and topological structures of entities, and …

The scalability of a parallel algorithm on a parallel architecture is a measure of its capacity to
effectively utilize an increasing number of processors. Scalability analysis may be used to …

Publisher Summary This chapter focuses on general purpose parallel architectures.
Multiprocessor parallel computation has been considered in the context of problems with …

This paper introduces the Asynchronous PRAM model of computation, a variant of the
PRAM in which the processors run asy~ chronously and there is an explicit charge for …

We propose a model, LPRAM, for parallel random access machines with local memory that
captures both the communication and computational requirements in parallel computation …