ISAAC
1994
Springer
14 years 1 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
ICS
1994
Tsinghua U.
14 years 1 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
ASPLOS
1992
ACM
14 years 1 months ago
1992
ACM
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors. While prefet...
GD
1994
Springer
14 years 1 months ago
1994
Springer
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
ICCI
1993
14 years 1 months ago
1993
A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the alg...
EDBT
1994
ACM
14 years 1 months ago
1994
ACM
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
ECOOP
1993
Springer
14 years 1 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...