138
Voted
WEA
15 years 10 months ago
2005 Springer  118
Voted
WEA
15 years 10 months ago
2005 Springer 155
Voted
WEA
15 years 10 months ago
2005 Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
148
Voted
WEA
15 years 10 months ago
2005 Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
132
Voted
WEA
15 years 10 months ago
2005 Springer 
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
|
Algorithms