4526 search results - page 4 / 906 » Algorithmic problems related to the Internet |
PAIRING
2007
Springer
15 years 6 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
130
Voted
MOR
2000
15 years 6 days ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
107
click to vote
ESA
1997
Springer
15 years 4 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
86
Voted
CCCG
2007
15 years 1 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
ESA
2004
Springer
15 years 5 months ago
2004
Springer