Sciweavers

417 search results - page 19 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
MOC
2000
78views more  MOC 2000»
14 years 9 months ago
Using number fields to compute logarithms in finite fields
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
Oliver Schirokauer
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
15 years 1 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
DAC
2009
ACM
15 years 10 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
71
Voted
IROS
2008
IEEE
101views Robotics» more  IROS 2008»
15 years 4 months ago
Spatial macroscopic models of a bio-inspired robotic swarm algorithm
— We present a comparative study of two spatially resolved macroscopic models of an autonomous robotic swarm. In previous experiments, the collective behavior of 15 autonomous sw...
Heiko Hamann, Heinz Wörn, Karl Crailsheim, Th...
RTSS
2003
IEEE
15 years 2 months ago
Experimental Evaluation of Code Properties for WCET Analysis
This paper presents a quantification of the timing effects that advanced processor features like data and instruction cache, pipelines, branch prediction units and out-oforder ex...
Antoine Colin, Stefan M. Petters