1449 search results - page 63 / 290 » Self-Randomized Exponentiation Algorithms |
139
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
124
Voted
PEWASUN
2006
ACM
15 years 8 months ago
2006
ACM
Understanding the performance of backoff algorithms in multihop ad hoc networks is a key feature to design efficient Medium Access Protocols for wireless networks. The 802.11 bac...
105
click to vote
SAS
2004
Springer
15 years 8 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
102
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
125
click to vote
APLAS
2006
ACM
15 years 8 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...