Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the problem of testing shared-memory multiprocessors to determine if theyâ€¦ (More)

Sequential consistency is the most-widely used correctness condition for multiprocessor memory systems. High-performance shared memory multiprocessors such as the Kendall Square KSR1, the Stanfordâ€¦ (More)

Granulocyte colony-stimulating factor (G-CSF) has proven effective in the prophylaxis of chemotherapy-induced neutropenia and as a mobilizer of peripheral blood progenitor cells. The longevity ofâ€¦ (More)

Let G = (V, E) be a graph and a weight function w : E -+ Z+. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. A T-join is aâ€¦ (More)

KÅ‘nig-EgervÃ¡ry graphs (KEGs) are the graphs whose maximum size of a matching is equal to the minimum size of a vertex cover. We give an excluded subgraph characterization of KEGs. We show that KEGsâ€¦ (More)

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize thoseâ€¦ (More)