Sciweavers

ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
15 years 7 months ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
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...
Qi Cheng, Ming-Deh A. Huang
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
129
Voted
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Geometric Optimization Problems Over Sliding Windows
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 ...
Timothy M. Chan, Bashir S. Sadjad
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
Algorithms
Top of PageReset Settings