175
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
105
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
149
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
135
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
153
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
152
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
143
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
96
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
139
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...