COCO
1991
Springer
15 years 22 days ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
AAECC
1991
Springer
15 years 22 days ago
1991
Springer
AAECC
1991
Springer
15 years 22 days ago
1991
Springer
AAECC
1991
Springer
15 years 22 days ago
1991
Springer
AAECC
1991
Springer
15 years 22 days ago
1991
Springer
106
click to vote
WG
1995
Springer
15 years 23 days ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
WDAG
1995
Springer
15 years 23 days ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
WDAG
1995
Springer
15 years 23 days ago
1995
Springer
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
WDAG
1995
Springer
15 years 23 days ago
1995
Springer
WDAG
1995
Springer
15 years 23 days ago
1995
Springer
