We extend known relations between random walks and electrical networks by showing that resistance in this network is intimately connected with thelengths of random walks on the graph.Expand

In this paper we introduce the Hierarchical Memory Model (HMM) of computation. It is intended to model computers with multiple levels in the memory hierarchy. Access to memory location x is assumed… Expand

We study a new model, in which a collection of processes that share information about a set of integers communicate to determine a 0-1 predicate of the numbers.Expand

We provide an abstract characterization of the class of queries which are computable, and define the completeness of a query language as the property of being precisely powerful enough to express the queries in this class.Expand

The purpose of this paper is to study reducibilities that can be computed by combinational logic networks of polynomial size and constant depth containing AND’s, OR's and NOT's, with no bound placed on the fan-in of AND-gates and OR-Gates.Expand

This paper is an attempt at laying the foundations for the classification of queries on relational data bases according to their structure and their computational complexity.Expand