Sciweavers

1380 search results - page 203 / 276
» A General Polynomial Sieve
Sort
View
MFCS
2009
Springer
14 years 1 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn
CTRSA
2001
Springer
120views Cryptology» more  CTRSA 2001»
14 years 1 months ago
Forward-Secure Threshold Signature Schemes
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...
Michel Abdalla, Sara K. Miner, Chanathip Namprempr...
ICALP
2001
Springer
14 years 1 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
LICS
2000
IEEE
14 years 1 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
RTSS
2000
IEEE
14 years 1 months ago
Enhanced Fixed-Priority Scheduling with (m, k)-Firm Guarantee
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
Gang Quan, Xiaobo Sharon Hu