Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
Lifan Xu, Michela Taufer, Stuart Collins, Dionisio...
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
The use of threads is becoming commonplace in both sequential and parallel programs. This paper describes our design and initial experience with non-trace based performance instru...
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...