Sciweavers

736 search results - page 94 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
POPL
1998
ACM
14 years 29 days ago
Alias Analysis of Executable Code
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
Saumya K. Debray, Robert Muth, Matthew Weippert
EUROCRYPT
1998
Springer
14 years 28 days ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
14 years 27 days ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
14 years 19 days ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
Samir Siksek, Michael Stoll
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
14 years 19 days ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir