Sciweavers

661 search results - page 48 / 133
» Argument Reduction by Factoring
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ASIACRYPT
2005
Springer
15 years 3 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 2 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
ICSR
2000
Springer
15 years 1 months ago
A New Control Structure for Transformation-Based Generators
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...
Ted J. Biggerstaff