We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Abstract. I argue for the use of a specific type of grid and computational style for computational simulation that utilize emergence to produce results that would resemble physica...
ional Frameworks: Toolkits and Abstractions In Introductory Computer Science Cynthia Brown, Harriet Fell, Viera Proulx, Richard Rasala College of Computer Science, Northeastern Uni...
Cynthia A. Brown, Harriet J. Fell, Viera K. Proulx...
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...