844 search results - page 71 / 169 » Solving the p |
165
Voted
WCW
2004
Springer
15 years 11 months ago
2004
Springer
Aiming at improving file download speed, existing large-scale P2P content distribution systems substantially employ a multi-source parallel downloading scheme to allow peers servi...
154
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
136
click to vote
TCOM
2008
15 years 5 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
151
Voted
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
140
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...