165
click to vote
ISAAC
15 years 10 months ago
1994 Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
135
click to vote
ISAAC
15 years 10 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...
121
click to vote
ISAAC
15 years 10 months ago
1994 Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
114
Voted
ISAAC
15 years 10 months ago
1994 Springer |